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.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:10:58,587 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:10:58,589 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:10:58,601 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:10:58,601 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:10:58,602 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:10:58,604 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:10:58,605 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:10:58,607 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:10:58,608 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:10:58,609 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:10:58,609 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:10:58,610 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:10:58,611 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:10:58,612 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:10:58,613 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:10:58,614 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:10:58,616 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:10:58,618 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:10:58,619 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:10:58,621 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:10:58,622 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:10:58,624 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:10:58,625 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:10:58,625 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:10:58,626 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:10:58,627 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:10:58,628 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:10:58,628 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:10:58,630 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:10:58,630 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:10:58,631 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:10:58,631 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:10:58,631 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:10:58,632 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:10:58,633 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:10:58,633 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:10:58,648 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:10:58,649 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:10:58,649 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:10:58,650 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:10:58,650 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:10:58,650 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:10:58,651 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:10:58,651 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:10:58,651 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:10:58,651 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:10:58,652 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:10:58,652 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:10:58,652 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:10:58,652 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:10:58,652 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:10:58,652 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:10:58,653 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:10:58,653 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:10:58,653 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:10:58,653 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:10:58,653 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:10:58,654 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:10:58,654 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:10:58,654 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:10:58,654 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:10:58,654 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:10:58,655 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:10:58,655 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:10:58,655 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:10:58,655 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:10:58,655 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:10:58,697 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:10:58,710 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:10:58,714 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:10:58,716 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:10:58,716 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:10:58,717 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.i.v+cfa-reducer.c [2018-11-23 13:10:58,779 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bc785382/5eeb40c6b26f467ba3a92f2af0338310/FLAGf430e18ac [2018-11-23 13:10:59,319 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:10:59,319 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-11-23 13:10:59,334 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bc785382/5eeb40c6b26f467ba3a92f2af0338310/FLAGf430e18ac [2018-11-23 13:10:59,648 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bc785382/5eeb40c6b26f467ba3a92f2af0338310 [2018-11-23 13:10:59,659 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:10:59,661 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:10:59,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:10:59,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:10:59,669 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:10:59,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:10:59" (1/1) ... [2018-11-23 13:10:59,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4132c202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:59, skipping insertion in model container [2018-11-23 13:10:59,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:10:59" (1/1) ... [2018-11-23 13:10:59,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:10:59,724 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:11:00,024 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:11:00,032 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:11:00,126 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:11:00,150 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:11:00,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:00 WrapperNode [2018-11-23 13:11:00,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:11:00,152 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:11:00,152 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:11:00,152 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:11:00,163 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:11:00" (1/1) ... [2018-11-23 13:11:00,172 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:11:00" (1/1) ... [2018-11-23 13:11:00,182 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:11:00,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:11:00,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:11:00,182 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:11:00,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:00" (1/1) ... [2018-11-23 13:11:00,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:00" (1/1) ... [2018-11-23 13:11:00,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:00" (1/1) ... [2018-11-23 13:11:00,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:00" (1/1) ... [2018-11-23 13:11:00,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:00" (1/1) ... [2018-11-23 13:11:00,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:00" (1/1) ... [2018-11-23 13:11:00,247 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:00" (1/1) ... [2018-11-23 13:11:00,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:11:00,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:11:00,250 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:11:00,250 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:11:00,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:00" (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:11:00,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:11:00,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:11:00,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:11:00,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:11:00,376 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:11:00,376 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:11:01,664 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:11:01,665 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 13:11:01,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:11:01 BoogieIcfgContainer [2018-11-23 13:11:01,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:11:01,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:11:01,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:11:01,670 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:11:01,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:10:59" (1/3) ... [2018-11-23 13:11:01,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753b15f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:11:01, skipping insertion in model container [2018-11-23 13:11:01,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:00" (2/3) ... [2018-11-23 13:11:01,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753b15f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:11:01, skipping insertion in model container [2018-11-23 13:11:01,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:11:01" (3/3) ... [2018-11-23 13:11:01,674 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-11-23 13:11:01,682 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:11:01,690 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2018-11-23 13:11:01,707 INFO L257 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2018-11-23 13:11:01,738 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:11:01,739 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:11:01,739 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:11:01,739 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:11:01,740 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:11:01,740 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:11:01,740 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:11:01,740 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:11:01,740 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:11:01,763 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2018-11-23 13:11:01,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:11:01,770 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:01,771 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:01,774 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:01,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:01,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1637525138, now seen corresponding path program 1 times [2018-11-23 13:11:01,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:01,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:01,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:01,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:01,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:02,087 INFO L256 TraceCheckUtils]: 0: Hoare triple {90#true} call ULTIMATE.init(); {90#true} is VALID [2018-11-23 13:11:02,090 INFO L273 TraceCheckUtils]: 1: Hoare triple {90#true} ~__return_main~0 := 0;~__return_375~0 := 0; {90#true} is VALID [2018-11-23 13:11:02,091 INFO L273 TraceCheckUtils]: 2: Hoare triple {90#true} assume true; {90#true} is VALID [2018-11-23 13:11:02,091 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} #215#return; {90#true} is VALID [2018-11-23 13:11:02,092 INFO L256 TraceCheckUtils]: 4: Hoare triple {90#true} call #t~ret8 := main(); {90#true} is VALID [2018-11-23 13:11:02,092 INFO L273 TraceCheckUtils]: 5: Hoare triple {90#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {90#true} is VALID [2018-11-23 13:11:02,092 INFO L273 TraceCheckUtils]: 6: Hoare triple {90#true} assume !!(~main__urilen~0 <= 1000000); {90#true} is VALID [2018-11-23 13:11:02,092 INFO L273 TraceCheckUtils]: 7: Hoare triple {90#true} assume !!(~main__urilen~0 >= -1000000); {90#true} is VALID [2018-11-23 13:11:02,093 INFO L273 TraceCheckUtils]: 8: Hoare triple {90#true} assume !!(~main__tokenlen~0 <= 1000000); {90#true} is VALID [2018-11-23 13:11:02,093 INFO L273 TraceCheckUtils]: 9: Hoare triple {90#true} assume !!(~main__tokenlen~0 >= -1000000); {90#true} is VALID [2018-11-23 13:11:02,093 INFO L273 TraceCheckUtils]: 10: Hoare triple {90#true} assume !!(~main__scheme~0 <= 1000000); {90#true} is VALID [2018-11-23 13:11:02,094 INFO L273 TraceCheckUtils]: 11: Hoare triple {90#true} assume !!(~main__scheme~0 >= -1000000); {90#true} is VALID [2018-11-23 13:11:02,094 INFO L273 TraceCheckUtils]: 12: Hoare triple {90#true} assume ~main__urilen~0 > 0; {90#true} is VALID [2018-11-23 13:11:02,094 INFO L273 TraceCheckUtils]: 13: Hoare triple {90#true} assume ~main__tokenlen~0 > 0; {90#true} is VALID [2018-11-23 13:11:02,095 INFO L273 TraceCheckUtils]: 14: Hoare triple {90#true} assume ~main__scheme~0 >= 0; {90#true} is VALID [2018-11-23 13:11:02,095 INFO L273 TraceCheckUtils]: 15: Hoare triple {90#true} assume !(0 == ~main__scheme~0); {90#true} is VALID [2018-11-23 13:11:02,108 INFO L273 TraceCheckUtils]: 16: Hoare triple {90#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {92#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:11:02,115 INFO L273 TraceCheckUtils]: 17: Hoare triple {92#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {91#false} is VALID [2018-11-23 13:11:02,116 INFO L273 TraceCheckUtils]: 18: Hoare triple {91#false} assume !false; {91#false} is VALID [2018-11-23 13:11:02,119 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:11:02,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:02,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:11:02,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 13:11:02,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:02,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:11:02,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:02,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:11:02,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:11:02,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:11:02,228 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 3 states. [2018-11-23 13:11:03,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:03,013 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2018-11-23 13:11:03,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:11:03,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 13:11:03,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:03,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:11:03,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2018-11-23 13:11:03,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:11:03,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2018-11-23 13:11:03,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 129 transitions. [2018-11-23 13:11:03,339 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:03,356 INFO L225 Difference]: With dead ends: 93 [2018-11-23 13:11:03,357 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 13:11:03,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:11:03,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 13:11:03,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-11-23 13:11:03,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:03,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 80 states. [2018-11-23 13:11:03,422 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2018-11-23 13:11:03,422 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2018-11-23 13:11:03,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:03,430 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-11-23 13:11:03,430 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-11-23 13:11:03,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:03,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:03,432 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2018-11-23 13:11:03,432 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2018-11-23 13:11:03,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:03,439 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-11-23 13:11:03,440 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-11-23 13:11:03,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:03,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:03,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:03,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:03,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 13:11:03,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-11-23 13:11:03,448 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2018-11-23 13:11:03,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:03,449 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2018-11-23 13:11:03,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:11:03,449 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-11-23 13:11:03,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:11:03,450 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:03,450 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:03,451 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:03,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:03,452 INFO L82 PathProgramCache]: Analyzing trace with hash 776331368, now seen corresponding path program 1 times [2018-11-23 13:11:03,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:03,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:03,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:03,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:03,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:03,753 INFO L256 TraceCheckUtils]: 0: Hoare triple {445#true} call ULTIMATE.init(); {445#true} is VALID [2018-11-23 13:11:03,753 INFO L273 TraceCheckUtils]: 1: Hoare triple {445#true} ~__return_main~0 := 0;~__return_375~0 := 0; {445#true} is VALID [2018-11-23 13:11:03,754 INFO L273 TraceCheckUtils]: 2: Hoare triple {445#true} assume true; {445#true} is VALID [2018-11-23 13:11:03,754 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {445#true} {445#true} #215#return; {445#true} is VALID [2018-11-23 13:11:03,755 INFO L256 TraceCheckUtils]: 4: Hoare triple {445#true} call #t~ret8 := main(); {445#true} is VALID [2018-11-23 13:11:03,755 INFO L273 TraceCheckUtils]: 5: Hoare triple {445#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {445#true} is VALID [2018-11-23 13:11:03,755 INFO L273 TraceCheckUtils]: 6: Hoare triple {445#true} assume !!(~main__urilen~0 <= 1000000); {445#true} is VALID [2018-11-23 13:11:03,756 INFO L273 TraceCheckUtils]: 7: Hoare triple {445#true} assume !!(~main__urilen~0 >= -1000000); {445#true} is VALID [2018-11-23 13:11:03,756 INFO L273 TraceCheckUtils]: 8: Hoare triple {445#true} assume !!(~main__tokenlen~0 <= 1000000); {445#true} is VALID [2018-11-23 13:11:03,756 INFO L273 TraceCheckUtils]: 9: Hoare triple {445#true} assume !!(~main__tokenlen~0 >= -1000000); {445#true} is VALID [2018-11-23 13:11:03,757 INFO L273 TraceCheckUtils]: 10: Hoare triple {445#true} assume !!(~main__scheme~0 <= 1000000); {445#true} is VALID [2018-11-23 13:11:03,757 INFO L273 TraceCheckUtils]: 11: Hoare triple {445#true} assume !!(~main__scheme~0 >= -1000000); {445#true} is VALID [2018-11-23 13:11:03,757 INFO L273 TraceCheckUtils]: 12: Hoare triple {445#true} assume ~main__urilen~0 > 0; {445#true} is VALID [2018-11-23 13:11:03,758 INFO L273 TraceCheckUtils]: 13: Hoare triple {445#true} assume ~main__tokenlen~0 > 0; {445#true} is VALID [2018-11-23 13:11:03,760 INFO L273 TraceCheckUtils]: 14: Hoare triple {445#true} assume ~main__scheme~0 >= 0; {447#(<= 0 main_~main__scheme~0)} is VALID [2018-11-23 13:11:03,761 INFO L273 TraceCheckUtils]: 15: Hoare triple {447#(<= 0 main_~main__scheme~0)} assume !(0 == ~main__scheme~0); {448#(<= 1 main_~main__scheme~0)} is VALID [2018-11-23 13:11:03,763 INFO L273 TraceCheckUtils]: 16: Hoare triple {448#(<= 1 main_~main__scheme~0)} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {449#(and (<= 1 main_~main__cp~0) (or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0)))} is VALID [2018-11-23 13:11:03,764 INFO L273 TraceCheckUtils]: 17: Hoare triple {449#(and (<= 1 main_~main__cp~0) (or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0)))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {450#(not (= 0 main_~__VERIFIER_assert__cond~1))} is VALID [2018-11-23 13:11:03,766 INFO L273 TraceCheckUtils]: 18: Hoare triple {450#(not (= 0 main_~__VERIFIER_assert__cond~1))} assume 0 == ~__VERIFIER_assert__cond~1; {446#false} is VALID [2018-11-23 13:11:03,766 INFO L273 TraceCheckUtils]: 19: Hoare triple {446#false} assume !false; {446#false} is VALID [2018-11-23 13:11:03,770 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:11:03,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:03,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:11:03,773 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 13:11:03,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:03,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:11:03,820 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:03,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:11:03,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:11:03,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:11:03,822 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 6 states. [2018-11-23 13:11:04,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:04,505 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-11-23 13:11:04,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:11:04,506 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 13:11:04,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:04,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:11:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2018-11-23 13:11:04,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:11:04,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2018-11-23 13:11:04,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 83 transitions. [2018-11-23 13:11:04,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:04,662 INFO L225 Difference]: With dead ends: 80 [2018-11-23 13:11:04,662 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 13:11:04,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:11:04,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 13:11:04,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-23 13:11:04,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:04,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 78 states. [2018-11-23 13:11:04,699 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2018-11-23 13:11:04,699 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2018-11-23 13:11:04,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:04,705 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2018-11-23 13:11:04,705 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-11-23 13:11:04,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:04,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:04,707 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2018-11-23 13:11:04,707 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2018-11-23 13:11:04,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:04,712 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2018-11-23 13:11:04,712 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-11-23 13:11:04,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:04,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:04,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:04,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:04,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 13:11:04,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-11-23 13:11:04,718 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2018-11-23 13:11:04,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:04,718 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-11-23 13:11:04,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:11:04,718 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-11-23 13:11:04,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:11:04,719 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:04,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:04,720 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:04,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:04,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1269768629, now seen corresponding path program 1 times [2018-11-23 13:11:04,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:04,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:04,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:04,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:04,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:04,853 INFO L256 TraceCheckUtils]: 0: Hoare triple {787#true} call ULTIMATE.init(); {787#true} is VALID [2018-11-23 13:11:04,854 INFO L273 TraceCheckUtils]: 1: Hoare triple {787#true} ~__return_main~0 := 0;~__return_375~0 := 0; {787#true} is VALID [2018-11-23 13:11:04,854 INFO L273 TraceCheckUtils]: 2: Hoare triple {787#true} assume true; {787#true} is VALID [2018-11-23 13:11:04,855 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {787#true} {787#true} #215#return; {787#true} is VALID [2018-11-23 13:11:04,856 INFO L256 TraceCheckUtils]: 4: Hoare triple {787#true} call #t~ret8 := main(); {787#true} is VALID [2018-11-23 13:11:04,856 INFO L273 TraceCheckUtils]: 5: Hoare triple {787#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {787#true} is VALID [2018-11-23 13:11:04,856 INFO L273 TraceCheckUtils]: 6: Hoare triple {787#true} assume !!(~main__urilen~0 <= 1000000); {787#true} is VALID [2018-11-23 13:11:04,856 INFO L273 TraceCheckUtils]: 7: Hoare triple {787#true} assume !!(~main__urilen~0 >= -1000000); {787#true} is VALID [2018-11-23 13:11:04,857 INFO L273 TraceCheckUtils]: 8: Hoare triple {787#true} assume !!(~main__tokenlen~0 <= 1000000); {787#true} is VALID [2018-11-23 13:11:04,857 INFO L273 TraceCheckUtils]: 9: Hoare triple {787#true} assume !!(~main__tokenlen~0 >= -1000000); {787#true} is VALID [2018-11-23 13:11:04,857 INFO L273 TraceCheckUtils]: 10: Hoare triple {787#true} assume !!(~main__scheme~0 <= 1000000); {787#true} is VALID [2018-11-23 13:11:04,857 INFO L273 TraceCheckUtils]: 11: Hoare triple {787#true} assume !!(~main__scheme~0 >= -1000000); {787#true} is VALID [2018-11-23 13:11:04,858 INFO L273 TraceCheckUtils]: 12: Hoare triple {787#true} assume ~main__urilen~0 > 0; {787#true} is VALID [2018-11-23 13:11:04,858 INFO L273 TraceCheckUtils]: 13: Hoare triple {787#true} assume ~main__tokenlen~0 > 0; {787#true} is VALID [2018-11-23 13:11:04,858 INFO L273 TraceCheckUtils]: 14: Hoare triple {787#true} assume ~main__scheme~0 >= 0; {787#true} is VALID [2018-11-23 13:11:04,859 INFO L273 TraceCheckUtils]: 15: Hoare triple {787#true} assume !(0 == ~main__scheme~0); {787#true} is VALID [2018-11-23 13:11:04,860 INFO L273 TraceCheckUtils]: 16: Hoare triple {787#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {789#(and (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0)))} is VALID [2018-11-23 13:11:04,862 INFO L273 TraceCheckUtils]: 17: Hoare triple {789#(and (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0)))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {790#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:04,862 INFO L273 TraceCheckUtils]: 18: Hoare triple {790#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {790#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:04,864 INFO L273 TraceCheckUtils]: 19: Hoare triple {790#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {791#(not (= 0 main_~__VERIFIER_assert__cond~2))} is VALID [2018-11-23 13:11:04,865 INFO L273 TraceCheckUtils]: 20: Hoare triple {791#(not (= 0 main_~__VERIFIER_assert__cond~2))} assume 0 == ~__VERIFIER_assert__cond~2; {788#false} is VALID [2018-11-23 13:11:04,865 INFO L273 TraceCheckUtils]: 21: Hoare triple {788#false} assume !false; {788#false} is VALID [2018-11-23 13:11:04,867 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:11:04,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:04,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:11:04,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-23 13:11:04,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:04,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:11:04,912 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:04,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:11:04,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:11:04,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:11:04,913 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 5 states. [2018-11-23 13:11:05,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:05,593 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-11-23 13:11:05,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:11:05,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-23 13:11:05,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:05,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:11:05,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2018-11-23 13:11:05,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:11:05,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2018-11-23 13:11:05,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 121 transitions. [2018-11-23 13:11:05,769 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:05,774 INFO L225 Difference]: With dead ends: 116 [2018-11-23 13:11:05,774 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 13:11:05,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:11:05,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 13:11:05,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 76. [2018-11-23 13:11:05,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:05,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 76 states. [2018-11-23 13:11:05,844 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 76 states. [2018-11-23 13:11:05,844 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 76 states. [2018-11-23 13:11:05,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:05,851 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-11-23 13:11:05,851 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-11-23 13:11:05,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:05,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:05,852 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 114 states. [2018-11-23 13:11:05,853 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 114 states. [2018-11-23 13:11:05,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:05,859 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-11-23 13:11:05,859 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-11-23 13:11:05,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:05,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:05,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:05,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:05,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 13:11:05,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-11-23 13:11:05,865 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2018-11-23 13:11:05,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:05,865 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-11-23 13:11:05,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:11:05,866 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-11-23 13:11:05,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:11:05,866 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:05,867 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:05,867 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:05,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:05,868 INFO L82 PathProgramCache]: Analyzing trace with hash -708118726, now seen corresponding path program 1 times [2018-11-23 13:11:05,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:05,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:05,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:05,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:05,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:06,027 INFO L256 TraceCheckUtils]: 0: Hoare triple {1237#true} call ULTIMATE.init(); {1237#true} is VALID [2018-11-23 13:11:06,027 INFO L273 TraceCheckUtils]: 1: Hoare triple {1237#true} ~__return_main~0 := 0;~__return_375~0 := 0; {1237#true} is VALID [2018-11-23 13:11:06,028 INFO L273 TraceCheckUtils]: 2: Hoare triple {1237#true} assume true; {1237#true} is VALID [2018-11-23 13:11:06,028 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1237#true} {1237#true} #215#return; {1237#true} is VALID [2018-11-23 13:11:06,028 INFO L256 TraceCheckUtils]: 4: Hoare triple {1237#true} call #t~ret8 := main(); {1237#true} is VALID [2018-11-23 13:11:06,029 INFO L273 TraceCheckUtils]: 5: Hoare triple {1237#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {1237#true} is VALID [2018-11-23 13:11:06,029 INFO L273 TraceCheckUtils]: 6: Hoare triple {1237#true} assume !!(~main__urilen~0 <= 1000000); {1237#true} is VALID [2018-11-23 13:11:06,029 INFO L273 TraceCheckUtils]: 7: Hoare triple {1237#true} assume !!(~main__urilen~0 >= -1000000); {1237#true} is VALID [2018-11-23 13:11:06,030 INFO L273 TraceCheckUtils]: 8: Hoare triple {1237#true} assume !!(~main__tokenlen~0 <= 1000000); {1237#true} is VALID [2018-11-23 13:11:06,030 INFO L273 TraceCheckUtils]: 9: Hoare triple {1237#true} assume !!(~main__tokenlen~0 >= -1000000); {1237#true} is VALID [2018-11-23 13:11:06,030 INFO L273 TraceCheckUtils]: 10: Hoare triple {1237#true} assume !!(~main__scheme~0 <= 1000000); {1237#true} is VALID [2018-11-23 13:11:06,030 INFO L273 TraceCheckUtils]: 11: Hoare triple {1237#true} assume !!(~main__scheme~0 >= -1000000); {1237#true} is VALID [2018-11-23 13:11:06,031 INFO L273 TraceCheckUtils]: 12: Hoare triple {1237#true} assume ~main__urilen~0 > 0; {1237#true} is VALID [2018-11-23 13:11:06,031 INFO L273 TraceCheckUtils]: 13: Hoare triple {1237#true} assume ~main__tokenlen~0 > 0; {1237#true} is VALID [2018-11-23 13:11:06,031 INFO L273 TraceCheckUtils]: 14: Hoare triple {1237#true} assume ~main__scheme~0 >= 0; {1237#true} is VALID [2018-11-23 13:11:06,032 INFO L273 TraceCheckUtils]: 15: Hoare triple {1237#true} assume !(0 == ~main__scheme~0); {1237#true} is VALID [2018-11-23 13:11:06,037 INFO L273 TraceCheckUtils]: 16: Hoare triple {1237#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1239#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2018-11-23 13:11:06,039 INFO L273 TraceCheckUtils]: 17: Hoare triple {1239#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1240#(or (= 0 main_~__VERIFIER_assert__cond~1) (<= 1 main_~main__cp~0))} is VALID [2018-11-23 13:11:06,039 INFO L273 TraceCheckUtils]: 18: Hoare triple {1240#(or (= 0 main_~__VERIFIER_assert__cond~1) (<= 1 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {1241#(<= 1 main_~main__cp~0)} is VALID [2018-11-23 13:11:06,040 INFO L273 TraceCheckUtils]: 19: Hoare triple {1241#(<= 1 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1241#(<= 1 main_~main__cp~0)} is VALID [2018-11-23 13:11:06,040 INFO L273 TraceCheckUtils]: 20: Hoare triple {1241#(<= 1 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {1242#(not (= 0 main_~__VERIFIER_assert__cond~3))} is VALID [2018-11-23 13:11:06,041 INFO L273 TraceCheckUtils]: 21: Hoare triple {1242#(not (= 0 main_~__VERIFIER_assert__cond~3))} assume 0 == ~__VERIFIER_assert__cond~3; {1238#false} is VALID [2018-11-23 13:11:06,041 INFO L273 TraceCheckUtils]: 22: Hoare triple {1238#false} assume !false; {1238#false} is VALID [2018-11-23 13:11:06,043 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:11:06,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:06,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:11:06,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-23 13:11:06,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:06,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:11:06,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:06,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:11:06,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:11:06,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:11:06,074 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2018-11-23 13:11:06,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:06,468 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-11-23 13:11:06,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:11:06,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-23 13:11:06,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:11:06,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2018-11-23 13:11:06,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:11:06,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2018-11-23 13:11:06,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2018-11-23 13:11:06,624 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:11:06,628 INFO L225 Difference]: With dead ends: 76 [2018-11-23 13:11:06,629 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 13:11:06,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:11:06,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 13:11:06,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-23 13:11:06,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:06,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 74 states. [2018-11-23 13:11:06,673 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2018-11-23 13:11:06,673 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2018-11-23 13:11:06,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:06,676 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-11-23 13:11:06,677 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-23 13:11:06,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:06,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:06,678 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2018-11-23 13:11:06,678 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2018-11-23 13:11:06,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:06,681 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-11-23 13:11:06,681 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-23 13:11:06,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:06,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:06,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:06,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:06,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 13:11:06,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-11-23 13:11:06,686 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2018-11-23 13:11:06,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:06,686 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-11-23 13:11:06,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:11:06,686 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-23 13:11:06,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:11:06,687 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:06,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:06,688 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:06,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:06,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1317531748, now seen corresponding path program 1 times [2018-11-23 13:11:06,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:06,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:06,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:06,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:06,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:06,810 INFO L256 TraceCheckUtils]: 0: Hoare triple {1565#true} call ULTIMATE.init(); {1565#true} is VALID [2018-11-23 13:11:06,810 INFO L273 TraceCheckUtils]: 1: Hoare triple {1565#true} ~__return_main~0 := 0;~__return_375~0 := 0; {1565#true} is VALID [2018-11-23 13:11:06,811 INFO L273 TraceCheckUtils]: 2: Hoare triple {1565#true} assume true; {1565#true} is VALID [2018-11-23 13:11:06,811 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1565#true} {1565#true} #215#return; {1565#true} is VALID [2018-11-23 13:11:06,811 INFO L256 TraceCheckUtils]: 4: Hoare triple {1565#true} call #t~ret8 := main(); {1565#true} is VALID [2018-11-23 13:11:06,812 INFO L273 TraceCheckUtils]: 5: Hoare triple {1565#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {1565#true} is VALID [2018-11-23 13:11:06,812 INFO L273 TraceCheckUtils]: 6: Hoare triple {1565#true} assume !!(~main__urilen~0 <= 1000000); {1565#true} is VALID [2018-11-23 13:11:06,812 INFO L273 TraceCheckUtils]: 7: Hoare triple {1565#true} assume !!(~main__urilen~0 >= -1000000); {1565#true} is VALID [2018-11-23 13:11:06,812 INFO L273 TraceCheckUtils]: 8: Hoare triple {1565#true} assume !!(~main__tokenlen~0 <= 1000000); {1565#true} is VALID [2018-11-23 13:11:06,813 INFO L273 TraceCheckUtils]: 9: Hoare triple {1565#true} assume !!(~main__tokenlen~0 >= -1000000); {1565#true} is VALID [2018-11-23 13:11:06,813 INFO L273 TraceCheckUtils]: 10: Hoare triple {1565#true} assume !!(~main__scheme~0 <= 1000000); {1565#true} is VALID [2018-11-23 13:11:06,813 INFO L273 TraceCheckUtils]: 11: Hoare triple {1565#true} assume !!(~main__scheme~0 >= -1000000); {1565#true} is VALID [2018-11-23 13:11:06,814 INFO L273 TraceCheckUtils]: 12: Hoare triple {1565#true} assume ~main__urilen~0 > 0; {1565#true} is VALID [2018-11-23 13:11:06,814 INFO L273 TraceCheckUtils]: 13: Hoare triple {1565#true} assume ~main__tokenlen~0 > 0; {1565#true} is VALID [2018-11-23 13:11:06,814 INFO L273 TraceCheckUtils]: 14: Hoare triple {1565#true} assume ~main__scheme~0 >= 0; {1565#true} is VALID [2018-11-23 13:11:06,815 INFO L273 TraceCheckUtils]: 15: Hoare triple {1565#true} assume !(0 == ~main__scheme~0); {1565#true} is VALID [2018-11-23 13:11:06,815 INFO L273 TraceCheckUtils]: 16: Hoare triple {1565#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1565#true} is VALID [2018-11-23 13:11:06,815 INFO L273 TraceCheckUtils]: 17: Hoare triple {1565#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1565#true} is VALID [2018-11-23 13:11:06,816 INFO L273 TraceCheckUtils]: 18: Hoare triple {1565#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {1565#true} is VALID [2018-11-23 13:11:06,822 INFO L273 TraceCheckUtils]: 19: Hoare triple {1565#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1567#(or (and (<= main_~main__urilen~0 main_~main__cp~0) (= main_~__VERIFIER_assert__cond~2 0)) (and (= main_~__VERIFIER_assert__cond~2 1) (< main_~main__cp~0 main_~main__urilen~0)))} is VALID [2018-11-23 13:11:06,827 INFO L273 TraceCheckUtils]: 20: Hoare triple {1567#(or (and (<= main_~main__urilen~0 main_~main__cp~0) (= main_~__VERIFIER_assert__cond~2 0)) (and (= main_~__VERIFIER_assert__cond~2 1) (< main_~main__cp~0 main_~main__urilen~0)))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {1568#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-23 13:11:06,830 INFO L273 TraceCheckUtils]: 21: Hoare triple {1568#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {1568#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-23 13:11:06,834 INFO L273 TraceCheckUtils]: 22: Hoare triple {1568#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {1568#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-23 13:11:06,839 INFO L273 TraceCheckUtils]: 23: Hoare triple {1568#(< main_~main__cp~0 main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {1569#(not (= 0 main_~__VERIFIER_assert__cond~16))} is VALID [2018-11-23 13:11:06,841 INFO L273 TraceCheckUtils]: 24: Hoare triple {1569#(not (= 0 main_~__VERIFIER_assert__cond~16))} assume 0 == ~__VERIFIER_assert__cond~16; {1566#false} is VALID [2018-11-23 13:11:06,841 INFO L273 TraceCheckUtils]: 25: Hoare triple {1566#false} assume !false; {1566#false} is VALID [2018-11-23 13:11:06,842 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:11:06,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:06,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:11:06,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-23 13:11:06,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:06,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:11:06,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:06,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:11:06,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:11:06,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:11:06,874 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2018-11-23 13:11:07,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:07,956 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2018-11-23 13:11:07,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:11:07,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-23 13:11:07,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:07,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:11:07,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2018-11-23 13:11:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:11:07,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2018-11-23 13:11:07,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 147 transitions. [2018-11-23 13:11:08,242 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:08,246 INFO L225 Difference]: With dead ends: 141 [2018-11-23 13:11:08,246 INFO L226 Difference]: Without dead ends: 139 [2018-11-23 13:11:08,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:11:08,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-23 13:11:08,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2018-11-23 13:11:08,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:08,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand 77 states. [2018-11-23 13:11:08,316 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 77 states. [2018-11-23 13:11:08,316 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 77 states. [2018-11-23 13:11:08,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:08,322 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2018-11-23 13:11:08,322 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2018-11-23 13:11:08,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:08,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:08,323 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 139 states. [2018-11-23 13:11:08,323 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 139 states. [2018-11-23 13:11:08,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:08,329 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2018-11-23 13:11:08,329 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2018-11-23 13:11:08,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:08,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:08,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:08,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:08,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 13:11:08,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-11-23 13:11:08,333 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2018-11-23 13:11:08,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:08,333 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-11-23 13:11:08,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:11:08,334 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-11-23 13:11:08,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:11:08,334 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:08,334 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:08,335 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:08,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:08,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1321265557, now seen corresponding path program 1 times [2018-11-23 13:11:08,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:08,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:08,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:08,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:08,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:08,459 INFO L256 TraceCheckUtils]: 0: Hoare triple {2096#true} call ULTIMATE.init(); {2096#true} is VALID [2018-11-23 13:11:08,460 INFO L273 TraceCheckUtils]: 1: Hoare triple {2096#true} ~__return_main~0 := 0;~__return_375~0 := 0; {2096#true} is VALID [2018-11-23 13:11:08,460 INFO L273 TraceCheckUtils]: 2: Hoare triple {2096#true} assume true; {2096#true} is VALID [2018-11-23 13:11:08,460 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2096#true} {2096#true} #215#return; {2096#true} is VALID [2018-11-23 13:11:08,461 INFO L256 TraceCheckUtils]: 4: Hoare triple {2096#true} call #t~ret8 := main(); {2096#true} is VALID [2018-11-23 13:11:08,461 INFO L273 TraceCheckUtils]: 5: Hoare triple {2096#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {2096#true} is VALID [2018-11-23 13:11:08,462 INFO L273 TraceCheckUtils]: 6: Hoare triple {2096#true} assume !!(~main__urilen~0 <= 1000000); {2096#true} is VALID [2018-11-23 13:11:08,462 INFO L273 TraceCheckUtils]: 7: Hoare triple {2096#true} assume !!(~main__urilen~0 >= -1000000); {2096#true} is VALID [2018-11-23 13:11:08,463 INFO L273 TraceCheckUtils]: 8: Hoare triple {2096#true} assume !!(~main__tokenlen~0 <= 1000000); {2096#true} is VALID [2018-11-23 13:11:08,463 INFO L273 TraceCheckUtils]: 9: Hoare triple {2096#true} assume !!(~main__tokenlen~0 >= -1000000); {2096#true} is VALID [2018-11-23 13:11:08,463 INFO L273 TraceCheckUtils]: 10: Hoare triple {2096#true} assume !!(~main__scheme~0 <= 1000000); {2096#true} is VALID [2018-11-23 13:11:08,463 INFO L273 TraceCheckUtils]: 11: Hoare triple {2096#true} assume !!(~main__scheme~0 >= -1000000); {2096#true} is VALID [2018-11-23 13:11:08,463 INFO L273 TraceCheckUtils]: 12: Hoare triple {2096#true} assume ~main__urilen~0 > 0; {2096#true} is VALID [2018-11-23 13:11:08,464 INFO L273 TraceCheckUtils]: 13: Hoare triple {2096#true} assume ~main__tokenlen~0 > 0; {2096#true} is VALID [2018-11-23 13:11:08,464 INFO L273 TraceCheckUtils]: 14: Hoare triple {2096#true} assume ~main__scheme~0 >= 0; {2096#true} is VALID [2018-11-23 13:11:08,464 INFO L273 TraceCheckUtils]: 15: Hoare triple {2096#true} assume !(0 == ~main__scheme~0); {2096#true} is VALID [2018-11-23 13:11:08,465 INFO L273 TraceCheckUtils]: 16: Hoare triple {2096#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2096#true} is VALID [2018-11-23 13:11:08,465 INFO L273 TraceCheckUtils]: 17: Hoare triple {2096#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2096#true} is VALID [2018-11-23 13:11:08,465 INFO L273 TraceCheckUtils]: 18: Hoare triple {2096#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {2096#true} is VALID [2018-11-23 13:11:08,478 INFO L273 TraceCheckUtils]: 19: Hoare triple {2096#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2098#(or (and (<= main_~main__urilen~0 main_~main__cp~0) (= main_~__VERIFIER_assert__cond~2 0)) (and (= main_~__VERIFIER_assert__cond~2 1) (< main_~main__cp~0 main_~main__urilen~0)))} is VALID [2018-11-23 13:11:08,483 INFO L273 TraceCheckUtils]: 20: Hoare triple {2098#(or (and (<= main_~main__urilen~0 main_~main__cp~0) (= main_~__VERIFIER_assert__cond~2 0)) (and (= main_~__VERIFIER_assert__cond~2 1) (< main_~main__cp~0 main_~main__urilen~0)))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2099#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-23 13:11:08,485 INFO L273 TraceCheckUtils]: 21: Hoare triple {2099#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {2099#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-23 13:11:08,485 INFO L273 TraceCheckUtils]: 22: Hoare triple {2099#(< main_~main__cp~0 main_~main__urilen~0)} assume !(~main__cp~0 != ~main__urilen~0 - 1); {2099#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-23 13:11:08,486 INFO L273 TraceCheckUtils]: 23: Hoare triple {2099#(< main_~main__cp~0 main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {2100#(not (= 0 main_~__VERIFIER_assert__cond~4))} is VALID [2018-11-23 13:11:08,486 INFO L273 TraceCheckUtils]: 24: Hoare triple {2100#(not (= 0 main_~__VERIFIER_assert__cond~4))} assume 0 == ~__VERIFIER_assert__cond~4; {2097#false} is VALID [2018-11-23 13:11:08,486 INFO L273 TraceCheckUtils]: 25: Hoare triple {2097#false} assume !false; {2097#false} is VALID [2018-11-23 13:11:08,488 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:11:08,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:08,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:11:08,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-23 13:11:08,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:08,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:11:08,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:08,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:11:08,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:11:08,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:11:08,515 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2018-11-23 13:11:09,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:09,113 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2018-11-23 13:11:09,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:11:09,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-23 13:11:09,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:09,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:11:09,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2018-11-23 13:11:09,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:11:09,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2018-11-23 13:11:09,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2018-11-23 13:11:09,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:09,259 INFO L225 Difference]: With dead ends: 108 [2018-11-23 13:11:09,259 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 13:11:09,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:11:09,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 13:11:09,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2018-11-23 13:11:09,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:09,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 79 states. [2018-11-23 13:11:09,469 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 79 states. [2018-11-23 13:11:09,469 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 79 states. [2018-11-23 13:11:09,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:09,473 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2018-11-23 13:11:09,473 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-11-23 13:11:09,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:09,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:09,473 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 106 states. [2018-11-23 13:11:09,474 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 106 states. [2018-11-23 13:11:09,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:09,477 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2018-11-23 13:11:09,477 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-11-23 13:11:09,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:09,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:09,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:09,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:09,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 13:11:09,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-11-23 13:11:09,481 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2018-11-23 13:11:09,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:09,481 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-11-23 13:11:09,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:11:09,481 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-11-23 13:11:09,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 13:11:09,482 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:09,482 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:09,483 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:09,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:09,483 INFO L82 PathProgramCache]: Analyzing trace with hash -2106185532, now seen corresponding path program 1 times [2018-11-23 13:11:09,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:09,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:09,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:09,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:09,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:09,599 INFO L256 TraceCheckUtils]: 0: Hoare triple {2529#true} call ULTIMATE.init(); {2529#true} is VALID [2018-11-23 13:11:09,599 INFO L273 TraceCheckUtils]: 1: Hoare triple {2529#true} ~__return_main~0 := 0;~__return_375~0 := 0; {2529#true} is VALID [2018-11-23 13:11:09,600 INFO L273 TraceCheckUtils]: 2: Hoare triple {2529#true} assume true; {2529#true} is VALID [2018-11-23 13:11:09,600 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2529#true} {2529#true} #215#return; {2529#true} is VALID [2018-11-23 13:11:09,600 INFO L256 TraceCheckUtils]: 4: Hoare triple {2529#true} call #t~ret8 := main(); {2529#true} is VALID [2018-11-23 13:11:09,600 INFO L273 TraceCheckUtils]: 5: Hoare triple {2529#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {2529#true} is VALID [2018-11-23 13:11:09,601 INFO L273 TraceCheckUtils]: 6: Hoare triple {2529#true} assume !!(~main__urilen~0 <= 1000000); {2529#true} is VALID [2018-11-23 13:11:09,601 INFO L273 TraceCheckUtils]: 7: Hoare triple {2529#true} assume !!(~main__urilen~0 >= -1000000); {2529#true} is VALID [2018-11-23 13:11:09,601 INFO L273 TraceCheckUtils]: 8: Hoare triple {2529#true} assume !!(~main__tokenlen~0 <= 1000000); {2529#true} is VALID [2018-11-23 13:11:09,601 INFO L273 TraceCheckUtils]: 9: Hoare triple {2529#true} assume !!(~main__tokenlen~0 >= -1000000); {2529#true} is VALID [2018-11-23 13:11:09,601 INFO L273 TraceCheckUtils]: 10: Hoare triple {2529#true} assume !!(~main__scheme~0 <= 1000000); {2529#true} is VALID [2018-11-23 13:11:09,602 INFO L273 TraceCheckUtils]: 11: Hoare triple {2529#true} assume !!(~main__scheme~0 >= -1000000); {2529#true} is VALID [2018-11-23 13:11:09,602 INFO L273 TraceCheckUtils]: 12: Hoare triple {2529#true} assume ~main__urilen~0 > 0; {2529#true} is VALID [2018-11-23 13:11:09,602 INFO L273 TraceCheckUtils]: 13: Hoare triple {2529#true} assume ~main__tokenlen~0 > 0; {2529#true} is VALID [2018-11-23 13:11:09,602 INFO L273 TraceCheckUtils]: 14: Hoare triple {2529#true} assume ~main__scheme~0 >= 0; {2529#true} is VALID [2018-11-23 13:11:09,602 INFO L273 TraceCheckUtils]: 15: Hoare triple {2529#true} assume !(0 == ~main__scheme~0); {2529#true} is VALID [2018-11-23 13:11:09,602 INFO L273 TraceCheckUtils]: 16: Hoare triple {2529#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2529#true} is VALID [2018-11-23 13:11:09,602 INFO L273 TraceCheckUtils]: 17: Hoare triple {2529#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2529#true} is VALID [2018-11-23 13:11:09,603 INFO L273 TraceCheckUtils]: 18: Hoare triple {2529#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {2529#true} is VALID [2018-11-23 13:11:09,603 INFO L273 TraceCheckUtils]: 19: Hoare triple {2529#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2529#true} is VALID [2018-11-23 13:11:09,605 INFO L273 TraceCheckUtils]: 20: Hoare triple {2529#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2531#(or (and (< main_~main__cp~0 0) (= main_~__VERIFIER_assert__cond~3 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (<= 0 main_~main__cp~0)))} is VALID [2018-11-23 13:11:09,605 INFO L273 TraceCheckUtils]: 21: Hoare triple {2531#(or (and (< main_~main__cp~0 0) (= main_~__VERIFIER_assert__cond~3 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (<= 0 main_~main__cp~0)))} assume !(0 == ~__VERIFIER_assert__cond~3); {2532#(<= 0 main_~main__cp~0)} is VALID [2018-11-23 13:11:09,607 INFO L273 TraceCheckUtils]: 22: Hoare triple {2532#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {2532#(<= 0 main_~main__cp~0)} is VALID [2018-11-23 13:11:09,607 INFO L273 TraceCheckUtils]: 23: Hoare triple {2532#(<= 0 main_~main__cp~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {2532#(<= 0 main_~main__cp~0)} is VALID [2018-11-23 13:11:09,607 INFO L273 TraceCheckUtils]: 24: Hoare triple {2532#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {2533#(not (= 0 main_~__VERIFIER_assert__cond~17))} is VALID [2018-11-23 13:11:09,609 INFO L273 TraceCheckUtils]: 25: Hoare triple {2533#(not (= 0 main_~__VERIFIER_assert__cond~17))} assume 0 == ~__VERIFIER_assert__cond~17; {2530#false} is VALID [2018-11-23 13:11:09,609 INFO L273 TraceCheckUtils]: 26: Hoare triple {2530#false} assume !false; {2530#false} is VALID [2018-11-23 13:11:09,611 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:11:09,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:09,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:11:09,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-23 13:11:09,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:09,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:11:09,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:09,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:11:09,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:11:09,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:11:09,658 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 5 states. [2018-11-23 13:11:10,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:10,108 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2018-11-23 13:11:10,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:11:10,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-23 13:11:10,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:10,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:11:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2018-11-23 13:11:10,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:11:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2018-11-23 13:11:10,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 125 transitions. [2018-11-23 13:11:10,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:10,271 INFO L225 Difference]: With dead ends: 121 [2018-11-23 13:11:10,271 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 13:11:10,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:11:10,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 13:11:10,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2018-11-23 13:11:10,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:10,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 77 states. [2018-11-23 13:11:10,529 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 77 states. [2018-11-23 13:11:10,529 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 77 states. [2018-11-23 13:11:10,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:10,533 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2018-11-23 13:11:10,533 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2018-11-23 13:11:10,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:10,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:10,534 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 119 states. [2018-11-23 13:11:10,534 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 119 states. [2018-11-23 13:11:10,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:10,537 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2018-11-23 13:11:10,537 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2018-11-23 13:11:10,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:10,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:10,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:10,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:10,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 13:11:10,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-11-23 13:11:10,540 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2018-11-23 13:11:10,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:10,541 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-11-23 13:11:10,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:11:10,541 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-11-23 13:11:10,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 13:11:10,542 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:10,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:10,543 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:10,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:10,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1990437563, now seen corresponding path program 1 times [2018-11-23 13:11:10,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:10,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:10,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:10,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:10,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:10,868 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-23 13:11:10,889 INFO L256 TraceCheckUtils]: 0: Hoare triple {2999#true} call ULTIMATE.init(); {2999#true} is VALID [2018-11-23 13:11:10,889 INFO L273 TraceCheckUtils]: 1: Hoare triple {2999#true} ~__return_main~0 := 0;~__return_375~0 := 0; {2999#true} is VALID [2018-11-23 13:11:10,889 INFO L273 TraceCheckUtils]: 2: Hoare triple {2999#true} assume true; {2999#true} is VALID [2018-11-23 13:11:10,889 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2999#true} {2999#true} #215#return; {2999#true} is VALID [2018-11-23 13:11:10,890 INFO L256 TraceCheckUtils]: 4: Hoare triple {2999#true} call #t~ret8 := main(); {2999#true} is VALID [2018-11-23 13:11:10,890 INFO L273 TraceCheckUtils]: 5: Hoare triple {2999#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {2999#true} is VALID [2018-11-23 13:11:10,891 INFO L273 TraceCheckUtils]: 6: Hoare triple {2999#true} assume !!(~main__urilen~0 <= 1000000); {2999#true} is VALID [2018-11-23 13:11:10,891 INFO L273 TraceCheckUtils]: 7: Hoare triple {2999#true} assume !!(~main__urilen~0 >= -1000000); {2999#true} is VALID [2018-11-23 13:11:10,891 INFO L273 TraceCheckUtils]: 8: Hoare triple {2999#true} assume !!(~main__tokenlen~0 <= 1000000); {2999#true} is VALID [2018-11-23 13:11:10,892 INFO L273 TraceCheckUtils]: 9: Hoare triple {2999#true} assume !!(~main__tokenlen~0 >= -1000000); {2999#true} is VALID [2018-11-23 13:11:10,892 INFO L273 TraceCheckUtils]: 10: Hoare triple {2999#true} assume !!(~main__scheme~0 <= 1000000); {2999#true} is VALID [2018-11-23 13:11:10,892 INFO L273 TraceCheckUtils]: 11: Hoare triple {2999#true} assume !!(~main__scheme~0 >= -1000000); {2999#true} is VALID [2018-11-23 13:11:10,892 INFO L273 TraceCheckUtils]: 12: Hoare triple {2999#true} assume ~main__urilen~0 > 0; {2999#true} is VALID [2018-11-23 13:11:10,893 INFO L273 TraceCheckUtils]: 13: Hoare triple {2999#true} assume ~main__tokenlen~0 > 0; {2999#true} is VALID [2018-11-23 13:11:10,893 INFO L273 TraceCheckUtils]: 14: Hoare triple {2999#true} assume ~main__scheme~0 >= 0; {2999#true} is VALID [2018-11-23 13:11:10,893 INFO L273 TraceCheckUtils]: 15: Hoare triple {2999#true} assume !(0 == ~main__scheme~0); {2999#true} is VALID [2018-11-23 13:11:10,893 INFO L273 TraceCheckUtils]: 16: Hoare triple {2999#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2999#true} is VALID [2018-11-23 13:11:10,893 INFO L273 TraceCheckUtils]: 17: Hoare triple {2999#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2999#true} is VALID [2018-11-23 13:11:10,894 INFO L273 TraceCheckUtils]: 18: Hoare triple {2999#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {2999#true} is VALID [2018-11-23 13:11:10,894 INFO L273 TraceCheckUtils]: 19: Hoare triple {2999#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2999#true} is VALID [2018-11-23 13:11:10,894 INFO L273 TraceCheckUtils]: 20: Hoare triple {2999#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {3001#(or (and (< main_~main__cp~0 0) (= main_~__VERIFIER_assert__cond~3 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (<= 0 main_~main__cp~0)))} is VALID [2018-11-23 13:11:10,895 INFO L273 TraceCheckUtils]: 21: Hoare triple {3001#(or (and (< main_~main__cp~0 0) (= main_~__VERIFIER_assert__cond~3 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (<= 0 main_~main__cp~0)))} assume !(0 == ~__VERIFIER_assert__cond~3); {3002#(<= 0 main_~main__cp~0)} is VALID [2018-11-23 13:11:10,895 INFO L273 TraceCheckUtils]: 22: Hoare triple {3002#(<= 0 main_~main__cp~0)} assume !(~main__cp~0 != ~main__urilen~0 - 1); {3002#(<= 0 main_~main__cp~0)} is VALID [2018-11-23 13:11:10,896 INFO L273 TraceCheckUtils]: 23: Hoare triple {3002#(<= 0 main_~main__cp~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {3002#(<= 0 main_~main__cp~0)} is VALID [2018-11-23 13:11:10,896 INFO L273 TraceCheckUtils]: 24: Hoare triple {3002#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {3003#(not (= 0 main_~__VERIFIER_assert__cond~5))} is VALID [2018-11-23 13:11:10,898 INFO L273 TraceCheckUtils]: 25: Hoare triple {3003#(not (= 0 main_~__VERIFIER_assert__cond~5))} assume 0 == ~__VERIFIER_assert__cond~5; {3000#false} is VALID [2018-11-23 13:11:10,898 INFO L273 TraceCheckUtils]: 26: Hoare triple {3000#false} assume !false; {3000#false} is VALID [2018-11-23 13:11:10,899 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:11:10,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:10,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:11:10,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-23 13:11:10,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:10,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:11:10,924 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:10,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:11:10,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:11:10,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:11:10,925 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2018-11-23 13:11:11,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:11,220 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-11-23 13:11:11,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:11:11,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-23 13:11:11,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:11,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:11:11,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2018-11-23 13:11:11,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:11:11,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2018-11-23 13:11:11,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 75 transitions. [2018-11-23 13:11:11,328 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:11:11,330 INFO L225 Difference]: With dead ends: 77 [2018-11-23 13:11:11,330 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 13:11:11,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:11:11,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 13:11:11,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-23 13:11:11,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:11,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 75 states. [2018-11-23 13:11:11,379 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 75 states. [2018-11-23 13:11:11,379 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 75 states. [2018-11-23 13:11:11,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:11,383 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-11-23 13:11:11,383 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-11-23 13:11:11,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:11,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:11,384 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 75 states. [2018-11-23 13:11:11,384 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 75 states. [2018-11-23 13:11:11,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:11,386 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-11-23 13:11:11,386 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-11-23 13:11:11,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:11,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:11,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:11,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:11,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 13:11:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-11-23 13:11:11,389 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2018-11-23 13:11:11,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:11,390 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-11-23 13:11:11,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:11:11,390 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-11-23 13:11:11,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 13:11:11,391 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:11,391 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:11,391 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:11,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:11,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1549950965, now seen corresponding path program 1 times [2018-11-23 13:11:11,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:11,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:11,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:11,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:11,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:11,466 INFO L256 TraceCheckUtils]: 0: Hoare triple {3332#true} call ULTIMATE.init(); {3332#true} is VALID [2018-11-23 13:11:11,466 INFO L273 TraceCheckUtils]: 1: Hoare triple {3332#true} ~__return_main~0 := 0;~__return_375~0 := 0; {3332#true} is VALID [2018-11-23 13:11:11,466 INFO L273 TraceCheckUtils]: 2: Hoare triple {3332#true} assume true; {3332#true} is VALID [2018-11-23 13:11:11,466 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3332#true} {3332#true} #215#return; {3332#true} is VALID [2018-11-23 13:11:11,467 INFO L256 TraceCheckUtils]: 4: Hoare triple {3332#true} call #t~ret8 := main(); {3332#true} is VALID [2018-11-23 13:11:11,467 INFO L273 TraceCheckUtils]: 5: Hoare triple {3332#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {3332#true} is VALID [2018-11-23 13:11:11,467 INFO L273 TraceCheckUtils]: 6: Hoare triple {3332#true} assume !!(~main__urilen~0 <= 1000000); {3332#true} is VALID [2018-11-23 13:11:11,467 INFO L273 TraceCheckUtils]: 7: Hoare triple {3332#true} assume !!(~main__urilen~0 >= -1000000); {3332#true} is VALID [2018-11-23 13:11:11,468 INFO L273 TraceCheckUtils]: 8: Hoare triple {3332#true} assume !!(~main__tokenlen~0 <= 1000000); {3332#true} is VALID [2018-11-23 13:11:11,468 INFO L273 TraceCheckUtils]: 9: Hoare triple {3332#true} assume !!(~main__tokenlen~0 >= -1000000); {3332#true} is VALID [2018-11-23 13:11:11,468 INFO L273 TraceCheckUtils]: 10: Hoare triple {3332#true} assume !!(~main__scheme~0 <= 1000000); {3332#true} is VALID [2018-11-23 13:11:11,468 INFO L273 TraceCheckUtils]: 11: Hoare triple {3332#true} assume !!(~main__scheme~0 >= -1000000); {3332#true} is VALID [2018-11-23 13:11:11,468 INFO L273 TraceCheckUtils]: 12: Hoare triple {3332#true} assume ~main__urilen~0 > 0; {3332#true} is VALID [2018-11-23 13:11:11,469 INFO L273 TraceCheckUtils]: 13: Hoare triple {3332#true} assume ~main__tokenlen~0 > 0; {3332#true} is VALID [2018-11-23 13:11:11,469 INFO L273 TraceCheckUtils]: 14: Hoare triple {3332#true} assume ~main__scheme~0 >= 0; {3332#true} is VALID [2018-11-23 13:11:11,469 INFO L273 TraceCheckUtils]: 15: Hoare triple {3332#true} assume !(0 == ~main__scheme~0); {3332#true} is VALID [2018-11-23 13:11:11,469 INFO L273 TraceCheckUtils]: 16: Hoare triple {3332#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3332#true} is VALID [2018-11-23 13:11:11,469 INFO L273 TraceCheckUtils]: 17: Hoare triple {3332#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3332#true} is VALID [2018-11-23 13:11:11,470 INFO L273 TraceCheckUtils]: 18: Hoare triple {3332#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {3332#true} is VALID [2018-11-23 13:11:11,470 INFO L273 TraceCheckUtils]: 19: Hoare triple {3332#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {3332#true} is VALID [2018-11-23 13:11:11,470 INFO L273 TraceCheckUtils]: 20: Hoare triple {3332#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {3332#true} is VALID [2018-11-23 13:11:11,470 INFO L273 TraceCheckUtils]: 21: Hoare triple {3332#true} assume !(0 == ~__VERIFIER_assert__cond~3); {3332#true} is VALID [2018-11-23 13:11:11,471 INFO L273 TraceCheckUtils]: 22: Hoare triple {3332#true} assume !(~main__cp~0 != ~main__urilen~0 - 1); {3334#(= main_~main__urilen~0 (+ main_~main__cp~0 1))} is VALID [2018-11-23 13:11:11,472 INFO L273 TraceCheckUtils]: 23: Hoare triple {3334#(= main_~main__urilen~0 (+ main_~main__cp~0 1))} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {3334#(= main_~main__urilen~0 (+ main_~main__cp~0 1))} is VALID [2018-11-23 13:11:11,472 INFO L273 TraceCheckUtils]: 24: Hoare triple {3334#(= main_~main__urilen~0 (+ main_~main__cp~0 1))} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {3334#(= main_~main__urilen~0 (+ main_~main__cp~0 1))} is VALID [2018-11-23 13:11:11,475 INFO L273 TraceCheckUtils]: 25: Hoare triple {3334#(= main_~main__urilen~0 (+ main_~main__cp~0 1))} assume !(0 == ~__VERIFIER_assert__cond~5); {3334#(= main_~main__urilen~0 (+ main_~main__cp~0 1))} is VALID [2018-11-23 13:11:11,475 INFO L273 TraceCheckUtils]: 26: Hoare triple {3334#(= main_~main__urilen~0 (+ main_~main__cp~0 1))} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {3333#false} is VALID [2018-11-23 13:11:11,475 INFO L273 TraceCheckUtils]: 27: Hoare triple {3333#false} assume 0 == ~__VERIFIER_assert__cond~6; {3333#false} is VALID [2018-11-23 13:11:11,476 INFO L273 TraceCheckUtils]: 28: Hoare triple {3333#false} assume !false; {3333#false} is VALID [2018-11-23 13:11:11,476 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:11:11,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:11,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:11:11,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 13:11:11,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:11,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:11:11,538 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:11,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:11:11,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:11:11,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:11:11,540 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 3 states. [2018-11-23 13:11:11,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:11,808 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-11-23 13:11:11,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:11:11,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 13:11:11,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:11,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:11:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2018-11-23 13:11:11,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:11:11,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2018-11-23 13:11:11,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2018-11-23 13:11:12,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:12,163 INFO L225 Difference]: With dead ends: 115 [2018-11-23 13:11:12,163 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 13:11:12,164 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:11:12,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 13:11:12,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-23 13:11:12,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:12,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 75 states. [2018-11-23 13:11:12,219 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 75 states. [2018-11-23 13:11:12,219 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 75 states. [2018-11-23 13:11:12,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:12,222 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-11-23 13:11:12,222 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-11-23 13:11:12,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:12,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:12,223 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 75 states. [2018-11-23 13:11:12,223 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 75 states. [2018-11-23 13:11:12,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:12,225 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-11-23 13:11:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-11-23 13:11:12,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:12,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:12,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:12,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:12,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 13:11:12,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2018-11-23 13:11:12,228 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2018-11-23 13:11:12,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:12,229 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2018-11-23 13:11:12,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:11:12,229 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-11-23 13:11:12,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 13:11:12,229 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:12,229 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:12,230 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:12,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:12,230 INFO L82 PathProgramCache]: Analyzing trace with hash 54388864, now seen corresponding path program 1 times [2018-11-23 13:11:12,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:12,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:12,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:12,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:12,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:12,391 INFO L256 TraceCheckUtils]: 0: Hoare triple {3700#true} call ULTIMATE.init(); {3700#true} is VALID [2018-11-23 13:11:12,392 INFO L273 TraceCheckUtils]: 1: Hoare triple {3700#true} ~__return_main~0 := 0;~__return_375~0 := 0; {3700#true} is VALID [2018-11-23 13:11:12,392 INFO L273 TraceCheckUtils]: 2: Hoare triple {3700#true} assume true; {3700#true} is VALID [2018-11-23 13:11:12,392 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3700#true} {3700#true} #215#return; {3700#true} is VALID [2018-11-23 13:11:12,393 INFO L256 TraceCheckUtils]: 4: Hoare triple {3700#true} call #t~ret8 := main(); {3700#true} is VALID [2018-11-23 13:11:12,393 INFO L273 TraceCheckUtils]: 5: Hoare triple {3700#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {3700#true} is VALID [2018-11-23 13:11:12,393 INFO L273 TraceCheckUtils]: 6: Hoare triple {3700#true} assume !!(~main__urilen~0 <= 1000000); {3700#true} is VALID [2018-11-23 13:11:12,393 INFO L273 TraceCheckUtils]: 7: Hoare triple {3700#true} assume !!(~main__urilen~0 >= -1000000); {3700#true} is VALID [2018-11-23 13:11:12,394 INFO L273 TraceCheckUtils]: 8: Hoare triple {3700#true} assume !!(~main__tokenlen~0 <= 1000000); {3700#true} is VALID [2018-11-23 13:11:12,394 INFO L273 TraceCheckUtils]: 9: Hoare triple {3700#true} assume !!(~main__tokenlen~0 >= -1000000); {3700#true} is VALID [2018-11-23 13:11:12,395 INFO L273 TraceCheckUtils]: 10: Hoare triple {3700#true} assume !!(~main__scheme~0 <= 1000000); {3700#true} is VALID [2018-11-23 13:11:12,395 INFO L273 TraceCheckUtils]: 11: Hoare triple {3700#true} assume !!(~main__scheme~0 >= -1000000); {3700#true} is VALID [2018-11-23 13:11:12,395 INFO L273 TraceCheckUtils]: 12: Hoare triple {3700#true} assume ~main__urilen~0 > 0; {3700#true} is VALID [2018-11-23 13:11:12,395 INFO L273 TraceCheckUtils]: 13: Hoare triple {3700#true} assume ~main__tokenlen~0 > 0; {3700#true} is VALID [2018-11-23 13:11:12,395 INFO L273 TraceCheckUtils]: 14: Hoare triple {3700#true} assume ~main__scheme~0 >= 0; {3700#true} is VALID [2018-11-23 13:11:12,396 INFO L273 TraceCheckUtils]: 15: Hoare triple {3700#true} assume !(0 == ~main__scheme~0); {3700#true} is VALID [2018-11-23 13:11:12,396 INFO L273 TraceCheckUtils]: 16: Hoare triple {3700#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3702#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2018-11-23 13:11:12,396 INFO L273 TraceCheckUtils]: 17: Hoare triple {3702#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3700#true} is VALID [2018-11-23 13:11:12,397 INFO L273 TraceCheckUtils]: 18: Hoare triple {3700#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {3700#true} is VALID [2018-11-23 13:11:12,397 INFO L273 TraceCheckUtils]: 19: Hoare triple {3700#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {3703#(or (= 0 main_~__VERIFIER_assert__cond~2) (<= (+ main_~main__cp~0 1) main_~main__urilen~0))} is VALID [2018-11-23 13:11:12,398 INFO L273 TraceCheckUtils]: 20: Hoare triple {3703#(or (= 0 main_~__VERIFIER_assert__cond~2) (<= (+ main_~main__cp~0 1) main_~main__urilen~0))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {3704#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:12,398 INFO L273 TraceCheckUtils]: 21: Hoare triple {3704#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {3704#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:12,399 INFO L273 TraceCheckUtils]: 22: Hoare triple {3704#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {3705#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:12,399 INFO L273 TraceCheckUtils]: 23: Hoare triple {3705#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {3705#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:12,399 INFO L273 TraceCheckUtils]: 24: Hoare triple {3705#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {3705#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:12,400 INFO L273 TraceCheckUtils]: 25: Hoare triple {3705#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {3705#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:12,400 INFO L273 TraceCheckUtils]: 26: Hoare triple {3705#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {3705#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:12,401 INFO L273 TraceCheckUtils]: 27: Hoare triple {3705#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {3706#(not (= 0 main_~__VERIFIER_assert__cond~6))} is VALID [2018-11-23 13:11:12,402 INFO L273 TraceCheckUtils]: 28: Hoare triple {3706#(not (= 0 main_~__VERIFIER_assert__cond~6))} assume 0 == ~__VERIFIER_assert__cond~6; {3701#false} is VALID [2018-11-23 13:11:12,402 INFO L273 TraceCheckUtils]: 29: Hoare triple {3701#false} assume !false; {3701#false} is VALID [2018-11-23 13:11:12,404 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:11:12,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:12,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 13:11:12,405 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-23 13:11:12,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:12,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:11:12,458 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:12,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:11:12,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:11:12,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:11:12,459 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 7 states. [2018-11-23 13:11:12,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:12,885 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-11-23 13:11:12,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:11:12,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-23 13:11:12,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:12,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:11:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2018-11-23 13:11:12,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:11:12,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2018-11-23 13:11:12,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2018-11-23 13:11:13,055 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:11:13,057 INFO L225 Difference]: With dead ends: 76 [2018-11-23 13:11:13,057 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 13:11:13,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:11:13,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 13:11:13,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-11-23 13:11:13,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:13,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 73 states. [2018-11-23 13:11:13,132 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 73 states. [2018-11-23 13:11:13,132 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 73 states. [2018-11-23 13:11:13,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:13,134 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-11-23 13:11:13,134 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-23 13:11:13,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:13,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:13,135 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 74 states. [2018-11-23 13:11:13,135 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 74 states. [2018-11-23 13:11:13,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:13,137 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-11-23 13:11:13,137 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-23 13:11:13,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:13,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:13,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:13,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:13,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 13:11:13,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-11-23 13:11:13,140 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2018-11-23 13:11:13,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:13,140 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-11-23 13:11:13,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:11:13,140 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-11-23 13:11:13,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 13:11:13,141 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:13,141 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:13,142 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:13,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:13,142 INFO L82 PathProgramCache]: Analyzing trace with hash -196719107, now seen corresponding path program 1 times [2018-11-23 13:11:13,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:13,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:13,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:13,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:13,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:13,330 INFO L256 TraceCheckUtils]: 0: Hoare triple {4036#true} call ULTIMATE.init(); {4036#true} is VALID [2018-11-23 13:11:13,331 INFO L273 TraceCheckUtils]: 1: Hoare triple {4036#true} ~__return_main~0 := 0;~__return_375~0 := 0; {4036#true} is VALID [2018-11-23 13:11:13,331 INFO L273 TraceCheckUtils]: 2: Hoare triple {4036#true} assume true; {4036#true} is VALID [2018-11-23 13:11:13,332 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4036#true} {4036#true} #215#return; {4036#true} is VALID [2018-11-23 13:11:13,332 INFO L256 TraceCheckUtils]: 4: Hoare triple {4036#true} call #t~ret8 := main(); {4036#true} is VALID [2018-11-23 13:11:13,332 INFO L273 TraceCheckUtils]: 5: Hoare triple {4036#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {4036#true} is VALID [2018-11-23 13:11:13,333 INFO L273 TraceCheckUtils]: 6: Hoare triple {4036#true} assume !!(~main__urilen~0 <= 1000000); {4036#true} is VALID [2018-11-23 13:11:13,333 INFO L273 TraceCheckUtils]: 7: Hoare triple {4036#true} assume !!(~main__urilen~0 >= -1000000); {4036#true} is VALID [2018-11-23 13:11:13,333 INFO L273 TraceCheckUtils]: 8: Hoare triple {4036#true} assume !!(~main__tokenlen~0 <= 1000000); {4036#true} is VALID [2018-11-23 13:11:13,334 INFO L273 TraceCheckUtils]: 9: Hoare triple {4036#true} assume !!(~main__tokenlen~0 >= -1000000); {4036#true} is VALID [2018-11-23 13:11:13,334 INFO L273 TraceCheckUtils]: 10: Hoare triple {4036#true} assume !!(~main__scheme~0 <= 1000000); {4036#true} is VALID [2018-11-23 13:11:13,335 INFO L273 TraceCheckUtils]: 11: Hoare triple {4036#true} assume !!(~main__scheme~0 >= -1000000); {4036#true} is VALID [2018-11-23 13:11:13,335 INFO L273 TraceCheckUtils]: 12: Hoare triple {4036#true} assume ~main__urilen~0 > 0; {4036#true} is VALID [2018-11-23 13:11:13,335 INFO L273 TraceCheckUtils]: 13: Hoare triple {4036#true} assume ~main__tokenlen~0 > 0; {4036#true} is VALID [2018-11-23 13:11:13,335 INFO L273 TraceCheckUtils]: 14: Hoare triple {4036#true} assume ~main__scheme~0 >= 0; {4036#true} is VALID [2018-11-23 13:11:13,335 INFO L273 TraceCheckUtils]: 15: Hoare triple {4036#true} assume !(0 == ~main__scheme~0); {4036#true} is VALID [2018-11-23 13:11:13,336 INFO L273 TraceCheckUtils]: 16: Hoare triple {4036#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4038#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2018-11-23 13:11:13,336 INFO L273 TraceCheckUtils]: 17: Hoare triple {4038#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4036#true} is VALID [2018-11-23 13:11:13,336 INFO L273 TraceCheckUtils]: 18: Hoare triple {4036#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {4036#true} is VALID [2018-11-23 13:11:13,339 INFO L273 TraceCheckUtils]: 19: Hoare triple {4036#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4039#(or (= 0 main_~__VERIFIER_assert__cond~2) (<= (+ main_~main__cp~0 1) main_~main__urilen~0))} is VALID [2018-11-23 13:11:13,340 INFO L273 TraceCheckUtils]: 20: Hoare triple {4039#(or (= 0 main_~__VERIFIER_assert__cond~2) (<= (+ main_~main__cp~0 1) main_~main__urilen~0))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:13,340 INFO L273 TraceCheckUtils]: 21: Hoare triple {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:13,341 INFO L273 TraceCheckUtils]: 22: Hoare triple {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {4041#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:13,341 INFO L273 TraceCheckUtils]: 23: Hoare triple {4041#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {4041#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:13,341 INFO L273 TraceCheckUtils]: 24: Hoare triple {4041#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {4041#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:13,342 INFO L273 TraceCheckUtils]: 25: Hoare triple {4041#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:13,343 INFO L273 TraceCheckUtils]: 26: Hoare triple {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:13,344 INFO L273 TraceCheckUtils]: 27: Hoare triple {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {4042#(not (= 0 main_~__VERIFIER_assert__cond~16))} is VALID [2018-11-23 13:11:13,344 INFO L273 TraceCheckUtils]: 28: Hoare triple {4042#(not (= 0 main_~__VERIFIER_assert__cond~16))} assume 0 == ~__VERIFIER_assert__cond~16; {4037#false} is VALID [2018-11-23 13:11:13,345 INFO L273 TraceCheckUtils]: 29: Hoare triple {4037#false} assume !false; {4037#false} is VALID [2018-11-23 13:11:13,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:11:13,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:13,347 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:11:13,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:13,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:13,923 INFO L256 TraceCheckUtils]: 0: Hoare triple {4036#true} call ULTIMATE.init(); {4036#true} is VALID [2018-11-23 13:11:13,924 INFO L273 TraceCheckUtils]: 1: Hoare triple {4036#true} ~__return_main~0 := 0;~__return_375~0 := 0; {4036#true} is VALID [2018-11-23 13:11:13,924 INFO L273 TraceCheckUtils]: 2: Hoare triple {4036#true} assume true; {4036#true} is VALID [2018-11-23 13:11:13,924 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4036#true} {4036#true} #215#return; {4036#true} is VALID [2018-11-23 13:11:13,924 INFO L256 TraceCheckUtils]: 4: Hoare triple {4036#true} call #t~ret8 := main(); {4036#true} is VALID [2018-11-23 13:11:13,924 INFO L273 TraceCheckUtils]: 5: Hoare triple {4036#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {4036#true} is VALID [2018-11-23 13:11:13,925 INFO L273 TraceCheckUtils]: 6: Hoare triple {4036#true} assume !!(~main__urilen~0 <= 1000000); {4036#true} is VALID [2018-11-23 13:11:13,925 INFO L273 TraceCheckUtils]: 7: Hoare triple {4036#true} assume !!(~main__urilen~0 >= -1000000); {4036#true} is VALID [2018-11-23 13:11:13,925 INFO L273 TraceCheckUtils]: 8: Hoare triple {4036#true} assume !!(~main__tokenlen~0 <= 1000000); {4036#true} is VALID [2018-11-23 13:11:13,925 INFO L273 TraceCheckUtils]: 9: Hoare triple {4036#true} assume !!(~main__tokenlen~0 >= -1000000); {4036#true} is VALID [2018-11-23 13:11:13,925 INFO L273 TraceCheckUtils]: 10: Hoare triple {4036#true} assume !!(~main__scheme~0 <= 1000000); {4036#true} is VALID [2018-11-23 13:11:13,926 INFO L273 TraceCheckUtils]: 11: Hoare triple {4036#true} assume !!(~main__scheme~0 >= -1000000); {4036#true} is VALID [2018-11-23 13:11:13,926 INFO L273 TraceCheckUtils]: 12: Hoare triple {4036#true} assume ~main__urilen~0 > 0; {4036#true} is VALID [2018-11-23 13:11:13,926 INFO L273 TraceCheckUtils]: 13: Hoare triple {4036#true} assume ~main__tokenlen~0 > 0; {4036#true} is VALID [2018-11-23 13:11:13,926 INFO L273 TraceCheckUtils]: 14: Hoare triple {4036#true} assume ~main__scheme~0 >= 0; {4036#true} is VALID [2018-11-23 13:11:13,926 INFO L273 TraceCheckUtils]: 15: Hoare triple {4036#true} assume !(0 == ~main__scheme~0); {4036#true} is VALID [2018-11-23 13:11:13,943 INFO L273 TraceCheckUtils]: 16: Hoare triple {4036#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4094#(and (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~0 1))} is VALID [2018-11-23 13:11:13,952 INFO L273 TraceCheckUtils]: 17: Hoare triple {4094#(and (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~0 1))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:13,965 INFO L273 TraceCheckUtils]: 18: Hoare triple {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:13,974 INFO L273 TraceCheckUtils]: 19: Hoare triple {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:13,987 INFO L273 TraceCheckUtils]: 20: Hoare triple {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:13,991 INFO L273 TraceCheckUtils]: 21: Hoare triple {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:13,994 INFO L273 TraceCheckUtils]: 22: Hoare triple {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {4041#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:13,994 INFO L273 TraceCheckUtils]: 23: Hoare triple {4041#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {4041#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:13,996 INFO L273 TraceCheckUtils]: 24: Hoare triple {4041#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {4041#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:13,996 INFO L273 TraceCheckUtils]: 25: Hoare triple {4041#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:13,998 INFO L273 TraceCheckUtils]: 26: Hoare triple {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:14,016 INFO L273 TraceCheckUtils]: 27: Hoare triple {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {4128#(= main_~__VERIFIER_assert__cond~16 1)} is VALID [2018-11-23 13:11:14,025 INFO L273 TraceCheckUtils]: 28: Hoare triple {4128#(= main_~__VERIFIER_assert__cond~16 1)} assume 0 == ~__VERIFIER_assert__cond~16; {4037#false} is VALID [2018-11-23 13:11:14,025 INFO L273 TraceCheckUtils]: 29: Hoare triple {4037#false} assume !false; {4037#false} is VALID [2018-11-23 13:11:14,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:11:14,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:14,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-11-23 13:11:14,056 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-11-23 13:11:14,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:14,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:11:14,131 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:14,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:11:14,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:11:14,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:11:14,132 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 9 states. [2018-11-23 13:11:15,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:15,141 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-11-23 13:11:15,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:11:15,141 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-11-23 13:11:15,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:15,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:11:15,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2018-11-23 13:11:15,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:11:15,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2018-11-23 13:11:15,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 114 transitions. [2018-11-23 13:11:15,300 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:15,302 INFO L225 Difference]: With dead ends: 111 [2018-11-23 13:11:15,303 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 13:11:15,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:11:15,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 13:11:15,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2018-11-23 13:11:15,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:15,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 70 states. [2018-11-23 13:11:15,375 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 70 states. [2018-11-23 13:11:15,376 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 70 states. [2018-11-23 13:11:15,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:15,379 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-11-23 13:11:15,379 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-11-23 13:11:15,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:15,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:15,380 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 109 states. [2018-11-23 13:11:15,380 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 109 states. [2018-11-23 13:11:15,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:15,382 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-11-23 13:11:15,382 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-11-23 13:11:15,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:15,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:15,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:15,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:15,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 13:11:15,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-11-23 13:11:15,384 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2018-11-23 13:11:15,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:15,384 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-11-23 13:11:15,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:11:15,384 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-11-23 13:11:15,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 13:11:15,385 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:15,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:15,386 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:15,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:15,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1686057932, now seen corresponding path program 1 times [2018-11-23 13:11:15,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:15,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:15,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:15,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:15,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:15,525 INFO L256 TraceCheckUtils]: 0: Hoare triple {4563#true} call ULTIMATE.init(); {4563#true} is VALID [2018-11-23 13:11:15,526 INFO L273 TraceCheckUtils]: 1: Hoare triple {4563#true} ~__return_main~0 := 0;~__return_375~0 := 0; {4563#true} is VALID [2018-11-23 13:11:15,526 INFO L273 TraceCheckUtils]: 2: Hoare triple {4563#true} assume true; {4563#true} is VALID [2018-11-23 13:11:15,526 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4563#true} {4563#true} #215#return; {4563#true} is VALID [2018-11-23 13:11:15,527 INFO L256 TraceCheckUtils]: 4: Hoare triple {4563#true} call #t~ret8 := main(); {4563#true} is VALID [2018-11-23 13:11:15,527 INFO L273 TraceCheckUtils]: 5: Hoare triple {4563#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {4563#true} is VALID [2018-11-23 13:11:15,527 INFO L273 TraceCheckUtils]: 6: Hoare triple {4563#true} assume !!(~main__urilen~0 <= 1000000); {4563#true} is VALID [2018-11-23 13:11:15,528 INFO L273 TraceCheckUtils]: 7: Hoare triple {4563#true} assume !!(~main__urilen~0 >= -1000000); {4563#true} is VALID [2018-11-23 13:11:15,528 INFO L273 TraceCheckUtils]: 8: Hoare triple {4563#true} assume !!(~main__tokenlen~0 <= 1000000); {4563#true} is VALID [2018-11-23 13:11:15,528 INFO L273 TraceCheckUtils]: 9: Hoare triple {4563#true} assume !!(~main__tokenlen~0 >= -1000000); {4563#true} is VALID [2018-11-23 13:11:15,529 INFO L273 TraceCheckUtils]: 10: Hoare triple {4563#true} assume !!(~main__scheme~0 <= 1000000); {4563#true} is VALID [2018-11-23 13:11:15,529 INFO L273 TraceCheckUtils]: 11: Hoare triple {4563#true} assume !!(~main__scheme~0 >= -1000000); {4563#true} is VALID [2018-11-23 13:11:15,529 INFO L273 TraceCheckUtils]: 12: Hoare triple {4563#true} assume ~main__urilen~0 > 0; {4563#true} is VALID [2018-11-23 13:11:15,530 INFO L273 TraceCheckUtils]: 13: Hoare triple {4563#true} assume ~main__tokenlen~0 > 0; {4563#true} is VALID [2018-11-23 13:11:15,530 INFO L273 TraceCheckUtils]: 14: Hoare triple {4563#true} assume ~main__scheme~0 >= 0; {4563#true} is VALID [2018-11-23 13:11:15,530 INFO L273 TraceCheckUtils]: 15: Hoare triple {4563#true} assume !(0 == ~main__scheme~0); {4563#true} is VALID [2018-11-23 13:11:15,537 INFO L273 TraceCheckUtils]: 16: Hoare triple {4563#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4565#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2018-11-23 13:11:15,538 INFO L273 TraceCheckUtils]: 17: Hoare triple {4565#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4566#(or (= 0 main_~__VERIFIER_assert__cond~1) (<= 1 main_~main__cp~0))} is VALID [2018-11-23 13:11:15,538 INFO L273 TraceCheckUtils]: 18: Hoare triple {4566#(or (= 0 main_~__VERIFIER_assert__cond~1) (<= 1 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {4567#(<= 1 main_~main__cp~0)} is VALID [2018-11-23 13:11:15,539 INFO L273 TraceCheckUtils]: 19: Hoare triple {4567#(<= 1 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4567#(<= 1 main_~main__cp~0)} is VALID [2018-11-23 13:11:15,539 INFO L273 TraceCheckUtils]: 20: Hoare triple {4567#(<= 1 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4567#(<= 1 main_~main__cp~0)} is VALID [2018-11-23 13:11:15,540 INFO L273 TraceCheckUtils]: 21: Hoare triple {4567#(<= 1 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {4567#(<= 1 main_~main__cp~0)} is VALID [2018-11-23 13:11:15,540 INFO L273 TraceCheckUtils]: 22: Hoare triple {4567#(<= 1 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {4567#(<= 1 main_~main__cp~0)} is VALID [2018-11-23 13:11:15,541 INFO L273 TraceCheckUtils]: 23: Hoare triple {4567#(<= 1 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {4567#(<= 1 main_~main__cp~0)} is VALID [2018-11-23 13:11:15,544 INFO L273 TraceCheckUtils]: 24: Hoare triple {4567#(<= 1 main_~main__cp~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {4567#(<= 1 main_~main__cp~0)} is VALID [2018-11-23 13:11:15,544 INFO L273 TraceCheckUtils]: 25: Hoare triple {4567#(<= 1 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {4567#(<= 1 main_~main__cp~0)} is VALID [2018-11-23 13:11:15,545 INFO L273 TraceCheckUtils]: 26: Hoare triple {4567#(<= 1 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {4567#(<= 1 main_~main__cp~0)} is VALID [2018-11-23 13:11:15,545 INFO L273 TraceCheckUtils]: 27: Hoare triple {4567#(<= 1 main_~main__cp~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {4567#(<= 1 main_~main__cp~0)} is VALID [2018-11-23 13:11:15,546 INFO L273 TraceCheckUtils]: 28: Hoare triple {4567#(<= 1 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {4568#(not (= 0 main_~__VERIFIER_assert__cond~7))} is VALID [2018-11-23 13:11:15,547 INFO L273 TraceCheckUtils]: 29: Hoare triple {4568#(not (= 0 main_~__VERIFIER_assert__cond~7))} assume 0 == ~__VERIFIER_assert__cond~7; {4564#false} is VALID [2018-11-23 13:11:15,547 INFO L273 TraceCheckUtils]: 30: Hoare triple {4564#false} assume !false; {4564#false} is VALID [2018-11-23 13:11:15,549 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:11:15,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:15,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:11:15,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-23 13:11:15,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:15,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:11:15,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:15,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:11:15,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:11:15,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:11:15,583 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 6 states. [2018-11-23 13:11:15,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:15,957 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-11-23 13:11:15,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:11:15,958 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-23 13:11:15,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:15,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:11:15,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2018-11-23 13:11:15,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:11:15,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2018-11-23 13:11:15,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 68 transitions. [2018-11-23 13:11:16,027 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:16,028 INFO L225 Difference]: With dead ends: 70 [2018-11-23 13:11:16,028 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 13:11:16,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:11:16,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 13:11:16,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-23 13:11:16,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:16,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 68 states. [2018-11-23 13:11:16,091 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2018-11-23 13:11:16,091 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2018-11-23 13:11:16,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:16,093 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-11-23 13:11:16,093 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-23 13:11:16,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:16,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:16,095 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2018-11-23 13:11:16,095 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2018-11-23 13:11:16,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:16,097 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-11-23 13:11:16,097 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-23 13:11:16,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:16,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:16,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:16,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 13:11:16,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-11-23 13:11:16,099 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2018-11-23 13:11:16,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:16,100 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-11-23 13:11:16,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:11:16,100 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-23 13:11:16,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 13:11:16,100 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:16,100 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:16,101 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:16,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:16,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1806773561, now seen corresponding path program 1 times [2018-11-23 13:11:16,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:16,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:16,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:16,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:16,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:16,329 INFO L256 TraceCheckUtils]: 0: Hoare triple {4871#true} call ULTIMATE.init(); {4871#true} is VALID [2018-11-23 13:11:16,329 INFO L273 TraceCheckUtils]: 1: Hoare triple {4871#true} ~__return_main~0 := 0;~__return_375~0 := 0; {4871#true} is VALID [2018-11-23 13:11:16,330 INFO L273 TraceCheckUtils]: 2: Hoare triple {4871#true} assume true; {4871#true} is VALID [2018-11-23 13:11:16,330 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4871#true} {4871#true} #215#return; {4871#true} is VALID [2018-11-23 13:11:16,330 INFO L256 TraceCheckUtils]: 4: Hoare triple {4871#true} call #t~ret8 := main(); {4871#true} is VALID [2018-11-23 13:11:16,330 INFO L273 TraceCheckUtils]: 5: Hoare triple {4871#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {4871#true} is VALID [2018-11-23 13:11:16,331 INFO L273 TraceCheckUtils]: 6: Hoare triple {4871#true} assume !!(~main__urilen~0 <= 1000000); {4871#true} is VALID [2018-11-23 13:11:16,331 INFO L273 TraceCheckUtils]: 7: Hoare triple {4871#true} assume !!(~main__urilen~0 >= -1000000); {4871#true} is VALID [2018-11-23 13:11:16,331 INFO L273 TraceCheckUtils]: 8: Hoare triple {4871#true} assume !!(~main__tokenlen~0 <= 1000000); {4871#true} is VALID [2018-11-23 13:11:16,332 INFO L273 TraceCheckUtils]: 9: Hoare triple {4871#true} assume !!(~main__tokenlen~0 >= -1000000); {4871#true} is VALID [2018-11-23 13:11:16,332 INFO L273 TraceCheckUtils]: 10: Hoare triple {4871#true} assume !!(~main__scheme~0 <= 1000000); {4871#true} is VALID [2018-11-23 13:11:16,332 INFO L273 TraceCheckUtils]: 11: Hoare triple {4871#true} assume !!(~main__scheme~0 >= -1000000); {4871#true} is VALID [2018-11-23 13:11:16,333 INFO L273 TraceCheckUtils]: 12: Hoare triple {4871#true} assume ~main__urilen~0 > 0; {4871#true} is VALID [2018-11-23 13:11:16,333 INFO L273 TraceCheckUtils]: 13: Hoare triple {4871#true} assume ~main__tokenlen~0 > 0; {4871#true} is VALID [2018-11-23 13:11:16,333 INFO L273 TraceCheckUtils]: 14: Hoare triple {4871#true} assume ~main__scheme~0 >= 0; {4871#true} is VALID [2018-11-23 13:11:16,333 INFO L273 TraceCheckUtils]: 15: Hoare triple {4871#true} assume !(0 == ~main__scheme~0); {4871#true} is VALID [2018-11-23 13:11:16,339 INFO L273 TraceCheckUtils]: 16: Hoare triple {4871#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4873#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2018-11-23 13:11:16,339 INFO L273 TraceCheckUtils]: 17: Hoare triple {4873#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4871#true} is VALID [2018-11-23 13:11:16,340 INFO L273 TraceCheckUtils]: 18: Hoare triple {4871#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {4871#true} is VALID [2018-11-23 13:11:16,340 INFO L273 TraceCheckUtils]: 19: Hoare triple {4871#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4874#(or (= 0 main_~__VERIFIER_assert__cond~2) (<= (+ main_~main__cp~0 1) main_~main__urilen~0))} is VALID [2018-11-23 13:11:16,341 INFO L273 TraceCheckUtils]: 20: Hoare triple {4874#(or (= 0 main_~__VERIFIER_assert__cond~2) (<= (+ main_~main__cp~0 1) main_~main__urilen~0))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:16,341 INFO L273 TraceCheckUtils]: 21: Hoare triple {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:16,342 INFO L273 TraceCheckUtils]: 22: Hoare triple {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {4876#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:16,342 INFO L273 TraceCheckUtils]: 23: Hoare triple {4876#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {4876#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:16,342 INFO L273 TraceCheckUtils]: 24: Hoare triple {4876#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {4876#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:16,343 INFO L273 TraceCheckUtils]: 25: Hoare triple {4876#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:16,343 INFO L273 TraceCheckUtils]: 26: Hoare triple {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:16,344 INFO L273 TraceCheckUtils]: 27: Hoare triple {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:16,344 INFO L273 TraceCheckUtils]: 28: Hoare triple {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {4877#(not (= 0 main_~__VERIFIER_assert__cond~4))} is VALID [2018-11-23 13:11:16,345 INFO L273 TraceCheckUtils]: 29: Hoare triple {4877#(not (= 0 main_~__VERIFIER_assert__cond~4))} assume 0 == ~__VERIFIER_assert__cond~4; {4872#false} is VALID [2018-11-23 13:11:16,345 INFO L273 TraceCheckUtils]: 30: Hoare triple {4872#false} assume !false; {4872#false} is VALID [2018-11-23 13:11:16,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:11:16,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:16,347 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:11:16,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:16,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:16,527 INFO L256 TraceCheckUtils]: 0: Hoare triple {4871#true} call ULTIMATE.init(); {4871#true} is VALID [2018-11-23 13:11:16,527 INFO L273 TraceCheckUtils]: 1: Hoare triple {4871#true} ~__return_main~0 := 0;~__return_375~0 := 0; {4871#true} is VALID [2018-11-23 13:11:16,527 INFO L273 TraceCheckUtils]: 2: Hoare triple {4871#true} assume true; {4871#true} is VALID [2018-11-23 13:11:16,528 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4871#true} {4871#true} #215#return; {4871#true} is VALID [2018-11-23 13:11:16,528 INFO L256 TraceCheckUtils]: 4: Hoare triple {4871#true} call #t~ret8 := main(); {4871#true} is VALID [2018-11-23 13:11:16,528 INFO L273 TraceCheckUtils]: 5: Hoare triple {4871#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {4871#true} is VALID [2018-11-23 13:11:16,528 INFO L273 TraceCheckUtils]: 6: Hoare triple {4871#true} assume !!(~main__urilen~0 <= 1000000); {4871#true} is VALID [2018-11-23 13:11:16,529 INFO L273 TraceCheckUtils]: 7: Hoare triple {4871#true} assume !!(~main__urilen~0 >= -1000000); {4871#true} is VALID [2018-11-23 13:11:16,529 INFO L273 TraceCheckUtils]: 8: Hoare triple {4871#true} assume !!(~main__tokenlen~0 <= 1000000); {4871#true} is VALID [2018-11-23 13:11:16,529 INFO L273 TraceCheckUtils]: 9: Hoare triple {4871#true} assume !!(~main__tokenlen~0 >= -1000000); {4871#true} is VALID [2018-11-23 13:11:16,529 INFO L273 TraceCheckUtils]: 10: Hoare triple {4871#true} assume !!(~main__scheme~0 <= 1000000); {4871#true} is VALID [2018-11-23 13:11:16,530 INFO L273 TraceCheckUtils]: 11: Hoare triple {4871#true} assume !!(~main__scheme~0 >= -1000000); {4871#true} is VALID [2018-11-23 13:11:16,530 INFO L273 TraceCheckUtils]: 12: Hoare triple {4871#true} assume ~main__urilen~0 > 0; {4871#true} is VALID [2018-11-23 13:11:16,530 INFO L273 TraceCheckUtils]: 13: Hoare triple {4871#true} assume ~main__tokenlen~0 > 0; {4871#true} is VALID [2018-11-23 13:11:16,531 INFO L273 TraceCheckUtils]: 14: Hoare triple {4871#true} assume ~main__scheme~0 >= 0; {4871#true} is VALID [2018-11-23 13:11:16,531 INFO L273 TraceCheckUtils]: 15: Hoare triple {4871#true} assume !(0 == ~main__scheme~0); {4871#true} is VALID [2018-11-23 13:11:16,536 INFO L273 TraceCheckUtils]: 16: Hoare triple {4871#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4929#(and (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~0 1))} is VALID [2018-11-23 13:11:16,537 INFO L273 TraceCheckUtils]: 17: Hoare triple {4929#(and (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~0 1))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:16,537 INFO L273 TraceCheckUtils]: 18: Hoare triple {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:16,537 INFO L273 TraceCheckUtils]: 19: Hoare triple {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:16,538 INFO L273 TraceCheckUtils]: 20: Hoare triple {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:16,538 INFO L273 TraceCheckUtils]: 21: Hoare triple {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:16,539 INFO L273 TraceCheckUtils]: 22: Hoare triple {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {4876#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:16,539 INFO L273 TraceCheckUtils]: 23: Hoare triple {4876#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {4876#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:16,539 INFO L273 TraceCheckUtils]: 24: Hoare triple {4876#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {4876#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:16,540 INFO L273 TraceCheckUtils]: 25: Hoare triple {4876#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:16,540 INFO L273 TraceCheckUtils]: 26: Hoare triple {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:16,541 INFO L273 TraceCheckUtils]: 27: Hoare triple {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:16,542 INFO L273 TraceCheckUtils]: 28: Hoare triple {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {4966#(= main_~__VERIFIER_assert__cond~4 1)} is VALID [2018-11-23 13:11:16,542 INFO L273 TraceCheckUtils]: 29: Hoare triple {4966#(= main_~__VERIFIER_assert__cond~4 1)} assume 0 == ~__VERIFIER_assert__cond~4; {4872#false} is VALID [2018-11-23 13:11:16,543 INFO L273 TraceCheckUtils]: 30: Hoare triple {4872#false} assume !false; {4872#false} is VALID [2018-11-23 13:11:16,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:11:16,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:16,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-11-23 13:11:16,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-23 13:11:16,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:16,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:11:16,596 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:16,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:11:16,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:11:16,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:11:16,597 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 9 states. [2018-11-23 13:11:17,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:17,366 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-23 13:11:17,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:11:17,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-23 13:11:17,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:17,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:11:17,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2018-11-23 13:11:17,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:11:17,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2018-11-23 13:11:17,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 67 transitions. [2018-11-23 13:11:17,800 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:17,802 INFO L225 Difference]: With dead ends: 69 [2018-11-23 13:11:17,802 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 13:11:17,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:11:17,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 13:11:17,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-11-23 13:11:17,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:17,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 62 states. [2018-11-23 13:11:17,843 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 62 states. [2018-11-23 13:11:17,843 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 62 states. [2018-11-23 13:11:17,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:17,844 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-11-23 13:11:17,844 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-11-23 13:11:17,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:17,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:17,845 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 67 states. [2018-11-23 13:11:17,845 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 67 states. [2018-11-23 13:11:17,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:17,846 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-11-23 13:11:17,847 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-11-23 13:11:17,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:17,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:17,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:17,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:17,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 13:11:17,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-11-23 13:11:17,849 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2018-11-23 13:11:17,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:17,849 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-11-23 13:11:17,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:11:17,849 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-11-23 13:11:17,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 13:11:17,850 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:17,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:17,850 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:17,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:17,851 INFO L82 PathProgramCache]: Analyzing trace with hash -287576151, now seen corresponding path program 1 times [2018-11-23 13:11:17,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:17,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:17,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:17,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:17,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:18,340 INFO L256 TraceCheckUtils]: 0: Hoare triple {5262#true} call ULTIMATE.init(); {5262#true} is VALID [2018-11-23 13:11:18,340 INFO L273 TraceCheckUtils]: 1: Hoare triple {5262#true} ~__return_main~0 := 0;~__return_375~0 := 0; {5262#true} is VALID [2018-11-23 13:11:18,340 INFO L273 TraceCheckUtils]: 2: Hoare triple {5262#true} assume true; {5262#true} is VALID [2018-11-23 13:11:18,341 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5262#true} {5262#true} #215#return; {5262#true} is VALID [2018-11-23 13:11:18,341 INFO L256 TraceCheckUtils]: 4: Hoare triple {5262#true} call #t~ret8 := main(); {5262#true} is VALID [2018-11-23 13:11:18,341 INFO L273 TraceCheckUtils]: 5: Hoare triple {5262#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {5262#true} is VALID [2018-11-23 13:11:18,341 INFO L273 TraceCheckUtils]: 6: Hoare triple {5262#true} assume !!(~main__urilen~0 <= 1000000); {5262#true} is VALID [2018-11-23 13:11:18,341 INFO L273 TraceCheckUtils]: 7: Hoare triple {5262#true} assume !!(~main__urilen~0 >= -1000000); {5262#true} is VALID [2018-11-23 13:11:18,342 INFO L273 TraceCheckUtils]: 8: Hoare triple {5262#true} assume !!(~main__tokenlen~0 <= 1000000); {5262#true} is VALID [2018-11-23 13:11:18,342 INFO L273 TraceCheckUtils]: 9: Hoare triple {5262#true} assume !!(~main__tokenlen~0 >= -1000000); {5262#true} is VALID [2018-11-23 13:11:18,342 INFO L273 TraceCheckUtils]: 10: Hoare triple {5262#true} assume !!(~main__scheme~0 <= 1000000); {5262#true} is VALID [2018-11-23 13:11:18,342 INFO L273 TraceCheckUtils]: 11: Hoare triple {5262#true} assume !!(~main__scheme~0 >= -1000000); {5262#true} is VALID [2018-11-23 13:11:18,342 INFO L273 TraceCheckUtils]: 12: Hoare triple {5262#true} assume ~main__urilen~0 > 0; {5262#true} is VALID [2018-11-23 13:11:18,343 INFO L273 TraceCheckUtils]: 13: Hoare triple {5262#true} assume ~main__tokenlen~0 > 0; {5262#true} is VALID [2018-11-23 13:11:18,343 INFO L273 TraceCheckUtils]: 14: Hoare triple {5262#true} assume ~main__scheme~0 >= 0; {5262#true} is VALID [2018-11-23 13:11:18,343 INFO L273 TraceCheckUtils]: 15: Hoare triple {5262#true} assume !(0 == ~main__scheme~0); {5262#true} is VALID [2018-11-23 13:11:18,347 INFO L273 TraceCheckUtils]: 16: Hoare triple {5262#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5264#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2018-11-23 13:11:18,347 INFO L273 TraceCheckUtils]: 17: Hoare triple {5264#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5262#true} is VALID [2018-11-23 13:11:18,348 INFO L273 TraceCheckUtils]: 18: Hoare triple {5262#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {5262#true} is VALID [2018-11-23 13:11:18,349 INFO L273 TraceCheckUtils]: 19: Hoare triple {5262#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5265#(or (= 0 main_~__VERIFIER_assert__cond~2) (<= (+ main_~main__cp~0 1) main_~main__urilen~0))} is VALID [2018-11-23 13:11:18,349 INFO L273 TraceCheckUtils]: 20: Hoare triple {5265#(or (= 0 main_~__VERIFIER_assert__cond~2) (<= (+ main_~main__cp~0 1) main_~main__urilen~0))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5266#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:18,352 INFO L273 TraceCheckUtils]: 21: Hoare triple {5266#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {5266#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:18,352 INFO L273 TraceCheckUtils]: 22: Hoare triple {5266#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {5267#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:18,354 INFO L273 TraceCheckUtils]: 23: Hoare triple {5267#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {5267#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:18,354 INFO L273 TraceCheckUtils]: 24: Hoare triple {5267#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {5267#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:18,356 INFO L273 TraceCheckUtils]: 25: Hoare triple {5267#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {5267#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:18,356 INFO L273 TraceCheckUtils]: 26: Hoare triple {5267#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {5267#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:18,356 INFO L273 TraceCheckUtils]: 27: Hoare triple {5267#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {5267#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:18,357 INFO L273 TraceCheckUtils]: 28: Hoare triple {5267#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {5267#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:18,357 INFO L273 TraceCheckUtils]: 29: Hoare triple {5267#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {5267#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:18,358 INFO L273 TraceCheckUtils]: 30: Hoare triple {5267#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet6;havoc #t~nondet6; {5266#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:18,358 INFO L273 TraceCheckUtils]: 31: Hoare triple {5266#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {5268#(not (= 0 main_~__VERIFIER_assert__cond~8))} is VALID [2018-11-23 13:11:18,359 INFO L273 TraceCheckUtils]: 32: Hoare triple {5268#(not (= 0 main_~__VERIFIER_assert__cond~8))} assume 0 == ~__VERIFIER_assert__cond~8; {5263#false} is VALID [2018-11-23 13:11:18,359 INFO L273 TraceCheckUtils]: 33: Hoare triple {5263#false} assume !false; {5263#false} is VALID [2018-11-23 13:11:18,360 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:11:18,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:18,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 13:11:18,361 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-23 13:11:18,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:18,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:11:18,389 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:18,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:11:18,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:11:18,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:11:18,390 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 7 states. [2018-11-23 13:11:19,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:19,176 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-23 13:11:19,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:11:19,177 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-23 13:11:19,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:19,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:11:19,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2018-11-23 13:11:19,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:11:19,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2018-11-23 13:11:19,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2018-11-23 13:11:19,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:19,251 INFO L225 Difference]: With dead ends: 63 [2018-11-23 13:11:19,251 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 13:11:19,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:11:19,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 13:11:19,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-23 13:11:19,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:19,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 60 states. [2018-11-23 13:11:19,300 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 60 states. [2018-11-23 13:11:19,300 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 60 states. [2018-11-23 13:11:19,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:19,302 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-11-23 13:11:19,302 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-11-23 13:11:19,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:19,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:19,303 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 61 states. [2018-11-23 13:11:19,303 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 61 states. [2018-11-23 13:11:19,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:19,304 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-11-23 13:11:19,304 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-11-23 13:11:19,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:19,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:19,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:19,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:19,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 13:11:19,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-11-23 13:11:19,306 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2018-11-23 13:11:19,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:19,307 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-11-23 13:11:19,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:11:19,307 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-23 13:11:19,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 13:11:19,307 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:19,307 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:19,308 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:19,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:19,308 INFO L82 PathProgramCache]: Analyzing trace with hash -324922921, now seen corresponding path program 1 times [2018-11-23 13:11:19,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:19,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:19,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:19,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:19,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:19,807 INFO L256 TraceCheckUtils]: 0: Hoare triple {5542#true} call ULTIMATE.init(); {5542#true} is VALID [2018-11-23 13:11:19,808 INFO L273 TraceCheckUtils]: 1: Hoare triple {5542#true} ~__return_main~0 := 0;~__return_375~0 := 0; {5542#true} is VALID [2018-11-23 13:11:19,808 INFO L273 TraceCheckUtils]: 2: Hoare triple {5542#true} assume true; {5542#true} is VALID [2018-11-23 13:11:19,808 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5542#true} {5542#true} #215#return; {5542#true} is VALID [2018-11-23 13:11:19,808 INFO L256 TraceCheckUtils]: 4: Hoare triple {5542#true} call #t~ret8 := main(); {5542#true} is VALID [2018-11-23 13:11:19,809 INFO L273 TraceCheckUtils]: 5: Hoare triple {5542#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {5542#true} is VALID [2018-11-23 13:11:19,809 INFO L273 TraceCheckUtils]: 6: Hoare triple {5542#true} assume !!(~main__urilen~0 <= 1000000); {5542#true} is VALID [2018-11-23 13:11:19,809 INFO L273 TraceCheckUtils]: 7: Hoare triple {5542#true} assume !!(~main__urilen~0 >= -1000000); {5542#true} is VALID [2018-11-23 13:11:19,809 INFO L273 TraceCheckUtils]: 8: Hoare triple {5542#true} assume !!(~main__tokenlen~0 <= 1000000); {5542#true} is VALID [2018-11-23 13:11:19,809 INFO L273 TraceCheckUtils]: 9: Hoare triple {5542#true} assume !!(~main__tokenlen~0 >= -1000000); {5542#true} is VALID [2018-11-23 13:11:19,810 INFO L273 TraceCheckUtils]: 10: Hoare triple {5542#true} assume !!(~main__scheme~0 <= 1000000); {5542#true} is VALID [2018-11-23 13:11:19,810 INFO L273 TraceCheckUtils]: 11: Hoare triple {5542#true} assume !!(~main__scheme~0 >= -1000000); {5542#true} is VALID [2018-11-23 13:11:19,810 INFO L273 TraceCheckUtils]: 12: Hoare triple {5542#true} assume ~main__urilen~0 > 0; {5542#true} is VALID [2018-11-23 13:11:19,810 INFO L273 TraceCheckUtils]: 13: Hoare triple {5542#true} assume ~main__tokenlen~0 > 0; {5542#true} is VALID [2018-11-23 13:11:19,811 INFO L273 TraceCheckUtils]: 14: Hoare triple {5542#true} assume ~main__scheme~0 >= 0; {5542#true} is VALID [2018-11-23 13:11:19,811 INFO L273 TraceCheckUtils]: 15: Hoare triple {5542#true} assume !(0 == ~main__scheme~0); {5542#true} is VALID [2018-11-23 13:11:19,811 INFO L273 TraceCheckUtils]: 16: Hoare triple {5542#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5544#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2018-11-23 13:11:19,812 INFO L273 TraceCheckUtils]: 17: Hoare triple {5544#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5545#(or (= 0 main_~__VERIFIER_assert__cond~1) (<= 1 main_~main__cp~0))} is VALID [2018-11-23 13:11:19,812 INFO L273 TraceCheckUtils]: 18: Hoare triple {5545#(or (= 0 main_~__VERIFIER_assert__cond~1) (<= 1 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {5546#(<= 1 main_~main__cp~0)} is VALID [2018-11-23 13:11:19,813 INFO L273 TraceCheckUtils]: 19: Hoare triple {5546#(<= 1 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5546#(<= 1 main_~main__cp~0)} is VALID [2018-11-23 13:11:19,813 INFO L273 TraceCheckUtils]: 20: Hoare triple {5546#(<= 1 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5546#(<= 1 main_~main__cp~0)} is VALID [2018-11-23 13:11:19,813 INFO L273 TraceCheckUtils]: 21: Hoare triple {5546#(<= 1 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {5546#(<= 1 main_~main__cp~0)} is VALID [2018-11-23 13:11:19,814 INFO L273 TraceCheckUtils]: 22: Hoare triple {5546#(<= 1 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {5546#(<= 1 main_~main__cp~0)} is VALID [2018-11-23 13:11:19,814 INFO L273 TraceCheckUtils]: 23: Hoare triple {5546#(<= 1 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {5546#(<= 1 main_~main__cp~0)} is VALID [2018-11-23 13:11:19,814 INFO L273 TraceCheckUtils]: 24: Hoare triple {5546#(<= 1 main_~main__cp~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {5546#(<= 1 main_~main__cp~0)} is VALID [2018-11-23 13:11:19,815 INFO L273 TraceCheckUtils]: 25: Hoare triple {5546#(<= 1 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {5546#(<= 1 main_~main__cp~0)} is VALID [2018-11-23 13:11:19,815 INFO L273 TraceCheckUtils]: 26: Hoare triple {5546#(<= 1 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {5546#(<= 1 main_~main__cp~0)} is VALID [2018-11-23 13:11:19,815 INFO L273 TraceCheckUtils]: 27: Hoare triple {5546#(<= 1 main_~main__cp~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {5546#(<= 1 main_~main__cp~0)} is VALID [2018-11-23 13:11:19,816 INFO L273 TraceCheckUtils]: 28: Hoare triple {5546#(<= 1 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {5546#(<= 1 main_~main__cp~0)} is VALID [2018-11-23 13:11:19,816 INFO L273 TraceCheckUtils]: 29: Hoare triple {5546#(<= 1 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {5546#(<= 1 main_~main__cp~0)} is VALID [2018-11-23 13:11:19,817 INFO L273 TraceCheckUtils]: 30: Hoare triple {5546#(<= 1 main_~main__cp~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet6;havoc #t~nondet6; {5547#(<= 2 main_~main__cp~0)} is VALID [2018-11-23 13:11:19,818 INFO L273 TraceCheckUtils]: 31: Hoare triple {5547#(<= 2 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {5547#(<= 2 main_~main__cp~0)} is VALID [2018-11-23 13:11:19,826 INFO L273 TraceCheckUtils]: 32: Hoare triple {5547#(<= 2 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {5548#(not (= 0 main_~__VERIFIER_assert__cond~9))} is VALID [2018-11-23 13:11:19,826 INFO L273 TraceCheckUtils]: 33: Hoare triple {5548#(not (= 0 main_~__VERIFIER_assert__cond~9))} assume 0 == ~__VERIFIER_assert__cond~9; {5543#false} is VALID [2018-11-23 13:11:19,827 INFO L273 TraceCheckUtils]: 34: Hoare triple {5543#false} assume !false; {5543#false} is VALID [2018-11-23 13:11:19,828 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:11:19,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:19,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 13:11:19,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-11-23 13:11:19,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:19,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:11:19,860 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:11:19,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:11:19,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:11:19,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:11:19,861 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 7 states. [2018-11-23 13:11:20,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:20,341 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-11-23 13:11:20,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:11:20,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-11-23 13:11:20,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:11:20,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2018-11-23 13:11:20,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:11:20,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2018-11-23 13:11:20,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2018-11-23 13:11:20,418 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:11:20,420 INFO L225 Difference]: With dead ends: 71 [2018-11-23 13:11:20,420 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 13:11:20,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:11:20,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 13:11:20,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2018-11-23 13:11:20,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:20,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 58 states. [2018-11-23 13:11:20,506 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 58 states. [2018-11-23 13:11:20,506 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 58 states. [2018-11-23 13:11:20,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:20,508 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-23 13:11:20,508 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-11-23 13:11:20,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:20,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:20,509 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 69 states. [2018-11-23 13:11:20,509 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 69 states. [2018-11-23 13:11:20,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:20,510 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-23 13:11:20,510 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-11-23 13:11:20,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:20,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:20,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:20,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:20,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 13:11:20,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-11-23 13:11:20,512 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2018-11-23 13:11:20,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:20,513 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-11-23 13:11:20,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:11:20,513 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-23 13:11:20,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 13:11:20,513 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:20,513 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:20,514 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:20,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:20,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1080633106, now seen corresponding path program 1 times [2018-11-23 13:11:20,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:20,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:20,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:20,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:20,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:20,891 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-23 13:11:20,923 INFO L256 TraceCheckUtils]: 0: Hoare triple {5844#true} call ULTIMATE.init(); {5844#true} is VALID [2018-11-23 13:11:20,923 INFO L273 TraceCheckUtils]: 1: Hoare triple {5844#true} ~__return_main~0 := 0;~__return_375~0 := 0; {5844#true} is VALID [2018-11-23 13:11:20,924 INFO L273 TraceCheckUtils]: 2: Hoare triple {5844#true} assume true; {5844#true} is VALID [2018-11-23 13:11:20,924 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5844#true} {5844#true} #215#return; {5844#true} is VALID [2018-11-23 13:11:20,924 INFO L256 TraceCheckUtils]: 4: Hoare triple {5844#true} call #t~ret8 := main(); {5844#true} is VALID [2018-11-23 13:11:20,924 INFO L273 TraceCheckUtils]: 5: Hoare triple {5844#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {5844#true} is VALID [2018-11-23 13:11:20,924 INFO L273 TraceCheckUtils]: 6: Hoare triple {5844#true} assume !!(~main__urilen~0 <= 1000000); {5844#true} is VALID [2018-11-23 13:11:20,925 INFO L273 TraceCheckUtils]: 7: Hoare triple {5844#true} assume !!(~main__urilen~0 >= -1000000); {5844#true} is VALID [2018-11-23 13:11:20,925 INFO L273 TraceCheckUtils]: 8: Hoare triple {5844#true} assume !!(~main__tokenlen~0 <= 1000000); {5844#true} is VALID [2018-11-23 13:11:20,925 INFO L273 TraceCheckUtils]: 9: Hoare triple {5844#true} assume !!(~main__tokenlen~0 >= -1000000); {5844#true} is VALID [2018-11-23 13:11:20,925 INFO L273 TraceCheckUtils]: 10: Hoare triple {5844#true} assume !!(~main__scheme~0 <= 1000000); {5844#true} is VALID [2018-11-23 13:11:20,926 INFO L273 TraceCheckUtils]: 11: Hoare triple {5844#true} assume !!(~main__scheme~0 >= -1000000); {5844#true} is VALID [2018-11-23 13:11:20,926 INFO L273 TraceCheckUtils]: 12: Hoare triple {5844#true} assume ~main__urilen~0 > 0; {5844#true} is VALID [2018-11-23 13:11:20,926 INFO L273 TraceCheckUtils]: 13: Hoare triple {5844#true} assume ~main__tokenlen~0 > 0; {5844#true} is VALID [2018-11-23 13:11:20,926 INFO L273 TraceCheckUtils]: 14: Hoare triple {5844#true} assume ~main__scheme~0 >= 0; {5844#true} is VALID [2018-11-23 13:11:20,926 INFO L273 TraceCheckUtils]: 15: Hoare triple {5844#true} assume !(0 == ~main__scheme~0); {5844#true} is VALID [2018-11-23 13:11:20,927 INFO L273 TraceCheckUtils]: 16: Hoare triple {5844#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5844#true} is VALID [2018-11-23 13:11:20,927 INFO L273 TraceCheckUtils]: 17: Hoare triple {5844#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5844#true} is VALID [2018-11-23 13:11:20,927 INFO L273 TraceCheckUtils]: 18: Hoare triple {5844#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {5844#true} is VALID [2018-11-23 13:11:20,927 INFO L273 TraceCheckUtils]: 19: Hoare triple {5844#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5844#true} is VALID [2018-11-23 13:11:20,927 INFO L273 TraceCheckUtils]: 20: Hoare triple {5844#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5844#true} is VALID [2018-11-23 13:11:20,927 INFO L273 TraceCheckUtils]: 21: Hoare triple {5844#true} assume !(0 == ~__VERIFIER_assert__cond~3); {5844#true} is VALID [2018-11-23 13:11:20,928 INFO L273 TraceCheckUtils]: 22: Hoare triple {5844#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {5844#true} is VALID [2018-11-23 13:11:20,928 INFO L273 TraceCheckUtils]: 23: Hoare triple {5844#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {5844#true} is VALID [2018-11-23 13:11:20,928 INFO L273 TraceCheckUtils]: 24: Hoare triple {5844#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {5844#true} is VALID [2018-11-23 13:11:20,928 INFO L273 TraceCheckUtils]: 25: Hoare triple {5844#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {5844#true} is VALID [2018-11-23 13:11:20,928 INFO L273 TraceCheckUtils]: 26: Hoare triple {5844#true} assume !(0 == ~__VERIFIER_assert__cond~5); {5844#true} is VALID [2018-11-23 13:11:20,928 INFO L273 TraceCheckUtils]: 27: Hoare triple {5844#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {5844#true} is VALID [2018-11-23 13:11:20,928 INFO L273 TraceCheckUtils]: 28: Hoare triple {5844#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {5844#true} is VALID [2018-11-23 13:11:20,929 INFO L273 TraceCheckUtils]: 29: Hoare triple {5844#true} assume !(0 == ~__VERIFIER_assert__cond~7); {5844#true} is VALID [2018-11-23 13:11:20,929 INFO L273 TraceCheckUtils]: 30: Hoare triple {5844#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet6;havoc #t~nondet6; {5844#true} is VALID [2018-11-23 13:11:20,929 INFO L273 TraceCheckUtils]: 31: Hoare triple {5844#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {5846#(or (and (<= main_~main__urilen~0 main_~main__cp~0) (= main_~__VERIFIER_assert__cond~8 0)) (and (< main_~main__cp~0 main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~8 1)))} is VALID [2018-11-23 13:11:20,930 INFO L273 TraceCheckUtils]: 32: Hoare triple {5846#(or (and (<= main_~main__urilen~0 main_~main__cp~0) (= main_~__VERIFIER_assert__cond~8 0)) (and (< main_~main__cp~0 main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~8 1)))} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {5847#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-23 13:11:20,930 INFO L273 TraceCheckUtils]: 33: Hoare triple {5847#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~9); {5847#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-23 13:11:20,931 INFO L273 TraceCheckUtils]: 34: Hoare triple {5847#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {5847#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-23 13:11:20,931 INFO L273 TraceCheckUtils]: 35: Hoare triple {5847#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {5848#(not (= 0 main_~__VERIFIER_assert__cond~10))} is VALID [2018-11-23 13:11:20,931 INFO L273 TraceCheckUtils]: 36: Hoare triple {5848#(not (= 0 main_~__VERIFIER_assert__cond~10))} assume 0 == ~__VERIFIER_assert__cond~10; {5845#false} is VALID [2018-11-23 13:11:20,932 INFO L273 TraceCheckUtils]: 37: Hoare triple {5845#false} assume !false; {5845#false} is VALID [2018-11-23 13:11:20,933 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:11:20,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:20,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:11:20,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-23 13:11:20,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:20,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:11:20,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:20,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:11:20,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:11:20,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:11:20,967 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2018-11-23 13:11:21,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:21,517 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-11-23 13:11:21,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:11:21,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-23 13:11:21,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:21,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:11:21,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2018-11-23 13:11:21,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:11:21,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2018-11-23 13:11:21,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 95 transitions. [2018-11-23 13:11:22,726 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:22,728 INFO L225 Difference]: With dead ends: 91 [2018-11-23 13:11:22,728 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 13:11:22,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:11:22,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 13:11:22,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2018-11-23 13:11:22,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:22,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 61 states. [2018-11-23 13:11:22,818 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 61 states. [2018-11-23 13:11:22,819 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 61 states. [2018-11-23 13:11:22,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:22,821 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-11-23 13:11:22,821 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-23 13:11:22,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:22,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:22,822 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 89 states. [2018-11-23 13:11:22,822 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 89 states. [2018-11-23 13:11:22,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:22,824 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-11-23 13:11:22,824 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-23 13:11:22,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:22,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:22,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:22,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:22,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 13:11:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-11-23 13:11:22,826 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2018-11-23 13:11:22,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:22,826 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-11-23 13:11:22,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:11:22,826 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-11-23 13:11:22,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 13:11:22,827 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:22,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:22,828 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:22,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:22,828 INFO L82 PathProgramCache]: Analyzing trace with hash -860108895, now seen corresponding path program 1 times [2018-11-23 13:11:22,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:22,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:22,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:22,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:22,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:23,178 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-23 13:11:23,348 INFO L256 TraceCheckUtils]: 0: Hoare triple {6206#true} call ULTIMATE.init(); {6206#true} is VALID [2018-11-23 13:11:23,348 INFO L273 TraceCheckUtils]: 1: Hoare triple {6206#true} ~__return_main~0 := 0;~__return_375~0 := 0; {6206#true} is VALID [2018-11-23 13:11:23,348 INFO L273 TraceCheckUtils]: 2: Hoare triple {6206#true} assume true; {6206#true} is VALID [2018-11-23 13:11:23,349 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6206#true} {6206#true} #215#return; {6206#true} is VALID [2018-11-23 13:11:23,349 INFO L256 TraceCheckUtils]: 4: Hoare triple {6206#true} call #t~ret8 := main(); {6206#true} is VALID [2018-11-23 13:11:23,349 INFO L273 TraceCheckUtils]: 5: Hoare triple {6206#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {6206#true} is VALID [2018-11-23 13:11:23,349 INFO L273 TraceCheckUtils]: 6: Hoare triple {6206#true} assume !!(~main__urilen~0 <= 1000000); {6206#true} is VALID [2018-11-23 13:11:23,349 INFO L273 TraceCheckUtils]: 7: Hoare triple {6206#true} assume !!(~main__urilen~0 >= -1000000); {6206#true} is VALID [2018-11-23 13:11:23,350 INFO L273 TraceCheckUtils]: 8: Hoare triple {6206#true} assume !!(~main__tokenlen~0 <= 1000000); {6206#true} is VALID [2018-11-23 13:11:23,350 INFO L273 TraceCheckUtils]: 9: Hoare triple {6206#true} assume !!(~main__tokenlen~0 >= -1000000); {6206#true} is VALID [2018-11-23 13:11:23,350 INFO L273 TraceCheckUtils]: 10: Hoare triple {6206#true} assume !!(~main__scheme~0 <= 1000000); {6206#true} is VALID [2018-11-23 13:11:23,350 INFO L273 TraceCheckUtils]: 11: Hoare triple {6206#true} assume !!(~main__scheme~0 >= -1000000); {6206#true} is VALID [2018-11-23 13:11:23,350 INFO L273 TraceCheckUtils]: 12: Hoare triple {6206#true} assume ~main__urilen~0 > 0; {6206#true} is VALID [2018-11-23 13:11:23,351 INFO L273 TraceCheckUtils]: 13: Hoare triple {6206#true} assume ~main__tokenlen~0 > 0; {6206#true} is VALID [2018-11-23 13:11:23,351 INFO L273 TraceCheckUtils]: 14: Hoare triple {6206#true} assume ~main__scheme~0 >= 0; {6206#true} is VALID [2018-11-23 13:11:23,351 INFO L273 TraceCheckUtils]: 15: Hoare triple {6206#true} assume !(0 == ~main__scheme~0); {6206#true} is VALID [2018-11-23 13:11:23,351 INFO L273 TraceCheckUtils]: 16: Hoare triple {6206#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6206#true} is VALID [2018-11-23 13:11:23,351 INFO L273 TraceCheckUtils]: 17: Hoare triple {6206#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6206#true} is VALID [2018-11-23 13:11:23,352 INFO L273 TraceCheckUtils]: 18: Hoare triple {6206#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {6206#true} is VALID [2018-11-23 13:11:23,352 INFO L273 TraceCheckUtils]: 19: Hoare triple {6206#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6206#true} is VALID [2018-11-23 13:11:23,352 INFO L273 TraceCheckUtils]: 20: Hoare triple {6206#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6206#true} is VALID [2018-11-23 13:11:23,352 INFO L273 TraceCheckUtils]: 21: Hoare triple {6206#true} assume !(0 == ~__VERIFIER_assert__cond~3); {6206#true} is VALID [2018-11-23 13:11:23,352 INFO L273 TraceCheckUtils]: 22: Hoare triple {6206#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {6206#true} is VALID [2018-11-23 13:11:23,352 INFO L273 TraceCheckUtils]: 23: Hoare triple {6206#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {6206#true} is VALID [2018-11-23 13:11:23,353 INFO L273 TraceCheckUtils]: 24: Hoare triple {6206#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {6206#true} is VALID [2018-11-23 13:11:23,353 INFO L273 TraceCheckUtils]: 25: Hoare triple {6206#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {6206#true} is VALID [2018-11-23 13:11:23,353 INFO L273 TraceCheckUtils]: 26: Hoare triple {6206#true} assume !(0 == ~__VERIFIER_assert__cond~5); {6206#true} is VALID [2018-11-23 13:11:23,353 INFO L273 TraceCheckUtils]: 27: Hoare triple {6206#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {6206#true} is VALID [2018-11-23 13:11:23,353 INFO L273 TraceCheckUtils]: 28: Hoare triple {6206#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {6206#true} is VALID [2018-11-23 13:11:23,353 INFO L273 TraceCheckUtils]: 29: Hoare triple {6206#true} assume !(0 == ~__VERIFIER_assert__cond~7); {6206#true} is VALID [2018-11-23 13:11:23,353 INFO L273 TraceCheckUtils]: 30: Hoare triple {6206#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet6;havoc #t~nondet6; {6206#true} is VALID [2018-11-23 13:11:23,354 INFO L273 TraceCheckUtils]: 31: Hoare triple {6206#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {6206#true} is VALID [2018-11-23 13:11:23,354 INFO L273 TraceCheckUtils]: 32: Hoare triple {6206#true} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {6208#(or (and (< main_~main__cp~0 0) (= main_~__VERIFIER_assert__cond~9 0)) (and (<= 0 main_~main__cp~0) (= main_~__VERIFIER_assert__cond~9 1)))} is VALID [2018-11-23 13:11:23,357 INFO L273 TraceCheckUtils]: 33: Hoare triple {6208#(or (and (< main_~main__cp~0 0) (= main_~__VERIFIER_assert__cond~9 0)) (and (<= 0 main_~main__cp~0) (= main_~__VERIFIER_assert__cond~9 1)))} assume !(0 == ~__VERIFIER_assert__cond~9); {6209#(<= 0 main_~main__cp~0)} is VALID [2018-11-23 13:11:23,357 INFO L273 TraceCheckUtils]: 34: Hoare triple {6209#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {6209#(<= 0 main_~main__cp~0)} is VALID [2018-11-23 13:11:23,357 INFO L273 TraceCheckUtils]: 35: Hoare triple {6209#(<= 0 main_~main__cp~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {6209#(<= 0 main_~main__cp~0)} is VALID [2018-11-23 13:11:23,358 INFO L273 TraceCheckUtils]: 36: Hoare triple {6209#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {6210#(not (= 0 main_~__VERIFIER_assert__cond~11))} is VALID [2018-11-23 13:11:23,358 INFO L273 TraceCheckUtils]: 37: Hoare triple {6210#(not (= 0 main_~__VERIFIER_assert__cond~11))} assume 0 == ~__VERIFIER_assert__cond~11; {6207#false} is VALID [2018-11-23 13:11:23,358 INFO L273 TraceCheckUtils]: 38: Hoare triple {6207#false} assume !false; {6207#false} is VALID [2018-11-23 13:11:23,359 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:11:23,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:23,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:11:23,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-23 13:11:23,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:23,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:11:23,390 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:23,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:11:23,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:11:23,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:11:23,391 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 5 states. [2018-11-23 13:11:23,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:23,799 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-11-23 13:11:23,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:11:23,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-23 13:11:23,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:23,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:11:23,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2018-11-23 13:11:23,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:11:23,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2018-11-23 13:11:23,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2018-11-23 13:11:23,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:23,859 INFO L225 Difference]: With dead ends: 61 [2018-11-23 13:11:23,859 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 13:11:23,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:11:23,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 13:11:24,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-23 13:11:24,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:24,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2018-11-23 13:11:24,080 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-23 13:11:24,080 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-23 13:11:24,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:24,082 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-11-23 13:11:24,082 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-23 13:11:24,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:24,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:24,083 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-23 13:11:24,083 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-23 13:11:24,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:24,084 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-11-23 13:11:24,084 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-23 13:11:24,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:24,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:24,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:24,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 13:11:24,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-11-23 13:11:24,086 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2018-11-23 13:11:24,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:24,086 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-11-23 13:11:24,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:11:24,087 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-23 13:11:24,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 13:11:24,087 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:24,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:24,088 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:24,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:24,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1930828060, now seen corresponding path program 1 times [2018-11-23 13:11:24,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:24,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:24,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:24,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:24,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:24,781 INFO L256 TraceCheckUtils]: 0: Hoare triple {6473#true} call ULTIMATE.init(); {6473#true} is VALID [2018-11-23 13:11:24,781 INFO L273 TraceCheckUtils]: 1: Hoare triple {6473#true} ~__return_main~0 := 0;~__return_375~0 := 0; {6473#true} is VALID [2018-11-23 13:11:24,781 INFO L273 TraceCheckUtils]: 2: Hoare triple {6473#true} assume true; {6473#true} is VALID [2018-11-23 13:11:24,782 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6473#true} {6473#true} #215#return; {6473#true} is VALID [2018-11-23 13:11:24,782 INFO L256 TraceCheckUtils]: 4: Hoare triple {6473#true} call #t~ret8 := main(); {6473#true} is VALID [2018-11-23 13:11:24,782 INFO L273 TraceCheckUtils]: 5: Hoare triple {6473#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {6473#true} is VALID [2018-11-23 13:11:24,782 INFO L273 TraceCheckUtils]: 6: Hoare triple {6473#true} assume !!(~main__urilen~0 <= 1000000); {6473#true} is VALID [2018-11-23 13:11:24,782 INFO L273 TraceCheckUtils]: 7: Hoare triple {6473#true} assume !!(~main__urilen~0 >= -1000000); {6473#true} is VALID [2018-11-23 13:11:24,783 INFO L273 TraceCheckUtils]: 8: Hoare triple {6473#true} assume !!(~main__tokenlen~0 <= 1000000); {6473#true} is VALID [2018-11-23 13:11:24,783 INFO L273 TraceCheckUtils]: 9: Hoare triple {6473#true} assume !!(~main__tokenlen~0 >= -1000000); {6473#true} is VALID [2018-11-23 13:11:24,783 INFO L273 TraceCheckUtils]: 10: Hoare triple {6473#true} assume !!(~main__scheme~0 <= 1000000); {6473#true} is VALID [2018-11-23 13:11:24,783 INFO L273 TraceCheckUtils]: 11: Hoare triple {6473#true} assume !!(~main__scheme~0 >= -1000000); {6473#true} is VALID [2018-11-23 13:11:24,783 INFO L273 TraceCheckUtils]: 12: Hoare triple {6473#true} assume ~main__urilen~0 > 0; {6473#true} is VALID [2018-11-23 13:11:24,783 INFO L273 TraceCheckUtils]: 13: Hoare triple {6473#true} assume ~main__tokenlen~0 > 0; {6473#true} is VALID [2018-11-23 13:11:24,784 INFO L273 TraceCheckUtils]: 14: Hoare triple {6473#true} assume ~main__scheme~0 >= 0; {6473#true} is VALID [2018-11-23 13:11:24,784 INFO L273 TraceCheckUtils]: 15: Hoare triple {6473#true} assume !(0 == ~main__scheme~0); {6473#true} is VALID [2018-11-23 13:11:24,793 INFO L273 TraceCheckUtils]: 16: Hoare triple {6473#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6475#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2018-11-23 13:11:24,793 INFO L273 TraceCheckUtils]: 17: Hoare triple {6475#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6473#true} is VALID [2018-11-23 13:11:24,793 INFO L273 TraceCheckUtils]: 18: Hoare triple {6473#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {6473#true} is VALID [2018-11-23 13:11:24,793 INFO L273 TraceCheckUtils]: 19: Hoare triple {6473#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6473#true} is VALID [2018-11-23 13:11:24,794 INFO L273 TraceCheckUtils]: 20: Hoare triple {6473#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6473#true} is VALID [2018-11-23 13:11:24,794 INFO L273 TraceCheckUtils]: 21: Hoare triple {6473#true} assume !(0 == ~__VERIFIER_assert__cond~3); {6473#true} is VALID [2018-11-23 13:11:24,794 INFO L273 TraceCheckUtils]: 22: Hoare triple {6473#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {6473#true} is VALID [2018-11-23 13:11:24,794 INFO L273 TraceCheckUtils]: 23: Hoare triple {6473#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {6473#true} is VALID [2018-11-23 13:11:24,794 INFO L273 TraceCheckUtils]: 24: Hoare triple {6473#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {6473#true} is VALID [2018-11-23 13:11:24,795 INFO L273 TraceCheckUtils]: 25: Hoare triple {6473#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {6473#true} is VALID [2018-11-23 13:11:24,795 INFO L273 TraceCheckUtils]: 26: Hoare triple {6473#true} assume !(0 == ~__VERIFIER_assert__cond~5); {6473#true} is VALID [2018-11-23 13:11:24,795 INFO L273 TraceCheckUtils]: 27: Hoare triple {6473#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {6473#true} is VALID [2018-11-23 13:11:24,795 INFO L273 TraceCheckUtils]: 28: Hoare triple {6473#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {6473#true} is VALID [2018-11-23 13:11:24,795 INFO L273 TraceCheckUtils]: 29: Hoare triple {6473#true} assume !(0 == ~__VERIFIER_assert__cond~7); {6473#true} is VALID [2018-11-23 13:11:24,795 INFO L273 TraceCheckUtils]: 30: Hoare triple {6473#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet6;havoc #t~nondet6; {6473#true} is VALID [2018-11-23 13:11:24,796 INFO L273 TraceCheckUtils]: 31: Hoare triple {6473#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {6473#true} is VALID [2018-11-23 13:11:24,796 INFO L273 TraceCheckUtils]: 32: Hoare triple {6473#true} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {6473#true} is VALID [2018-11-23 13:11:24,796 INFO L273 TraceCheckUtils]: 33: Hoare triple {6473#true} assume !(0 == ~__VERIFIER_assert__cond~9); {6473#true} is VALID [2018-11-23 13:11:24,796 INFO L273 TraceCheckUtils]: 34: Hoare triple {6473#true} assume ~main__cp~0 != ~main__urilen~0 - 1; {6473#true} is VALID [2018-11-23 13:11:24,810 INFO L273 TraceCheckUtils]: 35: Hoare triple {6473#true} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {6476#(<= (+ main_~main__c~0 2) main_~main__tokenlen~0)} is VALID [2018-11-23 13:11:24,819 INFO L273 TraceCheckUtils]: 36: Hoare triple {6476#(<= (+ main_~main__c~0 2) main_~main__tokenlen~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {6476#(<= (+ main_~main__c~0 2) main_~main__tokenlen~0)} is VALID [2018-11-23 13:11:24,824 INFO L273 TraceCheckUtils]: 37: Hoare triple {6476#(<= (+ main_~main__c~0 2) main_~main__tokenlen~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet7;havoc #t~nondet7; {6476#(<= (+ main_~main__c~0 2) main_~main__tokenlen~0)} is VALID [2018-11-23 13:11:24,825 INFO L273 TraceCheckUtils]: 38: Hoare triple {6476#(<= (+ main_~main__c~0 2) main_~main__tokenlen~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {6477#(not (= 0 main_~__VERIFIER_assert__cond~12))} is VALID [2018-11-23 13:11:24,825 INFO L273 TraceCheckUtils]: 39: Hoare triple {6477#(not (= 0 main_~__VERIFIER_assert__cond~12))} assume 0 == ~__VERIFIER_assert__cond~12; {6474#false} is VALID [2018-11-23 13:11:24,826 INFO L273 TraceCheckUtils]: 40: Hoare triple {6474#false} assume !false; {6474#false} is VALID [2018-11-23 13:11:24,826 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:11:24,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:24,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:11:24,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-11-23 13:11:24,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:24,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:11:24,861 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:24,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:11:24,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:11:24,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:11:24,862 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 5 states. [2018-11-23 13:11:25,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:25,245 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-11-23 13:11:25,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:11:25,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-11-23 13:11:25,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:25,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:11:25,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2018-11-23 13:11:25,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:11:25,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2018-11-23 13:11:25,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2018-11-23 13:11:25,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:25,348 INFO L225 Difference]: With dead ends: 70 [2018-11-23 13:11:25,348 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 13:11:25,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:11:25,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 13:11:25,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-11-23 13:11:25,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:25,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 57 states. [2018-11-23 13:11:25,507 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 57 states. [2018-11-23 13:11:25,507 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 57 states. [2018-11-23 13:11:25,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:25,509 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-11-23 13:11:25,509 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-23 13:11:25,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:25,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:25,509 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 68 states. [2018-11-23 13:11:25,510 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 68 states. [2018-11-23 13:11:25,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:25,511 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-11-23 13:11:25,511 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-23 13:11:25,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:25,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:25,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:25,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:25,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 13:11:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-11-23 13:11:25,514 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 41 [2018-11-23 13:11:25,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:25,514 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-11-23 13:11:25,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:11:25,514 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-11-23 13:11:25,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 13:11:25,515 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:25,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:25,515 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:25,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:25,516 INFO L82 PathProgramCache]: Analyzing trace with hash 273875486, now seen corresponding path program 1 times [2018-11-23 13:11:25,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:25,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:25,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:25,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:25,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:26,099 INFO L256 TraceCheckUtils]: 0: Hoare triple {6774#true} call ULTIMATE.init(); {6774#true} is VALID [2018-11-23 13:11:26,100 INFO L273 TraceCheckUtils]: 1: Hoare triple {6774#true} ~__return_main~0 := 0;~__return_375~0 := 0; {6774#true} is VALID [2018-11-23 13:11:26,100 INFO L273 TraceCheckUtils]: 2: Hoare triple {6774#true} assume true; {6774#true} is VALID [2018-11-23 13:11:26,100 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6774#true} {6774#true} #215#return; {6774#true} is VALID [2018-11-23 13:11:26,101 INFO L256 TraceCheckUtils]: 4: Hoare triple {6774#true} call #t~ret8 := main(); {6774#true} is VALID [2018-11-23 13:11:26,101 INFO L273 TraceCheckUtils]: 5: Hoare triple {6774#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {6774#true} is VALID [2018-11-23 13:11:26,101 INFO L273 TraceCheckUtils]: 6: Hoare triple {6774#true} assume !!(~main__urilen~0 <= 1000000); {6774#true} is VALID [2018-11-23 13:11:26,101 INFO L273 TraceCheckUtils]: 7: Hoare triple {6774#true} assume !!(~main__urilen~0 >= -1000000); {6774#true} is VALID [2018-11-23 13:11:26,102 INFO L273 TraceCheckUtils]: 8: Hoare triple {6774#true} assume !!(~main__tokenlen~0 <= 1000000); {6774#true} is VALID [2018-11-23 13:11:26,102 INFO L273 TraceCheckUtils]: 9: Hoare triple {6774#true} assume !!(~main__tokenlen~0 >= -1000000); {6774#true} is VALID [2018-11-23 13:11:26,102 INFO L273 TraceCheckUtils]: 10: Hoare triple {6774#true} assume !!(~main__scheme~0 <= 1000000); {6774#true} is VALID [2018-11-23 13:11:26,102 INFO L273 TraceCheckUtils]: 11: Hoare triple {6774#true} assume !!(~main__scheme~0 >= -1000000); {6774#true} is VALID [2018-11-23 13:11:26,103 INFO L273 TraceCheckUtils]: 12: Hoare triple {6774#true} assume ~main__urilen~0 > 0; {6774#true} is VALID [2018-11-23 13:11:26,103 INFO L273 TraceCheckUtils]: 13: Hoare triple {6774#true} assume ~main__tokenlen~0 > 0; {6774#true} is VALID [2018-11-23 13:11:26,103 INFO L273 TraceCheckUtils]: 14: Hoare triple {6774#true} assume ~main__scheme~0 >= 0; {6774#true} is VALID [2018-11-23 13:11:26,103 INFO L273 TraceCheckUtils]: 15: Hoare triple {6774#true} assume !(0 == ~main__scheme~0); {6774#true} is VALID [2018-11-23 13:11:26,104 INFO L273 TraceCheckUtils]: 16: Hoare triple {6774#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6776#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2018-11-23 13:11:26,104 INFO L273 TraceCheckUtils]: 17: Hoare triple {6776#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6774#true} is VALID [2018-11-23 13:11:26,104 INFO L273 TraceCheckUtils]: 18: Hoare triple {6774#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {6774#true} is VALID [2018-11-23 13:11:26,104 INFO L273 TraceCheckUtils]: 19: Hoare triple {6774#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6774#true} is VALID [2018-11-23 13:11:26,105 INFO L273 TraceCheckUtils]: 20: Hoare triple {6774#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6774#true} is VALID [2018-11-23 13:11:26,105 INFO L273 TraceCheckUtils]: 21: Hoare triple {6774#true} assume !(0 == ~__VERIFIER_assert__cond~3); {6774#true} is VALID [2018-11-23 13:11:26,105 INFO L273 TraceCheckUtils]: 22: Hoare triple {6774#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {6774#true} is VALID [2018-11-23 13:11:26,105 INFO L273 TraceCheckUtils]: 23: Hoare triple {6774#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {6774#true} is VALID [2018-11-23 13:11:26,105 INFO L273 TraceCheckUtils]: 24: Hoare triple {6774#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {6774#true} is VALID [2018-11-23 13:11:26,105 INFO L273 TraceCheckUtils]: 25: Hoare triple {6774#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {6774#true} is VALID [2018-11-23 13:11:26,106 INFO L273 TraceCheckUtils]: 26: Hoare triple {6774#true} assume !(0 == ~__VERIFIER_assert__cond~5); {6774#true} is VALID [2018-11-23 13:11:26,106 INFO L273 TraceCheckUtils]: 27: Hoare triple {6774#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {6774#true} is VALID [2018-11-23 13:11:26,106 INFO L273 TraceCheckUtils]: 28: Hoare triple {6774#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {6774#true} is VALID [2018-11-23 13:11:26,106 INFO L273 TraceCheckUtils]: 29: Hoare triple {6774#true} assume !(0 == ~__VERIFIER_assert__cond~7); {6774#true} is VALID [2018-11-23 13:11:26,106 INFO L273 TraceCheckUtils]: 30: Hoare triple {6774#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet6;havoc #t~nondet6; {6774#true} is VALID [2018-11-23 13:11:26,107 INFO L273 TraceCheckUtils]: 31: Hoare triple {6774#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {6777#(= main_~main__c~0 0)} is VALID [2018-11-23 13:11:26,107 INFO L273 TraceCheckUtils]: 32: Hoare triple {6777#(= main_~main__c~0 0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {6777#(= main_~main__c~0 0)} is VALID [2018-11-23 13:11:26,107 INFO L273 TraceCheckUtils]: 33: Hoare triple {6777#(= main_~main__c~0 0)} assume !(0 == ~__VERIFIER_assert__cond~9); {6777#(= main_~main__c~0 0)} is VALID [2018-11-23 13:11:26,108 INFO L273 TraceCheckUtils]: 34: Hoare triple {6777#(= main_~main__c~0 0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {6777#(= main_~main__c~0 0)} is VALID [2018-11-23 13:11:26,108 INFO L273 TraceCheckUtils]: 35: Hoare triple {6777#(= main_~main__c~0 0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {6777#(= main_~main__c~0 0)} is VALID [2018-11-23 13:11:26,109 INFO L273 TraceCheckUtils]: 36: Hoare triple {6777#(= main_~main__c~0 0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {6777#(= main_~main__c~0 0)} is VALID [2018-11-23 13:11:26,109 INFO L273 TraceCheckUtils]: 37: Hoare triple {6777#(= main_~main__c~0 0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet7;havoc #t~nondet7; {6777#(= main_~main__c~0 0)} is VALID [2018-11-23 13:11:26,109 INFO L273 TraceCheckUtils]: 38: Hoare triple {6777#(= main_~main__c~0 0)} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {6778#(<= 1 main_~main__c~0)} is VALID [2018-11-23 13:11:26,110 INFO L273 TraceCheckUtils]: 39: Hoare triple {6778#(<= 1 main_~main__c~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__c~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {6779#(not (= 0 main_~__VERIFIER_assert__cond~13))} is VALID [2018-11-23 13:11:26,111 INFO L273 TraceCheckUtils]: 40: Hoare triple {6779#(not (= 0 main_~__VERIFIER_assert__cond~13))} assume 0 == ~__VERIFIER_assert__cond~13; {6775#false} is VALID [2018-11-23 13:11:26,111 INFO L273 TraceCheckUtils]: 41: Hoare triple {6775#false} assume !false; {6775#false} is VALID [2018-11-23 13:11:26,114 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:11:26,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:26,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:11:26,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-11-23 13:11:26,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:26,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:11:26,155 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:26,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:11:26,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:11:26,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:11:26,156 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 6 states. [2018-11-23 13:11:26,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:26,575 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-11-23 13:11:26,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:11:26,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-11-23 13:11:26,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:26,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:11:26,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2018-11-23 13:11:26,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:11:26,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2018-11-23 13:11:26,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 66 transitions. [2018-11-23 13:11:26,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:26,643 INFO L225 Difference]: With dead ends: 66 [2018-11-23 13:11:26,644 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 13:11:26,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:11:26,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 13:11:26,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2018-11-23 13:11:26,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:26,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 55 states. [2018-11-23 13:11:26,712 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 55 states. [2018-11-23 13:11:26,712 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 55 states. [2018-11-23 13:11:26,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:26,714 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-11-23 13:11:26,714 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-11-23 13:11:26,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:26,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:26,714 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 64 states. [2018-11-23 13:11:26,714 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 64 states. [2018-11-23 13:11:26,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:26,715 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-11-23 13:11:26,715 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-11-23 13:11:26,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:26,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:26,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:26,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:26,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 13:11:26,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-11-23 13:11:26,717 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2018-11-23 13:11:26,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:26,717 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-11-23 13:11:26,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:11:26,717 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-23 13:11:26,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 13:11:26,718 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:26,718 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:26,719 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:26,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:26,719 INFO L82 PathProgramCache]: Analyzing trace with hash -99791318, now seen corresponding path program 1 times [2018-11-23 13:11:26,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:26,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:26,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:26,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:26,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:26,799 INFO L256 TraceCheckUtils]: 0: Hoare triple {7057#true} call ULTIMATE.init(); {7057#true} is VALID [2018-11-23 13:11:26,799 INFO L273 TraceCheckUtils]: 1: Hoare triple {7057#true} ~__return_main~0 := 0;~__return_375~0 := 0; {7057#true} is VALID [2018-11-23 13:11:26,799 INFO L273 TraceCheckUtils]: 2: Hoare triple {7057#true} assume true; {7057#true} is VALID [2018-11-23 13:11:26,800 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7057#true} {7057#true} #215#return; {7057#true} is VALID [2018-11-23 13:11:26,800 INFO L256 TraceCheckUtils]: 4: Hoare triple {7057#true} call #t~ret8 := main(); {7057#true} is VALID [2018-11-23 13:11:26,800 INFO L273 TraceCheckUtils]: 5: Hoare triple {7057#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {7057#true} is VALID [2018-11-23 13:11:26,801 INFO L273 TraceCheckUtils]: 6: Hoare triple {7057#true} assume !!(~main__urilen~0 <= 1000000); {7057#true} is VALID [2018-11-23 13:11:26,801 INFO L273 TraceCheckUtils]: 7: Hoare triple {7057#true} assume !!(~main__urilen~0 >= -1000000); {7057#true} is VALID [2018-11-23 13:11:26,801 INFO L273 TraceCheckUtils]: 8: Hoare triple {7057#true} assume !!(~main__tokenlen~0 <= 1000000); {7057#true} is VALID [2018-11-23 13:11:26,802 INFO L273 TraceCheckUtils]: 9: Hoare triple {7057#true} assume !!(~main__tokenlen~0 >= -1000000); {7057#true} is VALID [2018-11-23 13:11:26,802 INFO L273 TraceCheckUtils]: 10: Hoare triple {7057#true} assume !!(~main__scheme~0 <= 1000000); {7057#true} is VALID [2018-11-23 13:11:26,802 INFO L273 TraceCheckUtils]: 11: Hoare triple {7057#true} assume !!(~main__scheme~0 >= -1000000); {7057#true} is VALID [2018-11-23 13:11:26,802 INFO L273 TraceCheckUtils]: 12: Hoare triple {7057#true} assume ~main__urilen~0 > 0; {7057#true} is VALID [2018-11-23 13:11:26,803 INFO L273 TraceCheckUtils]: 13: Hoare triple {7057#true} assume ~main__tokenlen~0 > 0; {7057#true} is VALID [2018-11-23 13:11:26,803 INFO L273 TraceCheckUtils]: 14: Hoare triple {7057#true} assume ~main__scheme~0 >= 0; {7057#true} is VALID [2018-11-23 13:11:26,803 INFO L273 TraceCheckUtils]: 15: Hoare triple {7057#true} assume !(0 == ~main__scheme~0); {7057#true} is VALID [2018-11-23 13:11:26,803 INFO L273 TraceCheckUtils]: 16: Hoare triple {7057#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7057#true} is VALID [2018-11-23 13:11:26,804 INFO L273 TraceCheckUtils]: 17: Hoare triple {7057#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7057#true} is VALID [2018-11-23 13:11:26,804 INFO L273 TraceCheckUtils]: 18: Hoare triple {7057#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {7057#true} is VALID [2018-11-23 13:11:26,804 INFO L273 TraceCheckUtils]: 19: Hoare triple {7057#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {7057#true} is VALID [2018-11-23 13:11:26,804 INFO L273 TraceCheckUtils]: 20: Hoare triple {7057#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {7057#true} is VALID [2018-11-23 13:11:26,804 INFO L273 TraceCheckUtils]: 21: Hoare triple {7057#true} assume !(0 == ~__VERIFIER_assert__cond~3); {7057#true} is VALID [2018-11-23 13:11:26,805 INFO L273 TraceCheckUtils]: 22: Hoare triple {7057#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {7057#true} is VALID [2018-11-23 13:11:26,805 INFO L273 TraceCheckUtils]: 23: Hoare triple {7057#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {7057#true} is VALID [2018-11-23 13:11:26,805 INFO L273 TraceCheckUtils]: 24: Hoare triple {7057#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7057#true} is VALID [2018-11-23 13:11:26,805 INFO L273 TraceCheckUtils]: 25: Hoare triple {7057#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {7057#true} is VALID [2018-11-23 13:11:26,805 INFO L273 TraceCheckUtils]: 26: Hoare triple {7057#true} assume !(0 == ~__VERIFIER_assert__cond~5); {7057#true} is VALID [2018-11-23 13:11:26,806 INFO L273 TraceCheckUtils]: 27: Hoare triple {7057#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {7057#true} is VALID [2018-11-23 13:11:26,806 INFO L273 TraceCheckUtils]: 28: Hoare triple {7057#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {7057#true} is VALID [2018-11-23 13:11:26,806 INFO L273 TraceCheckUtils]: 29: Hoare triple {7057#true} assume !(0 == ~__VERIFIER_assert__cond~7); {7057#true} is VALID [2018-11-23 13:11:26,806 INFO L273 TraceCheckUtils]: 30: Hoare triple {7057#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet6;havoc #t~nondet6; {7057#true} is VALID [2018-11-23 13:11:26,819 INFO L273 TraceCheckUtils]: 31: Hoare triple {7057#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {7059#(or (and (<= main_~main__urilen~0 main_~main__cp~0) (= main_~__VERIFIER_assert__cond~8 0)) (and (< main_~main__cp~0 main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~8 1)))} is VALID [2018-11-23 13:11:26,821 INFO L273 TraceCheckUtils]: 32: Hoare triple {7059#(or (and (<= main_~main__urilen~0 main_~main__cp~0) (= main_~__VERIFIER_assert__cond~8 0)) (and (< main_~main__cp~0 main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~8 1)))} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {7060#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-23 13:11:26,821 INFO L273 TraceCheckUtils]: 33: Hoare triple {7060#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~9); {7060#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-23 13:11:26,823 INFO L273 TraceCheckUtils]: 34: Hoare triple {7060#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {7060#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-23 13:11:26,823 INFO L273 TraceCheckUtils]: 35: Hoare triple {7060#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {7060#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-23 13:11:26,825 INFO L273 TraceCheckUtils]: 36: Hoare triple {7060#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {7060#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-23 13:11:26,825 INFO L273 TraceCheckUtils]: 37: Hoare triple {7060#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet7;havoc #t~nondet7; {7060#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-23 13:11:26,827 INFO L273 TraceCheckUtils]: 38: Hoare triple {7060#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {7060#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-23 13:11:26,827 INFO L273 TraceCheckUtils]: 39: Hoare triple {7060#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__c~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {7060#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-23 13:11:26,829 INFO L273 TraceCheckUtils]: 40: Hoare triple {7060#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~13);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {7061#(not (= 0 main_~__VERIFIER_assert__cond~14))} is VALID [2018-11-23 13:11:26,829 INFO L273 TraceCheckUtils]: 41: Hoare triple {7061#(not (= 0 main_~__VERIFIER_assert__cond~14))} assume 0 == ~__VERIFIER_assert__cond~14; {7058#false} is VALID [2018-11-23 13:11:26,829 INFO L273 TraceCheckUtils]: 42: Hoare triple {7058#false} assume !false; {7058#false} is VALID [2018-11-23 13:11:26,830 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:11:26,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:26,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:11:26,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-11-23 13:11:26,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:26,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:11:26,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:26,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:11:26,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:11:26,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:11:26,871 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 5 states. [2018-11-23 13:11:27,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:27,366 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-11-23 13:11:27,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:11:27,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-11-23 13:11:27,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:27,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:11:27,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2018-11-23 13:11:27,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:11:27,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2018-11-23 13:11:27,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 93 transitions. [2018-11-23 13:11:27,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:27,467 INFO L225 Difference]: With dead ends: 88 [2018-11-23 13:11:27,467 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 13:11:27,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:11:27,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 13:11:27,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2018-11-23 13:11:27,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:27,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 60 states. [2018-11-23 13:11:27,535 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 60 states. [2018-11-23 13:11:27,535 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 60 states. [2018-11-23 13:11:27,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:27,539 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-11-23 13:11:27,539 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-11-23 13:11:27,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:27,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:27,539 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 86 states. [2018-11-23 13:11:27,540 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 86 states. [2018-11-23 13:11:27,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:27,541 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-11-23 13:11:27,541 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-11-23 13:11:27,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:27,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:27,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:27,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:27,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 13:11:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-11-23 13:11:27,546 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 43 [2018-11-23 13:11:27,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:27,546 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-11-23 13:11:27,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:11:27,546 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-11-23 13:11:27,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 13:11:27,547 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:27,547 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:27,547 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:27,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:27,548 INFO L82 PathProgramCache]: Analyzing trace with hash 2020599801, now seen corresponding path program 1 times [2018-11-23 13:11:27,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:27,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:27,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:27,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:27,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:27,773 INFO L256 TraceCheckUtils]: 0: Hoare triple {7412#true} call ULTIMATE.init(); {7412#true} is VALID [2018-11-23 13:11:27,773 INFO L273 TraceCheckUtils]: 1: Hoare triple {7412#true} ~__return_main~0 := 0;~__return_375~0 := 0; {7412#true} is VALID [2018-11-23 13:11:27,773 INFO L273 TraceCheckUtils]: 2: Hoare triple {7412#true} assume true; {7412#true} is VALID [2018-11-23 13:11:27,773 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7412#true} {7412#true} #215#return; {7412#true} is VALID [2018-11-23 13:11:27,773 INFO L256 TraceCheckUtils]: 4: Hoare triple {7412#true} call #t~ret8 := main(); {7412#true} is VALID [2018-11-23 13:11:27,773 INFO L273 TraceCheckUtils]: 5: Hoare triple {7412#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {7412#true} is VALID [2018-11-23 13:11:27,774 INFO L273 TraceCheckUtils]: 6: Hoare triple {7412#true} assume !!(~main__urilen~0 <= 1000000); {7412#true} is VALID [2018-11-23 13:11:27,774 INFO L273 TraceCheckUtils]: 7: Hoare triple {7412#true} assume !!(~main__urilen~0 >= -1000000); {7412#true} is VALID [2018-11-23 13:11:27,774 INFO L273 TraceCheckUtils]: 8: Hoare triple {7412#true} assume !!(~main__tokenlen~0 <= 1000000); {7412#true} is VALID [2018-11-23 13:11:27,774 INFO L273 TraceCheckUtils]: 9: Hoare triple {7412#true} assume !!(~main__tokenlen~0 >= -1000000); {7412#true} is VALID [2018-11-23 13:11:27,774 INFO L273 TraceCheckUtils]: 10: Hoare triple {7412#true} assume !!(~main__scheme~0 <= 1000000); {7412#true} is VALID [2018-11-23 13:11:27,774 INFO L273 TraceCheckUtils]: 11: Hoare triple {7412#true} assume !!(~main__scheme~0 >= -1000000); {7412#true} is VALID [2018-11-23 13:11:27,774 INFO L273 TraceCheckUtils]: 12: Hoare triple {7412#true} assume ~main__urilen~0 > 0; {7412#true} is VALID [2018-11-23 13:11:27,774 INFO L273 TraceCheckUtils]: 13: Hoare triple {7412#true} assume ~main__tokenlen~0 > 0; {7412#true} is VALID [2018-11-23 13:11:27,775 INFO L273 TraceCheckUtils]: 14: Hoare triple {7412#true} assume ~main__scheme~0 >= 0; {7412#true} is VALID [2018-11-23 13:11:27,775 INFO L273 TraceCheckUtils]: 15: Hoare triple {7412#true} assume !(0 == ~main__scheme~0); {7412#true} is VALID [2018-11-23 13:11:27,793 INFO L273 TraceCheckUtils]: 16: Hoare triple {7412#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7414#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2018-11-23 13:11:27,793 INFO L273 TraceCheckUtils]: 17: Hoare triple {7414#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7412#true} is VALID [2018-11-23 13:11:27,793 INFO L273 TraceCheckUtils]: 18: Hoare triple {7412#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {7412#true} is VALID [2018-11-23 13:11:27,797 INFO L273 TraceCheckUtils]: 19: Hoare triple {7412#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {7415#(or (= 0 main_~__VERIFIER_assert__cond~2) (<= (+ main_~main__cp~0 1) main_~main__urilen~0))} is VALID [2018-11-23 13:11:27,798 INFO L273 TraceCheckUtils]: 20: Hoare triple {7415#(or (= 0 main_~__VERIFIER_assert__cond~2) (<= (+ main_~main__cp~0 1) main_~main__urilen~0))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,798 INFO L273 TraceCheckUtils]: 21: Hoare triple {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,799 INFO L273 TraceCheckUtils]: 22: Hoare triple {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,799 INFO L273 TraceCheckUtils]: 23: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,799 INFO L273 TraceCheckUtils]: 24: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,800 INFO L273 TraceCheckUtils]: 25: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,800 INFO L273 TraceCheckUtils]: 26: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,800 INFO L273 TraceCheckUtils]: 27: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,801 INFO L273 TraceCheckUtils]: 28: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,801 INFO L273 TraceCheckUtils]: 29: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,802 INFO L273 TraceCheckUtils]: 30: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet6;havoc #t~nondet6; {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,803 INFO L273 TraceCheckUtils]: 31: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,803 INFO L273 TraceCheckUtils]: 32: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,804 INFO L273 TraceCheckUtils]: 33: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~9); {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,804 INFO L273 TraceCheckUtils]: 34: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,805 INFO L273 TraceCheckUtils]: 35: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,805 INFO L273 TraceCheckUtils]: 36: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,806 INFO L273 TraceCheckUtils]: 37: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet7;havoc #t~nondet7; {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,806 INFO L273 TraceCheckUtils]: 38: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0); {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,807 INFO L273 TraceCheckUtils]: 39: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} ~main__cp~0 := 1 + ~main__cp~0; {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,808 INFO L273 TraceCheckUtils]: 40: Hoare triple {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,809 INFO L273 TraceCheckUtils]: 41: Hoare triple {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {7418#(not (= 0 main_~__VERIFIER_assert__cond~10))} is VALID [2018-11-23 13:11:27,809 INFO L273 TraceCheckUtils]: 42: Hoare triple {7418#(not (= 0 main_~__VERIFIER_assert__cond~10))} assume 0 == ~__VERIFIER_assert__cond~10; {7413#false} is VALID [2018-11-23 13:11:27,810 INFO L273 TraceCheckUtils]: 43: Hoare triple {7413#false} assume !false; {7413#false} is VALID [2018-11-23 13:11:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:27,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:27,813 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:11:27,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:27,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:27,992 INFO L256 TraceCheckUtils]: 0: Hoare triple {7412#true} call ULTIMATE.init(); {7412#true} is VALID [2018-11-23 13:11:27,992 INFO L273 TraceCheckUtils]: 1: Hoare triple {7412#true} ~__return_main~0 := 0;~__return_375~0 := 0; {7412#true} is VALID [2018-11-23 13:11:27,992 INFO L273 TraceCheckUtils]: 2: Hoare triple {7412#true} assume true; {7412#true} is VALID [2018-11-23 13:11:27,993 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7412#true} {7412#true} #215#return; {7412#true} is VALID [2018-11-23 13:11:27,993 INFO L256 TraceCheckUtils]: 4: Hoare triple {7412#true} call #t~ret8 := main(); {7412#true} is VALID [2018-11-23 13:11:27,993 INFO L273 TraceCheckUtils]: 5: Hoare triple {7412#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {7412#true} is VALID [2018-11-23 13:11:27,993 INFO L273 TraceCheckUtils]: 6: Hoare triple {7412#true} assume !!(~main__urilen~0 <= 1000000); {7412#true} is VALID [2018-11-23 13:11:27,993 INFO L273 TraceCheckUtils]: 7: Hoare triple {7412#true} assume !!(~main__urilen~0 >= -1000000); {7412#true} is VALID [2018-11-23 13:11:27,994 INFO L273 TraceCheckUtils]: 8: Hoare triple {7412#true} assume !!(~main__tokenlen~0 <= 1000000); {7412#true} is VALID [2018-11-23 13:11:27,994 INFO L273 TraceCheckUtils]: 9: Hoare triple {7412#true} assume !!(~main__tokenlen~0 >= -1000000); {7412#true} is VALID [2018-11-23 13:11:27,994 INFO L273 TraceCheckUtils]: 10: Hoare triple {7412#true} assume !!(~main__scheme~0 <= 1000000); {7412#true} is VALID [2018-11-23 13:11:27,994 INFO L273 TraceCheckUtils]: 11: Hoare triple {7412#true} assume !!(~main__scheme~0 >= -1000000); {7412#true} is VALID [2018-11-23 13:11:27,994 INFO L273 TraceCheckUtils]: 12: Hoare triple {7412#true} assume ~main__urilen~0 > 0; {7412#true} is VALID [2018-11-23 13:11:27,994 INFO L273 TraceCheckUtils]: 13: Hoare triple {7412#true} assume ~main__tokenlen~0 > 0; {7412#true} is VALID [2018-11-23 13:11:27,994 INFO L273 TraceCheckUtils]: 14: Hoare triple {7412#true} assume ~main__scheme~0 >= 0; {7412#true} is VALID [2018-11-23 13:11:27,994 INFO L273 TraceCheckUtils]: 15: Hoare triple {7412#true} assume !(0 == ~main__scheme~0); {7412#true} is VALID [2018-11-23 13:11:27,995 INFO L273 TraceCheckUtils]: 16: Hoare triple {7412#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7470#(and (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~0 1))} is VALID [2018-11-23 13:11:27,995 INFO L273 TraceCheckUtils]: 17: Hoare triple {7470#(and (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~0 1))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,996 INFO L273 TraceCheckUtils]: 18: Hoare triple {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,996 INFO L273 TraceCheckUtils]: 19: Hoare triple {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,996 INFO L273 TraceCheckUtils]: 20: Hoare triple {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,997 INFO L273 TraceCheckUtils]: 21: Hoare triple {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,997 INFO L273 TraceCheckUtils]: 22: Hoare triple {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,997 INFO L273 TraceCheckUtils]: 23: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,998 INFO L273 TraceCheckUtils]: 24: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,998 INFO L273 TraceCheckUtils]: 25: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,998 INFO L273 TraceCheckUtils]: 26: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,999 INFO L273 TraceCheckUtils]: 27: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:27,999 INFO L273 TraceCheckUtils]: 28: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:28,000 INFO L273 TraceCheckUtils]: 29: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:28,001 INFO L273 TraceCheckUtils]: 30: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet6;havoc #t~nondet6; {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:28,002 INFO L273 TraceCheckUtils]: 31: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:28,002 INFO L273 TraceCheckUtils]: 32: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:28,003 INFO L273 TraceCheckUtils]: 33: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~9); {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:28,003 INFO L273 TraceCheckUtils]: 34: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:28,004 INFO L273 TraceCheckUtils]: 35: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:28,004 INFO L273 TraceCheckUtils]: 36: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:28,005 INFO L273 TraceCheckUtils]: 37: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet7;havoc #t~nondet7; {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:28,005 INFO L273 TraceCheckUtils]: 38: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0); {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-23 13:11:28,006 INFO L273 TraceCheckUtils]: 39: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} ~main__cp~0 := 1 + ~main__cp~0; {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:28,007 INFO L273 TraceCheckUtils]: 40: Hoare triple {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-23 13:11:28,008 INFO L273 TraceCheckUtils]: 41: Hoare triple {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {7546#(= main_~__VERIFIER_assert__cond~10 1)} is VALID [2018-11-23 13:11:28,008 INFO L273 TraceCheckUtils]: 42: Hoare triple {7546#(= main_~__VERIFIER_assert__cond~10 1)} assume 0 == ~__VERIFIER_assert__cond~10; {7413#false} is VALID [2018-11-23 13:11:28,008 INFO L273 TraceCheckUtils]: 43: Hoare triple {7413#false} assume !false; {7413#false} is VALID [2018-11-23 13:11:28,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:28,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:28,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-11-23 13:11:28,032 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-11-23 13:11:28,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:28,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:11:28,076 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:11:28,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:11:28,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:11:28,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:11:28,077 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 9 states. [2018-11-23 13:11:28,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:28,452 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-11-23 13:11:28,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:11:28,452 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-11-23 13:11:28,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:28,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:11:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2018-11-23 13:11:28,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:11:28,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2018-11-23 13:11:28,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2018-11-23 13:11:28,513 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:28,514 INFO L225 Difference]: With dead ends: 60 [2018-11-23 13:11:28,514 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 13:11:28,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:11:28,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 13:11:28,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-23 13:11:28,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:28,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-23 13:11:28,585 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 13:11:28,585 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 13:11:28,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:28,586 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-11-23 13:11:28,586 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-23 13:11:28,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:28,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:28,587 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 13:11:28,587 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 13:11:28,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:28,588 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-11-23 13:11:28,588 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-23 13:11:28,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:28,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:28,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:28,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:28,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 13:11:28,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-11-23 13:11:28,589 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44 [2018-11-23 13:11:28,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:28,589 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-11-23 13:11:28,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:11:28,590 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-23 13:11:28,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 13:11:28,590 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:28,590 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:28,591 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:28,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:28,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1201439652, now seen corresponding path program 1 times [2018-11-23 13:11:28,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:28,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:28,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:28,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:28,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:28,700 INFO L256 TraceCheckUtils]: 0: Hoare triple {7810#true} call ULTIMATE.init(); {7810#true} is VALID [2018-11-23 13:11:28,700 INFO L273 TraceCheckUtils]: 1: Hoare triple {7810#true} ~__return_main~0 := 0;~__return_375~0 := 0; {7810#true} is VALID [2018-11-23 13:11:28,700 INFO L273 TraceCheckUtils]: 2: Hoare triple {7810#true} assume true; {7810#true} is VALID [2018-11-23 13:11:28,700 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7810#true} {7810#true} #215#return; {7810#true} is VALID [2018-11-23 13:11:28,701 INFO L256 TraceCheckUtils]: 4: Hoare triple {7810#true} call #t~ret8 := main(); {7810#true} is VALID [2018-11-23 13:11:28,701 INFO L273 TraceCheckUtils]: 5: Hoare triple {7810#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {7810#true} is VALID [2018-11-23 13:11:28,701 INFO L273 TraceCheckUtils]: 6: Hoare triple {7810#true} assume !!(~main__urilen~0 <= 1000000); {7810#true} is VALID [2018-11-23 13:11:28,701 INFO L273 TraceCheckUtils]: 7: Hoare triple {7810#true} assume !!(~main__urilen~0 >= -1000000); {7810#true} is VALID [2018-11-23 13:11:28,701 INFO L273 TraceCheckUtils]: 8: Hoare triple {7810#true} assume !!(~main__tokenlen~0 <= 1000000); {7810#true} is VALID [2018-11-23 13:11:28,702 INFO L273 TraceCheckUtils]: 9: Hoare triple {7810#true} assume !!(~main__tokenlen~0 >= -1000000); {7810#true} is VALID [2018-11-23 13:11:28,702 INFO L273 TraceCheckUtils]: 10: Hoare triple {7810#true} assume !!(~main__scheme~0 <= 1000000); {7810#true} is VALID [2018-11-23 13:11:28,702 INFO L273 TraceCheckUtils]: 11: Hoare triple {7810#true} assume !!(~main__scheme~0 >= -1000000); {7810#true} is VALID [2018-11-23 13:11:28,702 INFO L273 TraceCheckUtils]: 12: Hoare triple {7810#true} assume ~main__urilen~0 > 0; {7810#true} is VALID [2018-11-23 13:11:28,702 INFO L273 TraceCheckUtils]: 13: Hoare triple {7810#true} assume ~main__tokenlen~0 > 0; {7810#true} is VALID [2018-11-23 13:11:28,703 INFO L273 TraceCheckUtils]: 14: Hoare triple {7810#true} assume ~main__scheme~0 >= 0; {7810#true} is VALID [2018-11-23 13:11:28,703 INFO L273 TraceCheckUtils]: 15: Hoare triple {7810#true} assume !(0 == ~main__scheme~0); {7810#true} is VALID [2018-11-23 13:11:28,703 INFO L273 TraceCheckUtils]: 16: Hoare triple {7810#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7810#true} is VALID [2018-11-23 13:11:28,703 INFO L273 TraceCheckUtils]: 17: Hoare triple {7810#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7810#true} is VALID [2018-11-23 13:11:28,703 INFO L273 TraceCheckUtils]: 18: Hoare triple {7810#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {7810#true} is VALID [2018-11-23 13:11:28,703 INFO L273 TraceCheckUtils]: 19: Hoare triple {7810#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {7810#true} is VALID [2018-11-23 13:11:28,703 INFO L273 TraceCheckUtils]: 20: Hoare triple {7810#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {7810#true} is VALID [2018-11-23 13:11:28,704 INFO L273 TraceCheckUtils]: 21: Hoare triple {7810#true} assume !(0 == ~__VERIFIER_assert__cond~3); {7810#true} is VALID [2018-11-23 13:11:28,704 INFO L273 TraceCheckUtils]: 22: Hoare triple {7810#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {7810#true} is VALID [2018-11-23 13:11:28,704 INFO L273 TraceCheckUtils]: 23: Hoare triple {7810#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {7810#true} is VALID [2018-11-23 13:11:28,704 INFO L273 TraceCheckUtils]: 24: Hoare triple {7810#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7810#true} is VALID [2018-11-23 13:11:28,704 INFO L273 TraceCheckUtils]: 25: Hoare triple {7810#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {7810#true} is VALID [2018-11-23 13:11:28,704 INFO L273 TraceCheckUtils]: 26: Hoare triple {7810#true} assume !(0 == ~__VERIFIER_assert__cond~5); {7810#true} is VALID [2018-11-23 13:11:28,704 INFO L273 TraceCheckUtils]: 27: Hoare triple {7810#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {7810#true} is VALID [2018-11-23 13:11:28,704 INFO L273 TraceCheckUtils]: 28: Hoare triple {7810#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {7810#true} is VALID [2018-11-23 13:11:28,707 INFO L273 TraceCheckUtils]: 29: Hoare triple {7810#true} assume !(0 == ~__VERIFIER_assert__cond~7); {7810#true} is VALID [2018-11-23 13:11:28,707 INFO L273 TraceCheckUtils]: 30: Hoare triple {7810#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet6;havoc #t~nondet6; {7810#true} is VALID [2018-11-23 13:11:28,707 INFO L273 TraceCheckUtils]: 31: Hoare triple {7810#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {7810#true} is VALID [2018-11-23 13:11:28,723 INFO L273 TraceCheckUtils]: 32: Hoare triple {7810#true} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {7812#(or (and (< main_~main__cp~0 0) (= main_~__VERIFIER_assert__cond~9 0)) (and (<= 0 main_~main__cp~0) (= main_~__VERIFIER_assert__cond~9 1)))} is VALID [2018-11-23 13:11:28,732 INFO L273 TraceCheckUtils]: 33: Hoare triple {7812#(or (and (< main_~main__cp~0 0) (= main_~__VERIFIER_assert__cond~9 0)) (and (<= 0 main_~main__cp~0) (= main_~__VERIFIER_assert__cond~9 1)))} assume !(0 == ~__VERIFIER_assert__cond~9); {7813#(<= 0 main_~main__cp~0)} is VALID [2018-11-23 13:11:28,746 INFO L273 TraceCheckUtils]: 34: Hoare triple {7813#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {7813#(<= 0 main_~main__cp~0)} is VALID [2018-11-23 13:11:28,755 INFO L273 TraceCheckUtils]: 35: Hoare triple {7813#(<= 0 main_~main__cp~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {7813#(<= 0 main_~main__cp~0)} is VALID [2018-11-23 13:11:28,767 INFO L273 TraceCheckUtils]: 36: Hoare triple {7813#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {7813#(<= 0 main_~main__cp~0)} is VALID [2018-11-23 13:11:28,776 INFO L273 TraceCheckUtils]: 37: Hoare triple {7813#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet7;havoc #t~nondet7; {7813#(<= 0 main_~main__cp~0)} is VALID [2018-11-23 13:11:28,776 INFO L273 TraceCheckUtils]: 38: Hoare triple {7813#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {7813#(<= 0 main_~main__cp~0)} is VALID [2018-11-23 13:11:28,778 INFO L273 TraceCheckUtils]: 39: Hoare triple {7813#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__c~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {7813#(<= 0 main_~main__cp~0)} is VALID [2018-11-23 13:11:28,778 INFO L273 TraceCheckUtils]: 40: Hoare triple {7813#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~13);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {7813#(<= 0 main_~main__cp~0)} is VALID [2018-11-23 13:11:28,780 INFO L273 TraceCheckUtils]: 41: Hoare triple {7813#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {7814#(not (= 0 main_~__VERIFIER_assert__cond~15))} is VALID [2018-11-23 13:11:28,780 INFO L273 TraceCheckUtils]: 42: Hoare triple {7814#(not (= 0 main_~__VERIFIER_assert__cond~15))} assume 0 == ~__VERIFIER_assert__cond~15; {7811#false} is VALID [2018-11-23 13:11:28,780 INFO L273 TraceCheckUtils]: 43: Hoare triple {7811#false} assume !false; {7811#false} is VALID [2018-11-23 13:11:28,781 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:11:28,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:28,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:11:28,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-23 13:11:28,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:28,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:11:28,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:28,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:11:28,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:11:28,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:11:28,819 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 5 states. [2018-11-23 13:11:29,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:29,150 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 13:11:29,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:11:29,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-23 13:11:29,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:29,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:11:29,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-23 13:11:29,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:11:29,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-23 13:11:29,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2018-11-23 13:11:29,216 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:29,217 INFO L225 Difference]: With dead ends: 69 [2018-11-23 13:11:29,217 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 13:11:29,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:11:29,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 13:11:29,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2018-11-23 13:11:29,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:29,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 56 states. [2018-11-23 13:11:29,292 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 56 states. [2018-11-23 13:11:29,292 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 56 states. [2018-11-23 13:11:29,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:29,293 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-23 13:11:29,293 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 13:11:29,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:29,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:29,294 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 67 states. [2018-11-23 13:11:29,294 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 67 states. [2018-11-23 13:11:29,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:29,295 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-23 13:11:29,295 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 13:11:29,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:29,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:29,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:29,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:29,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 13:11:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-11-23 13:11:29,297 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2018-11-23 13:11:29,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:29,297 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-11-23 13:11:29,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:11:29,298 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-11-23 13:11:29,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 13:11:29,298 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:29,298 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:29,299 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:29,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:29,299 INFO L82 PathProgramCache]: Analyzing trace with hash 40764835, now seen corresponding path program 1 times [2018-11-23 13:11:29,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:29,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:29,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:29,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:29,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:29,491 INFO L256 TraceCheckUtils]: 0: Hoare triple {8100#true} call ULTIMATE.init(); {8100#true} is VALID [2018-11-23 13:11:29,492 INFO L273 TraceCheckUtils]: 1: Hoare triple {8100#true} ~__return_main~0 := 0;~__return_375~0 := 0; {8100#true} is VALID [2018-11-23 13:11:29,492 INFO L273 TraceCheckUtils]: 2: Hoare triple {8100#true} assume true; {8100#true} is VALID [2018-11-23 13:11:29,492 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8100#true} {8100#true} #215#return; {8100#true} is VALID [2018-11-23 13:11:29,492 INFO L256 TraceCheckUtils]: 4: Hoare triple {8100#true} call #t~ret8 := main(); {8100#true} is VALID [2018-11-23 13:11:29,493 INFO L273 TraceCheckUtils]: 5: Hoare triple {8100#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {8100#true} is VALID [2018-11-23 13:11:29,493 INFO L273 TraceCheckUtils]: 6: Hoare triple {8100#true} assume !!(~main__urilen~0 <= 1000000); {8100#true} is VALID [2018-11-23 13:11:29,493 INFO L273 TraceCheckUtils]: 7: Hoare triple {8100#true} assume !!(~main__urilen~0 >= -1000000); {8100#true} is VALID [2018-11-23 13:11:29,493 INFO L273 TraceCheckUtils]: 8: Hoare triple {8100#true} assume !!(~main__tokenlen~0 <= 1000000); {8100#true} is VALID [2018-11-23 13:11:29,493 INFO L273 TraceCheckUtils]: 9: Hoare triple {8100#true} assume !!(~main__tokenlen~0 >= -1000000); {8100#true} is VALID [2018-11-23 13:11:29,494 INFO L273 TraceCheckUtils]: 10: Hoare triple {8100#true} assume !!(~main__scheme~0 <= 1000000); {8100#true} is VALID [2018-11-23 13:11:29,494 INFO L273 TraceCheckUtils]: 11: Hoare triple {8100#true} assume !!(~main__scheme~0 >= -1000000); {8100#true} is VALID [2018-11-23 13:11:29,494 INFO L273 TraceCheckUtils]: 12: Hoare triple {8100#true} assume ~main__urilen~0 > 0; {8100#true} is VALID [2018-11-23 13:11:29,494 INFO L273 TraceCheckUtils]: 13: Hoare triple {8100#true} assume ~main__tokenlen~0 > 0; {8100#true} is VALID [2018-11-23 13:11:29,494 INFO L273 TraceCheckUtils]: 14: Hoare triple {8100#true} assume ~main__scheme~0 >= 0; {8100#true} is VALID [2018-11-23 13:11:29,495 INFO L273 TraceCheckUtils]: 15: Hoare triple {8100#true} assume !(0 == ~main__scheme~0); {8100#true} is VALID [2018-11-23 13:11:29,495 INFO L273 TraceCheckUtils]: 16: Hoare triple {8100#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8100#true} is VALID [2018-11-23 13:11:29,495 INFO L273 TraceCheckUtils]: 17: Hoare triple {8100#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {8100#true} is VALID [2018-11-23 13:11:29,495 INFO L273 TraceCheckUtils]: 18: Hoare triple {8100#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {8100#true} is VALID [2018-11-23 13:11:29,495 INFO L273 TraceCheckUtils]: 19: Hoare triple {8100#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {8100#true} is VALID [2018-11-23 13:11:29,495 INFO L273 TraceCheckUtils]: 20: Hoare triple {8100#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {8100#true} is VALID [2018-11-23 13:11:29,495 INFO L273 TraceCheckUtils]: 21: Hoare triple {8100#true} assume !(0 == ~__VERIFIER_assert__cond~3); {8100#true} is VALID [2018-11-23 13:11:29,496 INFO L273 TraceCheckUtils]: 22: Hoare triple {8100#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {8100#true} is VALID [2018-11-23 13:11:29,496 INFO L273 TraceCheckUtils]: 23: Hoare triple {8100#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {8100#true} is VALID [2018-11-23 13:11:29,496 INFO L273 TraceCheckUtils]: 24: Hoare triple {8100#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {8100#true} is VALID [2018-11-23 13:11:29,496 INFO L273 TraceCheckUtils]: 25: Hoare triple {8100#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {8100#true} is VALID [2018-11-23 13:11:29,496 INFO L273 TraceCheckUtils]: 26: Hoare triple {8100#true} assume !(0 == ~__VERIFIER_assert__cond~5); {8100#true} is VALID [2018-11-23 13:11:29,496 INFO L273 TraceCheckUtils]: 27: Hoare triple {8100#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {8100#true} is VALID [2018-11-23 13:11:29,496 INFO L273 TraceCheckUtils]: 28: Hoare triple {8100#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {8100#true} is VALID [2018-11-23 13:11:29,496 INFO L273 TraceCheckUtils]: 29: Hoare triple {8100#true} assume !(0 == ~__VERIFIER_assert__cond~7); {8100#true} is VALID [2018-11-23 13:11:29,497 INFO L273 TraceCheckUtils]: 30: Hoare triple {8100#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet6;havoc #t~nondet6; {8100#true} is VALID [2018-11-23 13:11:29,497 INFO L273 TraceCheckUtils]: 31: Hoare triple {8100#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {8100#true} is VALID [2018-11-23 13:11:29,497 INFO L273 TraceCheckUtils]: 32: Hoare triple {8100#true} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {8100#true} is VALID [2018-11-23 13:11:29,497 INFO L273 TraceCheckUtils]: 33: Hoare triple {8100#true} assume !(0 == ~__VERIFIER_assert__cond~9); {8100#true} is VALID [2018-11-23 13:11:29,497 INFO L273 TraceCheckUtils]: 34: Hoare triple {8100#true} assume ~main__cp~0 != ~main__urilen~0 - 1; {8100#true} is VALID [2018-11-23 13:11:29,497 INFO L273 TraceCheckUtils]: 35: Hoare triple {8100#true} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {8100#true} is VALID [2018-11-23 13:11:29,497 INFO L273 TraceCheckUtils]: 36: Hoare triple {8100#true} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {8100#true} is VALID [2018-11-23 13:11:29,497 INFO L273 TraceCheckUtils]: 37: Hoare triple {8100#true} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet7;havoc #t~nondet7; {8100#true} is VALID [2018-11-23 13:11:29,498 INFO L273 TraceCheckUtils]: 38: Hoare triple {8100#true} assume !!(0 == ~main____CPAchecker_TMP_3~0); {8100#true} is VALID [2018-11-23 13:11:29,498 INFO L273 TraceCheckUtils]: 39: Hoare triple {8100#true} ~main__cp~0 := 1 + ~main__cp~0; {8100#true} is VALID [2018-11-23 13:11:29,498 INFO L273 TraceCheckUtils]: 40: Hoare triple {8100#true} assume ~main__cp~0 != ~main__urilen~0 - 1; {8100#true} is VALID [2018-11-23 13:11:29,498 INFO L273 TraceCheckUtils]: 41: Hoare triple {8100#true} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {8102#(or (and (<= main_~main__urilen~0 main_~main__cp~0) (= main_~__VERIFIER_assert__cond~10 0)) (and (< main_~main__cp~0 main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~10 1)))} is VALID [2018-11-23 13:11:29,499 INFO L273 TraceCheckUtils]: 42: Hoare triple {8102#(or (and (<= main_~main__urilen~0 main_~main__cp~0) (= main_~__VERIFIER_assert__cond~10 0)) (and (< main_~main__cp~0 main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~10 1)))} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {8103#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-23 13:11:29,499 INFO L273 TraceCheckUtils]: 43: Hoare triple {8103#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet7;havoc #t~nondet7; {8103#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-23 13:11:29,500 INFO L273 TraceCheckUtils]: 44: Hoare triple {8103#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {8103#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-23 13:11:29,500 INFO L273 TraceCheckUtils]: 45: Hoare triple {8103#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__c~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {8103#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-23 13:11:29,500 INFO L273 TraceCheckUtils]: 46: Hoare triple {8103#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~13);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {8104#(not (= 0 main_~__VERIFIER_assert__cond~14))} is VALID [2018-11-23 13:11:29,501 INFO L273 TraceCheckUtils]: 47: Hoare triple {8104#(not (= 0 main_~__VERIFIER_assert__cond~14))} assume 0 == ~__VERIFIER_assert__cond~14; {8101#false} is VALID [2018-11-23 13:11:29,501 INFO L273 TraceCheckUtils]: 48: Hoare triple {8101#false} assume !false; {8101#false} is VALID [2018-11-23 13:11:29,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:11:29,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:29,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:11:29,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-11-23 13:11:29,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:29,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:11:29,549 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:29,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:11:29,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:11:29,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:11:29,550 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 5 states. [2018-11-23 13:11:30,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:30,299 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-11-23 13:11:30,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:11:30,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-11-23 13:11:30,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:30,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:11:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2018-11-23 13:11:30,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:11:30,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2018-11-23 13:11:30,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 71 transitions. [2018-11-23 13:11:30,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:30,369 INFO L225 Difference]: With dead ends: 75 [2018-11-23 13:11:30,369 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:11:30,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:11:30,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:11:30,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:11:30,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:30,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:11:30,371 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:11:30,371 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:11:30,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:30,371 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:11:30,371 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:11:30,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:30,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:30,372 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:11:30,372 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:11:30,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:30,372 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:11:30,372 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:11:30,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:30,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:30,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:30,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:30,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:11:30,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:11:30,373 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2018-11-23 13:11:30,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:30,373 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:11:30,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:11:30,373 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:11:30,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:30,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:11:30,494 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 107 [2018-11-23 13:11:30,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 13:11:30,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 13:11:30,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 13:11:30,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 13:11:31,625 WARN L180 SmtUtils]: Spent 896.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 69 [2018-11-23 13:11:32,347 WARN L180 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 27 [2018-11-23 13:11:32,692 WARN L180 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2018-11-23 13:11:32,891 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 28 [2018-11-23 13:11:32,902 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:11:32,902 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:11:32,902 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:11:32,902 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:11:32,902 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:11:32,902 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:11:32,902 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:11:32,903 INFO L448 ceAbstractionStarter]: For program point L60(lines 60 412) no Hoare annotation was computed. [2018-11-23 13:11:32,903 INFO L448 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2018-11-23 13:11:32,903 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 8 434) no Hoare annotation was computed. [2018-11-23 13:11:32,903 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-23 13:11:32,903 INFO L448 ceAbstractionStarter]: For program point L118(lines 118 398) no Hoare annotation was computed. [2018-11-23 13:11:32,903 INFO L448 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2018-11-23 13:11:32,903 INFO L448 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2018-11-23 13:11:32,903 INFO L448 ceAbstractionStarter]: For program point L267(line 267) no Hoare annotation was computed. [2018-11-23 13:11:32,903 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 430) no Hoare annotation was computed. [2018-11-23 13:11:32,903 INFO L448 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-11-23 13:11:32,903 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 390) no Hoare annotation was computed. [2018-11-23 13:11:32,903 INFO L448 ceAbstractionStarter]: For program point L78(lines 78 409) no Hoare annotation was computed. [2018-11-23 13:11:32,903 INFO L448 ceAbstractionStarter]: For program point L301(lines 301 311) no Hoare annotation was computed. [2018-11-23 13:11:32,904 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 339) no Hoare annotation was computed. [2018-11-23 13:11:32,904 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-11-23 13:11:32,904 INFO L448 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 209) no Hoare annotation was computed. [2018-11-23 13:11:32,904 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 427) no Hoare annotation was computed. [2018-11-23 13:11:32,904 INFO L444 ceAbstractionStarter]: At program point L310(lines 225 339) the Hoare annotation is: (let ((.cse2 (<= 2 main_~main__cp~0)) (.cse1 (= main_~main__c~0 0)) (.cse3 (= main_~__VERIFIER_assert__cond~9 1)) (.cse4 (and (and (not (= 0 main_~__VERIFIER_assert__cond~7)) (and (= main_~__VERIFIER_assert__cond~3 1) (not (= 0 main_~__VERIFIER_assert__cond~2)) (not (= 0 main_~__VERIFIER_assert__cond~5)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (<= 1 main_~main__scheme~0) (not (= 0 main_~__VERIFIER_assert__cond~6)) (not (= 0 main_~__VERIFIER_assert__cond~1))) (<= 1 main_~main__cp~0) (= main_~__VERIFIER_assert__cond~0 1) (= main_~__VERIFIER_assert__cond~4 1)) (not (= 0 main_~__VERIFIER_assert__cond~8))))) (or (and (let ((.cse0 (let ((.cse5 (not (= 0 main_~__VERIFIER_assert__cond~11)))) (or (and .cse2 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (not (= 0 main_~__VERIFIER_assert__cond~12))))))) (or (and (<= 1 main_~main__c~0) (not (= 0 main_~__VERIFIER_assert__cond~13)) .cse0) (and .cse1 .cse0))) (= main_~__VERIFIER_assert__cond~10 1)) (and .cse2 (<= (+ main_~main__cp~0 2) main_~main__urilen~0) .cse1 .cse3 .cse4 (= main_~__VERIFIER_assert__cond~8 1)))) [2018-11-23 13:11:32,904 INFO L448 ceAbstractionStarter]: For program point L277(lines 277 315) no Hoare annotation was computed. [2018-11-23 13:11:32,904 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 8 434) no Hoare annotation was computed. [2018-11-23 13:11:32,904 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 326) no Hoare annotation was computed. [2018-11-23 13:11:32,904 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 352) no Hoare annotation was computed. [2018-11-23 13:11:32,904 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 431) no Hoare annotation was computed. [2018-11-23 13:11:32,904 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 8 434) the Hoare annotation is: true [2018-11-23 13:11:32,905 INFO L448 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 369) no Hoare annotation was computed. [2018-11-23 13:11:32,905 INFO L448 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 381) no Hoare annotation was computed. [2018-11-23 13:11:32,905 INFO L448 ceAbstractionStarter]: For program point L369(line 369) no Hoare annotation was computed. [2018-11-23 13:11:32,905 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-11-23 13:11:32,905 INFO L448 ceAbstractionStarter]: For program point L303(line 303) no Hoare annotation was computed. [2018-11-23 13:11:32,905 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 357) no Hoare annotation was computed. [2018-11-23 13:11:32,905 INFO L448 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 238) no Hoare annotation was computed. [2018-11-23 13:11:32,905 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 333) no Hoare annotation was computed. [2018-11-23 13:11:32,905 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 392) no Hoare annotation was computed. [2018-11-23 13:11:32,906 INFO L448 ceAbstractionStarter]: For program point L221(line 221) no Hoare annotation was computed. [2018-11-23 13:11:32,906 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 422) no Hoare annotation was computed. [2018-11-23 13:11:32,906 INFO L448 ceAbstractionStarter]: For program point L279(line 279) no Hoare annotation was computed. [2018-11-23 13:11:32,906 INFO L448 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2018-11-23 13:11:32,906 INFO L448 ceAbstractionStarter]: For program point L48(lines 48 428) no Hoare annotation was computed. [2018-11-23 13:11:32,906 INFO L448 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2018-11-23 13:11:32,906 INFO L448 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2018-11-23 13:11:32,906 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-23 13:11:32,906 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 400) no Hoare annotation was computed. [2018-11-23 13:11:32,907 INFO L444 ceAbstractionStarter]: At program point L387(lines 124 398) the Hoare annotation is: (and (let ((.cse0 (= main_~__VERIFIER_assert__cond~3 1)) (.cse1 (<= 1 main_~main__cp~0)) (.cse2 (<= 1 main_~main__scheme~0)) (.cse3 (not (= 0 main_~__VERIFIER_assert__cond~1)))) (or (and .cse0 (= main_~__VERIFIER_assert__cond~2 1) .cse1 .cse2 .cse3) (and .cse0 (not (= 0 main_~__VERIFIER_assert__cond~2)) .cse1 (not (= 0 main_~__VERIFIER_assert__cond~17)) (= main_~__VERIFIER_assert__cond~16 1) .cse2 .cse3))) (< main_~main__cp~0 main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~0 1)) [2018-11-23 13:11:32,907 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 349) no Hoare annotation was computed. [2018-11-23 13:11:32,907 INFO L448 ceAbstractionStarter]: For program point L379(lines 379 388) no Hoare annotation was computed. [2018-11-23 13:11:32,907 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 407) no Hoare annotation was computed. [2018-11-23 13:11:32,907 INFO L448 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2018-11-23 13:11:32,907 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 432) no Hoare annotation was computed. [2018-11-23 13:11:32,907 INFO L448 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-11-23 13:11:32,907 INFO L444 ceAbstractionStarter]: At program point L396(lines 126 397) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~3 1) (let ((.cse0 (<= 1 main_~main__cp~0)) (.cse1 (= main_~__VERIFIER_assert__cond~0 1)) (.cse2 (<= 1 main_~main__scheme~0)) (.cse3 (not (= 0 main_~__VERIFIER_assert__cond~1)))) (or (and (not (= 0 main_~__VERIFIER_assert__cond~2)) .cse0 .cse1 (not (= 0 main_~__VERIFIER_assert__cond~16)) .cse2 .cse3) (and (= main_~__VERIFIER_assert__cond~2 1) .cse0 .cse1 .cse2 .cse3))) (< main_~main__cp~0 main_~main__urilen~0)) [2018-11-23 13:11:32,908 INFO L448 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 291) no Hoare annotation was computed. [2018-11-23 13:11:32,908 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 406) no Hoare annotation was computed. [2018-11-23 13:11:32,908 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 411) no Hoare annotation was computed. [2018-11-23 13:11:32,908 INFO L444 ceAbstractionStarter]: At program point L322(lines 257 323) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~10 1) (let ((.cse0 (let ((.cse1 (<= 2 main_~main__cp~0)) (.cse2 (not (= 0 main_~__VERIFIER_assert__cond~7))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (not (= 0 main_~__VERIFIER_assert__cond~2))) (.cse5 (not (= 0 main_~__VERIFIER_assert__cond~5))) (.cse6 (not (= 0 main_~__VERIFIER_assert__cond~8))) (.cse7 (not (= 0 main_~__VERIFIER_assert__cond~11))) (.cse8 (= main_~__VERIFIER_assert__cond~9 1)) (.cse9 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse10 (= main_~__VERIFIER_assert__cond~0 1)) (.cse11 (= main_~__VERIFIER_assert__cond~4 1)) (.cse12 (<= 1 main_~main__scheme~0)) (.cse13 (not (= 0 main_~__VERIFIER_assert__cond~6))) (.cse14 (not (= 0 main_~__VERIFIER_assert__cond~1)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 main_~__VERIFIER_assert__cond~12)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))))) (or (and (<= 1 main_~main__c~0) (not (= 0 main_~__VERIFIER_assert__cond~13)) .cse0) (and .cse0 (= main_~main__c~0 0))))) [2018-11-23 13:11:32,908 INFO L448 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 221) no Hoare annotation was computed. [2018-11-23 13:11:32,908 INFO L448 ceAbstractionStarter]: For program point L289(lines 289 313) no Hoare annotation was computed. [2018-11-23 13:11:32,908 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-11-23 13:11:32,909 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 354) no Hoare annotation was computed. [2018-11-23 13:11:32,909 INFO L448 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 303) no Hoare annotation was computed. [2018-11-23 13:11:32,909 INFO L448 ceAbstractionStarter]: For program point L58(lines 58 417) no Hoare annotation was computed. [2018-11-23 13:11:32,909 INFO L448 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2018-11-23 13:11:32,909 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 324) no Hoare annotation was computed. [2018-11-23 13:11:32,909 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 350) no Hoare annotation was computed. [2018-11-23 13:11:32,909 INFO L444 ceAbstractionStarter]: At program point L405(lines 99 406) the Hoare annotation is: (= main_~__VERIFIER_assert__cond~0 1) [2018-11-23 13:11:32,909 INFO L448 ceAbstractionStarter]: For program point L207(lines 207 341) no Hoare annotation was computed. [2018-11-23 13:11:32,909 INFO L448 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-11-23 13:11:32,909 INFO L448 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2018-11-23 13:11:32,909 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 429) no Hoare annotation was computed. [2018-11-23 13:11:32,909 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 317) no Hoare annotation was computed. [2018-11-23 13:11:32,910 INFO L448 ceAbstractionStarter]: For program point L199(lines 199 348) no Hoare annotation was computed. [2018-11-23 13:11:32,910 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 92) no Hoare annotation was computed. [2018-11-23 13:11:32,910 INFO L448 ceAbstractionStarter]: For program point L257(lines 257 323) no Hoare annotation was computed. [2018-11-23 13:11:32,910 INFO L448 ceAbstractionStarter]: For program point L381(line 381) no Hoare annotation was computed. [2018-11-23 13:11:32,910 INFO L448 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2018-11-23 13:11:32,910 INFO L448 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-11-23 13:11:32,910 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 355) no Hoare annotation was computed. [2018-11-23 13:11:32,910 INFO L448 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2018-11-23 13:11:32,910 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 433) no Hoare annotation was computed. [2018-11-23 13:11:32,910 INFO L448 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2018-11-23 13:11:32,910 INFO L448 ceAbstractionStarter]: For program point L291(line 291) no Hoare annotation was computed. [2018-11-23 13:11:32,912 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:11:32,912 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 13:11:32,912 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:11:32,912 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:11:32,912 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 13:11:32,912 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 13:11:32,913 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:11:32,913 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:11:32,913 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:11:32,913 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 13:11:32,913 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 13:11:32,913 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:11:32,913 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-23 13:11:32,913 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-23 13:11:32,913 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2018-11-23 13:11:32,913 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2018-11-23 13:11:32,913 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2018-11-23 13:11:32,913 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2018-11-23 13:11:32,913 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2018-11-23 13:11:32,913 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2018-11-23 13:11:32,913 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2018-11-23 13:11:32,914 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2018-11-23 13:11:32,914 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2018-11-23 13:11:32,914 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2018-11-23 13:11:32,914 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2018-11-23 13:11:32,914 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2018-11-23 13:11:32,914 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2018-11-23 13:11:32,914 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2018-11-23 13:11:32,914 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2018-11-23 13:11:32,914 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2018-11-23 13:11:32,914 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2018-11-23 13:11:32,914 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2018-11-23 13:11:32,914 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2018-11-23 13:11:32,915 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2018-11-23 13:11:32,915 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2018-11-23 13:11:32,915 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2018-11-23 13:11:32,915 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2018-11-23 13:11:32,915 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2018-11-23 13:11:32,915 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2018-11-23 13:11:32,915 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2018-11-23 13:11:32,915 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2018-11-23 13:11:32,915 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2018-11-23 13:11:32,915 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:11:32,915 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2018-11-23 13:11:32,915 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2018-11-23 13:11:32,915 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2018-11-23 13:11:32,916 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2018-11-23 13:11:32,916 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2018-11-23 13:11:32,916 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2018-11-23 13:11:32,916 WARN L170 areAnnotationChecker]: L130 has no Hoare annotation [2018-11-23 13:11:32,917 WARN L170 areAnnotationChecker]: L130 has no Hoare annotation [2018-11-23 13:11:32,917 WARN L170 areAnnotationChecker]: L130 has no Hoare annotation [2018-11-23 13:11:32,917 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2018-11-23 13:11:32,917 WARN L170 areAnnotationChecker]: L367 has no Hoare annotation [2018-11-23 13:11:32,917 WARN L170 areAnnotationChecker]: L367 has no Hoare annotation [2018-11-23 13:11:32,917 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2018-11-23 13:11:32,917 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2018-11-23 13:11:32,917 WARN L170 areAnnotationChecker]: L369 has no Hoare annotation [2018-11-23 13:11:32,917 WARN L170 areAnnotationChecker]: L369 has no Hoare annotation [2018-11-23 13:11:32,917 WARN L170 areAnnotationChecker]: L379 has no Hoare annotation [2018-11-23 13:11:32,917 WARN L170 areAnnotationChecker]: L379 has no Hoare annotation [2018-11-23 13:11:32,918 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2018-11-23 13:11:32,918 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2018-11-23 13:11:32,918 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2018-11-23 13:11:32,918 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2018-11-23 13:11:32,918 WARN L170 areAnnotationChecker]: L381 has no Hoare annotation [2018-11-23 13:11:32,918 WARN L170 areAnnotationChecker]: L381 has no Hoare annotation [2018-11-23 13:11:32,918 WARN L170 areAnnotationChecker]: L152 has no Hoare annotation [2018-11-23 13:11:32,918 WARN L170 areAnnotationChecker]: L152 has no Hoare annotation [2018-11-23 13:11:32,918 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2018-11-23 13:11:32,918 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2018-11-23 13:11:32,918 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2018-11-23 13:11:32,918 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2018-11-23 13:11:32,918 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2018-11-23 13:11:32,918 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2018-11-23 13:11:32,918 WARN L170 areAnnotationChecker]: L182 has no Hoare annotation [2018-11-23 13:11:32,919 WARN L170 areAnnotationChecker]: L182 has no Hoare annotation [2018-11-23 13:11:32,919 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2018-11-23 13:11:32,919 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2018-11-23 13:11:32,919 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2018-11-23 13:11:32,919 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2018-11-23 13:11:32,919 WARN L170 areAnnotationChecker]: L199 has no Hoare annotation [2018-11-23 13:11:32,919 WARN L170 areAnnotationChecker]: L199 has no Hoare annotation [2018-11-23 13:11:32,919 WARN L170 areAnnotationChecker]: L207 has no Hoare annotation [2018-11-23 13:11:32,919 WARN L170 areAnnotationChecker]: L207 has no Hoare annotation [2018-11-23 13:11:32,919 WARN L170 areAnnotationChecker]: L209 has no Hoare annotation [2018-11-23 13:11:32,919 WARN L170 areAnnotationChecker]: L209 has no Hoare annotation [2018-11-23 13:11:32,919 WARN L170 areAnnotationChecker]: L219 has no Hoare annotation [2018-11-23 13:11:32,919 WARN L170 areAnnotationChecker]: L219 has no Hoare annotation [2018-11-23 13:11:32,919 WARN L170 areAnnotationChecker]: L221 has no Hoare annotation [2018-11-23 13:11:32,919 WARN L170 areAnnotationChecker]: L221 has no Hoare annotation [2018-11-23 13:11:32,920 WARN L170 areAnnotationChecker]: L229 has no Hoare annotation [2018-11-23 13:11:32,920 WARN L170 areAnnotationChecker]: L229 has no Hoare annotation [2018-11-23 13:11:32,920 WARN L170 areAnnotationChecker]: L229 has no Hoare annotation [2018-11-23 13:11:32,921 WARN L170 areAnnotationChecker]: L236 has no Hoare annotation [2018-11-23 13:11:32,921 WARN L170 areAnnotationChecker]: L236 has no Hoare annotation [2018-11-23 13:11:32,921 WARN L170 areAnnotationChecker]: L238 has no Hoare annotation [2018-11-23 13:11:32,921 WARN L170 areAnnotationChecker]: L238 has no Hoare annotation [2018-11-23 13:11:32,921 WARN L170 areAnnotationChecker]: L248 has no Hoare annotation [2018-11-23 13:11:32,921 WARN L170 areAnnotationChecker]: L248 has no Hoare annotation [2018-11-23 13:11:32,921 WARN L170 areAnnotationChecker]: L250 has no Hoare annotation [2018-11-23 13:11:32,921 WARN L170 areAnnotationChecker]: L250 has no Hoare annotation [2018-11-23 13:11:32,921 WARN L170 areAnnotationChecker]: L257 has no Hoare annotation [2018-11-23 13:11:32,921 WARN L170 areAnnotationChecker]: L257 has no Hoare annotation [2018-11-23 13:11:32,921 WARN L170 areAnnotationChecker]: L265 has no Hoare annotation [2018-11-23 13:11:32,921 WARN L170 areAnnotationChecker]: L265 has no Hoare annotation [2018-11-23 13:11:32,923 WARN L170 areAnnotationChecker]: L267 has no Hoare annotation [2018-11-23 13:11:32,923 WARN L170 areAnnotationChecker]: L267 has no Hoare annotation [2018-11-23 13:11:32,923 WARN L170 areAnnotationChecker]: L277 has no Hoare annotation [2018-11-23 13:11:32,923 WARN L170 areAnnotationChecker]: L277 has no Hoare annotation [2018-11-23 13:11:32,923 WARN L170 areAnnotationChecker]: L279 has no Hoare annotation [2018-11-23 13:11:32,923 WARN L170 areAnnotationChecker]: L279 has no Hoare annotation [2018-11-23 13:11:32,923 WARN L170 areAnnotationChecker]: L289 has no Hoare annotation [2018-11-23 13:11:32,923 WARN L170 areAnnotationChecker]: L289 has no Hoare annotation [2018-11-23 13:11:32,923 WARN L170 areAnnotationChecker]: L291 has no Hoare annotation [2018-11-23 13:11:32,923 WARN L170 areAnnotationChecker]: L291 has no Hoare annotation [2018-11-23 13:11:32,923 WARN L170 areAnnotationChecker]: L301 has no Hoare annotation [2018-11-23 13:11:32,923 WARN L170 areAnnotationChecker]: L301 has no Hoare annotation [2018-11-23 13:11:32,923 WARN L170 areAnnotationChecker]: L303 has no Hoare annotation [2018-11-23 13:11:32,924 WARN L170 areAnnotationChecker]: L303 has no Hoare annotation [2018-11-23 13:11:32,924 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:11:32,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:11:32 BoogieIcfgContainer [2018-11-23 13:11:32,947 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:11:32,947 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:11:32,947 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:11:32,947 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:11:32,948 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:11:01" (3/4) ... [2018-11-23 13:11:32,952 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:11:32,977 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:11:32,977 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:11:32,991 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 13:11:32,992 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 13:11:33,087 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c-witness.graphml [2018-11-23 13:11:33,088 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:11:33,089 INFO L168 Benchmark]: Toolchain (without parser) took 33429.66 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 805.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:11:33,090 INFO L168 Benchmark]: CDTParser took 0.28 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:11:33,090 INFO L168 Benchmark]: CACSL2BoogieTranslator took 488.47 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:11:33,090 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.96 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:11:33,091 INFO L168 Benchmark]: Boogie Preprocessor took 67.59 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:11:33,091 INFO L168 Benchmark]: RCFGBuilder took 1415.96 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 743.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -767.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:11:33,092 INFO L168 Benchmark]: TraceAbstraction took 31279.82 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 318.2 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 487.0 MB). Peak memory consumption was 805.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:11:33,092 INFO L168 Benchmark]: Witness Printer took 140.74 ms. Allocated memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 18.4 MB). Free memory was 1.7 GB in the beginning and 2.6 GB in the end (delta: -887.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:11:33,094 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.28 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 488.47 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 29.96 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 67.59 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. * RCFGBuilder took 1415.96 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 743.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -767.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31279.82 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 318.2 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 487.0 MB). Peak memory consumption was 805.2 MB. Max. memory is 7.1 GB. * Witness Printer took 140.74 ms. Allocated memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 18.4 MB). Free memory was 1.7 GB in the beginning and 2.6 GB in the end (delta: -887.9 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 92]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 120]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 303]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 221]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 369]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 108]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 209]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 381]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 291]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 279]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 238]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 267]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: ((((1 <= main__c && !(0 == __VERIFIER_assert__cond)) && (((((2 <= main__cp && main__c + 2 <= main__tokenlen) && __VERIFIER_assert__cond == 1) && ((((!(0 == __VERIFIER_assert__cond) && (((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || ((((2 <= main__cp && __VERIFIER_assert__cond == 1) && ((((!(0 == __VERIFIER_assert__cond) && (((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)))) || (main__c == 0 && (((((2 <= main__cp && main__c + 2 <= main__tokenlen) && __VERIFIER_assert__cond == 1) && ((((!(0 == __VERIFIER_assert__cond) && (((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || ((((2 <= main__cp && __VERIFIER_assert__cond == 1) && ((((!(0 == __VERIFIER_assert__cond) && (((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond))))) && __VERIFIER_assert__cond == 1) || (((((2 <= main__cp && main__cp + 2 <= main__urilen) && main__c == 0) && __VERIFIER_assert__cond == 1) && ((((!(0 == __VERIFIER_assert__cond) && (((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (__VERIFIER_assert__cond == 1 && ((((((!(0 == __VERIFIER_assert__cond) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) || ((((__VERIFIER_assert__cond == 1 && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)))) && main__cp < main__urilen - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: __VERIFIER_assert__cond == 1 && (((1 <= main__c && !(0 == __VERIFIER_assert__cond)) && (((((((((((((((2 <= main__cp && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || ((((((((((((((2 <= main__cp && main__c + 2 <= main__tokenlen) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)))) || ((((((((((((((((2 <= main__cp && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || ((((((((((((((2 <= main__cp && main__c + 2 <= main__tokenlen) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond))) && main__c == 0)) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: ((((((__VERIFIER_assert__cond == 1 && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) || ((((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond))) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: __VERIFIER_assert__cond == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 87 locations, 18 error locations. SAFE Result, 31.1s OverallTime, 23 OverallIterations, 2 TraceHistogramMax, 17.4s AutomataDifference, 0.0s DeadEndRemovalTime, 2.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1337 SDtfs, 2826 SDslu, 1899 SDs, 0 SdLazy, 1151 SolverSat, 166 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 157 SyntacticMatches, 5 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, 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: 2.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 311 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 17 NumberOfFragments, 685 HoareAnnotationTreeSize, 9 FomulaSimplifications, 326253 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 80271 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 855 NumberOfCodeBlocks, 855 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 829 ConstructedInterpolants, 0 QuantifiedInterpolants, 60398 SizeOfPredicates, 21 NumberOfNonLiveVariables, 359 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 26 InterpolantComputations, 20 PerfectInterpolantSequences, 9/21 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...