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/AutomizerC.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-370d6ab [2018-11-14 17:34:25,243 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:34:25,247 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:34:25,263 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:34:25,264 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:34:25,265 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:34:25,267 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:34:25,270 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:34:25,272 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:34:25,273 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:34:25,274 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:34:25,281 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:34:25,282 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:34:25,285 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:34:25,286 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:34:25,287 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:34:25,287 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:34:25,293 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:34:25,295 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:34:25,299 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:34:25,301 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:34:25,302 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:34:25,305 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:34:25,308 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:34:25,309 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:34:25,310 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:34:25,310 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:34:25,312 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:34:25,313 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:34:25,316 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:34:25,316 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:34:25,318 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:34:25,318 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:34:25,319 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:34:25,320 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:34:25,321 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:34:25,321 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-14 17:34:25,346 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:34:25,346 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:34:25,347 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:34:25,347 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:34:25,348 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:34:25,348 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:34:25,348 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:34:25,348 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:34:25,349 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:34:25,349 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:34:25,349 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:34:25,349 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:34:25,349 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:34:25,350 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:34:25,350 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:34:25,350 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:34:25,350 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:34:25,350 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:34:25,350 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:34:25,351 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:34:25,351 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:34:25,351 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:34:25,351 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:34:25,351 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:34:25,352 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:34:25,352 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:34:25,352 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:34:25,352 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:34:25,352 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:34:25,353 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:34:25,420 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:34:25,434 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:34:25,438 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:34:25,439 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:34:25,440 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:34:25,441 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-14 17:34:25,506 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cba8b8bb/2524eddb611b4bb4bfc1d260477759c0/FLAGb17465f01 [2018-11-14 17:34:26,006 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:34:26,007 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-11-14 17:34:26,020 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cba8b8bb/2524eddb611b4bb4bfc1d260477759c0/FLAGb17465f01 [2018-11-14 17:34:26,041 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cba8b8bb/2524eddb611b4bb4bfc1d260477759c0 [2018-11-14 17:34:26,053 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:34:26,055 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:34:26,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:34:26,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:34:26,060 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:34:26,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:34:26" (1/1) ... [2018-11-14 17:34:26,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36c2812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:26, skipping insertion in model container [2018-11-14 17:34:26,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:34:26" (1/1) ... [2018-11-14 17:34:26,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:34:26,131 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:34:26,403 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:34:26,410 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:34:26,491 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:34:26,509 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:34:26,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:26 WrapperNode [2018-11-14 17:34:26,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:34:26,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:34:26,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:34:26,511 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:34:26,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:26" (1/1) ... [2018-11-14 17:34:26,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:26" (1/1) ... [2018-11-14 17:34:26,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:26" (1/1) ... [2018-11-14 17:34:26,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:26" (1/1) ... [2018-11-14 17:34:26,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:26" (1/1) ... [2018-11-14 17:34:26,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:26" (1/1) ... [2018-11-14 17:34:26,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:26" (1/1) ... [2018-11-14 17:34:26,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:34:26,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:34:26,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:34:26,571 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:34:26,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:26" (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-14 17:34:26,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:34:26,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:34:26,732 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:34:26,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:34:26,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 17:34:26,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:34:26,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:34:26,733 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:34:26,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:34:26,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:34:28,028 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:34:28,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:34:28 BoogieIcfgContainer [2018-11-14 17:34:28,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:34:28,030 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:34:28,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:34:28,033 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:34:28,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:34:26" (1/3) ... [2018-11-14 17:34:28,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a722a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:34:28, skipping insertion in model container [2018-11-14 17:34:28,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:26" (2/3) ... [2018-11-14 17:34:28,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a722a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:34:28, skipping insertion in model container [2018-11-14 17:34:28,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:34:28" (3/3) ... [2018-11-14 17:34:28,037 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-11-14 17:34:28,047 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:34:28,056 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2018-11-14 17:34:28,074 INFO L257 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2018-11-14 17:34:28,107 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:34:28,108 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:34:28,108 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:34:28,109 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:34:28,109 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:34:28,110 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:34:28,110 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:34:28,110 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:34:28,110 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:34:28,134 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2018-11-14 17:34:28,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 17:34:28,141 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:28,142 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:28,145 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:28,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:28,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1637525138, now seen corresponding path program 1 times [2018-11-14 17:34:28,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:28,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:28,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:28,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:28,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:28,466 INFO L256 TraceCheckUtils]: 0: Hoare triple {90#true} call ULTIMATE.init(); {90#true} is VALID [2018-11-14 17:34:28,470 INFO L273 TraceCheckUtils]: 1: Hoare triple {90#true} ~__return_main~0 := 0;~__return_375~0 := 0; {90#true} is VALID [2018-11-14 17:34:28,470 INFO L273 TraceCheckUtils]: 2: Hoare triple {90#true} assume true; {90#true} is VALID [2018-11-14 17:34:28,471 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} #215#return; {90#true} is VALID [2018-11-14 17:34:28,471 INFO L256 TraceCheckUtils]: 4: Hoare triple {90#true} call #t~ret8 := main(); {90#true} is VALID [2018-11-14 17:34:28,471 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-14 17:34:28,472 INFO L273 TraceCheckUtils]: 6: Hoare triple {90#true} assume !!(~main__urilen~0 <= 1000000); {90#true} is VALID [2018-11-14 17:34:28,472 INFO L273 TraceCheckUtils]: 7: Hoare triple {90#true} assume !!(~main__urilen~0 >= -1000000); {90#true} is VALID [2018-11-14 17:34:28,472 INFO L273 TraceCheckUtils]: 8: Hoare triple {90#true} assume !!(~main__tokenlen~0 <= 1000000); {90#true} is VALID [2018-11-14 17:34:28,473 INFO L273 TraceCheckUtils]: 9: Hoare triple {90#true} assume !!(~main__tokenlen~0 >= -1000000); {90#true} is VALID [2018-11-14 17:34:28,473 INFO L273 TraceCheckUtils]: 10: Hoare triple {90#true} assume !!(~main__scheme~0 <= 1000000); {90#true} is VALID [2018-11-14 17:34:28,474 INFO L273 TraceCheckUtils]: 11: Hoare triple {90#true} assume !!(~main__scheme~0 >= -1000000); {90#true} is VALID [2018-11-14 17:34:28,474 INFO L273 TraceCheckUtils]: 12: Hoare triple {90#true} assume ~main__urilen~0 > 0; {90#true} is VALID [2018-11-14 17:34:28,474 INFO L273 TraceCheckUtils]: 13: Hoare triple {90#true} assume ~main__tokenlen~0 > 0; {90#true} is VALID [2018-11-14 17:34:28,475 INFO L273 TraceCheckUtils]: 14: Hoare triple {90#true} assume ~main__scheme~0 >= 0; {90#true} is VALID [2018-11-14 17:34:28,475 INFO L273 TraceCheckUtils]: 15: Hoare triple {90#true} assume !(~main__scheme~0 == 0); {90#true} is VALID [2018-11-14 17:34:28,479 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-14 17:34:28,480 INFO L273 TraceCheckUtils]: 17: Hoare triple {92#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {91#false} is VALID [2018-11-14 17:34:28,480 INFO L273 TraceCheckUtils]: 18: Hoare triple {91#false} assume !false; {91#false} is VALID [2018-11-14 17:34:28,484 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-14 17:34:28,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:28,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:34:28,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 17:34:28,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:28,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:34:28,578 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-14 17:34:28,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:34:28,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:34:28,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:34:28,589 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 3 states. [2018-11-14 17:34:29,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:29,305 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2018-11-14 17:34:29,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:34:29,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 17:34:29,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:29,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:34:29,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2018-11-14 17:34:29,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:34:29,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2018-11-14 17:34:29,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 129 transitions. [2018-11-14 17:34:29,668 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-14 17:34:29,689 INFO L225 Difference]: With dead ends: 93 [2018-11-14 17:34:29,689 INFO L226 Difference]: Without dead ends: 80 [2018-11-14 17:34:29,693 INFO L604 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-14 17:34:29,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-14 17:34:29,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-11-14 17:34:29,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:29,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 80 states. [2018-11-14 17:34:29,755 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2018-11-14 17:34:29,755 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2018-11-14 17:34:29,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:29,763 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-11-14 17:34:29,764 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-11-14 17:34:29,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:29,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:29,765 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2018-11-14 17:34:29,766 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2018-11-14 17:34:29,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:29,775 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-11-14 17:34:29,776 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-11-14 17:34:29,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:29,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:29,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:29,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:29,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 17:34:29,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-11-14 17:34:29,786 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2018-11-14 17:34:29,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:29,787 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2018-11-14 17:34:29,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:34:29,787 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-11-14 17:34:29,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 17:34:29,788 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:29,788 INFO L375 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-14 17:34:29,790 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:29,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:29,791 INFO L82 PathProgramCache]: Analyzing trace with hash 776331368, now seen corresponding path program 1 times [2018-11-14 17:34:29,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:29,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:29,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:29,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:29,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:30,093 INFO L256 TraceCheckUtils]: 0: Hoare triple {445#true} call ULTIMATE.init(); {445#true} is VALID [2018-11-14 17:34:30,094 INFO L273 TraceCheckUtils]: 1: Hoare triple {445#true} ~__return_main~0 := 0;~__return_375~0 := 0; {445#true} is VALID [2018-11-14 17:34:30,094 INFO L273 TraceCheckUtils]: 2: Hoare triple {445#true} assume true; {445#true} is VALID [2018-11-14 17:34:30,095 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {445#true} {445#true} #215#return; {445#true} is VALID [2018-11-14 17:34:30,095 INFO L256 TraceCheckUtils]: 4: Hoare triple {445#true} call #t~ret8 := main(); {445#true} is VALID [2018-11-14 17:34:30,095 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-14 17:34:30,096 INFO L273 TraceCheckUtils]: 6: Hoare triple {445#true} assume !!(~main__urilen~0 <= 1000000); {445#true} is VALID [2018-11-14 17:34:30,096 INFO L273 TraceCheckUtils]: 7: Hoare triple {445#true} assume !!(~main__urilen~0 >= -1000000); {445#true} is VALID [2018-11-14 17:34:30,097 INFO L273 TraceCheckUtils]: 8: Hoare triple {445#true} assume !!(~main__tokenlen~0 <= 1000000); {445#true} is VALID [2018-11-14 17:34:30,097 INFO L273 TraceCheckUtils]: 9: Hoare triple {445#true} assume !!(~main__tokenlen~0 >= -1000000); {445#true} is VALID [2018-11-14 17:34:30,097 INFO L273 TraceCheckUtils]: 10: Hoare triple {445#true} assume !!(~main__scheme~0 <= 1000000); {445#true} is VALID [2018-11-14 17:34:30,098 INFO L273 TraceCheckUtils]: 11: Hoare triple {445#true} assume !!(~main__scheme~0 >= -1000000); {445#true} is VALID [2018-11-14 17:34:30,098 INFO L273 TraceCheckUtils]: 12: Hoare triple {445#true} assume ~main__urilen~0 > 0; {445#true} is VALID [2018-11-14 17:34:30,098 INFO L273 TraceCheckUtils]: 13: Hoare triple {445#true} assume ~main__tokenlen~0 > 0; {445#true} is VALID [2018-11-14 17:34:30,101 INFO L273 TraceCheckUtils]: 14: Hoare triple {445#true} assume ~main__scheme~0 >= 0; {447#(<= 0 main_~main__scheme~0)} is VALID [2018-11-14 17:34:30,102 INFO L273 TraceCheckUtils]: 15: Hoare triple {447#(<= 0 main_~main__scheme~0)} assume !(~main__scheme~0 == 0); {448#(<= 1 main_~main__scheme~0)} is VALID [2018-11-14 17:34:30,103 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-14 17:34:30,107 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 !(~__VERIFIER_assert__cond~0 == 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-14 17:34:30,113 INFO L273 TraceCheckUtils]: 18: Hoare triple {450#(not (= 0 main_~__VERIFIER_assert__cond~1))} assume ~__VERIFIER_assert__cond~1 == 0; {446#false} is VALID [2018-11-14 17:34:30,114 INFO L273 TraceCheckUtils]: 19: Hoare triple {446#false} assume !false; {446#false} is VALID [2018-11-14 17:34:30,116 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-14 17:34:30,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:30,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:34:30,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-14 17:34:30,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:30,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:34:30,181 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-14 17:34:30,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:34:30,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:34:30,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:34:30,182 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 6 states. [2018-11-14 17:34:30,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:30,647 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-11-14 17:34:30,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:34:30,647 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-14 17:34:30,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:30,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:30,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2018-11-14 17:34:30,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:30,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2018-11-14 17:34:30,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 83 transitions. [2018-11-14 17:34:30,815 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-14 17:34:30,819 INFO L225 Difference]: With dead ends: 80 [2018-11-14 17:34:30,820 INFO L226 Difference]: Without dead ends: 78 [2018-11-14 17:34:30,821 INFO L604 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-14 17:34:30,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-14 17:34:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-14 17:34:30,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:30,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 78 states. [2018-11-14 17:34:30,869 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2018-11-14 17:34:30,869 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2018-11-14 17:34:30,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:30,875 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2018-11-14 17:34:30,875 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-11-14 17:34:30,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:30,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:30,876 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2018-11-14 17:34:30,877 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2018-11-14 17:34:30,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:30,881 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2018-11-14 17:34:30,881 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-11-14 17:34:30,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:30,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:30,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:30,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-14 17:34:30,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-11-14 17:34:30,887 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2018-11-14 17:34:30,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:30,888 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-11-14 17:34:30,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:34:30,888 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-11-14 17:34:30,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 17:34:30,889 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:30,889 INFO L375 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-14 17:34:30,890 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:30,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:30,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1269768629, now seen corresponding path program 1 times [2018-11-14 17:34:30,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:30,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:30,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:30,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:30,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:31,023 INFO L256 TraceCheckUtils]: 0: Hoare triple {787#true} call ULTIMATE.init(); {787#true} is VALID [2018-11-14 17:34:31,024 INFO L273 TraceCheckUtils]: 1: Hoare triple {787#true} ~__return_main~0 := 0;~__return_375~0 := 0; {787#true} is VALID [2018-11-14 17:34:31,024 INFO L273 TraceCheckUtils]: 2: Hoare triple {787#true} assume true; {787#true} is VALID [2018-11-14 17:34:31,024 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {787#true} {787#true} #215#return; {787#true} is VALID [2018-11-14 17:34:31,025 INFO L256 TraceCheckUtils]: 4: Hoare triple {787#true} call #t~ret8 := main(); {787#true} is VALID [2018-11-14 17:34:31,025 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-14 17:34:31,025 INFO L273 TraceCheckUtils]: 6: Hoare triple {787#true} assume !!(~main__urilen~0 <= 1000000); {787#true} is VALID [2018-11-14 17:34:31,026 INFO L273 TraceCheckUtils]: 7: Hoare triple {787#true} assume !!(~main__urilen~0 >= -1000000); {787#true} is VALID [2018-11-14 17:34:31,026 INFO L273 TraceCheckUtils]: 8: Hoare triple {787#true} assume !!(~main__tokenlen~0 <= 1000000); {787#true} is VALID [2018-11-14 17:34:31,026 INFO L273 TraceCheckUtils]: 9: Hoare triple {787#true} assume !!(~main__tokenlen~0 >= -1000000); {787#true} is VALID [2018-11-14 17:34:31,027 INFO L273 TraceCheckUtils]: 10: Hoare triple {787#true} assume !!(~main__scheme~0 <= 1000000); {787#true} is VALID [2018-11-14 17:34:31,027 INFO L273 TraceCheckUtils]: 11: Hoare triple {787#true} assume !!(~main__scheme~0 >= -1000000); {787#true} is VALID [2018-11-14 17:34:31,027 INFO L273 TraceCheckUtils]: 12: Hoare triple {787#true} assume ~main__urilen~0 > 0; {787#true} is VALID [2018-11-14 17:34:31,028 INFO L273 TraceCheckUtils]: 13: Hoare triple {787#true} assume ~main__tokenlen~0 > 0; {787#true} is VALID [2018-11-14 17:34:31,028 INFO L273 TraceCheckUtils]: 14: Hoare triple {787#true} assume ~main__scheme~0 >= 0; {787#true} is VALID [2018-11-14 17:34:31,028 INFO L273 TraceCheckUtils]: 15: Hoare triple {787#true} assume !(~main__scheme~0 == 0); {787#true} is VALID [2018-11-14 17:34:31,031 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-14 17:34:31,033 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 !(~__VERIFIER_assert__cond~0 == 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-14 17:34:31,033 INFO L273 TraceCheckUtils]: 18: Hoare triple {790#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~1 == 0);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-14 17:34:31,035 INFO L273 TraceCheckUtils]: 19: Hoare triple {790#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~main____CPAchecker_TMP_0~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-14 17:34:31,036 INFO L273 TraceCheckUtils]: 20: Hoare triple {791#(not (= 0 main_~__VERIFIER_assert__cond~2))} assume ~__VERIFIER_assert__cond~2 == 0; {788#false} is VALID [2018-11-14 17:34:31,036 INFO L273 TraceCheckUtils]: 21: Hoare triple {788#false} assume !false; {788#false} is VALID [2018-11-14 17:34:31,038 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-14 17:34:31,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:31,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:34:31,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-14 17:34:31,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:31,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:34:31,081 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-14 17:34:31,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:34:31,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:34:31,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:34:31,083 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 5 states. [2018-11-14 17:34:31,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:31,761 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-11-14 17:34:31,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:34:31,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-14 17:34:31,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:31,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:31,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2018-11-14 17:34:31,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:31,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2018-11-14 17:34:31,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 121 transitions. [2018-11-14 17:34:31,972 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-14 17:34:31,977 INFO L225 Difference]: With dead ends: 116 [2018-11-14 17:34:31,978 INFO L226 Difference]: Without dead ends: 114 [2018-11-14 17:34:31,978 INFO L604 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-14 17:34:31,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-14 17:34:32,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 76. [2018-11-14 17:34:32,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:32,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 76 states. [2018-11-14 17:34:32,055 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 76 states. [2018-11-14 17:34:32,055 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 76 states. [2018-11-14 17:34:32,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:32,060 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-11-14 17:34:32,061 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-11-14 17:34:32,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:32,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:32,062 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 114 states. [2018-11-14 17:34:32,062 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 114 states. [2018-11-14 17:34:32,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:32,068 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-11-14 17:34:32,068 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-11-14 17:34:32,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:32,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:32,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:32,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:32,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-14 17:34:32,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-11-14 17:34:32,073 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2018-11-14 17:34:32,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:32,074 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-11-14 17:34:32,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:34:32,074 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-11-14 17:34:32,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 17:34:32,075 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:32,075 INFO L375 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-14 17:34:32,076 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:32,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:32,076 INFO L82 PathProgramCache]: Analyzing trace with hash -708118726, now seen corresponding path program 1 times [2018-11-14 17:34:32,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:32,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:32,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:32,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:32,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:32,218 INFO L256 TraceCheckUtils]: 0: Hoare triple {1237#true} call ULTIMATE.init(); {1237#true} is VALID [2018-11-14 17:34:32,219 INFO L273 TraceCheckUtils]: 1: Hoare triple {1237#true} ~__return_main~0 := 0;~__return_375~0 := 0; {1237#true} is VALID [2018-11-14 17:34:32,219 INFO L273 TraceCheckUtils]: 2: Hoare triple {1237#true} assume true; {1237#true} is VALID [2018-11-14 17:34:32,219 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1237#true} {1237#true} #215#return; {1237#true} is VALID [2018-11-14 17:34:32,220 INFO L256 TraceCheckUtils]: 4: Hoare triple {1237#true} call #t~ret8 := main(); {1237#true} is VALID [2018-11-14 17:34:32,220 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-14 17:34:32,220 INFO L273 TraceCheckUtils]: 6: Hoare triple {1237#true} assume !!(~main__urilen~0 <= 1000000); {1237#true} is VALID [2018-11-14 17:34:32,221 INFO L273 TraceCheckUtils]: 7: Hoare triple {1237#true} assume !!(~main__urilen~0 >= -1000000); {1237#true} is VALID [2018-11-14 17:34:32,221 INFO L273 TraceCheckUtils]: 8: Hoare triple {1237#true} assume !!(~main__tokenlen~0 <= 1000000); {1237#true} is VALID [2018-11-14 17:34:32,221 INFO L273 TraceCheckUtils]: 9: Hoare triple {1237#true} assume !!(~main__tokenlen~0 >= -1000000); {1237#true} is VALID [2018-11-14 17:34:32,222 INFO L273 TraceCheckUtils]: 10: Hoare triple {1237#true} assume !!(~main__scheme~0 <= 1000000); {1237#true} is VALID [2018-11-14 17:34:32,222 INFO L273 TraceCheckUtils]: 11: Hoare triple {1237#true} assume !!(~main__scheme~0 >= -1000000); {1237#true} is VALID [2018-11-14 17:34:32,222 INFO L273 TraceCheckUtils]: 12: Hoare triple {1237#true} assume ~main__urilen~0 > 0; {1237#true} is VALID [2018-11-14 17:34:32,223 INFO L273 TraceCheckUtils]: 13: Hoare triple {1237#true} assume ~main__tokenlen~0 > 0; {1237#true} is VALID [2018-11-14 17:34:32,223 INFO L273 TraceCheckUtils]: 14: Hoare triple {1237#true} assume ~main__scheme~0 >= 0; {1237#true} is VALID [2018-11-14 17:34:32,223 INFO L273 TraceCheckUtils]: 15: Hoare triple {1237#true} assume !(~main__scheme~0 == 0); {1237#true} is VALID [2018-11-14 17:34:32,230 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-14 17:34:32,232 INFO L273 TraceCheckUtils]: 17: Hoare triple {1239#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} assume !(~__VERIFIER_assert__cond~0 == 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-14 17:34:32,232 INFO L273 TraceCheckUtils]: 18: Hoare triple {1240#(or (= 0 main_~__VERIFIER_assert__cond~1) (<= 1 main_~main__cp~0))} assume !(~__VERIFIER_assert__cond~1 == 0);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-14 17:34:32,234 INFO L273 TraceCheckUtils]: 19: Hoare triple {1241#(<= 1 main_~main__cp~0)} assume !(~main____CPAchecker_TMP_0~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-14 17:34:32,234 INFO L273 TraceCheckUtils]: 20: Hoare triple {1241#(<= 1 main_~main__cp~0)} assume !(~__VERIFIER_assert__cond~2 == 0);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-14 17:34:32,236 INFO L273 TraceCheckUtils]: 21: Hoare triple {1242#(not (= 0 main_~__VERIFIER_assert__cond~3))} assume ~__VERIFIER_assert__cond~3 == 0; {1238#false} is VALID [2018-11-14 17:34:32,236 INFO L273 TraceCheckUtils]: 22: Hoare triple {1238#false} assume !false; {1238#false} is VALID [2018-11-14 17:34:32,237 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-14 17:34:32,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:32,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:34:32,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-14 17:34:32,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:32,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:34:32,262 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-14 17:34:32,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:34:32,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:34:32,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:34:32,264 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2018-11-14 17:34:32,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:32,740 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-11-14 17:34:32,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:34:32,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-14 17:34:32,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:32,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:32,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2018-11-14 17:34:32,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2018-11-14 17:34:32,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2018-11-14 17:34:32,879 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-14 17:34:32,880 INFO L225 Difference]: With dead ends: 76 [2018-11-14 17:34:32,881 INFO L226 Difference]: Without dead ends: 74 [2018-11-14 17:34:32,881 INFO L604 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-14 17:34:32,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-14 17:34:32,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-14 17:34:32,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:32,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 74 states. [2018-11-14 17:34:32,951 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2018-11-14 17:34:32,952 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2018-11-14 17:34:32,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:32,955 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-11-14 17:34:32,955 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-14 17:34:32,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:32,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:32,956 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2018-11-14 17:34:32,956 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2018-11-14 17:34:32,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:32,959 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-11-14 17:34:32,959 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-14 17:34:32,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:32,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:32,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:32,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:32,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 17:34:32,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-11-14 17:34:32,964 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2018-11-14 17:34:32,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:32,964 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-11-14 17:34:32,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:34:32,964 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-14 17:34:32,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 17:34:32,966 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:32,967 INFO L375 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-14 17:34:32,967 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:32,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:32,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1317531748, now seen corresponding path program 1 times [2018-11-14 17:34:32,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:32,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:32,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:32,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:32,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:33,100 INFO L256 TraceCheckUtils]: 0: Hoare triple {1565#true} call ULTIMATE.init(); {1565#true} is VALID [2018-11-14 17:34:33,101 INFO L273 TraceCheckUtils]: 1: Hoare triple {1565#true} ~__return_main~0 := 0;~__return_375~0 := 0; {1565#true} is VALID [2018-11-14 17:34:33,101 INFO L273 TraceCheckUtils]: 2: Hoare triple {1565#true} assume true; {1565#true} is VALID [2018-11-14 17:34:33,102 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1565#true} {1565#true} #215#return; {1565#true} is VALID [2018-11-14 17:34:33,102 INFO L256 TraceCheckUtils]: 4: Hoare triple {1565#true} call #t~ret8 := main(); {1565#true} is VALID [2018-11-14 17:34:33,102 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-14 17:34:33,103 INFO L273 TraceCheckUtils]: 6: Hoare triple {1565#true} assume !!(~main__urilen~0 <= 1000000); {1565#true} is VALID [2018-11-14 17:34:33,103 INFO L273 TraceCheckUtils]: 7: Hoare triple {1565#true} assume !!(~main__urilen~0 >= -1000000); {1565#true} is VALID [2018-11-14 17:34:33,103 INFO L273 TraceCheckUtils]: 8: Hoare triple {1565#true} assume !!(~main__tokenlen~0 <= 1000000); {1565#true} is VALID [2018-11-14 17:34:33,103 INFO L273 TraceCheckUtils]: 9: Hoare triple {1565#true} assume !!(~main__tokenlen~0 >= -1000000); {1565#true} is VALID [2018-11-14 17:34:33,103 INFO L273 TraceCheckUtils]: 10: Hoare triple {1565#true} assume !!(~main__scheme~0 <= 1000000); {1565#true} is VALID [2018-11-14 17:34:33,104 INFO L273 TraceCheckUtils]: 11: Hoare triple {1565#true} assume !!(~main__scheme~0 >= -1000000); {1565#true} is VALID [2018-11-14 17:34:33,104 INFO L273 TraceCheckUtils]: 12: Hoare triple {1565#true} assume ~main__urilen~0 > 0; {1565#true} is VALID [2018-11-14 17:34:33,104 INFO L273 TraceCheckUtils]: 13: Hoare triple {1565#true} assume ~main__tokenlen~0 > 0; {1565#true} is VALID [2018-11-14 17:34:33,104 INFO L273 TraceCheckUtils]: 14: Hoare triple {1565#true} assume ~main__scheme~0 >= 0; {1565#true} is VALID [2018-11-14 17:34:33,105 INFO L273 TraceCheckUtils]: 15: Hoare triple {1565#true} assume !(~main__scheme~0 == 0); {1565#true} is VALID [2018-11-14 17:34:33,105 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-14 17:34:33,106 INFO L273 TraceCheckUtils]: 17: Hoare triple {1565#true} assume !(~__VERIFIER_assert__cond~0 == 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-14 17:34:33,106 INFO L273 TraceCheckUtils]: 18: Hoare triple {1565#true} assume !(~__VERIFIER_assert__cond~1 == 0);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-14 17:34:33,113 INFO L273 TraceCheckUtils]: 19: Hoare triple {1565#true} assume !(~main____CPAchecker_TMP_0~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-14 17:34:33,115 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 !(~__VERIFIER_assert__cond~2 == 0);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-14 17:34:33,115 INFO L273 TraceCheckUtils]: 21: Hoare triple {1568#(< main_~main__cp~0 main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~3 == 0); {1568#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-14 17:34:33,121 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-14 17:34:33,126 INFO L273 TraceCheckUtils]: 23: Hoare triple {1568#(< main_~main__cp~0 main_~main__urilen~0)} assume !!(~main____CPAchecker_TMP_1~0 == 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-14 17:34:33,126 INFO L273 TraceCheckUtils]: 24: Hoare triple {1569#(not (= 0 main_~__VERIFIER_assert__cond~16))} assume ~__VERIFIER_assert__cond~16 == 0; {1566#false} is VALID [2018-11-14 17:34:33,127 INFO L273 TraceCheckUtils]: 25: Hoare triple {1566#false} assume !false; {1566#false} is VALID [2018-11-14 17:34:33,128 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-14 17:34:33,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:33,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:34:33,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-14 17:34:33,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:33,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:34:33,159 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-14 17:34:33,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:34:33,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:34:33,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:34:33,161 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2018-11-14 17:34:34,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:34,393 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2018-11-14 17:34:34,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:34:34,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-14 17:34:34,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:34,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:34,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2018-11-14 17:34:34,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:34,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2018-11-14 17:34:34,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 147 transitions. [2018-11-14 17:34:34,666 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-14 17:34:34,671 INFO L225 Difference]: With dead ends: 141 [2018-11-14 17:34:34,671 INFO L226 Difference]: Without dead ends: 139 [2018-11-14 17:34:34,671 INFO L604 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-14 17:34:34,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-14 17:34:34,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2018-11-14 17:34:34,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:34,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand 77 states. [2018-11-14 17:34:34,728 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 77 states. [2018-11-14 17:34:34,728 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 77 states. [2018-11-14 17:34:34,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:34,734 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2018-11-14 17:34:34,734 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2018-11-14 17:34:34,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:34,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:34,735 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 139 states. [2018-11-14 17:34:34,735 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 139 states. [2018-11-14 17:34:34,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:34,740 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2018-11-14 17:34:34,740 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2018-11-14 17:34:34,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:34,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:34,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:34,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:34,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-14 17:34:34,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-11-14 17:34:34,745 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2018-11-14 17:34:34,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:34,745 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-11-14 17:34:34,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:34:34,745 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-11-14 17:34:34,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 17:34:34,746 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:34,746 INFO L375 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-14 17:34:34,747 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:34,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:34,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1321265557, now seen corresponding path program 1 times [2018-11-14 17:34:34,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:34,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:34,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:34,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:34,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:34,852 INFO L256 TraceCheckUtils]: 0: Hoare triple {2096#true} call ULTIMATE.init(); {2096#true} is VALID [2018-11-14 17:34:34,853 INFO L273 TraceCheckUtils]: 1: Hoare triple {2096#true} ~__return_main~0 := 0;~__return_375~0 := 0; {2096#true} is VALID [2018-11-14 17:34:34,853 INFO L273 TraceCheckUtils]: 2: Hoare triple {2096#true} assume true; {2096#true} is VALID [2018-11-14 17:34:34,853 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2096#true} {2096#true} #215#return; {2096#true} is VALID [2018-11-14 17:34:34,853 INFO L256 TraceCheckUtils]: 4: Hoare triple {2096#true} call #t~ret8 := main(); {2096#true} is VALID [2018-11-14 17:34:34,854 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-14 17:34:34,854 INFO L273 TraceCheckUtils]: 6: Hoare triple {2096#true} assume !!(~main__urilen~0 <= 1000000); {2096#true} is VALID [2018-11-14 17:34:34,854 INFO L273 TraceCheckUtils]: 7: Hoare triple {2096#true} assume !!(~main__urilen~0 >= -1000000); {2096#true} is VALID [2018-11-14 17:34:34,855 INFO L273 TraceCheckUtils]: 8: Hoare triple {2096#true} assume !!(~main__tokenlen~0 <= 1000000); {2096#true} is VALID [2018-11-14 17:34:34,855 INFO L273 TraceCheckUtils]: 9: Hoare triple {2096#true} assume !!(~main__tokenlen~0 >= -1000000); {2096#true} is VALID [2018-11-14 17:34:34,855 INFO L273 TraceCheckUtils]: 10: Hoare triple {2096#true} assume !!(~main__scheme~0 <= 1000000); {2096#true} is VALID [2018-11-14 17:34:34,855 INFO L273 TraceCheckUtils]: 11: Hoare triple {2096#true} assume !!(~main__scheme~0 >= -1000000); {2096#true} is VALID [2018-11-14 17:34:34,855 INFO L273 TraceCheckUtils]: 12: Hoare triple {2096#true} assume ~main__urilen~0 > 0; {2096#true} is VALID [2018-11-14 17:34:34,856 INFO L273 TraceCheckUtils]: 13: Hoare triple {2096#true} assume ~main__tokenlen~0 > 0; {2096#true} is VALID [2018-11-14 17:34:34,856 INFO L273 TraceCheckUtils]: 14: Hoare triple {2096#true} assume ~main__scheme~0 >= 0; {2096#true} is VALID [2018-11-14 17:34:34,856 INFO L273 TraceCheckUtils]: 15: Hoare triple {2096#true} assume !(~main__scheme~0 == 0); {2096#true} is VALID [2018-11-14 17:34:34,857 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-14 17:34:34,857 INFO L273 TraceCheckUtils]: 17: Hoare triple {2096#true} assume !(~__VERIFIER_assert__cond~0 == 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-14 17:34:34,857 INFO L273 TraceCheckUtils]: 18: Hoare triple {2096#true} assume !(~__VERIFIER_assert__cond~1 == 0);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-14 17:34:34,870 INFO L273 TraceCheckUtils]: 19: Hoare triple {2096#true} assume !(~main____CPAchecker_TMP_0~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-14 17:34:34,872 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 !(~__VERIFIER_assert__cond~2 == 0);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-14 17:34:34,872 INFO L273 TraceCheckUtils]: 21: Hoare triple {2099#(< main_~main__cp~0 main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~3 == 0); {2099#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-14 17:34:34,874 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-14 17:34:34,874 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-14 17:34:34,876 INFO L273 TraceCheckUtils]: 24: Hoare triple {2100#(not (= 0 main_~__VERIFIER_assert__cond~4))} assume ~__VERIFIER_assert__cond~4 == 0; {2097#false} is VALID [2018-11-14 17:34:34,876 INFO L273 TraceCheckUtils]: 25: Hoare triple {2097#false} assume !false; {2097#false} is VALID [2018-11-14 17:34:34,877 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-14 17:34:34,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:34,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:34:34,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-14 17:34:34,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:34,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:34:34,908 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-14 17:34:34,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:34:34,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:34:34,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:34:34,909 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2018-11-14 17:34:35,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:35,525 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2018-11-14 17:34:35,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:34:35,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-14 17:34:35,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:35,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:35,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2018-11-14 17:34:35,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:35,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2018-11-14 17:34:35,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2018-11-14 17:34:35,672 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-14 17:34:35,674 INFO L225 Difference]: With dead ends: 108 [2018-11-14 17:34:35,674 INFO L226 Difference]: Without dead ends: 106 [2018-11-14 17:34:35,675 INFO L604 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-14 17:34:35,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-14 17:34:35,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2018-11-14 17:34:35,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:35,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 79 states. [2018-11-14 17:34:35,841 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 79 states. [2018-11-14 17:34:35,841 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 79 states. [2018-11-14 17:34:35,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:35,846 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2018-11-14 17:34:35,846 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-11-14 17:34:35,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:35,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:35,847 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 106 states. [2018-11-14 17:34:35,847 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 106 states. [2018-11-14 17:34:35,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:35,850 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2018-11-14 17:34:35,850 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-11-14 17:34:35,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:35,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:35,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:35,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:35,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-14 17:34:35,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-11-14 17:34:35,854 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2018-11-14 17:34:35,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:35,854 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-11-14 17:34:35,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:34:35,854 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-11-14 17:34:35,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 17:34:35,855 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:35,855 INFO L375 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-14 17:34:35,856 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:35,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:35,856 INFO L82 PathProgramCache]: Analyzing trace with hash -2106185532, now seen corresponding path program 1 times [2018-11-14 17:34:35,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:35,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:35,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:35,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:35,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:35,974 INFO L256 TraceCheckUtils]: 0: Hoare triple {2529#true} call ULTIMATE.init(); {2529#true} is VALID [2018-11-14 17:34:35,974 INFO L273 TraceCheckUtils]: 1: Hoare triple {2529#true} ~__return_main~0 := 0;~__return_375~0 := 0; {2529#true} is VALID [2018-11-14 17:34:35,975 INFO L273 TraceCheckUtils]: 2: Hoare triple {2529#true} assume true; {2529#true} is VALID [2018-11-14 17:34:35,975 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2529#true} {2529#true} #215#return; {2529#true} is VALID [2018-11-14 17:34:35,975 INFO L256 TraceCheckUtils]: 4: Hoare triple {2529#true} call #t~ret8 := main(); {2529#true} is VALID [2018-11-14 17:34:35,976 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-14 17:34:35,976 INFO L273 TraceCheckUtils]: 6: Hoare triple {2529#true} assume !!(~main__urilen~0 <= 1000000); {2529#true} is VALID [2018-11-14 17:34:35,976 INFO L273 TraceCheckUtils]: 7: Hoare triple {2529#true} assume !!(~main__urilen~0 >= -1000000); {2529#true} is VALID [2018-11-14 17:34:35,977 INFO L273 TraceCheckUtils]: 8: Hoare triple {2529#true} assume !!(~main__tokenlen~0 <= 1000000); {2529#true} is VALID [2018-11-14 17:34:35,977 INFO L273 TraceCheckUtils]: 9: Hoare triple {2529#true} assume !!(~main__tokenlen~0 >= -1000000); {2529#true} is VALID [2018-11-14 17:34:35,977 INFO L273 TraceCheckUtils]: 10: Hoare triple {2529#true} assume !!(~main__scheme~0 <= 1000000); {2529#true} is VALID [2018-11-14 17:34:35,977 INFO L273 TraceCheckUtils]: 11: Hoare triple {2529#true} assume !!(~main__scheme~0 >= -1000000); {2529#true} is VALID [2018-11-14 17:34:35,977 INFO L273 TraceCheckUtils]: 12: Hoare triple {2529#true} assume ~main__urilen~0 > 0; {2529#true} is VALID [2018-11-14 17:34:35,978 INFO L273 TraceCheckUtils]: 13: Hoare triple {2529#true} assume ~main__tokenlen~0 > 0; {2529#true} is VALID [2018-11-14 17:34:35,978 INFO L273 TraceCheckUtils]: 14: Hoare triple {2529#true} assume ~main__scheme~0 >= 0; {2529#true} is VALID [2018-11-14 17:34:35,978 INFO L273 TraceCheckUtils]: 15: Hoare triple {2529#true} assume !(~main__scheme~0 == 0); {2529#true} is VALID [2018-11-14 17:34:35,978 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-14 17:34:35,978 INFO L273 TraceCheckUtils]: 17: Hoare triple {2529#true} assume !(~__VERIFIER_assert__cond~0 == 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-14 17:34:35,979 INFO L273 TraceCheckUtils]: 18: Hoare triple {2529#true} assume !(~__VERIFIER_assert__cond~1 == 0);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-14 17:34:35,979 INFO L273 TraceCheckUtils]: 19: Hoare triple {2529#true} assume !(~main____CPAchecker_TMP_0~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-14 17:34:35,980 INFO L273 TraceCheckUtils]: 20: Hoare triple {2529#true} assume !(~__VERIFIER_assert__cond~2 == 0);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-14 17:34:35,980 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 !(~__VERIFIER_assert__cond~3 == 0); {2532#(<= 0 main_~main__cp~0)} is VALID [2018-11-14 17:34:35,980 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-14 17:34:35,981 INFO L273 TraceCheckUtils]: 23: Hoare triple {2532#(<= 0 main_~main__cp~0)} assume !!(~main____CPAchecker_TMP_1~0 == 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-14 17:34:35,981 INFO L273 TraceCheckUtils]: 24: Hoare triple {2532#(<= 0 main_~main__cp~0)} assume !(~__VERIFIER_assert__cond~16 == 0);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-14 17:34:35,982 INFO L273 TraceCheckUtils]: 25: Hoare triple {2533#(not (= 0 main_~__VERIFIER_assert__cond~17))} assume ~__VERIFIER_assert__cond~17 == 0; {2530#false} is VALID [2018-11-14 17:34:35,982 INFO L273 TraceCheckUtils]: 26: Hoare triple {2530#false} assume !false; {2530#false} is VALID [2018-11-14 17:34:35,984 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-14 17:34:35,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:35,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:34:35,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 17:34:35,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:35,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:34:36,034 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-14 17:34:36,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:34:36,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:34:36,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:34:36,035 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 5 states. [2018-11-14 17:34:36,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:36,517 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2018-11-14 17:34:36,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:34:36,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 17:34:36,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:36,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:36,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2018-11-14 17:34:36,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:36,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2018-11-14 17:34:36,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 125 transitions. [2018-11-14 17:34:36,703 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-14 17:34:36,705 INFO L225 Difference]: With dead ends: 121 [2018-11-14 17:34:36,705 INFO L226 Difference]: Without dead ends: 119 [2018-11-14 17:34:36,706 INFO L604 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-14 17:34:36,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-14 17:34:36,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2018-11-14 17:34:36,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:36,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 77 states. [2018-11-14 17:34:36,931 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 77 states. [2018-11-14 17:34:36,931 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 77 states. [2018-11-14 17:34:36,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:36,936 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2018-11-14 17:34:36,936 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2018-11-14 17:34:36,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:36,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:36,936 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 119 states. [2018-11-14 17:34:36,936 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 119 states. [2018-11-14 17:34:36,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:36,940 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2018-11-14 17:34:36,940 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2018-11-14 17:34:36,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:36,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:36,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:36,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:36,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-14 17:34:36,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-11-14 17:34:36,943 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2018-11-14 17:34:36,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:36,943 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-11-14 17:34:36,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:34:36,943 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-11-14 17:34:36,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 17:34:36,944 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:36,944 INFO L375 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-14 17:34:36,944 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:36,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:36,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1990437563, now seen corresponding path program 1 times [2018-11-14 17:34:36,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:36,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:36,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:36,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:36,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:37,073 INFO L256 TraceCheckUtils]: 0: Hoare triple {2999#true} call ULTIMATE.init(); {2999#true} is VALID [2018-11-14 17:34:37,073 INFO L273 TraceCheckUtils]: 1: Hoare triple {2999#true} ~__return_main~0 := 0;~__return_375~0 := 0; {2999#true} is VALID [2018-11-14 17:34:37,074 INFO L273 TraceCheckUtils]: 2: Hoare triple {2999#true} assume true; {2999#true} is VALID [2018-11-14 17:34:37,074 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2999#true} {2999#true} #215#return; {2999#true} is VALID [2018-11-14 17:34:37,074 INFO L256 TraceCheckUtils]: 4: Hoare triple {2999#true} call #t~ret8 := main(); {2999#true} is VALID [2018-11-14 17:34:37,075 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-14 17:34:37,075 INFO L273 TraceCheckUtils]: 6: Hoare triple {2999#true} assume !!(~main__urilen~0 <= 1000000); {2999#true} is VALID [2018-11-14 17:34:37,076 INFO L273 TraceCheckUtils]: 7: Hoare triple {2999#true} assume !!(~main__urilen~0 >= -1000000); {2999#true} is VALID [2018-11-14 17:34:37,076 INFO L273 TraceCheckUtils]: 8: Hoare triple {2999#true} assume !!(~main__tokenlen~0 <= 1000000); {2999#true} is VALID [2018-11-14 17:34:37,076 INFO L273 TraceCheckUtils]: 9: Hoare triple {2999#true} assume !!(~main__tokenlen~0 >= -1000000); {2999#true} is VALID [2018-11-14 17:34:37,076 INFO L273 TraceCheckUtils]: 10: Hoare triple {2999#true} assume !!(~main__scheme~0 <= 1000000); {2999#true} is VALID [2018-11-14 17:34:37,077 INFO L273 TraceCheckUtils]: 11: Hoare triple {2999#true} assume !!(~main__scheme~0 >= -1000000); {2999#true} is VALID [2018-11-14 17:34:37,077 INFO L273 TraceCheckUtils]: 12: Hoare triple {2999#true} assume ~main__urilen~0 > 0; {2999#true} is VALID [2018-11-14 17:34:37,077 INFO L273 TraceCheckUtils]: 13: Hoare triple {2999#true} assume ~main__tokenlen~0 > 0; {2999#true} is VALID [2018-11-14 17:34:37,077 INFO L273 TraceCheckUtils]: 14: Hoare triple {2999#true} assume ~main__scheme~0 >= 0; {2999#true} is VALID [2018-11-14 17:34:37,077 INFO L273 TraceCheckUtils]: 15: Hoare triple {2999#true} assume !(~main__scheme~0 == 0); {2999#true} is VALID [2018-11-14 17:34:37,078 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-14 17:34:37,078 INFO L273 TraceCheckUtils]: 17: Hoare triple {2999#true} assume !(~__VERIFIER_assert__cond~0 == 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-14 17:34:37,078 INFO L273 TraceCheckUtils]: 18: Hoare triple {2999#true} assume !(~__VERIFIER_assert__cond~1 == 0);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-14 17:34:37,078 INFO L273 TraceCheckUtils]: 19: Hoare triple {2999#true} assume !(~main____CPAchecker_TMP_0~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-14 17:34:37,079 INFO L273 TraceCheckUtils]: 20: Hoare triple {2999#true} assume !(~__VERIFIER_assert__cond~2 == 0);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-14 17:34:37,079 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 !(~__VERIFIER_assert__cond~3 == 0); {3002#(<= 0 main_~main__cp~0)} is VALID [2018-11-14 17:34:37,080 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-14 17:34:37,080 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-14 17:34:37,081 INFO L273 TraceCheckUtils]: 24: Hoare triple {3002#(<= 0 main_~main__cp~0)} assume !(~__VERIFIER_assert__cond~4 == 0);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-14 17:34:37,081 INFO L273 TraceCheckUtils]: 25: Hoare triple {3003#(not (= 0 main_~__VERIFIER_assert__cond~5))} assume ~__VERIFIER_assert__cond~5 == 0; {3000#false} is VALID [2018-11-14 17:34:37,081 INFO L273 TraceCheckUtils]: 26: Hoare triple {3000#false} assume !false; {3000#false} is VALID [2018-11-14 17:34:37,082 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-14 17:34:37,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:37,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:34:37,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 17:34:37,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:37,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:34:37,104 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-14 17:34:37,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:34:37,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:34:37,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:34:37,105 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2018-11-14 17:34:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:37,408 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-11-14 17:34:37,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:34:37,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 17:34:37,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:37,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:37,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2018-11-14 17:34:37,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:37,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2018-11-14 17:34:37,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 75 transitions. [2018-11-14 17:34:37,805 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-14 17:34:37,806 INFO L225 Difference]: With dead ends: 77 [2018-11-14 17:34:37,806 INFO L226 Difference]: Without dead ends: 75 [2018-11-14 17:34:37,807 INFO L604 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-14 17:34:37,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-14 17:34:37,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-14 17:34:37,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:37,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 75 states. [2018-11-14 17:34:37,941 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 75 states. [2018-11-14 17:34:37,941 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 75 states. [2018-11-14 17:34:37,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:37,946 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-11-14 17:34:37,946 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-11-14 17:34:37,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:37,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:37,946 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 75 states. [2018-11-14 17:34:37,946 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 75 states. [2018-11-14 17:34:37,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:37,949 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-11-14 17:34:37,949 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-11-14 17:34:37,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:37,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:37,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:37,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:37,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-14 17:34:37,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-11-14 17:34:37,951 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2018-11-14 17:34:37,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:37,952 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-11-14 17:34:37,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:34:37,952 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-11-14 17:34:37,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 17:34:37,952 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:37,953 INFO L375 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-14 17:34:37,953 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:37,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:37,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1549950965, now seen corresponding path program 1 times [2018-11-14 17:34:37,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:37,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:37,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:37,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:37,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:38,018 INFO L256 TraceCheckUtils]: 0: Hoare triple {3332#true} call ULTIMATE.init(); {3332#true} is VALID [2018-11-14 17:34:38,018 INFO L273 TraceCheckUtils]: 1: Hoare triple {3332#true} ~__return_main~0 := 0;~__return_375~0 := 0; {3332#true} is VALID [2018-11-14 17:34:38,018 INFO L273 TraceCheckUtils]: 2: Hoare triple {3332#true} assume true; {3332#true} is VALID [2018-11-14 17:34:38,019 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3332#true} {3332#true} #215#return; {3332#true} is VALID [2018-11-14 17:34:38,019 INFO L256 TraceCheckUtils]: 4: Hoare triple {3332#true} call #t~ret8 := main(); {3332#true} is VALID [2018-11-14 17:34:38,019 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-14 17:34:38,019 INFO L273 TraceCheckUtils]: 6: Hoare triple {3332#true} assume !!(~main__urilen~0 <= 1000000); {3332#true} is VALID [2018-11-14 17:34:38,020 INFO L273 TraceCheckUtils]: 7: Hoare triple {3332#true} assume !!(~main__urilen~0 >= -1000000); {3332#true} is VALID [2018-11-14 17:34:38,020 INFO L273 TraceCheckUtils]: 8: Hoare triple {3332#true} assume !!(~main__tokenlen~0 <= 1000000); {3332#true} is VALID [2018-11-14 17:34:38,020 INFO L273 TraceCheckUtils]: 9: Hoare triple {3332#true} assume !!(~main__tokenlen~0 >= -1000000); {3332#true} is VALID [2018-11-14 17:34:38,020 INFO L273 TraceCheckUtils]: 10: Hoare triple {3332#true} assume !!(~main__scheme~0 <= 1000000); {3332#true} is VALID [2018-11-14 17:34:38,020 INFO L273 TraceCheckUtils]: 11: Hoare triple {3332#true} assume !!(~main__scheme~0 >= -1000000); {3332#true} is VALID [2018-11-14 17:34:38,021 INFO L273 TraceCheckUtils]: 12: Hoare triple {3332#true} assume ~main__urilen~0 > 0; {3332#true} is VALID [2018-11-14 17:34:38,021 INFO L273 TraceCheckUtils]: 13: Hoare triple {3332#true} assume ~main__tokenlen~0 > 0; {3332#true} is VALID [2018-11-14 17:34:38,021 INFO L273 TraceCheckUtils]: 14: Hoare triple {3332#true} assume ~main__scheme~0 >= 0; {3332#true} is VALID [2018-11-14 17:34:38,021 INFO L273 TraceCheckUtils]: 15: Hoare triple {3332#true} assume !(~main__scheme~0 == 0); {3332#true} is VALID [2018-11-14 17:34:38,022 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-14 17:34:38,022 INFO L273 TraceCheckUtils]: 17: Hoare triple {3332#true} assume !(~__VERIFIER_assert__cond~0 == 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-14 17:34:38,022 INFO L273 TraceCheckUtils]: 18: Hoare triple {3332#true} assume !(~__VERIFIER_assert__cond~1 == 0);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-14 17:34:38,022 INFO L273 TraceCheckUtils]: 19: Hoare triple {3332#true} assume !(~main____CPAchecker_TMP_0~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-14 17:34:38,022 INFO L273 TraceCheckUtils]: 20: Hoare triple {3332#true} assume !(~__VERIFIER_assert__cond~2 == 0);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-14 17:34:38,023 INFO L273 TraceCheckUtils]: 21: Hoare triple {3332#true} assume !(~__VERIFIER_assert__cond~3 == 0); {3332#true} is VALID [2018-11-14 17:34:38,024 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-14 17:34:38,024 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-14 17:34:38,026 INFO L273 TraceCheckUtils]: 24: Hoare triple {3334#(= main_~main__urilen~0 (+ main_~main__cp~0 1))} assume !(~__VERIFIER_assert__cond~4 == 0);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-14 17:34:38,028 INFO L273 TraceCheckUtils]: 25: Hoare triple {3334#(= main_~main__urilen~0 (+ main_~main__cp~0 1))} assume !(~__VERIFIER_assert__cond~5 == 0); {3334#(= main_~main__urilen~0 (+ main_~main__cp~0 1))} is VALID [2018-11-14 17:34:38,028 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 ~main__cp~0 + 1 < ~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-14 17:34:38,028 INFO L273 TraceCheckUtils]: 27: Hoare triple {3333#false} assume ~__VERIFIER_assert__cond~6 == 0; {3333#false} is VALID [2018-11-14 17:34:38,029 INFO L273 TraceCheckUtils]: 28: Hoare triple {3333#false} assume !false; {3333#false} is VALID [2018-11-14 17:34:38,029 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-14 17:34:38,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:38,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:34:38,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 17:34:38,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:38,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:34:38,098 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-14 17:34:38,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:34:38,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:34:38,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:34:38,099 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 3 states. [2018-11-14 17:34:38,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:38,376 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-11-14 17:34:38,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:34:38,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 17:34:38,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:38,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:34:38,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2018-11-14 17:34:38,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:34:38,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2018-11-14 17:34:38,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2018-11-14 17:34:38,491 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-14 17:34:38,492 INFO L225 Difference]: With dead ends: 115 [2018-11-14 17:34:38,493 INFO L226 Difference]: Without dead ends: 75 [2018-11-14 17:34:38,494 INFO L604 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-14 17:34:38,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-14 17:34:38,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-14 17:34:38,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:38,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 75 states. [2018-11-14 17:34:38,548 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 75 states. [2018-11-14 17:34:38,548 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 75 states. [2018-11-14 17:34:38,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:38,551 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-11-14 17:34:38,552 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-11-14 17:34:38,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:38,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:38,552 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 75 states. [2018-11-14 17:34:38,552 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 75 states. [2018-11-14 17:34:38,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:38,554 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-11-14 17:34:38,554 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-11-14 17:34:38,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:38,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:38,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:38,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:38,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-14 17:34:38,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2018-11-14 17:34:38,557 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2018-11-14 17:34:38,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:38,558 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2018-11-14 17:34:38,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:34:38,558 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-11-14 17:34:38,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 17:34:38,558 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:38,558 INFO L375 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-14 17:34:38,559 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:38,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:38,560 INFO L82 PathProgramCache]: Analyzing trace with hash 54388864, now seen corresponding path program 1 times [2018-11-14 17:34:38,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:38,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:38,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:38,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:38,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:39,010 INFO L256 TraceCheckUtils]: 0: Hoare triple {3700#true} call ULTIMATE.init(); {3700#true} is VALID [2018-11-14 17:34:39,011 INFO L273 TraceCheckUtils]: 1: Hoare triple {3700#true} ~__return_main~0 := 0;~__return_375~0 := 0; {3700#true} is VALID [2018-11-14 17:34:39,011 INFO L273 TraceCheckUtils]: 2: Hoare triple {3700#true} assume true; {3700#true} is VALID [2018-11-14 17:34:39,012 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3700#true} {3700#true} #215#return; {3700#true} is VALID [2018-11-14 17:34:39,012 INFO L256 TraceCheckUtils]: 4: Hoare triple {3700#true} call #t~ret8 := main(); {3700#true} is VALID [2018-11-14 17:34:39,012 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-14 17:34:39,012 INFO L273 TraceCheckUtils]: 6: Hoare triple {3700#true} assume !!(~main__urilen~0 <= 1000000); {3700#true} is VALID [2018-11-14 17:34:39,013 INFO L273 TraceCheckUtils]: 7: Hoare triple {3700#true} assume !!(~main__urilen~0 >= -1000000); {3700#true} is VALID [2018-11-14 17:34:39,013 INFO L273 TraceCheckUtils]: 8: Hoare triple {3700#true} assume !!(~main__tokenlen~0 <= 1000000); {3700#true} is VALID [2018-11-14 17:34:39,013 INFO L273 TraceCheckUtils]: 9: Hoare triple {3700#true} assume !!(~main__tokenlen~0 >= -1000000); {3700#true} is VALID [2018-11-14 17:34:39,013 INFO L273 TraceCheckUtils]: 10: Hoare triple {3700#true} assume !!(~main__scheme~0 <= 1000000); {3700#true} is VALID [2018-11-14 17:34:39,013 INFO L273 TraceCheckUtils]: 11: Hoare triple {3700#true} assume !!(~main__scheme~0 >= -1000000); {3700#true} is VALID [2018-11-14 17:34:39,014 INFO L273 TraceCheckUtils]: 12: Hoare triple {3700#true} assume ~main__urilen~0 > 0; {3700#true} is VALID [2018-11-14 17:34:39,014 INFO L273 TraceCheckUtils]: 13: Hoare triple {3700#true} assume ~main__tokenlen~0 > 0; {3700#true} is VALID [2018-11-14 17:34:39,014 INFO L273 TraceCheckUtils]: 14: Hoare triple {3700#true} assume ~main__scheme~0 >= 0; {3700#true} is VALID [2018-11-14 17:34:39,014 INFO L273 TraceCheckUtils]: 15: Hoare triple {3700#true} assume !(~main__scheme~0 == 0); {3700#true} is VALID [2018-11-14 17:34:39,015 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-14 17:34:39,015 INFO L273 TraceCheckUtils]: 17: Hoare triple {3702#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} assume !(~__VERIFIER_assert__cond~0 == 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-14 17:34:39,015 INFO L273 TraceCheckUtils]: 18: Hoare triple {3700#true} assume !(~__VERIFIER_assert__cond~1 == 0);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-14 17:34:39,016 INFO L273 TraceCheckUtils]: 19: Hoare triple {3700#true} assume !(~main____CPAchecker_TMP_0~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-14 17:34:39,017 INFO L273 TraceCheckUtils]: 20: Hoare triple {3703#(or (= 0 main_~__VERIFIER_assert__cond~2) (<= (+ main_~main__cp~0 1) main_~main__urilen~0))} assume !(~__VERIFIER_assert__cond~2 == 0);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-14 17:34:39,017 INFO L273 TraceCheckUtils]: 21: Hoare triple {3704#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~3 == 0); {3704#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-14 17:34:39,018 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-14 17:34:39,018 INFO L273 TraceCheckUtils]: 23: Hoare triple {3705#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~main____CPAchecker_TMP_1~0 == 0); {3705#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-14 17:34:39,019 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-14 17:34:39,019 INFO L273 TraceCheckUtils]: 25: Hoare triple {3705#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~4 == 0);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-14 17:34:39,019 INFO L273 TraceCheckUtils]: 26: Hoare triple {3705#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~5 == 0); {3705#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-14 17:34:39,020 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 ~main__cp~0 + 1 < ~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-14 17:34:39,021 INFO L273 TraceCheckUtils]: 28: Hoare triple {3706#(not (= 0 main_~__VERIFIER_assert__cond~6))} assume ~__VERIFIER_assert__cond~6 == 0; {3701#false} is VALID [2018-11-14 17:34:39,021 INFO L273 TraceCheckUtils]: 29: Hoare triple {3701#false} assume !false; {3701#false} is VALID [2018-11-14 17:34:39,022 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-14 17:34:39,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:39,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 17:34:39,024 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-14 17:34:39,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:39,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:34:39,079 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-14 17:34:39,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:34:39,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:34:39,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:34:39,080 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 7 states. [2018-11-14 17:34:39,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:39,548 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-11-14 17:34:39,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:34:39,548 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-14 17:34:39,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:39,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:34:39,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2018-11-14 17:34:39,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:34:39,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2018-11-14 17:34:39,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2018-11-14 17:34:39,704 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-14 17:34:39,706 INFO L225 Difference]: With dead ends: 76 [2018-11-14 17:34:39,706 INFO L226 Difference]: Without dead ends: 74 [2018-11-14 17:34:39,707 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:34:39,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-14 17:34:39,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-11-14 17:34:39,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:39,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 73 states. [2018-11-14 17:34:39,783 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 73 states. [2018-11-14 17:34:39,784 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 73 states. [2018-11-14 17:34:39,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:39,786 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-11-14 17:34:39,786 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-14 17:34:39,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:39,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:39,787 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 74 states. [2018-11-14 17:34:39,787 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 74 states. [2018-11-14 17:34:39,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:39,788 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-11-14 17:34:39,789 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-14 17:34:39,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:39,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:39,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:39,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:39,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-14 17:34:39,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-11-14 17:34:39,791 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2018-11-14 17:34:39,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:39,791 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-11-14 17:34:39,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:34:39,791 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-11-14 17:34:39,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 17:34:39,792 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:39,792 INFO L375 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-14 17:34:39,793 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:39,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:39,793 INFO L82 PathProgramCache]: Analyzing trace with hash -196719107, now seen corresponding path program 1 times [2018-11-14 17:34:39,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:39,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:39,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:39,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:39,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:39,958 INFO L256 TraceCheckUtils]: 0: Hoare triple {4036#true} call ULTIMATE.init(); {4036#true} is VALID [2018-11-14 17:34:39,959 INFO L273 TraceCheckUtils]: 1: Hoare triple {4036#true} ~__return_main~0 := 0;~__return_375~0 := 0; {4036#true} is VALID [2018-11-14 17:34:39,959 INFO L273 TraceCheckUtils]: 2: Hoare triple {4036#true} assume true; {4036#true} is VALID [2018-11-14 17:34:39,960 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4036#true} {4036#true} #215#return; {4036#true} is VALID [2018-11-14 17:34:39,960 INFO L256 TraceCheckUtils]: 4: Hoare triple {4036#true} call #t~ret8 := main(); {4036#true} is VALID [2018-11-14 17:34:39,961 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-14 17:34:39,961 INFO L273 TraceCheckUtils]: 6: Hoare triple {4036#true} assume !!(~main__urilen~0 <= 1000000); {4036#true} is VALID [2018-11-14 17:34:39,961 INFO L273 TraceCheckUtils]: 7: Hoare triple {4036#true} assume !!(~main__urilen~0 >= -1000000); {4036#true} is VALID [2018-11-14 17:34:39,962 INFO L273 TraceCheckUtils]: 8: Hoare triple {4036#true} assume !!(~main__tokenlen~0 <= 1000000); {4036#true} is VALID [2018-11-14 17:34:39,962 INFO L273 TraceCheckUtils]: 9: Hoare triple {4036#true} assume !!(~main__tokenlen~0 >= -1000000); {4036#true} is VALID [2018-11-14 17:34:39,962 INFO L273 TraceCheckUtils]: 10: Hoare triple {4036#true} assume !!(~main__scheme~0 <= 1000000); {4036#true} is VALID [2018-11-14 17:34:39,963 INFO L273 TraceCheckUtils]: 11: Hoare triple {4036#true} assume !!(~main__scheme~0 >= -1000000); {4036#true} is VALID [2018-11-14 17:34:39,963 INFO L273 TraceCheckUtils]: 12: Hoare triple {4036#true} assume ~main__urilen~0 > 0; {4036#true} is VALID [2018-11-14 17:34:39,963 INFO L273 TraceCheckUtils]: 13: Hoare triple {4036#true} assume ~main__tokenlen~0 > 0; {4036#true} is VALID [2018-11-14 17:34:39,963 INFO L273 TraceCheckUtils]: 14: Hoare triple {4036#true} assume ~main__scheme~0 >= 0; {4036#true} is VALID [2018-11-14 17:34:39,964 INFO L273 TraceCheckUtils]: 15: Hoare triple {4036#true} assume !(~main__scheme~0 == 0); {4036#true} is VALID [2018-11-14 17:34:39,964 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-14 17:34:39,965 INFO L273 TraceCheckUtils]: 17: Hoare triple {4038#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} assume !(~__VERIFIER_assert__cond~0 == 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-14 17:34:39,965 INFO L273 TraceCheckUtils]: 18: Hoare triple {4036#true} assume !(~__VERIFIER_assert__cond~1 == 0);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-14 17:34:39,965 INFO L273 TraceCheckUtils]: 19: Hoare triple {4036#true} assume !(~main____CPAchecker_TMP_0~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-14 17:34:39,966 INFO L273 TraceCheckUtils]: 20: Hoare triple {4039#(or (= 0 main_~__VERIFIER_assert__cond~2) (<= (+ main_~main__cp~0 1) main_~main__urilen~0))} assume !(~__VERIFIER_assert__cond~2 == 0);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-14 17:34:39,967 INFO L273 TraceCheckUtils]: 21: Hoare triple {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~3 == 0); {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-14 17:34:39,967 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-14 17:34:39,968 INFO L273 TraceCheckUtils]: 23: Hoare triple {4041#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(~main____CPAchecker_TMP_1~0 == 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-14 17:34:39,968 INFO L273 TraceCheckUtils]: 24: Hoare triple {4041#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~16 == 0);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-14 17:34:39,969 INFO L273 TraceCheckUtils]: 25: Hoare triple {4041#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~17 == 0);~main__cp~0 := ~main__cp~0 + 1; {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-14 17:34:39,969 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-14 17:34:39,970 INFO L273 TraceCheckUtils]: 27: Hoare triple {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(~main____CPAchecker_TMP_1~0 == 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-14 17:34:39,971 INFO L273 TraceCheckUtils]: 28: Hoare triple {4042#(not (= 0 main_~__VERIFIER_assert__cond~16))} assume ~__VERIFIER_assert__cond~16 == 0; {4037#false} is VALID [2018-11-14 17:34:39,971 INFO L273 TraceCheckUtils]: 29: Hoare triple {4037#false} assume !false; {4037#false} is VALID [2018-11-14 17:34:39,972 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-14 17:34:39,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:34:39,973 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-14 17:34:39,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:40,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:34:40,552 INFO L256 TraceCheckUtils]: 0: Hoare triple {4036#true} call ULTIMATE.init(); {4036#true} is VALID [2018-11-14 17:34:40,552 INFO L273 TraceCheckUtils]: 1: Hoare triple {4036#true} ~__return_main~0 := 0;~__return_375~0 := 0; {4036#true} is VALID [2018-11-14 17:34:40,552 INFO L273 TraceCheckUtils]: 2: Hoare triple {4036#true} assume true; {4036#true} is VALID [2018-11-14 17:34:40,552 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4036#true} {4036#true} #215#return; {4036#true} is VALID [2018-11-14 17:34:40,553 INFO L256 TraceCheckUtils]: 4: Hoare triple {4036#true} call #t~ret8 := main(); {4036#true} is VALID [2018-11-14 17:34:40,553 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-14 17:34:40,553 INFO L273 TraceCheckUtils]: 6: Hoare triple {4036#true} assume !!(~main__urilen~0 <= 1000000); {4036#true} is VALID [2018-11-14 17:34:40,553 INFO L273 TraceCheckUtils]: 7: Hoare triple {4036#true} assume !!(~main__urilen~0 >= -1000000); {4036#true} is VALID [2018-11-14 17:34:40,554 INFO L273 TraceCheckUtils]: 8: Hoare triple {4036#true} assume !!(~main__tokenlen~0 <= 1000000); {4036#true} is VALID [2018-11-14 17:34:40,554 INFO L273 TraceCheckUtils]: 9: Hoare triple {4036#true} assume !!(~main__tokenlen~0 >= -1000000); {4036#true} is VALID [2018-11-14 17:34:40,554 INFO L273 TraceCheckUtils]: 10: Hoare triple {4036#true} assume !!(~main__scheme~0 <= 1000000); {4036#true} is VALID [2018-11-14 17:34:40,554 INFO L273 TraceCheckUtils]: 11: Hoare triple {4036#true} assume !!(~main__scheme~0 >= -1000000); {4036#true} is VALID [2018-11-14 17:34:40,554 INFO L273 TraceCheckUtils]: 12: Hoare triple {4036#true} assume ~main__urilen~0 > 0; {4036#true} is VALID [2018-11-14 17:34:40,555 INFO L273 TraceCheckUtils]: 13: Hoare triple {4036#true} assume ~main__tokenlen~0 > 0; {4036#true} is VALID [2018-11-14 17:34:40,555 INFO L273 TraceCheckUtils]: 14: Hoare triple {4036#true} assume ~main__scheme~0 >= 0; {4036#true} is VALID [2018-11-14 17:34:40,555 INFO L273 TraceCheckUtils]: 15: Hoare triple {4036#true} assume !(~main__scheme~0 == 0); {4036#true} is VALID [2018-11-14 17:34:40,564 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-14 17:34:40,578 INFO L273 TraceCheckUtils]: 17: Hoare triple {4094#(and (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~0 1))} assume !(~__VERIFIER_assert__cond~0 == 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-14 17:34:40,587 INFO L273 TraceCheckUtils]: 18: Hoare triple {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~1 == 0);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-14 17:34:40,601 INFO L273 TraceCheckUtils]: 19: Hoare triple {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~main____CPAchecker_TMP_0~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-14 17:34:40,610 INFO L273 TraceCheckUtils]: 20: Hoare triple {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~2 == 0);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-14 17:34:40,625 INFO L273 TraceCheckUtils]: 21: Hoare triple {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~3 == 0); {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-14 17:34:40,626 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-14 17:34:40,627 INFO L273 TraceCheckUtils]: 23: Hoare triple {4041#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(~main____CPAchecker_TMP_1~0 == 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-14 17:34:40,627 INFO L273 TraceCheckUtils]: 24: Hoare triple {4041#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~16 == 0);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-14 17:34:40,644 INFO L273 TraceCheckUtils]: 25: Hoare triple {4041#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~17 == 0);~main__cp~0 := ~main__cp~0 + 1; {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-14 17:34:40,653 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-14 17:34:40,665 INFO L273 TraceCheckUtils]: 27: Hoare triple {4040#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(~main____CPAchecker_TMP_1~0 == 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-14 17:34:40,675 INFO L273 TraceCheckUtils]: 28: Hoare triple {4128#(= main_~__VERIFIER_assert__cond~16 1)} assume ~__VERIFIER_assert__cond~16 == 0; {4037#false} is VALID [2018-11-14 17:34:40,675 INFO L273 TraceCheckUtils]: 29: Hoare triple {4037#false} assume !false; {4037#false} is VALID [2018-11-14 17:34:40,676 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-14 17:34:40,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:34:40,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-11-14 17:34:40,712 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-11-14 17:34:40,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:40,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:34:40,819 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-14 17:34:40,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:34:40,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:34:40,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:34:40,820 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 9 states. [2018-11-14 17:34:41,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:41,638 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-11-14 17:34:41,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:34:41,638 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-11-14 17:34:41,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:41,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:34:41,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2018-11-14 17:34:41,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:34:41,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2018-11-14 17:34:41,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 114 transitions. [2018-11-14 17:34:41,837 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-14 17:34:41,840 INFO L225 Difference]: With dead ends: 111 [2018-11-14 17:34:41,840 INFO L226 Difference]: Without dead ends: 109 [2018-11-14 17:34:41,840 INFO L604 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-14 17:34:41,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-14 17:34:41,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2018-11-14 17:34:41,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:41,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 70 states. [2018-11-14 17:34:41,901 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 70 states. [2018-11-14 17:34:41,901 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 70 states. [2018-11-14 17:34:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:41,904 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-11-14 17:34:41,904 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-11-14 17:34:41,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:41,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:41,905 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 109 states. [2018-11-14 17:34:41,905 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 109 states. [2018-11-14 17:34:41,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:41,908 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-11-14 17:34:41,909 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-11-14 17:34:41,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:41,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:41,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:41,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:41,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-14 17:34:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-11-14 17:34:41,910 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2018-11-14 17:34:41,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:41,910 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-11-14 17:34:41,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:34:41,911 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-11-14 17:34:41,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 17:34:41,911 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:41,911 INFO L375 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-14 17:34:41,911 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:41,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:41,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1686057932, now seen corresponding path program 1 times [2018-11-14 17:34:41,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:41,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:41,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:41,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:41,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:42,061 INFO L256 TraceCheckUtils]: 0: Hoare triple {4563#true} call ULTIMATE.init(); {4563#true} is VALID [2018-11-14 17:34:42,062 INFO L273 TraceCheckUtils]: 1: Hoare triple {4563#true} ~__return_main~0 := 0;~__return_375~0 := 0; {4563#true} is VALID [2018-11-14 17:34:42,062 INFO L273 TraceCheckUtils]: 2: Hoare triple {4563#true} assume true; {4563#true} is VALID [2018-11-14 17:34:42,063 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4563#true} {4563#true} #215#return; {4563#true} is VALID [2018-11-14 17:34:42,063 INFO L256 TraceCheckUtils]: 4: Hoare triple {4563#true} call #t~ret8 := main(); {4563#true} is VALID [2018-11-14 17:34:42,063 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-14 17:34:42,064 INFO L273 TraceCheckUtils]: 6: Hoare triple {4563#true} assume !!(~main__urilen~0 <= 1000000); {4563#true} is VALID [2018-11-14 17:34:42,064 INFO L273 TraceCheckUtils]: 7: Hoare triple {4563#true} assume !!(~main__urilen~0 >= -1000000); {4563#true} is VALID [2018-11-14 17:34:42,064 INFO L273 TraceCheckUtils]: 8: Hoare triple {4563#true} assume !!(~main__tokenlen~0 <= 1000000); {4563#true} is VALID [2018-11-14 17:34:42,064 INFO L273 TraceCheckUtils]: 9: Hoare triple {4563#true} assume !!(~main__tokenlen~0 >= -1000000); {4563#true} is VALID [2018-11-14 17:34:42,065 INFO L273 TraceCheckUtils]: 10: Hoare triple {4563#true} assume !!(~main__scheme~0 <= 1000000); {4563#true} is VALID [2018-11-14 17:34:42,065 INFO L273 TraceCheckUtils]: 11: Hoare triple {4563#true} assume !!(~main__scheme~0 >= -1000000); {4563#true} is VALID [2018-11-14 17:34:42,065 INFO L273 TraceCheckUtils]: 12: Hoare triple {4563#true} assume ~main__urilen~0 > 0; {4563#true} is VALID [2018-11-14 17:34:42,065 INFO L273 TraceCheckUtils]: 13: Hoare triple {4563#true} assume ~main__tokenlen~0 > 0; {4563#true} is VALID [2018-11-14 17:34:42,065 INFO L273 TraceCheckUtils]: 14: Hoare triple {4563#true} assume ~main__scheme~0 >= 0; {4563#true} is VALID [2018-11-14 17:34:42,066 INFO L273 TraceCheckUtils]: 15: Hoare triple {4563#true} assume !(~main__scheme~0 == 0); {4563#true} is VALID [2018-11-14 17:34:42,066 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-14 17:34:42,067 INFO L273 TraceCheckUtils]: 17: Hoare triple {4565#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} assume !(~__VERIFIER_assert__cond~0 == 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-14 17:34:42,068 INFO L273 TraceCheckUtils]: 18: Hoare triple {4566#(or (= 0 main_~__VERIFIER_assert__cond~1) (<= 1 main_~main__cp~0))} assume !(~__VERIFIER_assert__cond~1 == 0);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-14 17:34:42,068 INFO L273 TraceCheckUtils]: 19: Hoare triple {4567#(<= 1 main_~main__cp~0)} assume !(~main____CPAchecker_TMP_0~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-14 17:34:42,069 INFO L273 TraceCheckUtils]: 20: Hoare triple {4567#(<= 1 main_~main__cp~0)} assume !(~__VERIFIER_assert__cond~2 == 0);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-14 17:34:42,070 INFO L273 TraceCheckUtils]: 21: Hoare triple {4567#(<= 1 main_~main__cp~0)} assume !(~__VERIFIER_assert__cond~3 == 0); {4567#(<= 1 main_~main__cp~0)} is VALID [2018-11-14 17:34:42,070 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-14 17:34:42,071 INFO L273 TraceCheckUtils]: 23: Hoare triple {4567#(<= 1 main_~main__cp~0)} assume !(~main____CPAchecker_TMP_1~0 == 0); {4567#(<= 1 main_~main__cp~0)} is VALID [2018-11-14 17:34:42,072 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-14 17:34:42,072 INFO L273 TraceCheckUtils]: 25: Hoare triple {4567#(<= 1 main_~main__cp~0)} assume !(~__VERIFIER_assert__cond~4 == 0);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-14 17:34:42,073 INFO L273 TraceCheckUtils]: 26: Hoare triple {4567#(<= 1 main_~main__cp~0)} assume !(~__VERIFIER_assert__cond~5 == 0); {4567#(<= 1 main_~main__cp~0)} is VALID [2018-11-14 17:34:42,074 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 ~main__cp~0 + 1 < ~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-14 17:34:42,075 INFO L273 TraceCheckUtils]: 28: Hoare triple {4567#(<= 1 main_~main__cp~0)} assume !(~__VERIFIER_assert__cond~6 == 0);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__cp~0 + 1 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-14 17:34:42,075 INFO L273 TraceCheckUtils]: 29: Hoare triple {4568#(not (= 0 main_~__VERIFIER_assert__cond~7))} assume ~__VERIFIER_assert__cond~7 == 0; {4564#false} is VALID [2018-11-14 17:34:42,076 INFO L273 TraceCheckUtils]: 30: Hoare triple {4564#false} assume !false; {4564#false} is VALID [2018-11-14 17:34:42,078 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-14 17:34:42,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:42,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:34:42,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-14 17:34:42,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:42,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:34:42,111 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-14 17:34:42,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:34:42,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:34:42,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:34:42,112 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 6 states. [2018-11-14 17:34:42,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:42,500 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-11-14 17:34:42,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:34:42,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-14 17:34:42,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:42,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:42,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2018-11-14 17:34:42,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2018-11-14 17:34:42,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 68 transitions. [2018-11-14 17:34:42,576 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-14 17:34:42,578 INFO L225 Difference]: With dead ends: 70 [2018-11-14 17:34:42,578 INFO L226 Difference]: Without dead ends: 68 [2018-11-14 17:34:42,579 INFO L604 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-14 17:34:42,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-14 17:34:42,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-14 17:34:42,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:42,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 68 states. [2018-11-14 17:34:42,655 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2018-11-14 17:34:42,655 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2018-11-14 17:34:42,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:42,657 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-11-14 17:34:42,658 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-14 17:34:42,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:42,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:42,658 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2018-11-14 17:34:42,658 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2018-11-14 17:34:42,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:42,660 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-11-14 17:34:42,660 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-14 17:34:42,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:42,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:42,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:42,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:42,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 17:34:42,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-11-14 17:34:42,663 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2018-11-14 17:34:42,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:42,664 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-11-14 17:34:42,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:34:42,664 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-14 17:34:42,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 17:34:42,664 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:42,665 INFO L375 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-14 17:34:42,665 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:42,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:42,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1806773561, now seen corresponding path program 1 times [2018-11-14 17:34:42,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:42,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:42,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:42,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:42,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:43,190 INFO L256 TraceCheckUtils]: 0: Hoare triple {4871#true} call ULTIMATE.init(); {4871#true} is VALID [2018-11-14 17:34:43,190 INFO L273 TraceCheckUtils]: 1: Hoare triple {4871#true} ~__return_main~0 := 0;~__return_375~0 := 0; {4871#true} is VALID [2018-11-14 17:34:43,190 INFO L273 TraceCheckUtils]: 2: Hoare triple {4871#true} assume true; {4871#true} is VALID [2018-11-14 17:34:43,191 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4871#true} {4871#true} #215#return; {4871#true} is VALID [2018-11-14 17:34:43,191 INFO L256 TraceCheckUtils]: 4: Hoare triple {4871#true} call #t~ret8 := main(); {4871#true} is VALID [2018-11-14 17:34:43,191 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-14 17:34:43,192 INFO L273 TraceCheckUtils]: 6: Hoare triple {4871#true} assume !!(~main__urilen~0 <= 1000000); {4871#true} is VALID [2018-11-14 17:34:43,192 INFO L273 TraceCheckUtils]: 7: Hoare triple {4871#true} assume !!(~main__urilen~0 >= -1000000); {4871#true} is VALID [2018-11-14 17:34:43,192 INFO L273 TraceCheckUtils]: 8: Hoare triple {4871#true} assume !!(~main__tokenlen~0 <= 1000000); {4871#true} is VALID [2018-11-14 17:34:43,193 INFO L273 TraceCheckUtils]: 9: Hoare triple {4871#true} assume !!(~main__tokenlen~0 >= -1000000); {4871#true} is VALID [2018-11-14 17:34:43,193 INFO L273 TraceCheckUtils]: 10: Hoare triple {4871#true} assume !!(~main__scheme~0 <= 1000000); {4871#true} is VALID [2018-11-14 17:34:43,194 INFO L273 TraceCheckUtils]: 11: Hoare triple {4871#true} assume !!(~main__scheme~0 >= -1000000); {4871#true} is VALID [2018-11-14 17:34:43,194 INFO L273 TraceCheckUtils]: 12: Hoare triple {4871#true} assume ~main__urilen~0 > 0; {4871#true} is VALID [2018-11-14 17:34:43,195 INFO L273 TraceCheckUtils]: 13: Hoare triple {4871#true} assume ~main__tokenlen~0 > 0; {4871#true} is VALID [2018-11-14 17:34:43,195 INFO L273 TraceCheckUtils]: 14: Hoare triple {4871#true} assume ~main__scheme~0 >= 0; {4871#true} is VALID [2018-11-14 17:34:43,195 INFO L273 TraceCheckUtils]: 15: Hoare triple {4871#true} assume !(~main__scheme~0 == 0); {4871#true} is VALID [2018-11-14 17:34:43,202 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-14 17:34:43,202 INFO L273 TraceCheckUtils]: 17: Hoare triple {4873#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} assume !(~__VERIFIER_assert__cond~0 == 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-14 17:34:43,202 INFO L273 TraceCheckUtils]: 18: Hoare triple {4871#true} assume !(~__VERIFIER_assert__cond~1 == 0);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-14 17:34:43,203 INFO L273 TraceCheckUtils]: 19: Hoare triple {4871#true} assume !(~main____CPAchecker_TMP_0~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-14 17:34:43,204 INFO L273 TraceCheckUtils]: 20: Hoare triple {4874#(or (= 0 main_~__VERIFIER_assert__cond~2) (<= (+ main_~main__cp~0 1) main_~main__urilen~0))} assume !(~__VERIFIER_assert__cond~2 == 0);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-14 17:34:43,204 INFO L273 TraceCheckUtils]: 21: Hoare triple {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~3 == 0); {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-14 17:34:43,205 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-14 17:34:43,205 INFO L273 TraceCheckUtils]: 23: Hoare triple {4876#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(~main____CPAchecker_TMP_1~0 == 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-14 17:34:43,206 INFO L273 TraceCheckUtils]: 24: Hoare triple {4876#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~16 == 0);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-14 17:34:43,207 INFO L273 TraceCheckUtils]: 25: Hoare triple {4876#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~17 == 0);~main__cp~0 := ~main__cp~0 + 1; {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-14 17:34:43,207 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-14 17:34:43,208 INFO L273 TraceCheckUtils]: 27: Hoare triple {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~main____CPAchecker_TMP_1~0 == 0); {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-14 17:34:43,209 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-14 17:34:43,210 INFO L273 TraceCheckUtils]: 29: Hoare triple {4877#(not (= 0 main_~__VERIFIER_assert__cond~4))} assume ~__VERIFIER_assert__cond~4 == 0; {4872#false} is VALID [2018-11-14 17:34:43,210 INFO L273 TraceCheckUtils]: 30: Hoare triple {4872#false} assume !false; {4872#false} is VALID [2018-11-14 17:34:43,212 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-14 17:34:43,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:34:43,213 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-14 17:34:43,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:43,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:34:43,539 INFO L256 TraceCheckUtils]: 0: Hoare triple {4871#true} call ULTIMATE.init(); {4871#true} is VALID [2018-11-14 17:34:43,539 INFO L273 TraceCheckUtils]: 1: Hoare triple {4871#true} ~__return_main~0 := 0;~__return_375~0 := 0; {4871#true} is VALID [2018-11-14 17:34:43,539 INFO L273 TraceCheckUtils]: 2: Hoare triple {4871#true} assume true; {4871#true} is VALID [2018-11-14 17:34:43,539 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4871#true} {4871#true} #215#return; {4871#true} is VALID [2018-11-14 17:34:43,539 INFO L256 TraceCheckUtils]: 4: Hoare triple {4871#true} call #t~ret8 := main(); {4871#true} is VALID [2018-11-14 17:34:43,539 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-14 17:34:43,540 INFO L273 TraceCheckUtils]: 6: Hoare triple {4871#true} assume !!(~main__urilen~0 <= 1000000); {4871#true} is VALID [2018-11-14 17:34:43,540 INFO L273 TraceCheckUtils]: 7: Hoare triple {4871#true} assume !!(~main__urilen~0 >= -1000000); {4871#true} is VALID [2018-11-14 17:34:43,540 INFO L273 TraceCheckUtils]: 8: Hoare triple {4871#true} assume !!(~main__tokenlen~0 <= 1000000); {4871#true} is VALID [2018-11-14 17:34:43,540 INFO L273 TraceCheckUtils]: 9: Hoare triple {4871#true} assume !!(~main__tokenlen~0 >= -1000000); {4871#true} is VALID [2018-11-14 17:34:43,540 INFO L273 TraceCheckUtils]: 10: Hoare triple {4871#true} assume !!(~main__scheme~0 <= 1000000); {4871#true} is VALID [2018-11-14 17:34:43,540 INFO L273 TraceCheckUtils]: 11: Hoare triple {4871#true} assume !!(~main__scheme~0 >= -1000000); {4871#true} is VALID [2018-11-14 17:34:43,541 INFO L273 TraceCheckUtils]: 12: Hoare triple {4871#true} assume ~main__urilen~0 > 0; {4871#true} is VALID [2018-11-14 17:34:43,541 INFO L273 TraceCheckUtils]: 13: Hoare triple {4871#true} assume ~main__tokenlen~0 > 0; {4871#true} is VALID [2018-11-14 17:34:43,541 INFO L273 TraceCheckUtils]: 14: Hoare triple {4871#true} assume ~main__scheme~0 >= 0; {4871#true} is VALID [2018-11-14 17:34:43,541 INFO L273 TraceCheckUtils]: 15: Hoare triple {4871#true} assume !(~main__scheme~0 == 0); {4871#true} is VALID [2018-11-14 17:34:43,548 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-14 17:34:43,554 INFO L273 TraceCheckUtils]: 17: Hoare triple {4929#(and (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~0 1))} assume !(~__VERIFIER_assert__cond~0 == 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-14 17:34:43,554 INFO L273 TraceCheckUtils]: 18: Hoare triple {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~1 == 0);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-14 17:34:43,555 INFO L273 TraceCheckUtils]: 19: Hoare triple {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~main____CPAchecker_TMP_0~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-14 17:34:43,555 INFO L273 TraceCheckUtils]: 20: Hoare triple {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~2 == 0);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-14 17:34:43,559 INFO L273 TraceCheckUtils]: 21: Hoare triple {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~3 == 0); {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-14 17:34:43,559 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-14 17:34:43,560 INFO L273 TraceCheckUtils]: 23: Hoare triple {4876#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(~main____CPAchecker_TMP_1~0 == 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-14 17:34:43,560 INFO L273 TraceCheckUtils]: 24: Hoare triple {4876#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~16 == 0);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-14 17:34:43,561 INFO L273 TraceCheckUtils]: 25: Hoare triple {4876#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~17 == 0);~main__cp~0 := ~main__cp~0 + 1; {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-14 17:34:43,561 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-14 17:34:43,561 INFO L273 TraceCheckUtils]: 27: Hoare triple {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~main____CPAchecker_TMP_1~0 == 0); {4875#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-14 17:34:43,562 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-14 17:34:43,562 INFO L273 TraceCheckUtils]: 29: Hoare triple {4966#(= main_~__VERIFIER_assert__cond~4 1)} assume ~__VERIFIER_assert__cond~4 == 0; {4872#false} is VALID [2018-11-14 17:34:43,562 INFO L273 TraceCheckUtils]: 30: Hoare triple {4872#false} assume !false; {4872#false} is VALID [2018-11-14 17:34:43,563 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-14 17:34:43,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:34:43,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-11-14 17:34:43,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-14 17:34:43,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:43,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:34:43,617 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-14 17:34:43,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:34:43,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:34:43,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:34:43,618 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 9 states. [2018-11-14 17:34:44,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:44,540 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-14 17:34:44,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:34:44,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-14 17:34:44,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:44,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:34:44,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2018-11-14 17:34:44,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:34:44,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2018-11-14 17:34:44,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 67 transitions. [2018-11-14 17:34:44,954 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-14 17:34:44,956 INFO L225 Difference]: With dead ends: 69 [2018-11-14 17:34:44,956 INFO L226 Difference]: Without dead ends: 67 [2018-11-14 17:34:44,957 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:34:44,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-14 17:34:45,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-11-14 17:34:45,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:45,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 62 states. [2018-11-14 17:34:45,002 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 62 states. [2018-11-14 17:34:45,002 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 62 states. [2018-11-14 17:34:45,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:45,004 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-11-14 17:34:45,004 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-11-14 17:34:45,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:45,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:45,004 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 67 states. [2018-11-14 17:34:45,004 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 67 states. [2018-11-14 17:34:45,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:45,006 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-11-14 17:34:45,006 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-11-14 17:34:45,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:45,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:45,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:45,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:45,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 17:34:45,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-11-14 17:34:45,008 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2018-11-14 17:34:45,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:45,008 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-11-14 17:34:45,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:34:45,008 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-11-14 17:34:45,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 17:34:45,009 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:45,009 INFO L375 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-14 17:34:45,009 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:45,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:45,010 INFO L82 PathProgramCache]: Analyzing trace with hash -287576151, now seen corresponding path program 1 times [2018-11-14 17:34:45,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:45,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:45,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:45,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:45,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:45,399 INFO L256 TraceCheckUtils]: 0: Hoare triple {5262#true} call ULTIMATE.init(); {5262#true} is VALID [2018-11-14 17:34:45,399 INFO L273 TraceCheckUtils]: 1: Hoare triple {5262#true} ~__return_main~0 := 0;~__return_375~0 := 0; {5262#true} is VALID [2018-11-14 17:34:45,399 INFO L273 TraceCheckUtils]: 2: Hoare triple {5262#true} assume true; {5262#true} is VALID [2018-11-14 17:34:45,400 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5262#true} {5262#true} #215#return; {5262#true} is VALID [2018-11-14 17:34:45,400 INFO L256 TraceCheckUtils]: 4: Hoare triple {5262#true} call #t~ret8 := main(); {5262#true} is VALID [2018-11-14 17:34:45,400 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-14 17:34:45,400 INFO L273 TraceCheckUtils]: 6: Hoare triple {5262#true} assume !!(~main__urilen~0 <= 1000000); {5262#true} is VALID [2018-11-14 17:34:45,400 INFO L273 TraceCheckUtils]: 7: Hoare triple {5262#true} assume !!(~main__urilen~0 >= -1000000); {5262#true} is VALID [2018-11-14 17:34:45,401 INFO L273 TraceCheckUtils]: 8: Hoare triple {5262#true} assume !!(~main__tokenlen~0 <= 1000000); {5262#true} is VALID [2018-11-14 17:34:45,401 INFO L273 TraceCheckUtils]: 9: Hoare triple {5262#true} assume !!(~main__tokenlen~0 >= -1000000); {5262#true} is VALID [2018-11-14 17:34:45,401 INFO L273 TraceCheckUtils]: 10: Hoare triple {5262#true} assume !!(~main__scheme~0 <= 1000000); {5262#true} is VALID [2018-11-14 17:34:45,401 INFO L273 TraceCheckUtils]: 11: Hoare triple {5262#true} assume !!(~main__scheme~0 >= -1000000); {5262#true} is VALID [2018-11-14 17:34:45,402 INFO L273 TraceCheckUtils]: 12: Hoare triple {5262#true} assume ~main__urilen~0 > 0; {5262#true} is VALID [2018-11-14 17:34:45,402 INFO L273 TraceCheckUtils]: 13: Hoare triple {5262#true} assume ~main__tokenlen~0 > 0; {5262#true} is VALID [2018-11-14 17:34:45,402 INFO L273 TraceCheckUtils]: 14: Hoare triple {5262#true} assume ~main__scheme~0 >= 0; {5262#true} is VALID [2018-11-14 17:34:45,402 INFO L273 TraceCheckUtils]: 15: Hoare triple {5262#true} assume !(~main__scheme~0 == 0); {5262#true} is VALID [2018-11-14 17:34:45,403 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-14 17:34:45,403 INFO L273 TraceCheckUtils]: 17: Hoare triple {5264#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} assume !(~__VERIFIER_assert__cond~0 == 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-14 17:34:45,403 INFO L273 TraceCheckUtils]: 18: Hoare triple {5262#true} assume !(~__VERIFIER_assert__cond~1 == 0);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-14 17:34:45,403 INFO L273 TraceCheckUtils]: 19: Hoare triple {5262#true} assume !(~main____CPAchecker_TMP_0~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-14 17:34:45,404 INFO L273 TraceCheckUtils]: 20: Hoare triple {5265#(or (= 0 main_~__VERIFIER_assert__cond~2) (<= (+ main_~main__cp~0 1) main_~main__urilen~0))} assume !(~__VERIFIER_assert__cond~2 == 0);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-14 17:34:45,404 INFO L273 TraceCheckUtils]: 21: Hoare triple {5266#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~3 == 0); {5266#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-14 17:34:45,405 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-14 17:34:45,405 INFO L273 TraceCheckUtils]: 23: Hoare triple {5267#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~main____CPAchecker_TMP_1~0 == 0); {5267#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-14 17:34:45,406 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-14 17:34:45,406 INFO L273 TraceCheckUtils]: 25: Hoare triple {5267#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~4 == 0);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-14 17:34:45,407 INFO L273 TraceCheckUtils]: 26: Hoare triple {5267#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~5 == 0); {5267#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-14 17:34:45,407 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 ~main__cp~0 + 1 < ~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-14 17:34:45,408 INFO L273 TraceCheckUtils]: 28: Hoare triple {5267#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~6 == 0);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__cp~0 + 1 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-14 17:34:45,408 INFO L273 TraceCheckUtils]: 29: Hoare triple {5267#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~7 == 0); {5267#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-14 17:34:45,409 INFO L273 TraceCheckUtils]: 30: Hoare triple {5267#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~main__cp~0 + 1 == ~main__urilen~0 - 1);~main__cp~0 := ~main__cp~0 + 1;~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-14 17:34:45,410 INFO L273 TraceCheckUtils]: 31: Hoare triple {5266#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~main____CPAchecker_TMP_2~0 == 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-14 17:34:45,411 INFO L273 TraceCheckUtils]: 32: Hoare triple {5268#(not (= 0 main_~__VERIFIER_assert__cond~8))} assume ~__VERIFIER_assert__cond~8 == 0; {5263#false} is VALID [2018-11-14 17:34:45,411 INFO L273 TraceCheckUtils]: 33: Hoare triple {5263#false} assume !false; {5263#false} is VALID [2018-11-14 17:34:45,413 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-14 17:34:45,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:45,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 17:34:45,414 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-14 17:34:45,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:45,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:34:45,443 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-14 17:34:45,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:34:45,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:34:45,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:34:45,444 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 7 states. [2018-11-14 17:34:46,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:46,229 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-14 17:34:46,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:34:46,230 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-14 17:34:46,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:46,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:34:46,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2018-11-14 17:34:46,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:34:46,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2018-11-14 17:34:46,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2018-11-14 17:34:46,692 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-14 17:34:46,693 INFO L225 Difference]: With dead ends: 63 [2018-11-14 17:34:46,694 INFO L226 Difference]: Without dead ends: 61 [2018-11-14 17:34:46,694 INFO L604 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-14 17:34:46,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-14 17:34:46,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-14 17:34:46,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:46,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 60 states. [2018-11-14 17:34:46,739 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 60 states. [2018-11-14 17:34:46,740 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 60 states. [2018-11-14 17:34:46,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:46,742 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-11-14 17:34:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-11-14 17:34:46,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:46,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:46,743 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 61 states. [2018-11-14 17:34:46,743 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 61 states. [2018-11-14 17:34:46,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:46,744 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-11-14 17:34:46,745 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-11-14 17:34:46,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:46,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:46,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:46,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:46,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-14 17:34:46,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-11-14 17:34:46,747 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2018-11-14 17:34:46,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:46,747 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-11-14 17:34:46,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:34:46,747 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-14 17:34:46,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 17:34:46,748 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:46,748 INFO L375 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-14 17:34:46,748 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:46,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:46,749 INFO L82 PathProgramCache]: Analyzing trace with hash -324922921, now seen corresponding path program 1 times [2018-11-14 17:34:46,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:46,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:46,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:46,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:46,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:46,967 INFO L256 TraceCheckUtils]: 0: Hoare triple {5542#true} call ULTIMATE.init(); {5542#true} is VALID [2018-11-14 17:34:46,968 INFO L273 TraceCheckUtils]: 1: Hoare triple {5542#true} ~__return_main~0 := 0;~__return_375~0 := 0; {5542#true} is VALID [2018-11-14 17:34:46,968 INFO L273 TraceCheckUtils]: 2: Hoare triple {5542#true} assume true; {5542#true} is VALID [2018-11-14 17:34:46,968 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5542#true} {5542#true} #215#return; {5542#true} is VALID [2018-11-14 17:34:46,969 INFO L256 TraceCheckUtils]: 4: Hoare triple {5542#true} call #t~ret8 := main(); {5542#true} is VALID [2018-11-14 17:34:46,969 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-14 17:34:46,969 INFO L273 TraceCheckUtils]: 6: Hoare triple {5542#true} assume !!(~main__urilen~0 <= 1000000); {5542#true} is VALID [2018-11-14 17:34:46,970 INFO L273 TraceCheckUtils]: 7: Hoare triple {5542#true} assume !!(~main__urilen~0 >= -1000000); {5542#true} is VALID [2018-11-14 17:34:46,970 INFO L273 TraceCheckUtils]: 8: Hoare triple {5542#true} assume !!(~main__tokenlen~0 <= 1000000); {5542#true} is VALID [2018-11-14 17:34:46,970 INFO L273 TraceCheckUtils]: 9: Hoare triple {5542#true} assume !!(~main__tokenlen~0 >= -1000000); {5542#true} is VALID [2018-11-14 17:34:46,970 INFO L273 TraceCheckUtils]: 10: Hoare triple {5542#true} assume !!(~main__scheme~0 <= 1000000); {5542#true} is VALID [2018-11-14 17:34:46,970 INFO L273 TraceCheckUtils]: 11: Hoare triple {5542#true} assume !!(~main__scheme~0 >= -1000000); {5542#true} is VALID [2018-11-14 17:34:46,970 INFO L273 TraceCheckUtils]: 12: Hoare triple {5542#true} assume ~main__urilen~0 > 0; {5542#true} is VALID [2018-11-14 17:34:46,970 INFO L273 TraceCheckUtils]: 13: Hoare triple {5542#true} assume ~main__tokenlen~0 > 0; {5542#true} is VALID [2018-11-14 17:34:46,971 INFO L273 TraceCheckUtils]: 14: Hoare triple {5542#true} assume ~main__scheme~0 >= 0; {5542#true} is VALID [2018-11-14 17:34:46,971 INFO L273 TraceCheckUtils]: 15: Hoare triple {5542#true} assume !(~main__scheme~0 == 0); {5542#true} is VALID [2018-11-14 17:34:46,971 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-14 17:34:46,972 INFO L273 TraceCheckUtils]: 17: Hoare triple {5544#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} assume !(~__VERIFIER_assert__cond~0 == 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-14 17:34:46,972 INFO L273 TraceCheckUtils]: 18: Hoare triple {5545#(or (= 0 main_~__VERIFIER_assert__cond~1) (<= 1 main_~main__cp~0))} assume !(~__VERIFIER_assert__cond~1 == 0);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-14 17:34:46,973 INFO L273 TraceCheckUtils]: 19: Hoare triple {5546#(<= 1 main_~main__cp~0)} assume !(~main____CPAchecker_TMP_0~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-14 17:34:46,973 INFO L273 TraceCheckUtils]: 20: Hoare triple {5546#(<= 1 main_~main__cp~0)} assume !(~__VERIFIER_assert__cond~2 == 0);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-14 17:34:46,973 INFO L273 TraceCheckUtils]: 21: Hoare triple {5546#(<= 1 main_~main__cp~0)} assume !(~__VERIFIER_assert__cond~3 == 0); {5546#(<= 1 main_~main__cp~0)} is VALID [2018-11-14 17:34:46,974 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-14 17:34:46,974 INFO L273 TraceCheckUtils]: 23: Hoare triple {5546#(<= 1 main_~main__cp~0)} assume !(~main____CPAchecker_TMP_1~0 == 0); {5546#(<= 1 main_~main__cp~0)} is VALID [2018-11-14 17:34:46,974 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-14 17:34:46,975 INFO L273 TraceCheckUtils]: 25: Hoare triple {5546#(<= 1 main_~main__cp~0)} assume !(~__VERIFIER_assert__cond~4 == 0);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-14 17:34:46,975 INFO L273 TraceCheckUtils]: 26: Hoare triple {5546#(<= 1 main_~main__cp~0)} assume !(~__VERIFIER_assert__cond~5 == 0); {5546#(<= 1 main_~main__cp~0)} is VALID [2018-11-14 17:34:46,976 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 ~main__cp~0 + 1 < ~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-14 17:34:46,976 INFO L273 TraceCheckUtils]: 28: Hoare triple {5546#(<= 1 main_~main__cp~0)} assume !(~__VERIFIER_assert__cond~6 == 0);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__cp~0 + 1 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-14 17:34:46,977 INFO L273 TraceCheckUtils]: 29: Hoare triple {5546#(<= 1 main_~main__cp~0)} assume !(~__VERIFIER_assert__cond~7 == 0); {5546#(<= 1 main_~main__cp~0)} is VALID [2018-11-14 17:34:46,978 INFO L273 TraceCheckUtils]: 30: Hoare triple {5546#(<= 1 main_~main__cp~0)} assume !(~main__cp~0 + 1 == ~main__urilen~0 - 1);~main__cp~0 := ~main__cp~0 + 1;~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-14 17:34:46,978 INFO L273 TraceCheckUtils]: 31: Hoare triple {5547#(<= 2 main_~main__cp~0)} assume !(~main____CPAchecker_TMP_2~0 == 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-14 17:34:46,979 INFO L273 TraceCheckUtils]: 32: Hoare triple {5547#(<= 2 main_~main__cp~0)} assume !(~__VERIFIER_assert__cond~8 == 0);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-14 17:34:46,980 INFO L273 TraceCheckUtils]: 33: Hoare triple {5548#(not (= 0 main_~__VERIFIER_assert__cond~9))} assume ~__VERIFIER_assert__cond~9 == 0; {5543#false} is VALID [2018-11-14 17:34:46,980 INFO L273 TraceCheckUtils]: 34: Hoare triple {5543#false} assume !false; {5543#false} is VALID [2018-11-14 17:34:46,981 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-14 17:34:46,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:46,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 17:34:46,983 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-11-14 17:34:46,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:46,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:34:47,012 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-14 17:34:47,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:34:47,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:34:47,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:34:47,014 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 7 states. [2018-11-14 17:34:47,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:47,486 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-11-14 17:34:47,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:34:47,486 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-11-14 17:34:47,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:47,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:34:47,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2018-11-14 17:34:47,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:34:47,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2018-11-14 17:34:47,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2018-11-14 17:34:47,596 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-14 17:34:47,597 INFO L225 Difference]: With dead ends: 71 [2018-11-14 17:34:47,597 INFO L226 Difference]: Without dead ends: 69 [2018-11-14 17:34:47,598 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:34:47,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-14 17:34:47,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2018-11-14 17:34:47,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:47,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 58 states. [2018-11-14 17:34:47,675 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 58 states. [2018-11-14 17:34:47,675 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 58 states. [2018-11-14 17:34:47,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:47,676 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-14 17:34:47,676 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-11-14 17:34:47,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:47,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:47,677 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 69 states. [2018-11-14 17:34:47,677 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 69 states. [2018-11-14 17:34:47,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:47,679 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-14 17:34:47,679 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-11-14 17:34:47,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:47,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:47,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:47,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:47,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-14 17:34:47,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-11-14 17:34:47,681 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2018-11-14 17:34:47,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:47,681 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-11-14 17:34:47,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:34:47,681 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-14 17:34:47,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-14 17:34:47,682 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:47,682 INFO L375 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-14 17:34:47,682 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:47,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:47,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1080633106, now seen corresponding path program 1 times [2018-11-14 17:34:47,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:47,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:47,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:47,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:47,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:48,028 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-14 17:34:48,491 INFO L256 TraceCheckUtils]: 0: Hoare triple {5844#true} call ULTIMATE.init(); {5844#true} is VALID [2018-11-14 17:34:48,492 INFO L273 TraceCheckUtils]: 1: Hoare triple {5844#true} ~__return_main~0 := 0;~__return_375~0 := 0; {5844#true} is VALID [2018-11-14 17:34:48,492 INFO L273 TraceCheckUtils]: 2: Hoare triple {5844#true} assume true; {5844#true} is VALID [2018-11-14 17:34:48,492 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5844#true} {5844#true} #215#return; {5844#true} is VALID [2018-11-14 17:34:48,492 INFO L256 TraceCheckUtils]: 4: Hoare triple {5844#true} call #t~ret8 := main(); {5844#true} is VALID [2018-11-14 17:34:48,493 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-14 17:34:48,493 INFO L273 TraceCheckUtils]: 6: Hoare triple {5844#true} assume !!(~main__urilen~0 <= 1000000); {5844#true} is VALID [2018-11-14 17:34:48,493 INFO L273 TraceCheckUtils]: 7: Hoare triple {5844#true} assume !!(~main__urilen~0 >= -1000000); {5844#true} is VALID [2018-11-14 17:34:48,493 INFO L273 TraceCheckUtils]: 8: Hoare triple {5844#true} assume !!(~main__tokenlen~0 <= 1000000); {5844#true} is VALID [2018-11-14 17:34:48,493 INFO L273 TraceCheckUtils]: 9: Hoare triple {5844#true} assume !!(~main__tokenlen~0 >= -1000000); {5844#true} is VALID [2018-11-14 17:34:48,494 INFO L273 TraceCheckUtils]: 10: Hoare triple {5844#true} assume !!(~main__scheme~0 <= 1000000); {5844#true} is VALID [2018-11-14 17:34:48,494 INFO L273 TraceCheckUtils]: 11: Hoare triple {5844#true} assume !!(~main__scheme~0 >= -1000000); {5844#true} is VALID [2018-11-14 17:34:48,494 INFO L273 TraceCheckUtils]: 12: Hoare triple {5844#true} assume ~main__urilen~0 > 0; {5844#true} is VALID [2018-11-14 17:34:48,494 INFO L273 TraceCheckUtils]: 13: Hoare triple {5844#true} assume ~main__tokenlen~0 > 0; {5844#true} is VALID [2018-11-14 17:34:48,494 INFO L273 TraceCheckUtils]: 14: Hoare triple {5844#true} assume ~main__scheme~0 >= 0; {5844#true} is VALID [2018-11-14 17:34:48,495 INFO L273 TraceCheckUtils]: 15: Hoare triple {5844#true} assume !(~main__scheme~0 == 0); {5844#true} is VALID [2018-11-14 17:34:48,495 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-14 17:34:48,495 INFO L273 TraceCheckUtils]: 17: Hoare triple {5844#true} assume !(~__VERIFIER_assert__cond~0 == 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-14 17:34:48,495 INFO L273 TraceCheckUtils]: 18: Hoare triple {5844#true} assume !(~__VERIFIER_assert__cond~1 == 0);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-14 17:34:48,496 INFO L273 TraceCheckUtils]: 19: Hoare triple {5844#true} assume !(~main____CPAchecker_TMP_0~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-14 17:34:48,496 INFO L273 TraceCheckUtils]: 20: Hoare triple {5844#true} assume !(~__VERIFIER_assert__cond~2 == 0);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-14 17:34:48,496 INFO L273 TraceCheckUtils]: 21: Hoare triple {5844#true} assume !(~__VERIFIER_assert__cond~3 == 0); {5844#true} is VALID [2018-11-14 17:34:48,496 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-14 17:34:48,496 INFO L273 TraceCheckUtils]: 23: Hoare triple {5844#true} assume !(~main____CPAchecker_TMP_1~0 == 0); {5844#true} is VALID [2018-11-14 17:34:48,496 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-14 17:34:48,497 INFO L273 TraceCheckUtils]: 25: Hoare triple {5844#true} assume !(~__VERIFIER_assert__cond~4 == 0);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-14 17:34:48,497 INFO L273 TraceCheckUtils]: 26: Hoare triple {5844#true} assume !(~__VERIFIER_assert__cond~5 == 0); {5844#true} is VALID [2018-11-14 17:34:48,497 INFO L273 TraceCheckUtils]: 27: Hoare triple {5844#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__cp~0 + 1 < ~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-14 17:34:48,497 INFO L273 TraceCheckUtils]: 28: Hoare triple {5844#true} assume !(~__VERIFIER_assert__cond~6 == 0);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__cp~0 + 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {5844#true} is VALID [2018-11-14 17:34:48,497 INFO L273 TraceCheckUtils]: 29: Hoare triple {5844#true} assume !(~__VERIFIER_assert__cond~7 == 0); {5844#true} is VALID [2018-11-14 17:34:48,498 INFO L273 TraceCheckUtils]: 30: Hoare triple {5844#true} assume !(~main__cp~0 + 1 == ~main__urilen~0 - 1);~main__cp~0 := ~main__cp~0 + 1;~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-14 17:34:48,510 INFO L273 TraceCheckUtils]: 31: Hoare triple {5844#true} assume !(~main____CPAchecker_TMP_2~0 == 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-14 17:34:48,523 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 !(~__VERIFIER_assert__cond~8 == 0);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-14 17:34:48,536 INFO L273 TraceCheckUtils]: 33: Hoare triple {5847#(< main_~main__cp~0 main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~9 == 0); {5847#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-14 17:34:48,547 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-14 17:34:48,560 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-14 17:34:48,572 INFO L273 TraceCheckUtils]: 36: Hoare triple {5848#(not (= 0 main_~__VERIFIER_assert__cond~10))} assume ~__VERIFIER_assert__cond~10 == 0; {5845#false} is VALID [2018-11-14 17:34:48,573 INFO L273 TraceCheckUtils]: 37: Hoare triple {5845#false} assume !false; {5845#false} is VALID [2018-11-14 17:34:48,577 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-14 17:34:48,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:48,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:34:48,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-14 17:34:48,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:48,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:34:48,705 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-14 17:34:48,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:34:48,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:34:48,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:34:48,707 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2018-11-14 17:34:49,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:49,292 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-11-14 17:34:49,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:34:49,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-14 17:34:49,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:49,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:49,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2018-11-14 17:34:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:49,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2018-11-14 17:34:49,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 95 transitions. [2018-11-14 17:34:49,379 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-14 17:34:49,382 INFO L225 Difference]: With dead ends: 91 [2018-11-14 17:34:49,382 INFO L226 Difference]: Without dead ends: 89 [2018-11-14 17:34:49,382 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:34:49,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-14 17:34:49,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2018-11-14 17:34:49,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:49,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 61 states. [2018-11-14 17:34:49,445 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 61 states. [2018-11-14 17:34:49,446 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 61 states. [2018-11-14 17:34:49,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:49,448 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-11-14 17:34:49,448 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-14 17:34:49,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:49,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:49,448 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 89 states. [2018-11-14 17:34:49,448 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 89 states. [2018-11-14 17:34:49,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:49,450 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-11-14 17:34:49,450 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-14 17:34:49,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:49,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:49,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:49,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:49,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-14 17:34:49,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-11-14 17:34:49,452 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2018-11-14 17:34:49,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:49,452 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-11-14 17:34:49,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:34:49,453 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-11-14 17:34:49,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 17:34:49,453 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:49,453 INFO L375 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-14 17:34:49,454 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:49,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:49,454 INFO L82 PathProgramCache]: Analyzing trace with hash -860108895, now seen corresponding path program 1 times [2018-11-14 17:34:49,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:49,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:49,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:49,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:49,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:49,560 INFO L256 TraceCheckUtils]: 0: Hoare triple {6206#true} call ULTIMATE.init(); {6206#true} is VALID [2018-11-14 17:34:49,561 INFO L273 TraceCheckUtils]: 1: Hoare triple {6206#true} ~__return_main~0 := 0;~__return_375~0 := 0; {6206#true} is VALID [2018-11-14 17:34:49,561 INFO L273 TraceCheckUtils]: 2: Hoare triple {6206#true} assume true; {6206#true} is VALID [2018-11-14 17:34:49,562 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6206#true} {6206#true} #215#return; {6206#true} is VALID [2018-11-14 17:34:49,562 INFO L256 TraceCheckUtils]: 4: Hoare triple {6206#true} call #t~ret8 := main(); {6206#true} is VALID [2018-11-14 17:34:49,562 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-14 17:34:49,563 INFO L273 TraceCheckUtils]: 6: Hoare triple {6206#true} assume !!(~main__urilen~0 <= 1000000); {6206#true} is VALID [2018-11-14 17:34:49,563 INFO L273 TraceCheckUtils]: 7: Hoare triple {6206#true} assume !!(~main__urilen~0 >= -1000000); {6206#true} is VALID [2018-11-14 17:34:49,563 INFO L273 TraceCheckUtils]: 8: Hoare triple {6206#true} assume !!(~main__tokenlen~0 <= 1000000); {6206#true} is VALID [2018-11-14 17:34:49,564 INFO L273 TraceCheckUtils]: 9: Hoare triple {6206#true} assume !!(~main__tokenlen~0 >= -1000000); {6206#true} is VALID [2018-11-14 17:34:49,564 INFO L273 TraceCheckUtils]: 10: Hoare triple {6206#true} assume !!(~main__scheme~0 <= 1000000); {6206#true} is VALID [2018-11-14 17:34:49,564 INFO L273 TraceCheckUtils]: 11: Hoare triple {6206#true} assume !!(~main__scheme~0 >= -1000000); {6206#true} is VALID [2018-11-14 17:34:49,564 INFO L273 TraceCheckUtils]: 12: Hoare triple {6206#true} assume ~main__urilen~0 > 0; {6206#true} is VALID [2018-11-14 17:34:49,564 INFO L273 TraceCheckUtils]: 13: Hoare triple {6206#true} assume ~main__tokenlen~0 > 0; {6206#true} is VALID [2018-11-14 17:34:49,565 INFO L273 TraceCheckUtils]: 14: Hoare triple {6206#true} assume ~main__scheme~0 >= 0; {6206#true} is VALID [2018-11-14 17:34:49,565 INFO L273 TraceCheckUtils]: 15: Hoare triple {6206#true} assume !(~main__scheme~0 == 0); {6206#true} is VALID [2018-11-14 17:34:49,565 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-14 17:34:49,565 INFO L273 TraceCheckUtils]: 17: Hoare triple {6206#true} assume !(~__VERIFIER_assert__cond~0 == 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-14 17:34:49,565 INFO L273 TraceCheckUtils]: 18: Hoare triple {6206#true} assume !(~__VERIFIER_assert__cond~1 == 0);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-14 17:34:49,566 INFO L273 TraceCheckUtils]: 19: Hoare triple {6206#true} assume !(~main____CPAchecker_TMP_0~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-14 17:34:49,566 INFO L273 TraceCheckUtils]: 20: Hoare triple {6206#true} assume !(~__VERIFIER_assert__cond~2 == 0);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-14 17:34:49,566 INFO L273 TraceCheckUtils]: 21: Hoare triple {6206#true} assume !(~__VERIFIER_assert__cond~3 == 0); {6206#true} is VALID [2018-11-14 17:34:49,566 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-14 17:34:49,566 INFO L273 TraceCheckUtils]: 23: Hoare triple {6206#true} assume !(~main____CPAchecker_TMP_1~0 == 0); {6206#true} is VALID [2018-11-14 17:34:49,566 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-14 17:34:49,567 INFO L273 TraceCheckUtils]: 25: Hoare triple {6206#true} assume !(~__VERIFIER_assert__cond~4 == 0);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-14 17:34:49,567 INFO L273 TraceCheckUtils]: 26: Hoare triple {6206#true} assume !(~__VERIFIER_assert__cond~5 == 0); {6206#true} is VALID [2018-11-14 17:34:49,567 INFO L273 TraceCheckUtils]: 27: Hoare triple {6206#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__cp~0 + 1 < ~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-14 17:34:49,567 INFO L273 TraceCheckUtils]: 28: Hoare triple {6206#true} assume !(~__VERIFIER_assert__cond~6 == 0);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__cp~0 + 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {6206#true} is VALID [2018-11-14 17:34:49,567 INFO L273 TraceCheckUtils]: 29: Hoare triple {6206#true} assume !(~__VERIFIER_assert__cond~7 == 0); {6206#true} is VALID [2018-11-14 17:34:49,568 INFO L273 TraceCheckUtils]: 30: Hoare triple {6206#true} assume !(~main__cp~0 + 1 == ~main__urilen~0 - 1);~main__cp~0 := ~main__cp~0 + 1;~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-14 17:34:49,568 INFO L273 TraceCheckUtils]: 31: Hoare triple {6206#true} assume !(~main____CPAchecker_TMP_2~0 == 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-14 17:34:49,579 INFO L273 TraceCheckUtils]: 32: Hoare triple {6206#true} assume !(~__VERIFIER_assert__cond~8 == 0);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-14 17:34:49,580 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 !(~__VERIFIER_assert__cond~9 == 0); {6209#(<= 0 main_~main__cp~0)} is VALID [2018-11-14 17:34:49,580 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-14 17:34:49,584 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-14 17:34:49,584 INFO L273 TraceCheckUtils]: 36: Hoare triple {6209#(<= 0 main_~main__cp~0)} assume !(~__VERIFIER_assert__cond~10 == 0);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-14 17:34:49,584 INFO L273 TraceCheckUtils]: 37: Hoare triple {6210#(not (= 0 main_~__VERIFIER_assert__cond~11))} assume ~__VERIFIER_assert__cond~11 == 0; {6207#false} is VALID [2018-11-14 17:34:49,585 INFO L273 TraceCheckUtils]: 38: Hoare triple {6207#false} assume !false; {6207#false} is VALID [2018-11-14 17:34:49,586 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-14 17:34:49,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:49,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:34:49,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-14 17:34:49,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:49,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:34:49,622 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-14 17:34:49,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:34:49,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:34:49,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:34:49,623 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 5 states. [2018-11-14 17:34:50,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:50,009 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-11-14 17:34:50,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:34:50,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-14 17:34:50,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:50,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:50,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2018-11-14 17:34:50,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:50,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2018-11-14 17:34:50,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2018-11-14 17:34:50,065 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-14 17:34:50,066 INFO L225 Difference]: With dead ends: 61 [2018-11-14 17:34:50,066 INFO L226 Difference]: Without dead ends: 59 [2018-11-14 17:34:50,067 INFO L604 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-14 17:34:50,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-14 17:34:50,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-14 17:34:50,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:50,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2018-11-14 17:34:50,303 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-14 17:34:50,303 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-14 17:34:50,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:50,305 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-11-14 17:34:50,305 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-14 17:34:50,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:50,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:50,306 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-14 17:34:50,306 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-14 17:34:50,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:50,307 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-11-14 17:34:50,308 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-14 17:34:50,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:50,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:50,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:50,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:50,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 17:34:50,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-11-14 17:34:50,310 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2018-11-14 17:34:50,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:50,310 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-11-14 17:34:50,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:34:50,310 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-14 17:34:50,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 17:34:50,311 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:50,311 INFO L375 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-14 17:34:50,311 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:50,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:50,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1930828060, now seen corresponding path program 1 times [2018-11-14 17:34:50,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:50,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:50,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:50,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:50,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:50,872 INFO L256 TraceCheckUtils]: 0: Hoare triple {6473#true} call ULTIMATE.init(); {6473#true} is VALID [2018-11-14 17:34:50,872 INFO L273 TraceCheckUtils]: 1: Hoare triple {6473#true} ~__return_main~0 := 0;~__return_375~0 := 0; {6473#true} is VALID [2018-11-14 17:34:50,873 INFO L273 TraceCheckUtils]: 2: Hoare triple {6473#true} assume true; {6473#true} is VALID [2018-11-14 17:34:50,873 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6473#true} {6473#true} #215#return; {6473#true} is VALID [2018-11-14 17:34:50,873 INFO L256 TraceCheckUtils]: 4: Hoare triple {6473#true} call #t~ret8 := main(); {6473#true} is VALID [2018-11-14 17:34:50,873 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-14 17:34:50,873 INFO L273 TraceCheckUtils]: 6: Hoare triple {6473#true} assume !!(~main__urilen~0 <= 1000000); {6473#true} is VALID [2018-11-14 17:34:50,874 INFO L273 TraceCheckUtils]: 7: Hoare triple {6473#true} assume !!(~main__urilen~0 >= -1000000); {6473#true} is VALID [2018-11-14 17:34:50,874 INFO L273 TraceCheckUtils]: 8: Hoare triple {6473#true} assume !!(~main__tokenlen~0 <= 1000000); {6473#true} is VALID [2018-11-14 17:34:50,874 INFO L273 TraceCheckUtils]: 9: Hoare triple {6473#true} assume !!(~main__tokenlen~0 >= -1000000); {6473#true} is VALID [2018-11-14 17:34:50,874 INFO L273 TraceCheckUtils]: 10: Hoare triple {6473#true} assume !!(~main__scheme~0 <= 1000000); {6473#true} is VALID [2018-11-14 17:34:50,874 INFO L273 TraceCheckUtils]: 11: Hoare triple {6473#true} assume !!(~main__scheme~0 >= -1000000); {6473#true} is VALID [2018-11-14 17:34:50,875 INFO L273 TraceCheckUtils]: 12: Hoare triple {6473#true} assume ~main__urilen~0 > 0; {6473#true} is VALID [2018-11-14 17:34:50,875 INFO L273 TraceCheckUtils]: 13: Hoare triple {6473#true} assume ~main__tokenlen~0 > 0; {6473#true} is VALID [2018-11-14 17:34:50,875 INFO L273 TraceCheckUtils]: 14: Hoare triple {6473#true} assume ~main__scheme~0 >= 0; {6473#true} is VALID [2018-11-14 17:34:50,875 INFO L273 TraceCheckUtils]: 15: Hoare triple {6473#true} assume !(~main__scheme~0 == 0); {6473#true} is VALID [2018-11-14 17:34:50,876 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-14 17:34:50,876 INFO L273 TraceCheckUtils]: 17: Hoare triple {6475#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} assume !(~__VERIFIER_assert__cond~0 == 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-14 17:34:50,876 INFO L273 TraceCheckUtils]: 18: Hoare triple {6473#true} assume !(~__VERIFIER_assert__cond~1 == 0);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-14 17:34:50,877 INFO L273 TraceCheckUtils]: 19: Hoare triple {6473#true} assume !(~main____CPAchecker_TMP_0~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-14 17:34:50,877 INFO L273 TraceCheckUtils]: 20: Hoare triple {6473#true} assume !(~__VERIFIER_assert__cond~2 == 0);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-14 17:34:50,877 INFO L273 TraceCheckUtils]: 21: Hoare triple {6473#true} assume !(~__VERIFIER_assert__cond~3 == 0); {6473#true} is VALID [2018-11-14 17:34:50,877 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-14 17:34:50,877 INFO L273 TraceCheckUtils]: 23: Hoare triple {6473#true} assume !(~main____CPAchecker_TMP_1~0 == 0); {6473#true} is VALID [2018-11-14 17:34:50,877 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-14 17:34:50,877 INFO L273 TraceCheckUtils]: 25: Hoare triple {6473#true} assume !(~__VERIFIER_assert__cond~4 == 0);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-14 17:34:50,877 INFO L273 TraceCheckUtils]: 26: Hoare triple {6473#true} assume !(~__VERIFIER_assert__cond~5 == 0); {6473#true} is VALID [2018-11-14 17:34:50,878 INFO L273 TraceCheckUtils]: 27: Hoare triple {6473#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__cp~0 + 1 < ~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-14 17:34:50,878 INFO L273 TraceCheckUtils]: 28: Hoare triple {6473#true} assume !(~__VERIFIER_assert__cond~6 == 0);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__cp~0 + 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {6473#true} is VALID [2018-11-14 17:34:50,878 INFO L273 TraceCheckUtils]: 29: Hoare triple {6473#true} assume !(~__VERIFIER_assert__cond~7 == 0); {6473#true} is VALID [2018-11-14 17:34:50,878 INFO L273 TraceCheckUtils]: 30: Hoare triple {6473#true} assume !(~main__cp~0 + 1 == ~main__urilen~0 - 1);~main__cp~0 := ~main__cp~0 + 1;~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-14 17:34:50,878 INFO L273 TraceCheckUtils]: 31: Hoare triple {6473#true} assume !(~main____CPAchecker_TMP_2~0 == 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-14 17:34:50,878 INFO L273 TraceCheckUtils]: 32: Hoare triple {6473#true} assume !(~__VERIFIER_assert__cond~8 == 0);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-14 17:34:50,878 INFO L273 TraceCheckUtils]: 33: Hoare triple {6473#true} assume !(~__VERIFIER_assert__cond~9 == 0); {6473#true} is VALID [2018-11-14 17:34:50,878 INFO L273 TraceCheckUtils]: 34: Hoare triple {6473#true} assume ~main__cp~0 != ~main__urilen~0 - 1; {6473#true} is VALID [2018-11-14 17:34:50,879 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-14 17:34:50,880 INFO L273 TraceCheckUtils]: 36: Hoare triple {6476#(<= (+ main_~main__c~0 2) main_~main__tokenlen~0)} assume !(~__VERIFIER_assert__cond~10 == 0);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-14 17:34:50,880 INFO L273 TraceCheckUtils]: 37: Hoare triple {6476#(<= (+ main_~main__c~0 2) main_~main__tokenlen~0)} assume !(~__VERIFIER_assert__cond~11 == 0);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-14 17:34:50,880 INFO L273 TraceCheckUtils]: 38: Hoare triple {6476#(<= (+ main_~main__c~0 2) main_~main__tokenlen~0)} assume !(~main____CPAchecker_TMP_3~0 == 0);~main__c~0 := ~main__c~0 + 1;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-14 17:34:50,881 INFO L273 TraceCheckUtils]: 39: Hoare triple {6477#(not (= 0 main_~__VERIFIER_assert__cond~12))} assume ~__VERIFIER_assert__cond~12 == 0; {6474#false} is VALID [2018-11-14 17:34:50,881 INFO L273 TraceCheckUtils]: 40: Hoare triple {6474#false} assume !false; {6474#false} is VALID [2018-11-14 17:34:50,883 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-14 17:34:50,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:50,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:34:50,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-11-14 17:34:50,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:50,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:34:50,938 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-14 17:34:50,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:34:50,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:34:50,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:34:50,939 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 5 states. [2018-11-14 17:34:51,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:51,298 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-11-14 17:34:51,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:34:51,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-11-14 17:34:51,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:51,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:51,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2018-11-14 17:34:51,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:51,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2018-11-14 17:34:51,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2018-11-14 17:34:51,391 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-14 17:34:51,393 INFO L225 Difference]: With dead ends: 70 [2018-11-14 17:34:51,393 INFO L226 Difference]: Without dead ends: 68 [2018-11-14 17:34:51,394 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:34:51,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-14 17:34:51,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-11-14 17:34:51,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:51,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 57 states. [2018-11-14 17:34:51,510 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 57 states. [2018-11-14 17:34:51,510 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 57 states. [2018-11-14 17:34:51,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:51,512 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-11-14 17:34:51,512 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-14 17:34:51,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:51,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:51,512 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 68 states. [2018-11-14 17:34:51,513 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 68 states. [2018-11-14 17:34:51,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:51,514 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-11-14 17:34:51,514 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-14 17:34:51,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:51,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:51,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:51,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:51,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-14 17:34:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-11-14 17:34:51,516 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 41 [2018-11-14 17:34:51,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:51,516 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-11-14 17:34:51,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:34:51,516 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-11-14 17:34:51,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 17:34:51,517 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:51,517 INFO L375 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-14 17:34:51,518 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:51,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:51,518 INFO L82 PathProgramCache]: Analyzing trace with hash 273875486, now seen corresponding path program 1 times [2018-11-14 17:34:51,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:51,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:51,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:51,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:51,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:51,656 INFO L256 TraceCheckUtils]: 0: Hoare triple {6774#true} call ULTIMATE.init(); {6774#true} is VALID [2018-11-14 17:34:51,657 INFO L273 TraceCheckUtils]: 1: Hoare triple {6774#true} ~__return_main~0 := 0;~__return_375~0 := 0; {6774#true} is VALID [2018-11-14 17:34:51,657 INFO L273 TraceCheckUtils]: 2: Hoare triple {6774#true} assume true; {6774#true} is VALID [2018-11-14 17:34:51,657 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6774#true} {6774#true} #215#return; {6774#true} is VALID [2018-11-14 17:34:51,657 INFO L256 TraceCheckUtils]: 4: Hoare triple {6774#true} call #t~ret8 := main(); {6774#true} is VALID [2018-11-14 17:34:51,657 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-14 17:34:51,658 INFO L273 TraceCheckUtils]: 6: Hoare triple {6774#true} assume !!(~main__urilen~0 <= 1000000); {6774#true} is VALID [2018-11-14 17:34:51,658 INFO L273 TraceCheckUtils]: 7: Hoare triple {6774#true} assume !!(~main__urilen~0 >= -1000000); {6774#true} is VALID [2018-11-14 17:34:51,658 INFO L273 TraceCheckUtils]: 8: Hoare triple {6774#true} assume !!(~main__tokenlen~0 <= 1000000); {6774#true} is VALID [2018-11-14 17:34:51,658 INFO L273 TraceCheckUtils]: 9: Hoare triple {6774#true} assume !!(~main__tokenlen~0 >= -1000000); {6774#true} is VALID [2018-11-14 17:34:51,659 INFO L273 TraceCheckUtils]: 10: Hoare triple {6774#true} assume !!(~main__scheme~0 <= 1000000); {6774#true} is VALID [2018-11-14 17:34:51,659 INFO L273 TraceCheckUtils]: 11: Hoare triple {6774#true} assume !!(~main__scheme~0 >= -1000000); {6774#true} is VALID [2018-11-14 17:34:51,659 INFO L273 TraceCheckUtils]: 12: Hoare triple {6774#true} assume ~main__urilen~0 > 0; {6774#true} is VALID [2018-11-14 17:34:51,659 INFO L273 TraceCheckUtils]: 13: Hoare triple {6774#true} assume ~main__tokenlen~0 > 0; {6774#true} is VALID [2018-11-14 17:34:51,659 INFO L273 TraceCheckUtils]: 14: Hoare triple {6774#true} assume ~main__scheme~0 >= 0; {6774#true} is VALID [2018-11-14 17:34:51,660 INFO L273 TraceCheckUtils]: 15: Hoare triple {6774#true} assume !(~main__scheme~0 == 0); {6774#true} is VALID [2018-11-14 17:34:51,660 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-14 17:34:51,660 INFO L273 TraceCheckUtils]: 17: Hoare triple {6776#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} assume !(~__VERIFIER_assert__cond~0 == 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-14 17:34:51,661 INFO L273 TraceCheckUtils]: 18: Hoare triple {6774#true} assume !(~__VERIFIER_assert__cond~1 == 0);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-14 17:34:51,661 INFO L273 TraceCheckUtils]: 19: Hoare triple {6774#true} assume !(~main____CPAchecker_TMP_0~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-14 17:34:51,661 INFO L273 TraceCheckUtils]: 20: Hoare triple {6774#true} assume !(~__VERIFIER_assert__cond~2 == 0);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-14 17:34:51,661 INFO L273 TraceCheckUtils]: 21: Hoare triple {6774#true} assume !(~__VERIFIER_assert__cond~3 == 0); {6774#true} is VALID [2018-11-14 17:34:51,661 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-14 17:34:51,661 INFO L273 TraceCheckUtils]: 23: Hoare triple {6774#true} assume !(~main____CPAchecker_TMP_1~0 == 0); {6774#true} is VALID [2018-11-14 17:34:51,661 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-14 17:34:51,661 INFO L273 TraceCheckUtils]: 25: Hoare triple {6774#true} assume !(~__VERIFIER_assert__cond~4 == 0);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-14 17:34:51,662 INFO L273 TraceCheckUtils]: 26: Hoare triple {6774#true} assume !(~__VERIFIER_assert__cond~5 == 0); {6774#true} is VALID [2018-11-14 17:34:51,662 INFO L273 TraceCheckUtils]: 27: Hoare triple {6774#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__cp~0 + 1 < ~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-14 17:34:51,662 INFO L273 TraceCheckUtils]: 28: Hoare triple {6774#true} assume !(~__VERIFIER_assert__cond~6 == 0);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__cp~0 + 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {6774#true} is VALID [2018-11-14 17:34:51,662 INFO L273 TraceCheckUtils]: 29: Hoare triple {6774#true} assume !(~__VERIFIER_assert__cond~7 == 0); {6774#true} is VALID [2018-11-14 17:34:51,662 INFO L273 TraceCheckUtils]: 30: Hoare triple {6774#true} assume !(~main__cp~0 + 1 == ~main__urilen~0 - 1);~main__cp~0 := ~main__cp~0 + 1;~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-14 17:34:51,662 INFO L273 TraceCheckUtils]: 31: Hoare triple {6774#true} assume !(~main____CPAchecker_TMP_2~0 == 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-14 17:34:51,663 INFO L273 TraceCheckUtils]: 32: Hoare triple {6777#(= main_~main__c~0 0)} assume !(~__VERIFIER_assert__cond~8 == 0);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-14 17:34:51,663 INFO L273 TraceCheckUtils]: 33: Hoare triple {6777#(= main_~main__c~0 0)} assume !(~__VERIFIER_assert__cond~9 == 0); {6777#(= main_~main__c~0 0)} is VALID [2018-11-14 17:34:51,663 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-14 17:34:51,664 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-14 17:34:51,664 INFO L273 TraceCheckUtils]: 36: Hoare triple {6777#(= main_~main__c~0 0)} assume !(~__VERIFIER_assert__cond~10 == 0);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-14 17:34:51,664 INFO L273 TraceCheckUtils]: 37: Hoare triple {6777#(= main_~main__c~0 0)} assume !(~__VERIFIER_assert__cond~11 == 0);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-14 17:34:51,665 INFO L273 TraceCheckUtils]: 38: Hoare triple {6777#(= main_~main__c~0 0)} assume !(~main____CPAchecker_TMP_3~0 == 0);~main__c~0 := ~main__c~0 + 1;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-14 17:34:51,665 INFO L273 TraceCheckUtils]: 39: Hoare triple {6778#(<= 1 main_~main__c~0)} assume !(~__VERIFIER_assert__cond~12 == 0);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-14 17:34:51,666 INFO L273 TraceCheckUtils]: 40: Hoare triple {6779#(not (= 0 main_~__VERIFIER_assert__cond~13))} assume ~__VERIFIER_assert__cond~13 == 0; {6775#false} is VALID [2018-11-14 17:34:51,666 INFO L273 TraceCheckUtils]: 41: Hoare triple {6775#false} assume !false; {6775#false} is VALID [2018-11-14 17:34:51,668 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-14 17:34:51,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:51,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:34:51,669 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-11-14 17:34:51,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:51,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:34:51,706 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-14 17:34:51,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:34:51,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:34:51,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:34:51,707 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 6 states. [2018-11-14 17:34:52,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:52,085 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-11-14 17:34:52,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:34:52,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-11-14 17:34:52,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:52,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2018-11-14 17:34:52,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:52,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2018-11-14 17:34:52,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 66 transitions. [2018-11-14 17:34:52,154 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-14 17:34:52,155 INFO L225 Difference]: With dead ends: 66 [2018-11-14 17:34:52,155 INFO L226 Difference]: Without dead ends: 64 [2018-11-14 17:34:52,156 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:34:52,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-14 17:34:52,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2018-11-14 17:34:52,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:52,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 55 states. [2018-11-14 17:34:52,236 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 55 states. [2018-11-14 17:34:52,236 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 55 states. [2018-11-14 17:34:52,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:52,238 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-11-14 17:34:52,238 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-11-14 17:34:52,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:52,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:52,239 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 64 states. [2018-11-14 17:34:52,240 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 64 states. [2018-11-14 17:34:52,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:52,241 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-11-14 17:34:52,241 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-11-14 17:34:52,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:52,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:52,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:52,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:52,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-14 17:34:52,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-11-14 17:34:52,242 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2018-11-14 17:34:52,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:52,243 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-11-14 17:34:52,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:34:52,243 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-14 17:34:52,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-14 17:34:52,243 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:52,243 INFO L375 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-14 17:34:52,244 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:52,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:52,244 INFO L82 PathProgramCache]: Analyzing trace with hash -99791318, now seen corresponding path program 1 times [2018-11-14 17:34:52,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:52,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:52,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:52,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:52,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:52,610 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-14 17:34:52,951 INFO L256 TraceCheckUtils]: 0: Hoare triple {7057#true} call ULTIMATE.init(); {7057#true} is VALID [2018-11-14 17:34:52,952 INFO L273 TraceCheckUtils]: 1: Hoare triple {7057#true} ~__return_main~0 := 0;~__return_375~0 := 0; {7057#true} is VALID [2018-11-14 17:34:52,952 INFO L273 TraceCheckUtils]: 2: Hoare triple {7057#true} assume true; {7057#true} is VALID [2018-11-14 17:34:52,952 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7057#true} {7057#true} #215#return; {7057#true} is VALID [2018-11-14 17:34:52,952 INFO L256 TraceCheckUtils]: 4: Hoare triple {7057#true} call #t~ret8 := main(); {7057#true} is VALID [2018-11-14 17:34:52,953 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-14 17:34:52,953 INFO L273 TraceCheckUtils]: 6: Hoare triple {7057#true} assume !!(~main__urilen~0 <= 1000000); {7057#true} is VALID [2018-11-14 17:34:52,953 INFO L273 TraceCheckUtils]: 7: Hoare triple {7057#true} assume !!(~main__urilen~0 >= -1000000); {7057#true} is VALID [2018-11-14 17:34:52,953 INFO L273 TraceCheckUtils]: 8: Hoare triple {7057#true} assume !!(~main__tokenlen~0 <= 1000000); {7057#true} is VALID [2018-11-14 17:34:52,953 INFO L273 TraceCheckUtils]: 9: Hoare triple {7057#true} assume !!(~main__tokenlen~0 >= -1000000); {7057#true} is VALID [2018-11-14 17:34:52,953 INFO L273 TraceCheckUtils]: 10: Hoare triple {7057#true} assume !!(~main__scheme~0 <= 1000000); {7057#true} is VALID [2018-11-14 17:34:52,954 INFO L273 TraceCheckUtils]: 11: Hoare triple {7057#true} assume !!(~main__scheme~0 >= -1000000); {7057#true} is VALID [2018-11-14 17:34:52,954 INFO L273 TraceCheckUtils]: 12: Hoare triple {7057#true} assume ~main__urilen~0 > 0; {7057#true} is VALID [2018-11-14 17:34:52,954 INFO L273 TraceCheckUtils]: 13: Hoare triple {7057#true} assume ~main__tokenlen~0 > 0; {7057#true} is VALID [2018-11-14 17:34:52,954 INFO L273 TraceCheckUtils]: 14: Hoare triple {7057#true} assume ~main__scheme~0 >= 0; {7057#true} is VALID [2018-11-14 17:34:52,954 INFO L273 TraceCheckUtils]: 15: Hoare triple {7057#true} assume !(~main__scheme~0 == 0); {7057#true} is VALID [2018-11-14 17:34:52,955 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-14 17:34:52,955 INFO L273 TraceCheckUtils]: 17: Hoare triple {7057#true} assume !(~__VERIFIER_assert__cond~0 == 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-14 17:34:52,955 INFO L273 TraceCheckUtils]: 18: Hoare triple {7057#true} assume !(~__VERIFIER_assert__cond~1 == 0);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-14 17:34:52,955 INFO L273 TraceCheckUtils]: 19: Hoare triple {7057#true} assume !(~main____CPAchecker_TMP_0~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-14 17:34:52,955 INFO L273 TraceCheckUtils]: 20: Hoare triple {7057#true} assume !(~__VERIFIER_assert__cond~2 == 0);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-14 17:34:52,956 INFO L273 TraceCheckUtils]: 21: Hoare triple {7057#true} assume !(~__VERIFIER_assert__cond~3 == 0); {7057#true} is VALID [2018-11-14 17:34:52,956 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-14 17:34:52,956 INFO L273 TraceCheckUtils]: 23: Hoare triple {7057#true} assume !(~main____CPAchecker_TMP_1~0 == 0); {7057#true} is VALID [2018-11-14 17:34:52,956 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-14 17:34:52,956 INFO L273 TraceCheckUtils]: 25: Hoare triple {7057#true} assume !(~__VERIFIER_assert__cond~4 == 0);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-14 17:34:52,956 INFO L273 TraceCheckUtils]: 26: Hoare triple {7057#true} assume !(~__VERIFIER_assert__cond~5 == 0); {7057#true} is VALID [2018-11-14 17:34:52,957 INFO L273 TraceCheckUtils]: 27: Hoare triple {7057#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__cp~0 + 1 < ~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-14 17:34:52,957 INFO L273 TraceCheckUtils]: 28: Hoare triple {7057#true} assume !(~__VERIFIER_assert__cond~6 == 0);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__cp~0 + 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {7057#true} is VALID [2018-11-14 17:34:52,957 INFO L273 TraceCheckUtils]: 29: Hoare triple {7057#true} assume !(~__VERIFIER_assert__cond~7 == 0); {7057#true} is VALID [2018-11-14 17:34:52,957 INFO L273 TraceCheckUtils]: 30: Hoare triple {7057#true} assume !(~main__cp~0 + 1 == ~main__urilen~0 - 1);~main__cp~0 := ~main__cp~0 + 1;~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-14 17:34:52,958 INFO L273 TraceCheckUtils]: 31: Hoare triple {7057#true} assume !(~main____CPAchecker_TMP_2~0 == 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-14 17:34:52,960 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 !(~__VERIFIER_assert__cond~8 == 0);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-14 17:34:52,961 INFO L273 TraceCheckUtils]: 33: Hoare triple {7060#(< main_~main__cp~0 main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~9 == 0); {7060#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-14 17:34:52,961 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-14 17:34:52,961 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-14 17:34:52,962 INFO L273 TraceCheckUtils]: 36: Hoare triple {7060#(< main_~main__cp~0 main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~10 == 0);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-14 17:34:52,962 INFO L273 TraceCheckUtils]: 37: Hoare triple {7060#(< main_~main__cp~0 main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~11 == 0);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-14 17:34:52,963 INFO L273 TraceCheckUtils]: 38: Hoare triple {7060#(< main_~main__cp~0 main_~main__urilen~0)} assume !(~main____CPAchecker_TMP_3~0 == 0);~main__c~0 := ~main__c~0 + 1;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-14 17:34:52,964 INFO L273 TraceCheckUtils]: 39: Hoare triple {7060#(< main_~main__cp~0 main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~12 == 0);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-14 17:34:52,965 INFO L273 TraceCheckUtils]: 40: Hoare triple {7060#(< main_~main__cp~0 main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~13 == 0);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-14 17:34:52,965 INFO L273 TraceCheckUtils]: 41: Hoare triple {7061#(not (= 0 main_~__VERIFIER_assert__cond~14))} assume ~__VERIFIER_assert__cond~14 == 0; {7058#false} is VALID [2018-11-14 17:34:52,966 INFO L273 TraceCheckUtils]: 42: Hoare triple {7058#false} assume !false; {7058#false} is VALID [2018-11-14 17:34:52,969 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-14 17:34:52,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:52,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:34:52,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-11-14 17:34:52,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:52,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:34:53,019 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-14 17:34:53,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:34:53,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:34:53,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:34:53,020 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 5 states. [2018-11-14 17:34:53,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:53,738 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-11-14 17:34:53,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:34:53,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-11-14 17:34:53,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:53,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:53,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2018-11-14 17:34:53,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:53,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2018-11-14 17:34:53,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 93 transitions. [2018-11-14 17:34:53,880 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-14 17:34:53,881 INFO L225 Difference]: With dead ends: 88 [2018-11-14 17:34:53,882 INFO L226 Difference]: Without dead ends: 86 [2018-11-14 17:34:53,882 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:34:53,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-14 17:34:53,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2018-11-14 17:34:53,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:53,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 60 states. [2018-11-14 17:34:53,953 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 60 states. [2018-11-14 17:34:53,953 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 60 states. [2018-11-14 17:34:53,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:53,955 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-11-14 17:34:53,956 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-11-14 17:34:53,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:53,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:53,956 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 86 states. [2018-11-14 17:34:53,957 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 86 states. [2018-11-14 17:34:53,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:53,958 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-11-14 17:34:53,958 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-11-14 17:34:53,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:53,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:53,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:53,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:53,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-14 17:34:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-11-14 17:34:53,960 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 43 [2018-11-14 17:34:53,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:53,961 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-11-14 17:34:53,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:34:53,961 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-11-14 17:34:53,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-14 17:34:53,961 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:53,962 INFO L375 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-14 17:34:53,962 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:53,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:53,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2020599801, now seen corresponding path program 1 times [2018-11-14 17:34:53,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:53,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:53,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:53,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:53,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:54,154 INFO L256 TraceCheckUtils]: 0: Hoare triple {7412#true} call ULTIMATE.init(); {7412#true} is VALID [2018-11-14 17:34:54,155 INFO L273 TraceCheckUtils]: 1: Hoare triple {7412#true} ~__return_main~0 := 0;~__return_375~0 := 0; {7412#true} is VALID [2018-11-14 17:34:54,155 INFO L273 TraceCheckUtils]: 2: Hoare triple {7412#true} assume true; {7412#true} is VALID [2018-11-14 17:34:54,155 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7412#true} {7412#true} #215#return; {7412#true} is VALID [2018-11-14 17:34:54,156 INFO L256 TraceCheckUtils]: 4: Hoare triple {7412#true} call #t~ret8 := main(); {7412#true} is VALID [2018-11-14 17:34:54,156 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-14 17:34:54,156 INFO L273 TraceCheckUtils]: 6: Hoare triple {7412#true} assume !!(~main__urilen~0 <= 1000000); {7412#true} is VALID [2018-11-14 17:34:54,156 INFO L273 TraceCheckUtils]: 7: Hoare triple {7412#true} assume !!(~main__urilen~0 >= -1000000); {7412#true} is VALID [2018-11-14 17:34:54,157 INFO L273 TraceCheckUtils]: 8: Hoare triple {7412#true} assume !!(~main__tokenlen~0 <= 1000000); {7412#true} is VALID [2018-11-14 17:34:54,157 INFO L273 TraceCheckUtils]: 9: Hoare triple {7412#true} assume !!(~main__tokenlen~0 >= -1000000); {7412#true} is VALID [2018-11-14 17:34:54,157 INFO L273 TraceCheckUtils]: 10: Hoare triple {7412#true} assume !!(~main__scheme~0 <= 1000000); {7412#true} is VALID [2018-11-14 17:34:54,157 INFO L273 TraceCheckUtils]: 11: Hoare triple {7412#true} assume !!(~main__scheme~0 >= -1000000); {7412#true} is VALID [2018-11-14 17:34:54,157 INFO L273 TraceCheckUtils]: 12: Hoare triple {7412#true} assume ~main__urilen~0 > 0; {7412#true} is VALID [2018-11-14 17:34:54,157 INFO L273 TraceCheckUtils]: 13: Hoare triple {7412#true} assume ~main__tokenlen~0 > 0; {7412#true} is VALID [2018-11-14 17:34:54,158 INFO L273 TraceCheckUtils]: 14: Hoare triple {7412#true} assume ~main__scheme~0 >= 0; {7412#true} is VALID [2018-11-14 17:34:54,158 INFO L273 TraceCheckUtils]: 15: Hoare triple {7412#true} assume !(~main__scheme~0 == 0); {7412#true} is VALID [2018-11-14 17:34:54,158 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-14 17:34:54,159 INFO L273 TraceCheckUtils]: 17: Hoare triple {7414#(or (= main_~__VERIFIER_assert__cond~0 1) (= 0 main_~__VERIFIER_assert__cond~0))} assume !(~__VERIFIER_assert__cond~0 == 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-14 17:34:54,159 INFO L273 TraceCheckUtils]: 18: Hoare triple {7412#true} assume !(~__VERIFIER_assert__cond~1 == 0);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-14 17:34:54,159 INFO L273 TraceCheckUtils]: 19: Hoare triple {7412#true} assume !(~main____CPAchecker_TMP_0~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-14 17:34:54,160 INFO L273 TraceCheckUtils]: 20: Hoare triple {7415#(or (= 0 main_~__VERIFIER_assert__cond~2) (<= (+ main_~main__cp~0 1) main_~main__urilen~0))} assume !(~__VERIFIER_assert__cond~2 == 0);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-14 17:34:54,160 INFO L273 TraceCheckUtils]: 21: Hoare triple {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~3 == 0); {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-14 17:34:54,161 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-14 17:34:54,161 INFO L273 TraceCheckUtils]: 23: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~main____CPAchecker_TMP_1~0 == 0); {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-14 17:34:54,162 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-14 17:34:54,162 INFO L273 TraceCheckUtils]: 25: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~4 == 0);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-14 17:34:54,163 INFO L273 TraceCheckUtils]: 26: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~5 == 0); {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-14 17:34:54,164 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 ~main__cp~0 + 1 < ~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-14 17:34:54,164 INFO L273 TraceCheckUtils]: 28: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~6 == 0);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__cp~0 + 1 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-14 17:34:54,165 INFO L273 TraceCheckUtils]: 29: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~7 == 0); {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-14 17:34:54,166 INFO L273 TraceCheckUtils]: 30: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~main__cp~0 + 1 == ~main__urilen~0 - 1);~main__cp~0 := ~main__cp~0 + 1;~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-14 17:34:54,166 INFO L273 TraceCheckUtils]: 31: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~main____CPAchecker_TMP_2~0 == 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-14 17:34:54,167 INFO L273 TraceCheckUtils]: 32: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~8 == 0);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-14 17:34:54,167 INFO L273 TraceCheckUtils]: 33: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~9 == 0); {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-14 17:34:54,168 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-14 17:34:54,168 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-14 17:34:54,169 INFO L273 TraceCheckUtils]: 36: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~10 == 0);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-14 17:34:54,170 INFO L273 TraceCheckUtils]: 37: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~11 == 0);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-14 17:34:54,170 INFO L273 TraceCheckUtils]: 38: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !!(~main____CPAchecker_TMP_3~0 == 0); {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-14 17:34:54,171 INFO L273 TraceCheckUtils]: 39: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} ~main__cp~0 := ~main__cp~0 + 1; {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-14 17:34:54,172 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-14 17:34:54,172 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-14 17:34:54,173 INFO L273 TraceCheckUtils]: 42: Hoare triple {7418#(not (= 0 main_~__VERIFIER_assert__cond~10))} assume ~__VERIFIER_assert__cond~10 == 0; {7413#false} is VALID [2018-11-14 17:34:54,173 INFO L273 TraceCheckUtils]: 43: Hoare triple {7413#false} assume !false; {7413#false} is VALID [2018-11-14 17:34:54,176 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-14 17:34:54,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:34:54,176 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-14 17:34:54,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:54,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:34:54,365 INFO L256 TraceCheckUtils]: 0: Hoare triple {7412#true} call ULTIMATE.init(); {7412#true} is VALID [2018-11-14 17:34:54,365 INFO L273 TraceCheckUtils]: 1: Hoare triple {7412#true} ~__return_main~0 := 0;~__return_375~0 := 0; {7412#true} is VALID [2018-11-14 17:34:54,365 INFO L273 TraceCheckUtils]: 2: Hoare triple {7412#true} assume true; {7412#true} is VALID [2018-11-14 17:34:54,366 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7412#true} {7412#true} #215#return; {7412#true} is VALID [2018-11-14 17:34:54,366 INFO L256 TraceCheckUtils]: 4: Hoare triple {7412#true} call #t~ret8 := main(); {7412#true} is VALID [2018-11-14 17:34:54,366 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-14 17:34:54,366 INFO L273 TraceCheckUtils]: 6: Hoare triple {7412#true} assume !!(~main__urilen~0 <= 1000000); {7412#true} is VALID [2018-11-14 17:34:54,366 INFO L273 TraceCheckUtils]: 7: Hoare triple {7412#true} assume !!(~main__urilen~0 >= -1000000); {7412#true} is VALID [2018-11-14 17:34:54,367 INFO L273 TraceCheckUtils]: 8: Hoare triple {7412#true} assume !!(~main__tokenlen~0 <= 1000000); {7412#true} is VALID [2018-11-14 17:34:54,367 INFO L273 TraceCheckUtils]: 9: Hoare triple {7412#true} assume !!(~main__tokenlen~0 >= -1000000); {7412#true} is VALID [2018-11-14 17:34:54,367 INFO L273 TraceCheckUtils]: 10: Hoare triple {7412#true} assume !!(~main__scheme~0 <= 1000000); {7412#true} is VALID [2018-11-14 17:34:54,367 INFO L273 TraceCheckUtils]: 11: Hoare triple {7412#true} assume !!(~main__scheme~0 >= -1000000); {7412#true} is VALID [2018-11-14 17:34:54,368 INFO L273 TraceCheckUtils]: 12: Hoare triple {7412#true} assume ~main__urilen~0 > 0; {7412#true} is VALID [2018-11-14 17:34:54,368 INFO L273 TraceCheckUtils]: 13: Hoare triple {7412#true} assume ~main__tokenlen~0 > 0; {7412#true} is VALID [2018-11-14 17:34:54,368 INFO L273 TraceCheckUtils]: 14: Hoare triple {7412#true} assume ~main__scheme~0 >= 0; {7412#true} is VALID [2018-11-14 17:34:54,368 INFO L273 TraceCheckUtils]: 15: Hoare triple {7412#true} assume !(~main__scheme~0 == 0); {7412#true} is VALID [2018-11-14 17:34:54,369 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-14 17:34:54,369 INFO L273 TraceCheckUtils]: 17: Hoare triple {7470#(and (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~0 1))} assume !(~__VERIFIER_assert__cond~0 == 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-14 17:34:54,369 INFO L273 TraceCheckUtils]: 18: Hoare triple {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~1 == 0);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-14 17:34:54,370 INFO L273 TraceCheckUtils]: 19: Hoare triple {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~main____CPAchecker_TMP_0~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-14 17:34:54,370 INFO L273 TraceCheckUtils]: 20: Hoare triple {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~2 == 0);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-14 17:34:54,370 INFO L273 TraceCheckUtils]: 21: Hoare triple {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~3 == 0); {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-14 17:34:54,371 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-14 17:34:54,371 INFO L273 TraceCheckUtils]: 23: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~main____CPAchecker_TMP_1~0 == 0); {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-14 17:34:54,371 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-14 17:34:54,372 INFO L273 TraceCheckUtils]: 25: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~4 == 0);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-14 17:34:54,372 INFO L273 TraceCheckUtils]: 26: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~5 == 0); {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-14 17:34:54,372 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 ~main__cp~0 + 1 < ~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-14 17:34:54,373 INFO L273 TraceCheckUtils]: 28: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~6 == 0);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__cp~0 + 1 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-14 17:34:54,373 INFO L273 TraceCheckUtils]: 29: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~7 == 0); {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-14 17:34:54,374 INFO L273 TraceCheckUtils]: 30: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~main__cp~0 + 1 == ~main__urilen~0 - 1);~main__cp~0 := ~main__cp~0 + 1;~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-14 17:34:54,375 INFO L273 TraceCheckUtils]: 31: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~main____CPAchecker_TMP_2~0 == 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-14 17:34:54,375 INFO L273 TraceCheckUtils]: 32: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~8 == 0);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-14 17:34:54,376 INFO L273 TraceCheckUtils]: 33: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~9 == 0); {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-14 17:34:54,376 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-14 17:34:54,377 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-14 17:34:54,377 INFO L273 TraceCheckUtils]: 36: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~10 == 0);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-14 17:34:54,378 INFO L273 TraceCheckUtils]: 37: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~11 == 0);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-14 17:34:54,378 INFO L273 TraceCheckUtils]: 38: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} assume !!(~main____CPAchecker_TMP_3~0 == 0); {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} is VALID [2018-11-14 17:34:54,379 INFO L273 TraceCheckUtils]: 39: Hoare triple {7417#(<= (+ main_~main__cp~0 2) main_~main__urilen~0)} ~main__cp~0 := ~main__cp~0 + 1; {7416#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2018-11-14 17:34:54,380 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-14 17:34:54,381 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-14 17:34:54,381 INFO L273 TraceCheckUtils]: 42: Hoare triple {7546#(= main_~__VERIFIER_assert__cond~10 1)} assume ~__VERIFIER_assert__cond~10 == 0; {7413#false} is VALID [2018-11-14 17:34:54,381 INFO L273 TraceCheckUtils]: 43: Hoare triple {7413#false} assume !false; {7413#false} is VALID [2018-11-14 17:34:54,385 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-14 17:34:54,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:34:54,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-11-14 17:34:54,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-11-14 17:34:54,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:54,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:34:54,450 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-14 17:34:54,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:34:54,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:34:54,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:34:54,452 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 9 states. [2018-11-14 17:34:54,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:54,836 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-11-14 17:34:54,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:34:54,837 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-11-14 17:34:54,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:54,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:34:54,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2018-11-14 17:34:54,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:34:54,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2018-11-14 17:34:54,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2018-11-14 17:34:54,895 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-14 17:34:54,896 INFO L225 Difference]: With dead ends: 60 [2018-11-14 17:34:54,896 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 17:34:54,897 INFO L604 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-14 17:34:54,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 17:34:54,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-14 17:34:54,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:54,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-14 17:34:54,964 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-14 17:34:54,964 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-14 17:34:54,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:54,965 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-11-14 17:34:54,965 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-14 17:34:54,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:54,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:54,966 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-14 17:34:54,966 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-14 17:34:54,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:54,967 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-11-14 17:34:54,967 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-14 17:34:54,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:54,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:54,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:54,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:54,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-14 17:34:54,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-11-14 17:34:54,968 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44 [2018-11-14 17:34:54,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:54,968 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-11-14 17:34:54,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:34:54,968 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-14 17:34:54,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-14 17:34:54,969 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:54,969 INFO L375 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-14 17:34:54,969 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:54,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:54,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1201439652, now seen corresponding path program 1 times [2018-11-14 17:34:54,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:54,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:54,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:54,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:54,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:55,101 INFO L256 TraceCheckUtils]: 0: Hoare triple {7810#true} call ULTIMATE.init(); {7810#true} is VALID [2018-11-14 17:34:55,101 INFO L273 TraceCheckUtils]: 1: Hoare triple {7810#true} ~__return_main~0 := 0;~__return_375~0 := 0; {7810#true} is VALID [2018-11-14 17:34:55,102 INFO L273 TraceCheckUtils]: 2: Hoare triple {7810#true} assume true; {7810#true} is VALID [2018-11-14 17:34:55,102 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7810#true} {7810#true} #215#return; {7810#true} is VALID [2018-11-14 17:34:55,102 INFO L256 TraceCheckUtils]: 4: Hoare triple {7810#true} call #t~ret8 := main(); {7810#true} is VALID [2018-11-14 17:34:55,102 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-14 17:34:55,102 INFO L273 TraceCheckUtils]: 6: Hoare triple {7810#true} assume !!(~main__urilen~0 <= 1000000); {7810#true} is VALID [2018-11-14 17:34:55,102 INFO L273 TraceCheckUtils]: 7: Hoare triple {7810#true} assume !!(~main__urilen~0 >= -1000000); {7810#true} is VALID [2018-11-14 17:34:55,103 INFO L273 TraceCheckUtils]: 8: Hoare triple {7810#true} assume !!(~main__tokenlen~0 <= 1000000); {7810#true} is VALID [2018-11-14 17:34:55,103 INFO L273 TraceCheckUtils]: 9: Hoare triple {7810#true} assume !!(~main__tokenlen~0 >= -1000000); {7810#true} is VALID [2018-11-14 17:34:55,103 INFO L273 TraceCheckUtils]: 10: Hoare triple {7810#true} assume !!(~main__scheme~0 <= 1000000); {7810#true} is VALID [2018-11-14 17:34:55,103 INFO L273 TraceCheckUtils]: 11: Hoare triple {7810#true} assume !!(~main__scheme~0 >= -1000000); {7810#true} is VALID [2018-11-14 17:34:55,103 INFO L273 TraceCheckUtils]: 12: Hoare triple {7810#true} assume ~main__urilen~0 > 0; {7810#true} is VALID [2018-11-14 17:34:55,104 INFO L273 TraceCheckUtils]: 13: Hoare triple {7810#true} assume ~main__tokenlen~0 > 0; {7810#true} is VALID [2018-11-14 17:34:55,104 INFO L273 TraceCheckUtils]: 14: Hoare triple {7810#true} assume ~main__scheme~0 >= 0; {7810#true} is VALID [2018-11-14 17:34:55,104 INFO L273 TraceCheckUtils]: 15: Hoare triple {7810#true} assume !(~main__scheme~0 == 0); {7810#true} is VALID [2018-11-14 17:34:55,104 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-14 17:34:55,105 INFO L273 TraceCheckUtils]: 17: Hoare triple {7810#true} assume !(~__VERIFIER_assert__cond~0 == 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-14 17:34:55,105 INFO L273 TraceCheckUtils]: 18: Hoare triple {7810#true} assume !(~__VERIFIER_assert__cond~1 == 0);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-14 17:34:55,105 INFO L273 TraceCheckUtils]: 19: Hoare triple {7810#true} assume !(~main____CPAchecker_TMP_0~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-14 17:34:55,105 INFO L273 TraceCheckUtils]: 20: Hoare triple {7810#true} assume !(~__VERIFIER_assert__cond~2 == 0);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-14 17:34:55,106 INFO L273 TraceCheckUtils]: 21: Hoare triple {7810#true} assume !(~__VERIFIER_assert__cond~3 == 0); {7810#true} is VALID [2018-11-14 17:34:55,106 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-14 17:34:55,106 INFO L273 TraceCheckUtils]: 23: Hoare triple {7810#true} assume !(~main____CPAchecker_TMP_1~0 == 0); {7810#true} is VALID [2018-11-14 17:34:55,106 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-14 17:34:55,106 INFO L273 TraceCheckUtils]: 25: Hoare triple {7810#true} assume !(~__VERIFIER_assert__cond~4 == 0);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-14 17:34:55,106 INFO L273 TraceCheckUtils]: 26: Hoare triple {7810#true} assume !(~__VERIFIER_assert__cond~5 == 0); {7810#true} is VALID [2018-11-14 17:34:55,107 INFO L273 TraceCheckUtils]: 27: Hoare triple {7810#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__cp~0 + 1 < ~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-14 17:34:55,107 INFO L273 TraceCheckUtils]: 28: Hoare triple {7810#true} assume !(~__VERIFIER_assert__cond~6 == 0);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__cp~0 + 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {7810#true} is VALID [2018-11-14 17:34:55,107 INFO L273 TraceCheckUtils]: 29: Hoare triple {7810#true} assume !(~__VERIFIER_assert__cond~7 == 0); {7810#true} is VALID [2018-11-14 17:34:55,107 INFO L273 TraceCheckUtils]: 30: Hoare triple {7810#true} assume !(~main__cp~0 + 1 == ~main__urilen~0 - 1);~main__cp~0 := ~main__cp~0 + 1;~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-14 17:34:55,107 INFO L273 TraceCheckUtils]: 31: Hoare triple {7810#true} assume !(~main____CPAchecker_TMP_2~0 == 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-14 17:34:55,124 INFO L273 TraceCheckUtils]: 32: Hoare triple {7810#true} assume !(~__VERIFIER_assert__cond~8 == 0);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-14 17:34:55,133 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 !(~__VERIFIER_assert__cond~9 == 0); {7813#(<= 0 main_~main__cp~0)} is VALID [2018-11-14 17:34:55,146 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-14 17:34:55,154 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-14 17:34:55,168 INFO L273 TraceCheckUtils]: 36: Hoare triple {7813#(<= 0 main_~main__cp~0)} assume !(~__VERIFIER_assert__cond~10 == 0);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-14 17:34:55,176 INFO L273 TraceCheckUtils]: 37: Hoare triple {7813#(<= 0 main_~main__cp~0)} assume !(~__VERIFIER_assert__cond~11 == 0);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-14 17:34:55,191 INFO L273 TraceCheckUtils]: 38: Hoare triple {7813#(<= 0 main_~main__cp~0)} assume !(~main____CPAchecker_TMP_3~0 == 0);~main__c~0 := ~main__c~0 + 1;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-14 17:34:55,199 INFO L273 TraceCheckUtils]: 39: Hoare triple {7813#(<= 0 main_~main__cp~0)} assume !(~__VERIFIER_assert__cond~12 == 0);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-14 17:34:55,211 INFO L273 TraceCheckUtils]: 40: Hoare triple {7813#(<= 0 main_~main__cp~0)} assume !(~__VERIFIER_assert__cond~13 == 0);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-14 17:34:55,211 INFO L273 TraceCheckUtils]: 41: Hoare triple {7813#(<= 0 main_~main__cp~0)} assume !(~__VERIFIER_assert__cond~14 == 0);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-14 17:34:55,212 INFO L273 TraceCheckUtils]: 42: Hoare triple {7814#(not (= 0 main_~__VERIFIER_assert__cond~15))} assume ~__VERIFIER_assert__cond~15 == 0; {7811#false} is VALID [2018-11-14 17:34:55,212 INFO L273 TraceCheckUtils]: 43: Hoare triple {7811#false} assume !false; {7811#false} is VALID [2018-11-14 17:34:55,213 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-14 17:34:55,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:55,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:34:55,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-14 17:34:55,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:55,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:34:55,250 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-14 17:34:55,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:34:55,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:34:55,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:34:55,251 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 5 states. [2018-11-14 17:34:55,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:55,590 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-14 17:34:55,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:34:55,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-14 17:34:55,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:55,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:55,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-14 17:34:55,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:55,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-14 17:34:55,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2018-11-14 17:34:55,650 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-14 17:34:55,652 INFO L225 Difference]: With dead ends: 69 [2018-11-14 17:34:55,652 INFO L226 Difference]: Without dead ends: 67 [2018-11-14 17:34:55,652 INFO L604 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-14 17:34:55,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-14 17:34:55,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2018-11-14 17:34:55,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:55,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 56 states. [2018-11-14 17:34:55,723 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 56 states. [2018-11-14 17:34:55,723 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 56 states. [2018-11-14 17:34:55,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:55,725 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-14 17:34:55,725 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-14 17:34:55,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:55,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:55,726 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 67 states. [2018-11-14 17:34:55,726 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 67 states. [2018-11-14 17:34:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:55,727 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-14 17:34:55,727 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-14 17:34:55,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:55,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:55,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:55,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:55,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 17:34:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-11-14 17:34:55,729 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2018-11-14 17:34:55,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:55,729 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-11-14 17:34:55,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:34:55,730 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-11-14 17:34:55,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 17:34:55,730 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:55,730 INFO L375 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-14 17:34:55,731 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:55,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:55,731 INFO L82 PathProgramCache]: Analyzing trace with hash 40764835, now seen corresponding path program 1 times [2018-11-14 17:34:55,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:55,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:55,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:55,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:55,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:56,074 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-14 17:34:56,486 INFO L256 TraceCheckUtils]: 0: Hoare triple {8100#true} call ULTIMATE.init(); {8100#true} is VALID [2018-11-14 17:34:56,487 INFO L273 TraceCheckUtils]: 1: Hoare triple {8100#true} ~__return_main~0 := 0;~__return_375~0 := 0; {8100#true} is VALID [2018-11-14 17:34:56,487 INFO L273 TraceCheckUtils]: 2: Hoare triple {8100#true} assume true; {8100#true} is VALID [2018-11-14 17:34:56,487 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8100#true} {8100#true} #215#return; {8100#true} is VALID [2018-11-14 17:34:56,487 INFO L256 TraceCheckUtils]: 4: Hoare triple {8100#true} call #t~ret8 := main(); {8100#true} is VALID [2018-11-14 17:34:56,487 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-14 17:34:56,488 INFO L273 TraceCheckUtils]: 6: Hoare triple {8100#true} assume !!(~main__urilen~0 <= 1000000); {8100#true} is VALID [2018-11-14 17:34:56,488 INFO L273 TraceCheckUtils]: 7: Hoare triple {8100#true} assume !!(~main__urilen~0 >= -1000000); {8100#true} is VALID [2018-11-14 17:34:56,488 INFO L273 TraceCheckUtils]: 8: Hoare triple {8100#true} assume !!(~main__tokenlen~0 <= 1000000); {8100#true} is VALID [2018-11-14 17:34:56,488 INFO L273 TraceCheckUtils]: 9: Hoare triple {8100#true} assume !!(~main__tokenlen~0 >= -1000000); {8100#true} is VALID [2018-11-14 17:34:56,488 INFO L273 TraceCheckUtils]: 10: Hoare triple {8100#true} assume !!(~main__scheme~0 <= 1000000); {8100#true} is VALID [2018-11-14 17:34:56,489 INFO L273 TraceCheckUtils]: 11: Hoare triple {8100#true} assume !!(~main__scheme~0 >= -1000000); {8100#true} is VALID [2018-11-14 17:34:56,489 INFO L273 TraceCheckUtils]: 12: Hoare triple {8100#true} assume ~main__urilen~0 > 0; {8100#true} is VALID [2018-11-14 17:34:56,489 INFO L273 TraceCheckUtils]: 13: Hoare triple {8100#true} assume ~main__tokenlen~0 > 0; {8100#true} is VALID [2018-11-14 17:34:56,489 INFO L273 TraceCheckUtils]: 14: Hoare triple {8100#true} assume ~main__scheme~0 >= 0; {8100#true} is VALID [2018-11-14 17:34:56,489 INFO L273 TraceCheckUtils]: 15: Hoare triple {8100#true} assume !(~main__scheme~0 == 0); {8100#true} is VALID [2018-11-14 17:34:56,489 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-14 17:34:56,490 INFO L273 TraceCheckUtils]: 17: Hoare triple {8100#true} assume !(~__VERIFIER_assert__cond~0 == 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-14 17:34:56,490 INFO L273 TraceCheckUtils]: 18: Hoare triple {8100#true} assume !(~__VERIFIER_assert__cond~1 == 0);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-14 17:34:56,490 INFO L273 TraceCheckUtils]: 19: Hoare triple {8100#true} assume !(~main____CPAchecker_TMP_0~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-14 17:34:56,490 INFO L273 TraceCheckUtils]: 20: Hoare triple {8100#true} assume !(~__VERIFIER_assert__cond~2 == 0);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-14 17:34:56,490 INFO L273 TraceCheckUtils]: 21: Hoare triple {8100#true} assume !(~__VERIFIER_assert__cond~3 == 0); {8100#true} is VALID [2018-11-14 17:34:56,490 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-14 17:34:56,491 INFO L273 TraceCheckUtils]: 23: Hoare triple {8100#true} assume !(~main____CPAchecker_TMP_1~0 == 0); {8100#true} is VALID [2018-11-14 17:34:56,491 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-14 17:34:56,491 INFO L273 TraceCheckUtils]: 25: Hoare triple {8100#true} assume !(~__VERIFIER_assert__cond~4 == 0);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-14 17:34:56,491 INFO L273 TraceCheckUtils]: 26: Hoare triple {8100#true} assume !(~__VERIFIER_assert__cond~5 == 0); {8100#true} is VALID [2018-11-14 17:34:56,491 INFO L273 TraceCheckUtils]: 27: Hoare triple {8100#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__cp~0 + 1 < ~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-14 17:34:56,491 INFO L273 TraceCheckUtils]: 28: Hoare triple {8100#true} assume !(~__VERIFIER_assert__cond~6 == 0);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__cp~0 + 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {8100#true} is VALID [2018-11-14 17:34:56,492 INFO L273 TraceCheckUtils]: 29: Hoare triple {8100#true} assume !(~__VERIFIER_assert__cond~7 == 0); {8100#true} is VALID [2018-11-14 17:34:56,492 INFO L273 TraceCheckUtils]: 30: Hoare triple {8100#true} assume !(~main__cp~0 + 1 == ~main__urilen~0 - 1);~main__cp~0 := ~main__cp~0 + 1;~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-14 17:34:56,492 INFO L273 TraceCheckUtils]: 31: Hoare triple {8100#true} assume !(~main____CPAchecker_TMP_2~0 == 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-14 17:34:56,492 INFO L273 TraceCheckUtils]: 32: Hoare triple {8100#true} assume !(~__VERIFIER_assert__cond~8 == 0);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-14 17:34:56,492 INFO L273 TraceCheckUtils]: 33: Hoare triple {8100#true} assume !(~__VERIFIER_assert__cond~9 == 0); {8100#true} is VALID [2018-11-14 17:34:56,493 INFO L273 TraceCheckUtils]: 34: Hoare triple {8100#true} assume ~main__cp~0 != ~main__urilen~0 - 1; {8100#true} is VALID [2018-11-14 17:34:56,493 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-14 17:34:56,493 INFO L273 TraceCheckUtils]: 36: Hoare triple {8100#true} assume !(~__VERIFIER_assert__cond~10 == 0);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-14 17:34:56,493 INFO L273 TraceCheckUtils]: 37: Hoare triple {8100#true} assume !(~__VERIFIER_assert__cond~11 == 0);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-14 17:34:56,493 INFO L273 TraceCheckUtils]: 38: Hoare triple {8100#true} assume !!(~main____CPAchecker_TMP_3~0 == 0); {8100#true} is VALID [2018-11-14 17:34:56,493 INFO L273 TraceCheckUtils]: 39: Hoare triple {8100#true} ~main__cp~0 := ~main__cp~0 + 1; {8100#true} is VALID [2018-11-14 17:34:56,494 INFO L273 TraceCheckUtils]: 40: Hoare triple {8100#true} assume ~main__cp~0 != ~main__urilen~0 - 1; {8100#true} is VALID [2018-11-14 17:34:56,506 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-14 17:34:56,521 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 !(~__VERIFIER_assert__cond~10 == 0);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-14 17:34:56,530 INFO L273 TraceCheckUtils]: 43: Hoare triple {8103#(< main_~main__cp~0 main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~11 == 0);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-14 17:34:56,531 INFO L273 TraceCheckUtils]: 44: Hoare triple {8103#(< main_~main__cp~0 main_~main__urilen~0)} assume !(~main____CPAchecker_TMP_3~0 == 0);~main__c~0 := ~main__c~0 + 1;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-14 17:34:56,533 INFO L273 TraceCheckUtils]: 45: Hoare triple {8103#(< main_~main__cp~0 main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~12 == 0);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-14 17:34:56,533 INFO L273 TraceCheckUtils]: 46: Hoare triple {8103#(< main_~main__cp~0 main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~13 == 0);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-14 17:34:56,535 INFO L273 TraceCheckUtils]: 47: Hoare triple {8104#(not (= 0 main_~__VERIFIER_assert__cond~14))} assume ~__VERIFIER_assert__cond~14 == 0; {8101#false} is VALID [2018-11-14 17:34:56,535 INFO L273 TraceCheckUtils]: 48: Hoare triple {8101#false} assume !false; {8101#false} is VALID [2018-11-14 17:34:56,536 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-14 17:34:56,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:56,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:34:56,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-11-14 17:34:56,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:56,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:34:56,584 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-14 17:34:56,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:34:56,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:34:56,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:34:56,585 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 5 states. [2018-11-14 17:34:57,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:57,262 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-11-14 17:34:57,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:34:57,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-11-14 17:34:57,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:57,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:57,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2018-11-14 17:34:57,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:57,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2018-11-14 17:34:57,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 71 transitions. [2018-11-14 17:34:57,328 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-14 17:34:57,329 INFO L225 Difference]: With dead ends: 75 [2018-11-14 17:34:57,329 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 17:34:57,330 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:34:57,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 17:34:57,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 17:34:57,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:57,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 17:34:57,331 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:34:57,331 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:34:57,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:57,331 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:34:57,331 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:34:57,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:57,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:57,332 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:34:57,332 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:34:57,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:57,332 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:34:57,332 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:34:57,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:57,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:57,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:57,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:57,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 17:34:57,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 17:34:57,333 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2018-11-14 17:34:57,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:57,333 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 17:34:57,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:34:57,333 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:34:57,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:57,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 17:34:57,466 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 107 [2018-11-14 17:34:57,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-14 17:34:57,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-14 17:34:57,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-14 17:34:57,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-14 17:34:58,592 WARN L179 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 69 [2018-11-14 17:34:59,260 WARN L179 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 27 [2018-11-14 17:34:59,618 WARN L179 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2018-11-14 17:34:59,801 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 28 [2018-11-14 17:34:59,812 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-14 17:34:59,813 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-14 17:34:59,813 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:34:59,813 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:34:59,813 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 17:34:59,813 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 17:34:59,813 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 17:34:59,814 INFO L425 ceAbstractionStarter]: For program point L60(lines 60 412) no Hoare annotation was computed. [2018-11-14 17:34:59,814 INFO L425 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2018-11-14 17:34:59,814 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 434) no Hoare annotation was computed. [2018-11-14 17:34:59,814 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-14 17:34:59,814 INFO L425 ceAbstractionStarter]: For program point L118(lines 118 398) no Hoare annotation was computed. [2018-11-14 17:34:59,814 INFO L425 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2018-11-14 17:34:59,814 INFO L425 ceAbstractionStarter]: For program point L267(line 267) no Hoare annotation was computed. [2018-11-14 17:34:59,814 INFO L425 ceAbstractionStarter]: For program point L36(lines 36 430) no Hoare annotation was computed. [2018-11-14 17:34:59,814 INFO L425 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-11-14 17:34:59,814 INFO L425 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 291) no Hoare annotation was computed. [2018-11-14 17:34:59,814 INFO L425 ceAbstractionStarter]: For program point L367(lines 367 390) no Hoare annotation was computed. [2018-11-14 17:34:59,814 INFO L425 ceAbstractionStarter]: For program point L78(lines 78 409) no Hoare annotation was computed. [2018-11-14 17:34:59,815 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 311) no Hoare annotation was computed. [2018-11-14 17:34:59,815 INFO L425 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 221) no Hoare annotation was computed. [2018-11-14 17:34:59,815 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2018-11-14 17:34:59,815 INFO L425 ceAbstractionStarter]: For program point L219(lines 219 339) no Hoare annotation was computed. [2018-11-14 17:34:59,815 INFO L425 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-11-14 17:34:59,815 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-11-14 17:34:59,815 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 427) no Hoare annotation was computed. [2018-11-14 17:34:59,815 INFO L421 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-14 17:34:59,815 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 315) no Hoare annotation was computed. [2018-11-14 17:34:59,816 INFO L425 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 303) no Hoare annotation was computed. [2018-11-14 17:34:59,816 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 434) no Hoare annotation was computed. [2018-11-14 17:34:59,816 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 326) no Hoare annotation was computed. [2018-11-14 17:34:59,816 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 352) no Hoare annotation was computed. [2018-11-14 17:34:59,816 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2018-11-14 17:34:59,816 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 431) no Hoare annotation was computed. [2018-11-14 17:34:59,816 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 8 434) the Hoare annotation is: true [2018-11-14 17:34:59,816 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-11-14 17:34:59,816 INFO L425 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 238) no Hoare annotation was computed. [2018-11-14 17:34:59,816 INFO L425 ceAbstractionStarter]: For program point L369(line 369) no Hoare annotation was computed. [2018-11-14 17:34:59,817 INFO L425 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-11-14 17:34:59,817 INFO L425 ceAbstractionStarter]: For program point L303(line 303) no Hoare annotation was computed. [2018-11-14 17:34:59,817 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 357) no Hoare annotation was computed. [2018-11-14 17:34:59,817 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 333) no Hoare annotation was computed. [2018-11-14 17:34:59,817 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 392) no Hoare annotation was computed. [2018-11-14 17:34:59,817 INFO L425 ceAbstractionStarter]: For program point L221(line 221) no Hoare annotation was computed. [2018-11-14 17:34:59,817 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 422) no Hoare annotation was computed. [2018-11-14 17:34:59,817 INFO L425 ceAbstractionStarter]: For program point L279(line 279) no Hoare annotation was computed. [2018-11-14 17:34:59,817 INFO L425 ceAbstractionStarter]: For program point L48(lines 48 428) no Hoare annotation was computed. [2018-11-14 17:34:59,818 INFO L425 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2018-11-14 17:34:59,818 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-14 17:34:59,818 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 400) no Hoare annotation was computed. [2018-11-14 17:34:59,818 INFO L421 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-14 17:34:59,818 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 349) no Hoare annotation was computed. [2018-11-14 17:34:59,818 INFO L425 ceAbstractionStarter]: For program point L379(lines 379 388) no Hoare annotation was computed. [2018-11-14 17:34:59,818 INFO L425 ceAbstractionStarter]: For program point L90(lines 90 407) no Hoare annotation was computed. [2018-11-14 17:34:59,818 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 432) no Hoare annotation was computed. [2018-11-14 17:34:59,818 INFO L425 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-11-14 17:34:59,819 INFO L421 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-14 17:34:59,819 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 406) no Hoare annotation was computed. [2018-11-14 17:34:59,819 INFO L425 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 369) no Hoare annotation was computed. [2018-11-14 17:34:59,819 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 411) no Hoare annotation was computed. [2018-11-14 17:34:59,819 INFO L421 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-14 17:34:59,820 INFO L425 ceAbstractionStarter]: For program point L289(lines 289 313) no Hoare annotation was computed. [2018-11-14 17:34:59,820 INFO L425 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2018-11-14 17:34:59,820 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2018-11-14 17:34:59,820 INFO L425 ceAbstractionStarter]: For program point L157(lines 157 354) no Hoare annotation was computed. [2018-11-14 17:34:59,820 INFO L425 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2018-11-14 17:34:59,820 INFO L425 ceAbstractionStarter]: For program point L58(lines 58 417) no Hoare annotation was computed. [2018-11-14 17:34:59,820 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2018-11-14 17:34:59,820 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 324) no Hoare annotation was computed. [2018-11-14 17:34:59,820 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 350) no Hoare annotation was computed. [2018-11-14 17:34:59,820 INFO L421 ceAbstractionStarter]: At program point L405(lines 99 406) the Hoare annotation is: (= main_~__VERIFIER_assert__cond~0 1) [2018-11-14 17:34:59,820 INFO L425 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2018-11-14 17:34:59,820 INFO L425 ceAbstractionStarter]: For program point L207(lines 207 341) no Hoare annotation was computed. [2018-11-14 17:34:59,821 INFO L425 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-11-14 17:34:59,821 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 429) no Hoare annotation was computed. [2018-11-14 17:34:59,821 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 317) no Hoare annotation was computed. [2018-11-14 17:34:59,821 INFO L425 ceAbstractionStarter]: For program point L199(lines 199 348) no Hoare annotation was computed. [2018-11-14 17:34:59,821 INFO L425 ceAbstractionStarter]: For program point L257(lines 257 323) no Hoare annotation was computed. [2018-11-14 17:34:59,821 INFO L425 ceAbstractionStarter]: For program point L381(line 381) no Hoare annotation was computed. [2018-11-14 17:34:59,821 INFO L425 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2018-11-14 17:34:59,821 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 92) no Hoare annotation was computed. [2018-11-14 17:34:59,821 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 355) no Hoare annotation was computed. [2018-11-14 17:34:59,821 INFO L425 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 209) no Hoare annotation was computed. [2018-11-14 17:34:59,821 INFO L425 ceAbstractionStarter]: For program point L18(lines 18 433) no Hoare annotation was computed. [2018-11-14 17:34:59,821 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2018-11-14 17:34:59,822 INFO L425 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 381) no Hoare annotation was computed. [2018-11-14 17:34:59,822 INFO L425 ceAbstractionStarter]: For program point L291(line 291) no Hoare annotation was computed. [2018-11-14 17:34:59,823 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 17:34:59,824 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-14 17:34:59,824 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 17:34:59,824 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:34:59,824 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-14 17:34:59,824 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-14 17:34:59,824 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:34:59,824 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:34:59,825 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:34:59,825 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-14 17:34:59,825 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-14 17:34:59,825 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 17:34:59,825 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-14 17:34:59,825 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-14 17:34:59,825 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2018-11-14 17:34:59,825 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2018-11-14 17:34:59,825 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2018-11-14 17:34:59,826 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2018-11-14 17:34:59,826 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2018-11-14 17:34:59,826 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2018-11-14 17:34:59,826 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2018-11-14 17:34:59,826 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2018-11-14 17:34:59,826 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2018-11-14 17:34:59,826 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2018-11-14 17:34:59,826 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2018-11-14 17:34:59,826 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2018-11-14 17:34:59,826 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2018-11-14 17:34:59,827 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2018-11-14 17:34:59,827 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2018-11-14 17:34:59,827 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2018-11-14 17:34:59,827 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2018-11-14 17:34:59,827 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2018-11-14 17:34:59,827 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2018-11-14 17:34:59,827 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2018-11-14 17:34:59,827 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2018-11-14 17:34:59,827 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2018-11-14 17:34:59,827 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2018-11-14 17:34:59,828 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2018-11-14 17:34:59,828 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2018-11-14 17:34:59,828 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2018-11-14 17:34:59,828 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2018-11-14 17:34:59,828 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2018-11-14 17:34:59,828 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:34:59,828 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2018-11-14 17:34:59,828 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2018-11-14 17:34:59,828 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2018-11-14 17:34:59,828 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2018-11-14 17:34:59,829 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2018-11-14 17:34:59,829 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2018-11-14 17:34:59,829 WARN L170 areAnnotationChecker]: L130 has no Hoare annotation [2018-11-14 17:34:59,846 WARN L170 areAnnotationChecker]: L130 has no Hoare annotation [2018-11-14 17:34:59,846 WARN L170 areAnnotationChecker]: L130 has no Hoare annotation [2018-11-14 17:34:59,846 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2018-11-14 17:34:59,846 WARN L170 areAnnotationChecker]: L367 has no Hoare annotation [2018-11-14 17:34:59,846 WARN L170 areAnnotationChecker]: L367 has no Hoare annotation [2018-11-14 17:34:59,846 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2018-11-14 17:34:59,847 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2018-11-14 17:34:59,847 WARN L170 areAnnotationChecker]: L369 has no Hoare annotation [2018-11-14 17:34:59,847 WARN L170 areAnnotationChecker]: L369 has no Hoare annotation [2018-11-14 17:34:59,847 WARN L170 areAnnotationChecker]: L379 has no Hoare annotation [2018-11-14 17:34:59,847 WARN L170 areAnnotationChecker]: L379 has no Hoare annotation [2018-11-14 17:34:59,847 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2018-11-14 17:34:59,847 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2018-11-14 17:34:59,847 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2018-11-14 17:34:59,847 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2018-11-14 17:34:59,847 WARN L170 areAnnotationChecker]: L381 has no Hoare annotation [2018-11-14 17:34:59,847 WARN L170 areAnnotationChecker]: L381 has no Hoare annotation [2018-11-14 17:34:59,847 WARN L170 areAnnotationChecker]: L152 has no Hoare annotation [2018-11-14 17:34:59,847 WARN L170 areAnnotationChecker]: L152 has no Hoare annotation [2018-11-14 17:34:59,847 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2018-11-14 17:34:59,848 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2018-11-14 17:34:59,848 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2018-11-14 17:34:59,848 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2018-11-14 17:34:59,848 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2018-11-14 17:34:59,848 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2018-11-14 17:34:59,848 WARN L170 areAnnotationChecker]: L182 has no Hoare annotation [2018-11-14 17:34:59,848 WARN L170 areAnnotationChecker]: L182 has no Hoare annotation [2018-11-14 17:34:59,848 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2018-11-14 17:34:59,848 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2018-11-14 17:34:59,848 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2018-11-14 17:34:59,848 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2018-11-14 17:34:59,848 WARN L170 areAnnotationChecker]: L199 has no Hoare annotation [2018-11-14 17:34:59,848 WARN L170 areAnnotationChecker]: L199 has no Hoare annotation [2018-11-14 17:34:59,848 WARN L170 areAnnotationChecker]: L207 has no Hoare annotation [2018-11-14 17:34:59,848 WARN L170 areAnnotationChecker]: L207 has no Hoare annotation [2018-11-14 17:34:59,849 WARN L170 areAnnotationChecker]: L209 has no Hoare annotation [2018-11-14 17:34:59,849 WARN L170 areAnnotationChecker]: L209 has no Hoare annotation [2018-11-14 17:34:59,849 WARN L170 areAnnotationChecker]: L219 has no Hoare annotation [2018-11-14 17:34:59,849 WARN L170 areAnnotationChecker]: L219 has no Hoare annotation [2018-11-14 17:34:59,849 WARN L170 areAnnotationChecker]: L221 has no Hoare annotation [2018-11-14 17:34:59,849 WARN L170 areAnnotationChecker]: L221 has no Hoare annotation [2018-11-14 17:34:59,849 WARN L170 areAnnotationChecker]: L229 has no Hoare annotation [2018-11-14 17:34:59,853 WARN L170 areAnnotationChecker]: L229 has no Hoare annotation [2018-11-14 17:34:59,853 WARN L170 areAnnotationChecker]: L229 has no Hoare annotation [2018-11-14 17:34:59,853 WARN L170 areAnnotationChecker]: L236 has no Hoare annotation [2018-11-14 17:34:59,853 WARN L170 areAnnotationChecker]: L236 has no Hoare annotation [2018-11-14 17:34:59,853 WARN L170 areAnnotationChecker]: L238 has no Hoare annotation [2018-11-14 17:34:59,853 WARN L170 areAnnotationChecker]: L238 has no Hoare annotation [2018-11-14 17:34:59,854 WARN L170 areAnnotationChecker]: L248 has no Hoare annotation [2018-11-14 17:34:59,854 WARN L170 areAnnotationChecker]: L248 has no Hoare annotation [2018-11-14 17:34:59,854 WARN L170 areAnnotationChecker]: L250 has no Hoare annotation [2018-11-14 17:34:59,854 WARN L170 areAnnotationChecker]: L250 has no Hoare annotation [2018-11-14 17:34:59,854 WARN L170 areAnnotationChecker]: L257 has no Hoare annotation [2018-11-14 17:34:59,854 WARN L170 areAnnotationChecker]: L257 has no Hoare annotation [2018-11-14 17:34:59,854 WARN L170 areAnnotationChecker]: L265 has no Hoare annotation [2018-11-14 17:34:59,854 WARN L170 areAnnotationChecker]: L265 has no Hoare annotation [2018-11-14 17:34:59,856 WARN L170 areAnnotationChecker]: L267 has no Hoare annotation [2018-11-14 17:34:59,856 WARN L170 areAnnotationChecker]: L267 has no Hoare annotation [2018-11-14 17:34:59,856 WARN L170 areAnnotationChecker]: L277 has no Hoare annotation [2018-11-14 17:34:59,856 WARN L170 areAnnotationChecker]: L277 has no Hoare annotation [2018-11-14 17:34:59,856 WARN L170 areAnnotationChecker]: L279 has no Hoare annotation [2018-11-14 17:34:59,856 WARN L170 areAnnotationChecker]: L279 has no Hoare annotation [2018-11-14 17:34:59,856 WARN L170 areAnnotationChecker]: L289 has no Hoare annotation [2018-11-14 17:34:59,856 WARN L170 areAnnotationChecker]: L289 has no Hoare annotation [2018-11-14 17:34:59,856 WARN L170 areAnnotationChecker]: L291 has no Hoare annotation [2018-11-14 17:34:59,857 WARN L170 areAnnotationChecker]: L291 has no Hoare annotation [2018-11-14 17:34:59,857 WARN L170 areAnnotationChecker]: L301 has no Hoare annotation [2018-11-14 17:34:59,857 WARN L170 areAnnotationChecker]: L301 has no Hoare annotation [2018-11-14 17:34:59,857 WARN L170 areAnnotationChecker]: L303 has no Hoare annotation [2018-11-14 17:34:59,857 WARN L170 areAnnotationChecker]: L303 has no Hoare annotation [2018-11-14 17:34:59,857 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-14 17:34:59,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:34:59 BoogieIcfgContainer [2018-11-14 17:34:59,880 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 17:34:59,881 INFO L168 Benchmark]: Toolchain (without parser) took 33827.92 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 1.9 GB in the end (delta: -442.6 MB). Peak memory consumption was 645.3 MB. Max. memory is 7.1 GB. [2018-11-14 17:34:59,882 INFO L168 Benchmark]: CDTParser took 0.20 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-14 17:34:59,883 INFO L168 Benchmark]: CACSL2BoogieTranslator took 454.79 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-14 17:34:59,883 INFO L168 Benchmark]: Boogie Preprocessor took 59.89 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-14 17:34:59,884 INFO L168 Benchmark]: RCFGBuilder took 1458.16 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.0 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -733.4 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2018-11-14 17:34:59,885 INFO L168 Benchmark]: TraceAbstraction took 31850.11 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 354.9 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 269.7 MB). Peak memory consumption was 624.7 MB. Max. memory is 7.1 GB. [2018-11-14 17:34:59,888 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.20 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 454.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.89 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 1458.16 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.0 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -733.4 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31850.11 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 354.9 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 269.7 MB). Peak memory consumption was 624.7 MB. 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: 279]: 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: 267]: 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: 152]: 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: 120]: 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: 172]: 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: 108]: 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: 250]: 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: 369]: 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 - 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.7s OverallTime, 23 OverallIterations, 2 TraceHistogramMax, 17.0s AutomataDifference, 0.0s DeadEndRemovalTime, 2.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1337 SDtfs, 2826 SDslu, 1899 SDs, 0 SdLazy, 1151 SolverSat, 166 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 157 SyntacticMatches, 5 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 5.1s 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.3s HoareSimplificationTime, 9 FomulaSimplificationsInter, 80271 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.0s 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...