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-get-tag_true-unreach-call.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:34:26,469 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:34:26,474 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:34:26,496 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:34:26,497 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:34:26,500 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:34:26,502 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:34:26,505 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:34:26,507 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:34:26,510 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:34:26,512 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:34:26,513 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:34:26,514 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:34:26,515 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:34:26,518 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:34:26,520 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:34:26,520 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:34:26,524 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:34:26,535 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:34:26,538 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:34:26,539 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:34:26,541 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:34:26,544 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:34:26,545 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:34:26,545 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:34:26,546 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:34:26,548 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:34:26,549 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:34:26,550 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:34:26,551 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:34:26,552 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:34:26,555 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:34:26,555 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:34:26,555 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:34:26,558 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:34:26,559 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:34:26,559 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:26,586 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:34:26,587 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:34:26,587 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:34:26,591 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:34:26,591 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:34:26,592 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:34:26,592 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:34:26,592 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:34:26,592 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:34:26,593 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:34:26,594 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:34:26,594 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:34:26,594 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:34:26,594 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:34:26,595 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:34:26,595 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:34:26,595 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:34:26,595 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:34:26,596 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:34:26,596 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:34:26,596 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:34:26,596 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:34:26,596 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:34:26,597 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:34:26,597 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:34:26,597 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:34:26,597 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:34:26,598 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:34:26,599 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:34:26,599 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:34:26,660 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:34:26,677 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:34:26,681 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:34:26,683 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:34:26,683 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:34:26,684 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.p+lhb-reducer.c [2018-11-14 17:34:26,752 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/399707b39/3a19f00d45b9407d9769af4d15aeb4a5/FLAGf1f53f530 [2018-11-14 17:34:27,289 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:34:27,290 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.p+lhb-reducer.c [2018-11-14 17:34:27,308 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/399707b39/3a19f00d45b9407d9769af4d15aeb4a5/FLAGf1f53f530 [2018-11-14 17:34:27,329 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/399707b39/3a19f00d45b9407d9769af4d15aeb4a5 [2018-11-14 17:34:27,342 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:34:27,344 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:34:27,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:34:27,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:34:27,349 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:34:27,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:34:27" (1/1) ... [2018-11-14 17:34:27,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b188b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:27, skipping insertion in model container [2018-11-14 17:34:27,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:34:27" (1/1) ... [2018-11-14 17:34:27,363 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:34:27,412 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:34:27,821 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:34:27,828 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:34:27,965 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:34:27,993 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:34:27,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:27 WrapperNode [2018-11-14 17:34:27,994 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:34:27,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:34:27,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:34:27,995 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:34:28,011 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:27" (1/1) ... [2018-11-14 17:34:28,011 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:27" (1/1) ... [2018-11-14 17:34:28,024 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:27" (1/1) ... [2018-11-14 17:34:28,024 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:27" (1/1) ... [2018-11-14 17:34:28,057 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:27" (1/1) ... [2018-11-14 17:34:28,146 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:27" (1/1) ... [2018-11-14 17:34:28,152 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:27" (1/1) ... [2018-11-14 17:34:28,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:34:28,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:34:28,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:34:28,164 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:34:28,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:27" (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:28,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:34:28,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:34:28,233 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:34:28,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:34:28,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 17:34:28,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:34:28,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:34:28,234 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:34:28,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:34:28,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:34:30,213 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:34:30,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:34:30 BoogieIcfgContainer [2018-11-14 17:34:30,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:34:30,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:34:30,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:34:30,219 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:34:30,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:34:27" (1/3) ... [2018-11-14 17:34:30,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172b6be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:34:30, skipping insertion in model container [2018-11-14 17:34:30,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:27" (2/3) ... [2018-11-14 17:34:30,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172b6be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:34:30, skipping insertion in model container [2018-11-14 17:34:30,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:34:30" (3/3) ... [2018-11-14 17:34:30,223 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.p+lhb-reducer.c [2018-11-14 17:34:30,231 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:34:30,240 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2018-11-14 17:34:30,255 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2018-11-14 17:34:30,288 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:34:30,289 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:34:30,289 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:34:30,289 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:34:30,289 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:34:30,290 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:34:30,290 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:34:30,290 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:34:30,290 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:34:30,316 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2018-11-14 17:34:30,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 17:34:30,323 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:30,324 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:30,327 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:30,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:30,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1915845654, now seen corresponding path program 1 times [2018-11-14 17:34:30,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:30,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:30,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:30,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:30,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:30,829 INFO L256 TraceCheckUtils]: 0: Hoare triple {128#true} call ULTIMATE.init(); {128#true} is VALID [2018-11-14 17:34:30,833 INFO L273 TraceCheckUtils]: 1: Hoare triple {128#true} ~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {128#true} is VALID [2018-11-14 17:34:30,834 INFO L273 TraceCheckUtils]: 2: Hoare triple {128#true} assume true; {128#true} is VALID [2018-11-14 17:34:30,835 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {128#true} {128#true} #388#return; {128#true} is VALID [2018-11-14 17:34:30,835 INFO L256 TraceCheckUtils]: 4: Hoare triple {128#true} call #t~ret15 := main(); {128#true} is VALID [2018-11-14 17:34:30,835 INFO L273 TraceCheckUtils]: 5: Hoare triple {128#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {128#true} is VALID [2018-11-14 17:34:30,836 INFO L273 TraceCheckUtils]: 6: Hoare triple {128#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {130#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:30,837 INFO L273 TraceCheckUtils]: 7: Hoare triple {130#(<= 0 main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {130#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:30,838 INFO L273 TraceCheckUtils]: 8: Hoare triple {130#(<= 0 main_~main__t~0)} havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {131#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:34:30,842 INFO L273 TraceCheckUtils]: 9: Hoare triple {131#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {129#false} is VALID [2018-11-14 17:34:30,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {129#false} assume !false; {129#false} is VALID [2018-11-14 17:34:30,845 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,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:30,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:34:30,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-14 17:34:30,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:30,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:34:30,931 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:30,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:34:30,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:34:30,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:34:30,942 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 4 states. [2018-11-14 17:34:32,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:32,278 INFO L93 Difference]: Finished difference Result 135 states and 211 transitions. [2018-11-14 17:34:32,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:34:32,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-14 17:34:32,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:32,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:34:32,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2018-11-14 17:34:32,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:34:32,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2018-11-14 17:34:32,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 211 transitions. [2018-11-14 17:34:32,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:32,671 INFO L225 Difference]: With dead ends: 135 [2018-11-14 17:34:32,671 INFO L226 Difference]: Without dead ends: 118 [2018-11-14 17:34:32,675 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:34:32,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-14 17:34:32,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-11-14 17:34:32,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:32,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 118 states. [2018-11-14 17:34:32,743 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 118 states. [2018-11-14 17:34:32,744 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 118 states. [2018-11-14 17:34:32,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:32,754 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2018-11-14 17:34:32,755 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2018-11-14 17:34:32,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:32,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:32,757 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 118 states. [2018-11-14 17:34:32,757 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 118 states. [2018-11-14 17:34:32,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:32,771 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2018-11-14 17:34:32,772 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2018-11-14 17:34:32,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:32,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:32,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:32,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:32,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-14 17:34:32,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2018-11-14 17:34:32,798 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 11 [2018-11-14 17:34:32,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:32,799 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2018-11-14 17:34:32,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:34:32,799 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2018-11-14 17:34:32,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 17:34:32,801 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:32,801 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:32,804 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:32,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:32,804 INFO L82 PathProgramCache]: Analyzing trace with hash 738329931, now seen corresponding path program 1 times [2018-11-14 17:34:32,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:32,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:32,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:32,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:32,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:32,963 INFO L256 TraceCheckUtils]: 0: Hoare triple {644#true} call ULTIMATE.init(); {644#true} is VALID [2018-11-14 17:34:32,964 INFO L273 TraceCheckUtils]: 1: Hoare triple {644#true} ~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {644#true} is VALID [2018-11-14 17:34:32,965 INFO L273 TraceCheckUtils]: 2: Hoare triple {644#true} assume true; {644#true} is VALID [2018-11-14 17:34:32,965 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {644#true} {644#true} #388#return; {644#true} is VALID [2018-11-14 17:34:32,966 INFO L256 TraceCheckUtils]: 4: Hoare triple {644#true} call #t~ret15 := main(); {644#true} is VALID [2018-11-14 17:34:32,966 INFO L273 TraceCheckUtils]: 5: Hoare triple {644#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {644#true} is VALID [2018-11-14 17:34:32,979 INFO L273 TraceCheckUtils]: 6: Hoare triple {644#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {646#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:32,980 INFO L273 TraceCheckUtils]: 7: Hoare triple {646#(<= 0 main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {647#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:34:32,981 INFO L273 TraceCheckUtils]: 8: Hoare triple {647#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {648#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~0 1))} is VALID [2018-11-14 17:34:32,982 INFO L273 TraceCheckUtils]: 9: Hoare triple {648#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~0 1))} assume !(~__VERIFIER_assert__cond~0 == 0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {649#(not (= 0 main_~__VERIFIER_assert__cond~1))} is VALID [2018-11-14 17:34:32,982 INFO L273 TraceCheckUtils]: 10: Hoare triple {649#(not (= 0 main_~__VERIFIER_assert__cond~1))} assume ~__VERIFIER_assert__cond~1 == 0; {645#false} is VALID [2018-11-14 17:34:32,983 INFO L273 TraceCheckUtils]: 11: Hoare triple {645#false} assume !false; {645#false} is VALID [2018-11-14 17:34:32,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:32,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:32,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:34:32,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-14 17:34:32,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:32,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:34:33,023 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:33,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:34:33,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:34:33,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:34:33,024 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand 6 states. [2018-11-14 17:34:34,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:34,579 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2018-11-14 17:34:34,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:34:34,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-14 17:34:34,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:34,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:34,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2018-11-14 17:34:34,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:34,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2018-11-14 17:34:34,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 139 transitions. [2018-11-14 17:34:34,780 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:34,785 INFO L225 Difference]: With dead ends: 118 [2018-11-14 17:34:34,785 INFO L226 Difference]: Without dead ends: 113 [2018-11-14 17:34:34,786 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:34:34,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-14 17:34:34,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-11-14 17:34:34,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:34,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 113 states. [2018-11-14 17:34:34,848 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 113 states. [2018-11-14 17:34:34,849 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 113 states. [2018-11-14 17:34:34,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:34,855 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2018-11-14 17:34:34,855 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2018-11-14 17:34:34,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:34,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:34,857 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 113 states. [2018-11-14 17:34:34,857 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 113 states. [2018-11-14 17:34:34,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:34,862 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2018-11-14 17:34:34,863 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2018-11-14 17:34:34,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:34,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:34,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:34,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:34,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-14 17:34:34,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2018-11-14 17:34:34,869 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 12 [2018-11-14 17:34:34,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:34,870 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2018-11-14 17:34:34,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:34:34,870 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2018-11-14 17:34:34,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 17:34:34,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:34,871 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:34,872 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:34,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:34,872 INFO L82 PathProgramCache]: Analyzing trace with hash -108000398, now seen corresponding path program 1 times [2018-11-14 17:34:34,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:34,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:34,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:34,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:34,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:35,023 INFO L256 TraceCheckUtils]: 0: Hoare triple {1128#true} call ULTIMATE.init(); {1128#true} is VALID [2018-11-14 17:34:35,024 INFO L273 TraceCheckUtils]: 1: Hoare triple {1128#true} ~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {1128#true} is VALID [2018-11-14 17:34:35,025 INFO L273 TraceCheckUtils]: 2: Hoare triple {1128#true} assume true; {1128#true} is VALID [2018-11-14 17:34:35,025 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1128#true} #388#return; {1128#true} is VALID [2018-11-14 17:34:35,025 INFO L256 TraceCheckUtils]: 4: Hoare triple {1128#true} call #t~ret15 := main(); {1128#true} is VALID [2018-11-14 17:34:35,026 INFO L273 TraceCheckUtils]: 5: Hoare triple {1128#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {1128#true} is VALID [2018-11-14 17:34:35,026 INFO L273 TraceCheckUtils]: 6: Hoare triple {1128#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {1130#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:35,027 INFO L273 TraceCheckUtils]: 7: Hoare triple {1130#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {1130#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:35,028 INFO L273 TraceCheckUtils]: 8: Hoare triple {1130#(<= 0 main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1131#(and (= main_~__VERIFIER_assert__cond~2 1) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:34:35,028 INFO L273 TraceCheckUtils]: 9: Hoare triple {1131#(and (= main_~__VERIFIER_assert__cond~2 1) (<= 0 main_~main__t~0))} assume !(~__VERIFIER_assert__cond~2 == 0);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {1130#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:35,029 INFO L273 TraceCheckUtils]: 10: Hoare triple {1130#(<= 0 main_~main__t~0)} assume !(~__VERIFIER_assert__cond~3 == 0);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1;~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {1132#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:35,029 INFO L273 TraceCheckUtils]: 11: Hoare triple {1132#(<= 1 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {1132#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:35,030 INFO L273 TraceCheckUtils]: 12: Hoare triple {1132#(<= 1 main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {1133#(not (= 0 main_~__VERIFIER_assert__cond~4))} is VALID [2018-11-14 17:34:35,031 INFO L273 TraceCheckUtils]: 13: Hoare triple {1133#(not (= 0 main_~__VERIFIER_assert__cond~4))} assume ~__VERIFIER_assert__cond~4 == 0; {1129#false} is VALID [2018-11-14 17:34:35,031 INFO L273 TraceCheckUtils]: 14: Hoare triple {1129#false} assume !false; {1129#false} is VALID [2018-11-14 17:34:35,033 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,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:35,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:34:35,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-14 17:34:35,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:35,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:34:35,059 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:35,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:34:35,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:34:35,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:34:35,061 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand 6 states. [2018-11-14 17:34:36,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:36,304 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2018-11-14 17:34:36,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:34:36,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-14 17:34:36,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:36,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:36,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2018-11-14 17:34:36,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:36,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2018-11-14 17:34:36,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 163 transitions. [2018-11-14 17:34:36,529 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:36,533 INFO L225 Difference]: With dead ends: 148 [2018-11-14 17:34:36,533 INFO L226 Difference]: Without dead ends: 146 [2018-11-14 17:34:36,534 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:34:36,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-14 17:34:36,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 111. [2018-11-14 17:34:36,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:36,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 111 states. [2018-11-14 17:34:36,579 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 111 states. [2018-11-14 17:34:36,579 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 111 states. [2018-11-14 17:34:36,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:36,585 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2018-11-14 17:34:36,585 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 160 transitions. [2018-11-14 17:34:36,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:36,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:36,604 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 146 states. [2018-11-14 17:34:36,604 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 146 states. [2018-11-14 17:34:36,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:36,612 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2018-11-14 17:34:36,612 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 160 transitions. [2018-11-14 17:34:36,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:36,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:36,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:36,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:36,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-14 17:34:36,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2018-11-14 17:34:36,617 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 15 [2018-11-14 17:34:36,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:36,617 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2018-11-14 17:34:36,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:34:36,617 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2018-11-14 17:34:36,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 17:34:36,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:36,618 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:36,619 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:36,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:36,621 INFO L82 PathProgramCache]: Analyzing trace with hash 946958050, now seen corresponding path program 1 times [2018-11-14 17:34:36,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:36,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:36,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:36,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:36,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:36,748 INFO L256 TraceCheckUtils]: 0: Hoare triple {1709#true} call ULTIMATE.init(); {1709#true} is VALID [2018-11-14 17:34:36,749 INFO L273 TraceCheckUtils]: 1: Hoare triple {1709#true} ~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {1709#true} is VALID [2018-11-14 17:34:36,749 INFO L273 TraceCheckUtils]: 2: Hoare triple {1709#true} assume true; {1709#true} is VALID [2018-11-14 17:34:36,749 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1709#true} {1709#true} #388#return; {1709#true} is VALID [2018-11-14 17:34:36,749 INFO L256 TraceCheckUtils]: 4: Hoare triple {1709#true} call #t~ret15 := main(); {1709#true} is VALID [2018-11-14 17:34:36,749 INFO L273 TraceCheckUtils]: 5: Hoare triple {1709#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {1709#true} is VALID [2018-11-14 17:34:36,750 INFO L273 TraceCheckUtils]: 6: Hoare triple {1709#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {1711#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:36,750 INFO L273 TraceCheckUtils]: 7: Hoare triple {1711#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {1711#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:36,752 INFO L273 TraceCheckUtils]: 8: Hoare triple {1711#(<= 0 main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1712#(= main_~__VERIFIER_assert__cond~2 1)} is VALID [2018-11-14 17:34:36,752 INFO L273 TraceCheckUtils]: 9: Hoare triple {1712#(= main_~__VERIFIER_assert__cond~2 1)} assume !(~__VERIFIER_assert__cond~2 == 0);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {1709#true} is VALID [2018-11-14 17:34:36,753 INFO L273 TraceCheckUtils]: 10: Hoare triple {1709#true} assume !(~__VERIFIER_assert__cond~3 == 0);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1;~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {1709#true} is VALID [2018-11-14 17:34:36,753 INFO L273 TraceCheckUtils]: 11: Hoare triple {1709#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {1709#true} is VALID [2018-11-14 17:34:36,753 INFO L273 TraceCheckUtils]: 12: Hoare triple {1709#true} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {1713#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:36,757 INFO L273 TraceCheckUtils]: 13: Hoare triple {1713#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~__VERIFIER_assert__cond~4 == 0);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {1714#(not (= 0 main_~__VERIFIER_assert__cond~5))} is VALID [2018-11-14 17:34:36,758 INFO L273 TraceCheckUtils]: 14: Hoare triple {1714#(not (= 0 main_~__VERIFIER_assert__cond~5))} assume ~__VERIFIER_assert__cond~5 == 0; {1710#false} is VALID [2018-11-14 17:34:36,758 INFO L273 TraceCheckUtils]: 15: Hoare triple {1710#false} assume !false; {1710#false} is VALID [2018-11-14 17:34:36,759 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:36,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:36,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:34:36,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 17:34:36,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:36,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:34:36,785 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:36,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:34:36,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:34:36,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:34:36,786 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 6 states. [2018-11-14 17:34:38,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:38,427 INFO L93 Difference]: Finished difference Result 144 states and 159 transitions. [2018-11-14 17:34:38,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:34:38,427 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 17:34:38,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:38,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:38,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2018-11-14 17:34:38,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:38,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2018-11-14 17:34:38,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 159 transitions. [2018-11-14 17:34:38,644 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:38,651 INFO L225 Difference]: With dead ends: 144 [2018-11-14 17:34:38,651 INFO L226 Difference]: Without dead ends: 138 [2018-11-14 17:34:38,652 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:34:38,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-14 17:34:38,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 107. [2018-11-14 17:34:38,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:38,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 107 states. [2018-11-14 17:34:38,682 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 107 states. [2018-11-14 17:34:38,682 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 107 states. [2018-11-14 17:34:38,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:38,686 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2018-11-14 17:34:38,687 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2018-11-14 17:34:38,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:38,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:38,687 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 138 states. [2018-11-14 17:34:38,688 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 138 states. [2018-11-14 17:34:38,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:38,692 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2018-11-14 17:34:38,692 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2018-11-14 17:34:38,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:38,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:38,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:38,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:38,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-14 17:34:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2018-11-14 17:34:38,697 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 16 [2018-11-14 17:34:38,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:38,697 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2018-11-14 17:34:38,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:34:38,697 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2018-11-14 17:34:38,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 17:34:38,698 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:38,698 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:38,699 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:38,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:38,699 INFO L82 PathProgramCache]: Analyzing trace with hash -695803485, now seen corresponding path program 1 times [2018-11-14 17:34:38,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:38,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:38,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:38,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:38,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:38,822 INFO L256 TraceCheckUtils]: 0: Hoare triple {2272#true} call ULTIMATE.init(); {2272#true} is VALID [2018-11-14 17:34:38,823 INFO L273 TraceCheckUtils]: 1: Hoare triple {2272#true} ~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {2272#true} is VALID [2018-11-14 17:34:38,823 INFO L273 TraceCheckUtils]: 2: Hoare triple {2272#true} assume true; {2272#true} is VALID [2018-11-14 17:34:38,823 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2272#true} {2272#true} #388#return; {2272#true} is VALID [2018-11-14 17:34:38,824 INFO L256 TraceCheckUtils]: 4: Hoare triple {2272#true} call #t~ret15 := main(); {2272#true} is VALID [2018-11-14 17:34:38,824 INFO L273 TraceCheckUtils]: 5: Hoare triple {2272#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {2272#true} is VALID [2018-11-14 17:34:38,825 INFO L273 TraceCheckUtils]: 6: Hoare triple {2272#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {2274#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:38,825 INFO L273 TraceCheckUtils]: 7: Hoare triple {2274#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {2274#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:38,828 INFO L273 TraceCheckUtils]: 8: Hoare triple {2274#(<= 0 main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2275#(and (= main_~__VERIFIER_assert__cond~2 1) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:34:38,829 INFO L273 TraceCheckUtils]: 9: Hoare triple {2275#(and (= main_~__VERIFIER_assert__cond~2 1) (<= 0 main_~main__t~0))} assume !(~__VERIFIER_assert__cond~2 == 0);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2274#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:38,829 INFO L273 TraceCheckUtils]: 10: Hoare triple {2274#(<= 0 main_~main__t~0)} assume !(~__VERIFIER_assert__cond~3 == 0);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1;~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {2276#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:38,830 INFO L273 TraceCheckUtils]: 11: Hoare triple {2276#(<= 1 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {2276#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:38,830 INFO L273 TraceCheckUtils]: 12: Hoare triple {2276#(<= 1 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {2276#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:38,830 INFO L273 TraceCheckUtils]: 13: Hoare triple {2276#(<= 1 main_~main__t~0)} assume !(~main____CPAchecker_TMP_3~0 == 0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {2276#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:38,831 INFO L273 TraceCheckUtils]: 14: Hoare triple {2276#(<= 1 main_~main__t~0)} assume !(~main____CPAchecker_TMP_4~0 == 0);havoc ~__tmp_7~0;~__tmp_7~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {2277#(not (= 0 main_~__VERIFIER_assert__cond~6))} is VALID [2018-11-14 17:34:38,831 INFO L273 TraceCheckUtils]: 15: Hoare triple {2277#(not (= 0 main_~__VERIFIER_assert__cond~6))} assume ~__VERIFIER_assert__cond~6 == 0; {2273#false} is VALID [2018-11-14 17:34:38,832 INFO L273 TraceCheckUtils]: 16: Hoare triple {2273#false} assume !false; {2273#false} is VALID [2018-11-14 17:34:38,833 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,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:38,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:34:38,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-14 17:34:38,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:38,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:34:38,850 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:38,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:34:38,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:34:38,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:34:38,851 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 6 states. [2018-11-14 17:34:39,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:39,861 INFO L93 Difference]: Finished difference Result 172 states and 191 transitions. [2018-11-14 17:34:39,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:34:39,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-14 17:34:39,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:39,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:39,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2018-11-14 17:34:39,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:39,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2018-11-14 17:34:39,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 191 transitions. [2018-11-14 17:34:40,081 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:40,085 INFO L225 Difference]: With dead ends: 172 [2018-11-14 17:34:40,085 INFO L226 Difference]: Without dead ends: 170 [2018-11-14 17:34:40,086 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:34:40,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-14 17:34:40,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 105. [2018-11-14 17:34:40,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:40,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand 105 states. [2018-11-14 17:34:40,102 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 105 states. [2018-11-14 17:34:40,102 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 105 states. [2018-11-14 17:34:40,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:40,107 INFO L93 Difference]: Finished difference Result 170 states and 188 transitions. [2018-11-14 17:34:40,107 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 188 transitions. [2018-11-14 17:34:40,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:40,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:40,108 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 170 states. [2018-11-14 17:34:40,108 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 170 states. [2018-11-14 17:34:40,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:40,113 INFO L93 Difference]: Finished difference Result 170 states and 188 transitions. [2018-11-14 17:34:40,114 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 188 transitions. [2018-11-14 17:34:40,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:40,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:40,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:40,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-14 17:34:40,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-11-14 17:34:40,118 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 17 [2018-11-14 17:34:40,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:40,118 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-11-14 17:34:40,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:34:40,118 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-11-14 17:34:40,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 17:34:40,119 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:40,119 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:40,120 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:40,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:40,120 INFO L82 PathProgramCache]: Analyzing trace with hash -694264285, now seen corresponding path program 1 times [2018-11-14 17:34:40,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:40,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:40,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:40,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:40,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:40,268 INFO L256 TraceCheckUtils]: 0: Hoare triple {2923#true} call ULTIMATE.init(); {2923#true} is VALID [2018-11-14 17:34:40,269 INFO L273 TraceCheckUtils]: 1: Hoare triple {2923#true} ~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {2923#true} is VALID [2018-11-14 17:34:40,269 INFO L273 TraceCheckUtils]: 2: Hoare triple {2923#true} assume true; {2923#true} is VALID [2018-11-14 17:34:40,269 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2923#true} {2923#true} #388#return; {2923#true} is VALID [2018-11-14 17:34:40,269 INFO L256 TraceCheckUtils]: 4: Hoare triple {2923#true} call #t~ret15 := main(); {2923#true} is VALID [2018-11-14 17:34:40,269 INFO L273 TraceCheckUtils]: 5: Hoare triple {2923#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {2923#true} is VALID [2018-11-14 17:34:40,270 INFO L273 TraceCheckUtils]: 6: Hoare triple {2923#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {2925#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:40,271 INFO L273 TraceCheckUtils]: 7: Hoare triple {2925#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {2925#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:40,271 INFO L273 TraceCheckUtils]: 8: Hoare triple {2925#(<= 0 main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2926#(and (= main_~__VERIFIER_assert__cond~2 1) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:34:40,272 INFO L273 TraceCheckUtils]: 9: Hoare triple {2926#(and (= main_~__VERIFIER_assert__cond~2 1) (<= 0 main_~main__t~0))} assume !(~__VERIFIER_assert__cond~2 == 0);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2925#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:40,272 INFO L273 TraceCheckUtils]: 10: Hoare triple {2925#(<= 0 main_~main__t~0)} assume !(~__VERIFIER_assert__cond~3 == 0);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1;~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {2927#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:40,273 INFO L273 TraceCheckUtils]: 11: Hoare triple {2927#(<= 1 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {2927#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:40,273 INFO L273 TraceCheckUtils]: 12: Hoare triple {2927#(<= 1 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {2927#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:40,274 INFO L273 TraceCheckUtils]: 13: Hoare triple {2927#(<= 1 main_~main__t~0)} assume !!(~main____CPAchecker_TMP_3~0 == 0);havoc ~main____CPAchecker_TMP_6~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {2927#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:40,277 INFO L273 TraceCheckUtils]: 14: Hoare triple {2927#(<= 1 main_~main__t~0)} assume !(~main____CPAchecker_TMP_6~0 == 0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {2928#(not (= 0 main_~__VERIFIER_assert__cond~12))} is VALID [2018-11-14 17:34:40,277 INFO L273 TraceCheckUtils]: 15: Hoare triple {2928#(not (= 0 main_~__VERIFIER_assert__cond~12))} assume ~__VERIFIER_assert__cond~12 == 0; {2924#false} is VALID [2018-11-14 17:34:40,277 INFO L273 TraceCheckUtils]: 16: Hoare triple {2924#false} assume !false; {2924#false} is VALID [2018-11-14 17:34:40,278 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:40,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:40,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:34:40,279 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-14 17:34:40,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:40,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:34:40,307 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:40,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:34:40,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:34:40,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:34:40,308 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 6 states. [2018-11-14 17:34:41,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:41,172 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2018-11-14 17:34:41,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:34:41,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-14 17:34:41,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:41,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2018-11-14 17:34:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:41,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2018-11-14 17:34:41,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 147 transitions. [2018-11-14 17:34:41,915 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:41,919 INFO L225 Difference]: With dead ends: 132 [2018-11-14 17:34:41,919 INFO L226 Difference]: Without dead ends: 130 [2018-11-14 17:34:41,919 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:34:41,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-14 17:34:41,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 103. [2018-11-14 17:34:41,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:41,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand 103 states. [2018-11-14 17:34:41,946 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 103 states. [2018-11-14 17:34:41,946 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 103 states. [2018-11-14 17:34:41,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:41,950 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2018-11-14 17:34:41,950 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 144 transitions. [2018-11-14 17:34:41,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:41,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:41,950 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 130 states. [2018-11-14 17:34:41,951 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 130 states. [2018-11-14 17:34:41,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:41,954 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2018-11-14 17:34:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 144 transitions. [2018-11-14 17:34:41,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:41,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:41,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:41,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:41,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-14 17:34:41,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2018-11-14 17:34:41,957 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 17 [2018-11-14 17:34:41,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:41,958 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2018-11-14 17:34:41,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:34:41,958 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2018-11-14 17:34:41,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 17:34:41,958 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:41,959 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:41,959 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:41,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:41,960 INFO L82 PathProgramCache]: Analyzing trace with hash -95068443, now seen corresponding path program 1 times [2018-11-14 17:34:41,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:41,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:41,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:41,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:41,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:42,118 INFO L256 TraceCheckUtils]: 0: Hoare triple {3448#true} call ULTIMATE.init(); {3448#true} is VALID [2018-11-14 17:34:42,119 INFO L273 TraceCheckUtils]: 1: Hoare triple {3448#true} ~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {3448#true} is VALID [2018-11-14 17:34:42,119 INFO L273 TraceCheckUtils]: 2: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-14 17:34:42,119 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3448#true} {3448#true} #388#return; {3448#true} is VALID [2018-11-14 17:34:42,119 INFO L256 TraceCheckUtils]: 4: Hoare triple {3448#true} call #t~ret15 := main(); {3448#true} is VALID [2018-11-14 17:34:42,119 INFO L273 TraceCheckUtils]: 5: Hoare triple {3448#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {3448#true} is VALID [2018-11-14 17:34:42,120 INFO L273 TraceCheckUtils]: 6: Hoare triple {3448#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {3450#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:42,121 INFO L273 TraceCheckUtils]: 7: Hoare triple {3450#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {3451#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:34:42,121 INFO L273 TraceCheckUtils]: 8: Hoare triple {3451#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} assume !(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {3452#(and (= main_~__VERIFIER_assert__cond~2 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 17:34:42,122 INFO L273 TraceCheckUtils]: 9: Hoare triple {3452#(and (= main_~__VERIFIER_assert__cond~2 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~__VERIFIER_assert__cond~2 == 0);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {3453#(or (= 0 main_~__VERIFIER_assert__cond~3) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0))} is VALID [2018-11-14 17:34:42,123 INFO L273 TraceCheckUtils]: 10: Hoare triple {3453#(or (= 0 main_~__VERIFIER_assert__cond~3) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0))} assume !(~__VERIFIER_assert__cond~3 == 0);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1;~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {3454#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:42,123 INFO L273 TraceCheckUtils]: 11: Hoare triple {3454#(<= main_~main__t~0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {3454#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:42,124 INFO L273 TraceCheckUtils]: 12: Hoare triple {3454#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {3454#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:42,127 INFO L273 TraceCheckUtils]: 13: Hoare triple {3454#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main____CPAchecker_TMP_3~0 == 0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {3454#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:42,128 INFO L273 TraceCheckUtils]: 14: Hoare triple {3454#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main____CPAchecker_TMP_4~0 == 0);havoc ~__tmp_7~0;~__tmp_7~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {3454#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:42,128 INFO L273 TraceCheckUtils]: 15: Hoare triple {3454#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~__VERIFIER_assert__cond~6 == 0);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {3455#(not (= 0 main_~__VERIFIER_assert__cond~7))} is VALID [2018-11-14 17:34:42,129 INFO L273 TraceCheckUtils]: 16: Hoare triple {3455#(not (= 0 main_~__VERIFIER_assert__cond~7))} assume ~__VERIFIER_assert__cond~7 == 0; {3449#false} is VALID [2018-11-14 17:34:42,129 INFO L273 TraceCheckUtils]: 17: Hoare triple {3449#false} assume !false; {3449#false} is VALID [2018-11-14 17:34:42,130 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,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:42,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-14 17:34:42,130 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-14 17:34:42,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:42,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:34:42,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:42,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:34:42,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:34:42,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:34:42,151 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 8 states. [2018-11-14 17:34:44,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:44,071 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2018-11-14 17:34:44,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:34:44,071 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-14 17:34:44,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:44,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:34:44,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2018-11-14 17:34:44,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:34:44,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2018-11-14 17:34:44,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 134 transitions. [2018-11-14 17:34:44,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:44,258 INFO L225 Difference]: With dead ends: 120 [2018-11-14 17:34:44,258 INFO L226 Difference]: Without dead ends: 118 [2018-11-14 17:34:44,259 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-14 17:34:44,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-14 17:34:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2018-11-14 17:34:44,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:44,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 101 states. [2018-11-14 17:34:44,276 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 101 states. [2018-11-14 17:34:44,276 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 101 states. [2018-11-14 17:34:44,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:44,280 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2018-11-14 17:34:44,280 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2018-11-14 17:34:44,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:44,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:44,281 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 118 states. [2018-11-14 17:34:44,281 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 118 states. [2018-11-14 17:34:44,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:44,285 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2018-11-14 17:34:44,285 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2018-11-14 17:34:44,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:44,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:44,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:44,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:44,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-14 17:34:44,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2018-11-14 17:34:44,289 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 18 [2018-11-14 17:34:44,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:44,289 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2018-11-14 17:34:44,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:34:44,289 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2018-11-14 17:34:44,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 17:34:44,290 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:44,290 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:44,291 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:44,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:44,291 INFO L82 PathProgramCache]: Analyzing trace with hash -93703023, now seen corresponding path program 1 times [2018-11-14 17:34:44,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:44,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:44,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:44,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:44,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:44,393 INFO L256 TraceCheckUtils]: 0: Hoare triple {3941#true} call ULTIMATE.init(); {3941#true} is VALID [2018-11-14 17:34:44,394 INFO L273 TraceCheckUtils]: 1: Hoare triple {3941#true} ~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {3941#true} is VALID [2018-11-14 17:34:44,394 INFO L273 TraceCheckUtils]: 2: Hoare triple {3941#true} assume true; {3941#true} is VALID [2018-11-14 17:34:44,394 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3941#true} {3941#true} #388#return; {3941#true} is VALID [2018-11-14 17:34:44,395 INFO L256 TraceCheckUtils]: 4: Hoare triple {3941#true} call #t~ret15 := main(); {3941#true} is VALID [2018-11-14 17:34:44,395 INFO L273 TraceCheckUtils]: 5: Hoare triple {3941#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {3941#true} is VALID [2018-11-14 17:34:44,397 INFO L273 TraceCheckUtils]: 6: Hoare triple {3941#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {3943#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:44,398 INFO L273 TraceCheckUtils]: 7: Hoare triple {3943#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {3943#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:44,399 INFO L273 TraceCheckUtils]: 8: Hoare triple {3943#(<= 0 main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {3944#(and (= main_~__VERIFIER_assert__cond~2 1) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:34:44,399 INFO L273 TraceCheckUtils]: 9: Hoare triple {3944#(and (= main_~__VERIFIER_assert__cond~2 1) (<= 0 main_~main__t~0))} assume !(~__VERIFIER_assert__cond~2 == 0);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {3943#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:44,400 INFO L273 TraceCheckUtils]: 10: Hoare triple {3943#(<= 0 main_~main__t~0)} assume !(~__VERIFIER_assert__cond~3 == 0);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1;~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {3945#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:44,401 INFO L273 TraceCheckUtils]: 11: Hoare triple {3945#(<= 1 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {3945#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:44,401 INFO L273 TraceCheckUtils]: 12: Hoare triple {3945#(<= 1 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {3945#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:44,402 INFO L273 TraceCheckUtils]: 13: Hoare triple {3945#(<= 1 main_~main__t~0)} assume !(~main____CPAchecker_TMP_3~0 == 0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {3945#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:44,402 INFO L273 TraceCheckUtils]: 14: Hoare triple {3945#(<= 1 main_~main__t~0)} assume !!(~main____CPAchecker_TMP_4~0 == 0); {3945#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:44,442 INFO L273 TraceCheckUtils]: 15: Hoare triple {3945#(<= 1 main_~main__t~0)} havoc ~__tmp_11~0;~__tmp_11~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {3946#(not (= 0 main_~__VERIFIER_assert__cond~10))} is VALID [2018-11-14 17:34:44,457 INFO L273 TraceCheckUtils]: 16: Hoare triple {3946#(not (= 0 main_~__VERIFIER_assert__cond~10))} assume ~__VERIFIER_assert__cond~10 == 0; {3942#false} is VALID [2018-11-14 17:34:44,457 INFO L273 TraceCheckUtils]: 17: Hoare triple {3942#false} assume !false; {3942#false} is VALID [2018-11-14 17:34:44,458 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:44,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:44,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:34:44,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-14 17:34:44,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:44,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:34:44,475 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:44,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:34:44,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:34:44,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:34:44,476 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 6 states. [2018-11-14 17:34:45,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:45,837 INFO L93 Difference]: Finished difference Result 162 states and 181 transitions. [2018-11-14 17:34:45,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:34:45,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-14 17:34:45,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:45,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 181 transitions. [2018-11-14 17:34:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:45,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 181 transitions. [2018-11-14 17:34:45,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 181 transitions. [2018-11-14 17:34:46,027 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:46,031 INFO L225 Difference]: With dead ends: 162 [2018-11-14 17:34:46,031 INFO L226 Difference]: Without dead ends: 160 [2018-11-14 17:34:46,032 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:34:46,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-14 17:34:46,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 99. [2018-11-14 17:34:46,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:46,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 99 states. [2018-11-14 17:34:46,053 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 99 states. [2018-11-14 17:34:46,053 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 99 states. [2018-11-14 17:34:46,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:46,059 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2018-11-14 17:34:46,059 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 178 transitions. [2018-11-14 17:34:46,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:46,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:46,060 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 160 states. [2018-11-14 17:34:46,060 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 160 states. [2018-11-14 17:34:46,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:46,065 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2018-11-14 17:34:46,065 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 178 transitions. [2018-11-14 17:34:46,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:46,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:46,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:46,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:46,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-14 17:34:46,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2018-11-14 17:34:46,070 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 18 [2018-11-14 17:34:46,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:46,070 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2018-11-14 17:34:46,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:34:46,070 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-11-14 17:34:46,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 17:34:46,071 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:46,071 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:46,072 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:46,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:46,072 INFO L82 PathProgramCache]: Analyzing trace with hash -47353193, now seen corresponding path program 1 times [2018-11-14 17:34:46,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:46,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:46,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:46,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:46,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:46,286 INFO L256 TraceCheckUtils]: 0: Hoare triple {4556#true} call ULTIMATE.init(); {4556#true} is VALID [2018-11-14 17:34:46,287 INFO L273 TraceCheckUtils]: 1: Hoare triple {4556#true} ~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {4556#true} is VALID [2018-11-14 17:34:46,287 INFO L273 TraceCheckUtils]: 2: Hoare triple {4556#true} assume true; {4556#true} is VALID [2018-11-14 17:34:46,288 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4556#true} {4556#true} #388#return; {4556#true} is VALID [2018-11-14 17:34:46,288 INFO L256 TraceCheckUtils]: 4: Hoare triple {4556#true} call #t~ret15 := main(); {4556#true} is VALID [2018-11-14 17:34:46,289 INFO L273 TraceCheckUtils]: 5: Hoare triple {4556#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {4556#true} is VALID [2018-11-14 17:34:46,292 INFO L273 TraceCheckUtils]: 6: Hoare triple {4556#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {4558#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:46,293 INFO L273 TraceCheckUtils]: 7: Hoare triple {4558#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {4559#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:34:46,293 INFO L273 TraceCheckUtils]: 8: Hoare triple {4559#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} assume !(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4560#(and (= main_~__VERIFIER_assert__cond~2 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 17:34:46,294 INFO L273 TraceCheckUtils]: 9: Hoare triple {4560#(and (= main_~__VERIFIER_assert__cond~2 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~__VERIFIER_assert__cond~2 == 0);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4561#(or (= 0 main_~__VERIFIER_assert__cond~3) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0))} is VALID [2018-11-14 17:34:46,295 INFO L273 TraceCheckUtils]: 10: Hoare triple {4561#(or (= 0 main_~__VERIFIER_assert__cond~3) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0))} assume !(~__VERIFIER_assert__cond~3 == 0);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1;~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {4562#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:46,295 INFO L273 TraceCheckUtils]: 11: Hoare triple {4562#(<= main_~main__t~0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {4562#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:46,296 INFO L273 TraceCheckUtils]: 12: Hoare triple {4562#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {4562#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:46,296 INFO L273 TraceCheckUtils]: 13: Hoare triple {4562#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(~main____CPAchecker_TMP_3~0 == 0);havoc ~main____CPAchecker_TMP_6~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {4562#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:46,296 INFO L273 TraceCheckUtils]: 14: Hoare triple {4562#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main____CPAchecker_TMP_6~0 == 0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {4562#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:46,297 INFO L273 TraceCheckUtils]: 15: Hoare triple {4562#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~__VERIFIER_assert__cond~12 == 0);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {4563#(not (= 0 main_~__VERIFIER_assert__cond~13))} is VALID [2018-11-14 17:34:46,298 INFO L273 TraceCheckUtils]: 16: Hoare triple {4563#(not (= 0 main_~__VERIFIER_assert__cond~13))} assume ~__VERIFIER_assert__cond~13 == 0; {4557#false} is VALID [2018-11-14 17:34:46,298 INFO L273 TraceCheckUtils]: 17: Hoare triple {4557#false} assume !false; {4557#false} is VALID [2018-11-14 17:34:46,299 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,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:46,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-14 17:34:46,301 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-14 17:34:46,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:46,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:34:46,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:46,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:34:46,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:34:46,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:34:46,326 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 8 states. [2018-11-14 17:34:47,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:47,714 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2018-11-14 17:34:47,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:34:47,714 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-14 17:34:47,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:47,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:34:47,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2018-11-14 17:34:47,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:34:47,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2018-11-14 17:34:47,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 111 transitions. [2018-11-14 17:34:47,859 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:47,861 INFO L225 Difference]: With dead ends: 99 [2018-11-14 17:34:47,861 INFO L226 Difference]: Without dead ends: 95 [2018-11-14 17:34:47,862 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:34:47,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-14 17:34:47,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-11-14 17:34:47,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:47,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 95 states. [2018-11-14 17:34:47,983 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 95 states. [2018-11-14 17:34:47,984 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 95 states. [2018-11-14 17:34:47,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:47,986 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2018-11-14 17:34:47,986 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-11-14 17:34:47,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:47,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:47,987 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 95 states. [2018-11-14 17:34:47,987 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 95 states. [2018-11-14 17:34:47,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:47,990 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2018-11-14 17:34:47,990 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-11-14 17:34:47,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:47,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:47,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:47,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:47,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-14 17:34:47,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-11-14 17:34:47,994 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 18 [2018-11-14 17:34:47,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:47,995 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-11-14 17:34:47,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:34:47,995 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-11-14 17:34:47,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 17:34:47,995 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:47,995 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:47,996 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:47,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:47,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1390176726, now seen corresponding path program 1 times [2018-11-14 17:34:47,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:47,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:47,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:47,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:47,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:48,249 INFO L256 TraceCheckUtils]: 0: Hoare triple {4972#true} call ULTIMATE.init(); {4972#true} is VALID [2018-11-14 17:34:48,249 INFO L273 TraceCheckUtils]: 1: Hoare triple {4972#true} ~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {4972#true} is VALID [2018-11-14 17:34:48,250 INFO L273 TraceCheckUtils]: 2: Hoare triple {4972#true} assume true; {4972#true} is VALID [2018-11-14 17:34:48,250 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4972#true} {4972#true} #388#return; {4972#true} is VALID [2018-11-14 17:34:48,250 INFO L256 TraceCheckUtils]: 4: Hoare triple {4972#true} call #t~ret15 := main(); {4972#true} is VALID [2018-11-14 17:34:48,250 INFO L273 TraceCheckUtils]: 5: Hoare triple {4972#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {4972#true} is VALID [2018-11-14 17:34:48,251 INFO L273 TraceCheckUtils]: 6: Hoare triple {4972#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {4974#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:48,255 INFO L273 TraceCheckUtils]: 7: Hoare triple {4974#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {4975#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:34:48,255 INFO L273 TraceCheckUtils]: 8: Hoare triple {4975#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} assume !(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4976#(and (= main_~__VERIFIER_assert__cond~2 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 17:34:48,257 INFO L273 TraceCheckUtils]: 9: Hoare triple {4976#(and (= main_~__VERIFIER_assert__cond~2 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~__VERIFIER_assert__cond~2 == 0);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4977#(or (= 0 main_~__VERIFIER_assert__cond~3) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0))} is VALID [2018-11-14 17:34:48,258 INFO L273 TraceCheckUtils]: 10: Hoare triple {4977#(or (= 0 main_~__VERIFIER_assert__cond~3) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0))} assume !(~__VERIFIER_assert__cond~3 == 0);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1;~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {4978#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:48,258 INFO L273 TraceCheckUtils]: 11: Hoare triple {4978#(<= main_~main__t~0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {4978#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:48,258 INFO L273 TraceCheckUtils]: 12: Hoare triple {4978#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {4978#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:48,259 INFO L273 TraceCheckUtils]: 13: Hoare triple {4978#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main____CPAchecker_TMP_3~0 == 0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {4978#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:48,259 INFO L273 TraceCheckUtils]: 14: Hoare triple {4978#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(~main____CPAchecker_TMP_4~0 == 0); {4978#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:48,260 INFO L273 TraceCheckUtils]: 15: Hoare triple {4978#(<= main_~main__t~0 main_~main__tagbuf_len~0)} havoc ~__tmp_11~0;~__tmp_11~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {4978#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:48,260 INFO L273 TraceCheckUtils]: 16: Hoare triple {4978#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~__VERIFIER_assert__cond~10 == 0);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {4979#(not (= 0 main_~__VERIFIER_assert__cond~11))} is VALID [2018-11-14 17:34:48,269 INFO L273 TraceCheckUtils]: 17: Hoare triple {4979#(not (= 0 main_~__VERIFIER_assert__cond~11))} assume ~__VERIFIER_assert__cond~11 == 0; {4973#false} is VALID [2018-11-14 17:34:48,269 INFO L273 TraceCheckUtils]: 18: Hoare triple {4973#false} assume !false; {4973#false} is VALID [2018-11-14 17:34:48,270 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,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:48,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-14 17:34:48,271 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-14 17:34:48,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:48,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:34:48,307 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:48,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:34:48,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:34:48,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:34:48,308 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 8 states. [2018-11-14 17:34:49,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:49,784 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2018-11-14 17:34:49,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:34:49,784 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-14 17:34:49,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:49,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:34:49,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2018-11-14 17:34:49,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:34:49,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2018-11-14 17:34:49,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 125 transitions. [2018-11-14 17:34:49,941 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:49,944 INFO L225 Difference]: With dead ends: 111 [2018-11-14 17:34:49,944 INFO L226 Difference]: Without dead ends: 109 [2018-11-14 17:34:49,945 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-14 17:34:49,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-14 17:34:49,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2018-11-14 17:34:49,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:49,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 93 states. [2018-11-14 17:34:49,962 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 93 states. [2018-11-14 17:34:49,962 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 93 states. [2018-11-14 17:34:49,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:49,964 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2018-11-14 17:34:49,965 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2018-11-14 17:34:49,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:49,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:49,965 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 109 states. [2018-11-14 17:34:49,965 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 109 states. [2018-11-14 17:34:49,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:49,967 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2018-11-14 17:34:49,968 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2018-11-14 17:34:49,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:49,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:49,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:49,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:49,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-14 17:34:49,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2018-11-14 17:34:49,970 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 19 [2018-11-14 17:34:49,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:49,971 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2018-11-14 17:34:49,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:34:49,971 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2018-11-14 17:34:49,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 17:34:49,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:49,971 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:49,972 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:49,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:49,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1166363704, now seen corresponding path program 1 times [2018-11-14 17:34:49,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:49,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:49,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:49,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:49,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:50,085 INFO L256 TraceCheckUtils]: 0: Hoare triple {5430#true} call ULTIMATE.init(); {5430#true} is VALID [2018-11-14 17:34:50,085 INFO L273 TraceCheckUtils]: 1: Hoare triple {5430#true} ~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {5430#true} is VALID [2018-11-14 17:34:50,085 INFO L273 TraceCheckUtils]: 2: Hoare triple {5430#true} assume true; {5430#true} is VALID [2018-11-14 17:34:50,085 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5430#true} {5430#true} #388#return; {5430#true} is VALID [2018-11-14 17:34:50,085 INFO L256 TraceCheckUtils]: 4: Hoare triple {5430#true} call #t~ret15 := main(); {5430#true} is VALID [2018-11-14 17:34:50,086 INFO L273 TraceCheckUtils]: 5: Hoare triple {5430#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {5430#true} is VALID [2018-11-14 17:34:50,086 INFO L273 TraceCheckUtils]: 6: Hoare triple {5430#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {5432#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:50,086 INFO L273 TraceCheckUtils]: 7: Hoare triple {5432#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {5432#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:50,087 INFO L273 TraceCheckUtils]: 8: Hoare triple {5432#(<= 0 main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5433#(= main_~__VERIFIER_assert__cond~2 1)} is VALID [2018-11-14 17:34:50,087 INFO L273 TraceCheckUtils]: 9: Hoare triple {5433#(= main_~__VERIFIER_assert__cond~2 1)} assume !(~__VERIFIER_assert__cond~2 == 0);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5430#true} is VALID [2018-11-14 17:34:50,087 INFO L273 TraceCheckUtils]: 10: Hoare triple {5430#true} assume !(~__VERIFIER_assert__cond~3 == 0);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1;~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {5430#true} is VALID [2018-11-14 17:34:50,087 INFO L273 TraceCheckUtils]: 11: Hoare triple {5430#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {5430#true} is VALID [2018-11-14 17:34:50,088 INFO L273 TraceCheckUtils]: 12: Hoare triple {5430#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {5430#true} is VALID [2018-11-14 17:34:50,088 INFO L273 TraceCheckUtils]: 13: Hoare triple {5430#true} assume !(~main____CPAchecker_TMP_3~0 == 0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {5430#true} is VALID [2018-11-14 17:34:50,088 INFO L273 TraceCheckUtils]: 14: Hoare triple {5430#true} assume !(~main____CPAchecker_TMP_4~0 == 0);havoc ~__tmp_7~0;~__tmp_7~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {5434#(or (= 0 main_~__VERIFIER_assert__cond~6) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:34:50,089 INFO L273 TraceCheckUtils]: 15: Hoare triple {5434#(or (= 0 main_~__VERIFIER_assert__cond~6) (<= 0 main_~main__t~0))} assume !(~__VERIFIER_assert__cond~6 == 0);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {5432#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:50,090 INFO L273 TraceCheckUtils]: 16: Hoare triple {5432#(<= 0 main_~main__t~0)} assume !(~__VERIFIER_assert__cond~7 == 0);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {5435#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:50,091 INFO L273 TraceCheckUtils]: 17: Hoare triple {5435#(<= 1 main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_9~0;~__tmp_9~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {5436#(not (= 0 main_~__VERIFIER_assert__cond~8))} is VALID [2018-11-14 17:34:50,091 INFO L273 TraceCheckUtils]: 18: Hoare triple {5436#(not (= 0 main_~__VERIFIER_assert__cond~8))} assume ~__VERIFIER_assert__cond~8 == 0; {5431#false} is VALID [2018-11-14 17:34:50,092 INFO L273 TraceCheckUtils]: 19: Hoare triple {5431#false} assume !false; {5431#false} is VALID [2018-11-14 17:34:50,093 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,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:50,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 17:34:50,093 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-14 17:34:50,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:50,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:34:50,119 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:50,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:34:50,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:34:50,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:34:50,121 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 7 states. [2018-11-14 17:34:50,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:50,850 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2018-11-14 17:34:50,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:34:50,850 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-14 17:34:50,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:50,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:34:50,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2018-11-14 17:34:50,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:34:50,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2018-11-14 17:34:50,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 123 transitions. [2018-11-14 17:34:51,887 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:51,890 INFO L225 Difference]: With dead ends: 108 [2018-11-14 17:34:51,890 INFO L226 Difference]: Without dead ends: 106 [2018-11-14 17:34:51,891 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:34:51,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-14 17:34:51,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 91. [2018-11-14 17:34:51,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:51,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 91 states. [2018-11-14 17:34:51,911 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 91 states. [2018-11-14 17:34:51,911 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 91 states. [2018-11-14 17:34:51,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:51,914 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2018-11-14 17:34:51,914 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-11-14 17:34:51,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:51,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:51,915 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 106 states. [2018-11-14 17:34:51,915 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 106 states. [2018-11-14 17:34:51,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:51,917 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2018-11-14 17:34:51,918 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-11-14 17:34:51,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:51,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:51,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:51,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:51,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-14 17:34:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2018-11-14 17:34:51,920 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 20 [2018-11-14 17:34:51,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:51,920 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2018-11-14 17:34:51,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:34:51,921 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2018-11-14 17:34:51,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 17:34:51,921 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:51,921 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] [2018-11-14 17:34:51,922 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:51,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:51,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1797533329, now seen corresponding path program 1 times [2018-11-14 17:34:51,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:51,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:51,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:51,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:51,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:52,693 INFO L256 TraceCheckUtils]: 0: Hoare triple {5876#true} call ULTIMATE.init(); {5876#true} is VALID [2018-11-14 17:34:52,693 INFO L273 TraceCheckUtils]: 1: Hoare triple {5876#true} ~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {5876#true} is VALID [2018-11-14 17:34:52,693 INFO L273 TraceCheckUtils]: 2: Hoare triple {5876#true} assume true; {5876#true} is VALID [2018-11-14 17:34:52,693 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5876#true} {5876#true} #388#return; {5876#true} is VALID [2018-11-14 17:34:52,694 INFO L256 TraceCheckUtils]: 4: Hoare triple {5876#true} call #t~ret15 := main(); {5876#true} is VALID [2018-11-14 17:34:52,694 INFO L273 TraceCheckUtils]: 5: Hoare triple {5876#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {5876#true} is VALID [2018-11-14 17:34:52,694 INFO L273 TraceCheckUtils]: 6: Hoare triple {5876#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {5878#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:52,695 INFO L273 TraceCheckUtils]: 7: Hoare triple {5878#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {5878#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:52,695 INFO L273 TraceCheckUtils]: 8: Hoare triple {5878#(<= 0 main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5879#(= main_~__VERIFIER_assert__cond~2 1)} is VALID [2018-11-14 17:34:52,696 INFO L273 TraceCheckUtils]: 9: Hoare triple {5879#(= main_~__VERIFIER_assert__cond~2 1)} assume !(~__VERIFIER_assert__cond~2 == 0);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5876#true} is VALID [2018-11-14 17:34:52,696 INFO L273 TraceCheckUtils]: 10: Hoare triple {5876#true} assume !(~__VERIFIER_assert__cond~3 == 0);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1;~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {5876#true} is VALID [2018-11-14 17:34:52,696 INFO L273 TraceCheckUtils]: 11: Hoare triple {5876#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {5876#true} is VALID [2018-11-14 17:34:52,696 INFO L273 TraceCheckUtils]: 12: Hoare triple {5876#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {5876#true} is VALID [2018-11-14 17:34:52,697 INFO L273 TraceCheckUtils]: 13: Hoare triple {5876#true} assume !(~main____CPAchecker_TMP_3~0 == 0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {5876#true} is VALID [2018-11-14 17:34:52,697 INFO L273 TraceCheckUtils]: 14: Hoare triple {5876#true} assume !(~main____CPAchecker_TMP_4~0 == 0);havoc ~__tmp_7~0;~__tmp_7~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {5876#true} is VALID [2018-11-14 17:34:52,697 INFO L273 TraceCheckUtils]: 15: Hoare triple {5876#true} assume !(~__VERIFIER_assert__cond~6 == 0);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {5876#true} is VALID [2018-11-14 17:34:52,697 INFO L273 TraceCheckUtils]: 16: Hoare triple {5876#true} assume !(~__VERIFIER_assert__cond~7 == 0);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {5876#true} is VALID [2018-11-14 17:34:52,698 INFO L273 TraceCheckUtils]: 17: Hoare triple {5876#true} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_9~0;~__tmp_9~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {5880#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:52,699 INFO L273 TraceCheckUtils]: 18: Hoare triple {5880#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~__VERIFIER_assert__cond~8 == 0);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {5881#(not (= 0 main_~__VERIFIER_assert__cond~9))} is VALID [2018-11-14 17:34:52,700 INFO L273 TraceCheckUtils]: 19: Hoare triple {5881#(not (= 0 main_~__VERIFIER_assert__cond~9))} assume ~__VERIFIER_assert__cond~9 == 0; {5877#false} is VALID [2018-11-14 17:34:52,700 INFO L273 TraceCheckUtils]: 20: Hoare triple {5877#false} assume !false; {5877#false} is VALID [2018-11-14 17:34:52,702 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,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:52,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:34:52,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-14 17:34:52,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:52,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:34:52,724 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:52,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:34:52,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:34:52,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:34:52,725 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 6 states. [2018-11-14 17:34:54,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:54,045 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2018-11-14 17:34:54,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:34:54,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-14 17:34:54,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:54,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:54,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2018-11-14 17:34:54,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:54,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2018-11-14 17:34:54,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 119 transitions. [2018-11-14 17:34:54,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:54,739 INFO L225 Difference]: With dead ends: 104 [2018-11-14 17:34:54,739 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 17:34:54,741 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:34:54,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 17:34:54,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-14 17:34:54,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:54,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-14 17:34:54,746 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-14 17:34:54,746 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-14 17:34:54,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:54,748 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-14 17:34:54,748 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-14 17:34:54,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:54,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:54,749 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-14 17:34:54,749 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-14 17:34:54,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:54,750 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-14 17:34:54,751 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-14 17:34:54,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:54,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:54,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:54,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:54,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-14 17:34:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-11-14 17:34:54,753 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 21 [2018-11-14 17:34:54,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:54,753 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-11-14 17:34:54,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:34:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-14 17:34:54,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-14 17:34:54,755 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:54,755 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, 1, 1, 1, 1] [2018-11-14 17:34:54,755 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:54,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:54,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1203360725, now seen corresponding path program 1 times [2018-11-14 17:34:54,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:54,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:54,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:54,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:54,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:55,639 INFO L256 TraceCheckUtils]: 0: Hoare triple {6188#true} call ULTIMATE.init(); {6188#true} is VALID [2018-11-14 17:34:55,640 INFO L273 TraceCheckUtils]: 1: Hoare triple {6188#true} ~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {6188#true} is VALID [2018-11-14 17:34:55,640 INFO L273 TraceCheckUtils]: 2: Hoare triple {6188#true} assume true; {6188#true} is VALID [2018-11-14 17:34:55,641 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6188#true} {6188#true} #388#return; {6188#true} is VALID [2018-11-14 17:34:55,641 INFO L256 TraceCheckUtils]: 4: Hoare triple {6188#true} call #t~ret15 := main(); {6188#true} is VALID [2018-11-14 17:34:55,642 INFO L273 TraceCheckUtils]: 5: Hoare triple {6188#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {6188#true} is VALID [2018-11-14 17:34:55,646 INFO L273 TraceCheckUtils]: 6: Hoare triple {6188#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {6190#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:55,656 INFO L273 TraceCheckUtils]: 7: Hoare triple {6190#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {6190#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:55,657 INFO L273 TraceCheckUtils]: 8: Hoare triple {6190#(<= 0 main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_15~0;~__tmp_15~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {6191#(= main_~__VERIFIER_assert__cond~14 1)} is VALID [2018-11-14 17:34:55,657 INFO L273 TraceCheckUtils]: 9: Hoare triple {6191#(= main_~__VERIFIER_assert__cond~14 1)} assume !(~__VERIFIER_assert__cond~14 == 0);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {6188#true} is VALID [2018-11-14 17:34:55,658 INFO L273 TraceCheckUtils]: 10: Hoare triple {6188#true} assume !(~__VERIFIER_assert__cond~15 == 0);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6188#true} is VALID [2018-11-14 17:34:55,658 INFO L273 TraceCheckUtils]: 11: Hoare triple {6188#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {6188#true} is VALID [2018-11-14 17:34:55,658 INFO L273 TraceCheckUtils]: 12: Hoare triple {6188#true} assume !!(~main____CPAchecker_TMP_0~1 == 0);havoc ~__tmp_19~0;~__tmp_19~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {6188#true} is VALID [2018-11-14 17:34:55,658 INFO L273 TraceCheckUtils]: 13: Hoare triple {6188#true} assume !(~__VERIFIER_assert__cond~18 == 0);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {6188#true} is VALID [2018-11-14 17:34:55,658 INFO L273 TraceCheckUtils]: 14: Hoare triple {6188#true} assume !(~__VERIFIER_assert__cond~19 == 0);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6188#true} is VALID [2018-11-14 17:34:55,659 INFO L273 TraceCheckUtils]: 15: Hoare triple {6188#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {6188#true} is VALID [2018-11-14 17:34:55,659 INFO L273 TraceCheckUtils]: 16: Hoare triple {6188#true} assume !!(~main____CPAchecker_TMP_0~2 == 0);havoc ~__tmp_23~0;~__tmp_23~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {6188#true} is VALID [2018-11-14 17:34:55,659 INFO L273 TraceCheckUtils]: 17: Hoare triple {6188#true} assume !(~__VERIFIER_assert__cond~22 == 0);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {6188#true} is VALID [2018-11-14 17:34:55,659 INFO L273 TraceCheckUtils]: 18: Hoare triple {6188#true} assume !(~__VERIFIER_assert__cond~23 == 0);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6188#true} is VALID [2018-11-14 17:34:55,659 INFO L273 TraceCheckUtils]: 19: Hoare triple {6188#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {6188#true} is VALID [2018-11-14 17:34:55,659 INFO L273 TraceCheckUtils]: 20: Hoare triple {6188#true} assume !!(~main____CPAchecker_TMP_0~3 == 0);havoc ~__tmp_27~0;~__tmp_27~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {6188#true} is VALID [2018-11-14 17:34:55,660 INFO L273 TraceCheckUtils]: 21: Hoare triple {6188#true} assume !(~__VERIFIER_assert__cond~26 == 0);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {6188#true} is VALID [2018-11-14 17:34:55,660 INFO L273 TraceCheckUtils]: 22: Hoare triple {6188#true} assume !(~__VERIFIER_assert__cond~27 == 0);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6188#true} is VALID [2018-11-14 17:34:55,660 INFO L273 TraceCheckUtils]: 23: Hoare triple {6188#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~4 := #t~nondet9;havoc #t~nondet9; {6188#true} is VALID [2018-11-14 17:34:55,661 INFO L273 TraceCheckUtils]: 24: Hoare triple {6188#true} assume !!(~main____CPAchecker_TMP_0~4 == 0);havoc ~__tmp_31~0;~__tmp_31~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~30;~__VERIFIER_assert__cond~30 := ~__tmp_31~0; {6188#true} is VALID [2018-11-14 17:34:55,661 INFO L273 TraceCheckUtils]: 25: Hoare triple {6188#true} assume !(~__VERIFIER_assert__cond~30 == 0);havoc ~__tmp_32~0;~__tmp_32~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~31;~__VERIFIER_assert__cond~31 := ~__tmp_32~0; {6188#true} is VALID [2018-11-14 17:34:55,661 INFO L273 TraceCheckUtils]: 26: Hoare triple {6188#true} assume !(~__VERIFIER_assert__cond~31 == 0);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6188#true} is VALID [2018-11-14 17:34:55,661 INFO L273 TraceCheckUtils]: 27: Hoare triple {6188#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~5;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_0~5 := #t~nondet10;havoc #t~nondet10; {6188#true} is VALID [2018-11-14 17:34:55,661 INFO L273 TraceCheckUtils]: 28: Hoare triple {6188#true} assume !!(~main____CPAchecker_TMP_0~5 == 0);havoc ~__tmp_35~0;~__tmp_35~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {6188#true} is VALID [2018-11-14 17:34:55,665 INFO L273 TraceCheckUtils]: 29: Hoare triple {6188#true} assume !(~__VERIFIER_assert__cond~34 == 0);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {6188#true} is VALID [2018-11-14 17:34:55,665 INFO L273 TraceCheckUtils]: 30: Hoare triple {6188#true} assume !(~__VERIFIER_assert__cond~35 == 0);~main____CPAchecker_TMP_1~5 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6188#true} is VALID [2018-11-14 17:34:55,665 INFO L273 TraceCheckUtils]: 31: Hoare triple {6188#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~6;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~main____CPAchecker_TMP_0~6 := #t~nondet11;havoc #t~nondet11; {6188#true} is VALID [2018-11-14 17:34:55,666 INFO L273 TraceCheckUtils]: 32: Hoare triple {6188#true} assume !!(~main____CPAchecker_TMP_0~6 == 0);havoc ~__tmp_39~0;~__tmp_39~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {6188#true} is VALID [2018-11-14 17:34:55,666 INFO L273 TraceCheckUtils]: 33: Hoare triple {6188#true} assume !(~__VERIFIER_assert__cond~38 == 0);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {6188#true} is VALID [2018-11-14 17:34:55,666 INFO L273 TraceCheckUtils]: 34: Hoare triple {6188#true} assume !(~__VERIFIER_assert__cond~39 == 0);~main____CPAchecker_TMP_1~6 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6188#true} is VALID [2018-11-14 17:34:55,666 INFO L273 TraceCheckUtils]: 35: Hoare triple {6188#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~7;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~main____CPAchecker_TMP_0~7 := #t~nondet12;havoc #t~nondet12; {6188#true} is VALID [2018-11-14 17:34:55,667 INFO L273 TraceCheckUtils]: 36: Hoare triple {6188#true} assume !!(~main____CPAchecker_TMP_0~7 == 0);havoc ~__tmp_43~0;~__tmp_43~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {6188#true} is VALID [2018-11-14 17:34:55,667 INFO L273 TraceCheckUtils]: 37: Hoare triple {6188#true} assume !(~__VERIFIER_assert__cond~42 == 0);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {6188#true} is VALID [2018-11-14 17:34:55,667 INFO L273 TraceCheckUtils]: 38: Hoare triple {6188#true} assume !(~__VERIFIER_assert__cond~43 == 0);~main____CPAchecker_TMP_1~7 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6188#true} is VALID [2018-11-14 17:34:55,667 INFO L273 TraceCheckUtils]: 39: Hoare triple {6188#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~8;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~main____CPAchecker_TMP_0~8 := #t~nondet13;havoc #t~nondet13; {6188#true} is VALID [2018-11-14 17:34:55,669 INFO L273 TraceCheckUtils]: 40: Hoare triple {6188#true} assume !!(~main____CPAchecker_TMP_0~8 == 0);havoc ~__tmp_47~0;~__tmp_47~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~46;~__VERIFIER_assert__cond~46 := ~__tmp_47~0; {6192#(or (= 0 main_~__VERIFIER_assert__cond~46) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:34:55,672 INFO L273 TraceCheckUtils]: 41: Hoare triple {6192#(or (= 0 main_~__VERIFIER_assert__cond~46) (<= 0 main_~main__t~0))} assume !(~__VERIFIER_assert__cond~46 == 0);havoc ~__tmp_48~0;~__tmp_48~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~47;~__VERIFIER_assert__cond~47 := ~__tmp_48~0; {6190#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:55,673 INFO L273 TraceCheckUtils]: 42: Hoare triple {6190#(<= 0 main_~main__t~0)} assume !(~__VERIFIER_assert__cond~47 == 0);~main____CPAchecker_TMP_1~8 := ~main__t~0;~main__t~0 := ~main__t~0 + 1;~__tmp_3137_0~0 := ~main____CPAchecker_TMP_1~8;~__tmp_3137_1~0 := ~main____CPAchecker_TMP_0~8; {6193#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:55,673 INFO L273 TraceCheckUtils]: 43: Hoare triple {6193#(<= 1 main_~main__t~0)} ~main____CPAchecker_TMP_1~8 := ~__tmp_3137_0~0;~main____CPAchecker_TMP_0~8 := ~__tmp_3137_1~0; {6193#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:55,673 INFO L273 TraceCheckUtils]: 44: Hoare triple {6193#(<= 1 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~9;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~main____CPAchecker_TMP_0~9 := #t~nondet14;havoc #t~nondet14; {6193#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:55,674 INFO L273 TraceCheckUtils]: 45: Hoare triple {6193#(<= 1 main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~9 == 0);havoc ~__tmp_51~0;~__tmp_51~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~50;~__VERIFIER_assert__cond~50 := ~__tmp_51~0; {6194#(not (= 0 main_~__VERIFIER_assert__cond~50))} is VALID [2018-11-14 17:34:55,674 INFO L273 TraceCheckUtils]: 46: Hoare triple {6194#(not (= 0 main_~__VERIFIER_assert__cond~50))} assume ~__VERIFIER_assert__cond~50 == 0; {6189#false} is VALID [2018-11-14 17:34:55,674 INFO L273 TraceCheckUtils]: 47: Hoare triple {6189#false} assume !false; {6189#false} is VALID [2018-11-14 17:34:55,677 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,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:55,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 17:34:55,678 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-14 17:34:55,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:55,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:34:55,725 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:55,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:34:55,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:34:55,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:34:55,726 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 7 states. [2018-11-14 17:34:56,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:56,078 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-11-14 17:34:56,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:34:56,078 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-14 17:34:56,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:56,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:34:56,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2018-11-14 17:34:56,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:34:56,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2018-11-14 17:34:56,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 67 transitions. [2018-11-14 17:34:56,163 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:56,165 INFO L225 Difference]: With dead ends: 67 [2018-11-14 17:34:56,165 INFO L226 Difference]: Without dead ends: 65 [2018-11-14 17:34:56,166 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:34:56,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-14 17:34:56,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-11-14 17:34:56,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:56,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 56 states. [2018-11-14 17:34:56,183 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 56 states. [2018-11-14 17:34:56,183 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 56 states. [2018-11-14 17:34:56,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:56,185 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-11-14 17:34:56,185 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-11-14 17:34:56,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:56,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:56,185 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 65 states. [2018-11-14 17:34:56,186 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 65 states. [2018-11-14 17:34:56,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:56,187 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-11-14 17:34:56,187 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-11-14 17:34:56,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:56,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:56,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:56,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:56,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 17:34:56,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-11-14 17:34:56,189 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 48 [2018-11-14 17:34:56,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:56,190 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-11-14 17:34:56,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:34:56,190 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-14 17:34:56,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-14 17:34:56,191 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:56,191 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, 1, 1, 1, 1] [2018-11-14 17:34:56,191 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:56,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:56,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1203346823, now seen corresponding path program 1 times [2018-11-14 17:34:56,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:56,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:56,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:56,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:56,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:56,791 INFO L256 TraceCheckUtils]: 0: Hoare triple {6469#true} call ULTIMATE.init(); {6469#true} is VALID [2018-11-14 17:34:56,791 INFO L273 TraceCheckUtils]: 1: Hoare triple {6469#true} ~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {6469#true} is VALID [2018-11-14 17:34:56,792 INFO L273 TraceCheckUtils]: 2: Hoare triple {6469#true} assume true; {6469#true} is VALID [2018-11-14 17:34:56,792 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6469#true} {6469#true} #388#return; {6469#true} is VALID [2018-11-14 17:34:56,792 INFO L256 TraceCheckUtils]: 4: Hoare triple {6469#true} call #t~ret15 := main(); {6469#true} is VALID [2018-11-14 17:34:56,792 INFO L273 TraceCheckUtils]: 5: Hoare triple {6469#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {6469#true} is VALID [2018-11-14 17:34:56,793 INFO L273 TraceCheckUtils]: 6: Hoare triple {6469#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {6471#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:56,794 INFO L273 TraceCheckUtils]: 7: Hoare triple {6471#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {6471#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:56,794 INFO L273 TraceCheckUtils]: 8: Hoare triple {6471#(<= 0 main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_15~0;~__tmp_15~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {6472#(= main_~__VERIFIER_assert__cond~14 1)} is VALID [2018-11-14 17:34:56,795 INFO L273 TraceCheckUtils]: 9: Hoare triple {6472#(= main_~__VERIFIER_assert__cond~14 1)} assume !(~__VERIFIER_assert__cond~14 == 0);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {6469#true} is VALID [2018-11-14 17:34:56,795 INFO L273 TraceCheckUtils]: 10: Hoare triple {6469#true} assume !(~__VERIFIER_assert__cond~15 == 0);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6469#true} is VALID [2018-11-14 17:34:56,795 INFO L273 TraceCheckUtils]: 11: Hoare triple {6469#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {6469#true} is VALID [2018-11-14 17:34:56,795 INFO L273 TraceCheckUtils]: 12: Hoare triple {6469#true} assume !!(~main____CPAchecker_TMP_0~1 == 0);havoc ~__tmp_19~0;~__tmp_19~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {6469#true} is VALID [2018-11-14 17:34:56,795 INFO L273 TraceCheckUtils]: 13: Hoare triple {6469#true} assume !(~__VERIFIER_assert__cond~18 == 0);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {6469#true} is VALID [2018-11-14 17:34:56,795 INFO L273 TraceCheckUtils]: 14: Hoare triple {6469#true} assume !(~__VERIFIER_assert__cond~19 == 0);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6469#true} is VALID [2018-11-14 17:34:56,796 INFO L273 TraceCheckUtils]: 15: Hoare triple {6469#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {6469#true} is VALID [2018-11-14 17:34:56,796 INFO L273 TraceCheckUtils]: 16: Hoare triple {6469#true} assume !!(~main____CPAchecker_TMP_0~2 == 0);havoc ~__tmp_23~0;~__tmp_23~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {6469#true} is VALID [2018-11-14 17:34:56,796 INFO L273 TraceCheckUtils]: 17: Hoare triple {6469#true} assume !(~__VERIFIER_assert__cond~22 == 0);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {6469#true} is VALID [2018-11-14 17:34:56,796 INFO L273 TraceCheckUtils]: 18: Hoare triple {6469#true} assume !(~__VERIFIER_assert__cond~23 == 0);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6469#true} is VALID [2018-11-14 17:34:56,797 INFO L273 TraceCheckUtils]: 19: Hoare triple {6469#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {6469#true} is VALID [2018-11-14 17:34:56,797 INFO L273 TraceCheckUtils]: 20: Hoare triple {6469#true} assume !!(~main____CPAchecker_TMP_0~3 == 0);havoc ~__tmp_27~0;~__tmp_27~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {6469#true} is VALID [2018-11-14 17:34:56,797 INFO L273 TraceCheckUtils]: 21: Hoare triple {6469#true} assume !(~__VERIFIER_assert__cond~26 == 0);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {6469#true} is VALID [2018-11-14 17:34:56,797 INFO L273 TraceCheckUtils]: 22: Hoare triple {6469#true} assume !(~__VERIFIER_assert__cond~27 == 0);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6469#true} is VALID [2018-11-14 17:34:56,797 INFO L273 TraceCheckUtils]: 23: Hoare triple {6469#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~4 := #t~nondet9;havoc #t~nondet9; {6469#true} is VALID [2018-11-14 17:34:56,798 INFO L273 TraceCheckUtils]: 24: Hoare triple {6469#true} assume !!(~main____CPAchecker_TMP_0~4 == 0);havoc ~__tmp_31~0;~__tmp_31~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~30;~__VERIFIER_assert__cond~30 := ~__tmp_31~0; {6469#true} is VALID [2018-11-14 17:34:56,798 INFO L273 TraceCheckUtils]: 25: Hoare triple {6469#true} assume !(~__VERIFIER_assert__cond~30 == 0);havoc ~__tmp_32~0;~__tmp_32~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~31;~__VERIFIER_assert__cond~31 := ~__tmp_32~0; {6469#true} is VALID [2018-11-14 17:34:56,798 INFO L273 TraceCheckUtils]: 26: Hoare triple {6469#true} assume !(~__VERIFIER_assert__cond~31 == 0);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6469#true} is VALID [2018-11-14 17:34:56,798 INFO L273 TraceCheckUtils]: 27: Hoare triple {6469#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~5;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_0~5 := #t~nondet10;havoc #t~nondet10; {6469#true} is VALID [2018-11-14 17:34:56,798 INFO L273 TraceCheckUtils]: 28: Hoare triple {6469#true} assume !!(~main____CPAchecker_TMP_0~5 == 0);havoc ~__tmp_35~0;~__tmp_35~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {6469#true} is VALID [2018-11-14 17:34:56,798 INFO L273 TraceCheckUtils]: 29: Hoare triple {6469#true} assume !(~__VERIFIER_assert__cond~34 == 0);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {6469#true} is VALID [2018-11-14 17:34:56,798 INFO L273 TraceCheckUtils]: 30: Hoare triple {6469#true} assume !(~__VERIFIER_assert__cond~35 == 0);~main____CPAchecker_TMP_1~5 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6469#true} is VALID [2018-11-14 17:34:56,799 INFO L273 TraceCheckUtils]: 31: Hoare triple {6469#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~6;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~main____CPAchecker_TMP_0~6 := #t~nondet11;havoc #t~nondet11; {6469#true} is VALID [2018-11-14 17:34:56,799 INFO L273 TraceCheckUtils]: 32: Hoare triple {6469#true} assume !!(~main____CPAchecker_TMP_0~6 == 0);havoc ~__tmp_39~0;~__tmp_39~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {6469#true} is VALID [2018-11-14 17:34:56,799 INFO L273 TraceCheckUtils]: 33: Hoare triple {6469#true} assume !(~__VERIFIER_assert__cond~38 == 0);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {6469#true} is VALID [2018-11-14 17:34:56,799 INFO L273 TraceCheckUtils]: 34: Hoare triple {6469#true} assume !(~__VERIFIER_assert__cond~39 == 0);~main____CPAchecker_TMP_1~6 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6469#true} is VALID [2018-11-14 17:34:56,799 INFO L273 TraceCheckUtils]: 35: Hoare triple {6469#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~7;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~main____CPAchecker_TMP_0~7 := #t~nondet12;havoc #t~nondet12; {6469#true} is VALID [2018-11-14 17:34:56,800 INFO L273 TraceCheckUtils]: 36: Hoare triple {6469#true} assume !!(~main____CPAchecker_TMP_0~7 == 0);havoc ~__tmp_43~0;~__tmp_43~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {6469#true} is VALID [2018-11-14 17:34:56,800 INFO L273 TraceCheckUtils]: 37: Hoare triple {6469#true} assume !(~__VERIFIER_assert__cond~42 == 0);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {6469#true} is VALID [2018-11-14 17:34:56,800 INFO L273 TraceCheckUtils]: 38: Hoare triple {6469#true} assume !(~__VERIFIER_assert__cond~43 == 0);~main____CPAchecker_TMP_1~7 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6469#true} is VALID [2018-11-14 17:34:56,800 INFO L273 TraceCheckUtils]: 39: Hoare triple {6469#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~8;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~main____CPAchecker_TMP_0~8 := #t~nondet13;havoc #t~nondet13; {6469#true} is VALID [2018-11-14 17:34:56,801 INFO L273 TraceCheckUtils]: 40: Hoare triple {6469#true} assume !!(~main____CPAchecker_TMP_0~8 == 0);havoc ~__tmp_47~0;~__tmp_47~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~46;~__VERIFIER_assert__cond~46 := ~__tmp_47~0; {6473#(or (= 0 main_~__VERIFIER_assert__cond~46) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:34:56,801 INFO L273 TraceCheckUtils]: 41: Hoare triple {6473#(or (= 0 main_~__VERIFIER_assert__cond~46) (<= 0 main_~main__t~0))} assume !(~__VERIFIER_assert__cond~46 == 0);havoc ~__tmp_48~0;~__tmp_48~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~47;~__VERIFIER_assert__cond~47 := ~__tmp_48~0; {6471#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:56,802 INFO L273 TraceCheckUtils]: 42: Hoare triple {6471#(<= 0 main_~main__t~0)} assume !(~__VERIFIER_assert__cond~47 == 0);~main____CPAchecker_TMP_1~8 := ~main__t~0;~main__t~0 := ~main__t~0 + 1;~__tmp_3137_0~0 := ~main____CPAchecker_TMP_1~8;~__tmp_3137_1~0 := ~main____CPAchecker_TMP_0~8; {6474#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:56,802 INFO L273 TraceCheckUtils]: 43: Hoare triple {6474#(<= 1 main_~main__t~0)} ~main____CPAchecker_TMP_1~8 := ~__tmp_3137_0~0;~main____CPAchecker_TMP_0~8 := ~__tmp_3137_1~0; {6474#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:56,803 INFO L273 TraceCheckUtils]: 44: Hoare triple {6474#(<= 1 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~9;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~main____CPAchecker_TMP_0~9 := #t~nondet14;havoc #t~nondet14; {6474#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:56,803 INFO L273 TraceCheckUtils]: 45: Hoare triple {6474#(<= 1 main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~9 == 0);havoc ~__tmp_49~0;~__tmp_49~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~48;~__VERIFIER_assert__cond~48 := ~__tmp_49~0; {6475#(not (= 0 main_~__VERIFIER_assert__cond~48))} is VALID [2018-11-14 17:34:56,804 INFO L273 TraceCheckUtils]: 46: Hoare triple {6475#(not (= 0 main_~__VERIFIER_assert__cond~48))} assume ~__VERIFIER_assert__cond~48 == 0; {6470#false} is VALID [2018-11-14 17:34:56,804 INFO L273 TraceCheckUtils]: 47: Hoare triple {6470#false} assume !false; {6470#false} is VALID [2018-11-14 17:34:56,807 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:56,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:56,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 17:34:56,808 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-14 17:34:56,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:56,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:34:56,880 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,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:34:56,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:34:56,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:34:56,881 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 7 states. [2018-11-14 17:34:57,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:57,210 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-14 17:34:57,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:34:57,210 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-14 17:34:57,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:57,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:34:57,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2018-11-14 17:34:57,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:34:57,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2018-11-14 17:34:57,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2018-11-14 17:34:57,631 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:57,632 INFO L225 Difference]: With dead ends: 56 [2018-11-14 17:34:57,632 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 17:34:57,632 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:34:57,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 17:34:57,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-14 17:34:57,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:57,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2018-11-14 17:34:57,639 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-14 17:34:57,639 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-14 17:34:57,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:57,641 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-14 17:34:57,641 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-14 17:34:57,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:57,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:57,642 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-14 17:34:57,642 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-14 17:34:57,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:57,643 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-14 17:34:57,643 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-14 17:34:57,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:57,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:57,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:57,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:57,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-14 17:34:57,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-11-14 17:34:57,645 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 48 [2018-11-14 17:34:57,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:57,646 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-11-14 17:34:57,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:34:57,646 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-14 17:34:57,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 17:34:57,646 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:57,647 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, 1, 1, 1, 1, 1] [2018-11-14 17:34:57,647 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:57,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:57,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1350519771, now seen corresponding path program 1 times [2018-11-14 17:34:57,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:57,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:57,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:57,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:57,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:58,215 INFO L256 TraceCheckUtils]: 0: Hoare triple {6714#true} call ULTIMATE.init(); {6714#true} is VALID [2018-11-14 17:34:58,215 INFO L273 TraceCheckUtils]: 1: Hoare triple {6714#true} ~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {6714#true} is VALID [2018-11-14 17:34:58,216 INFO L273 TraceCheckUtils]: 2: Hoare triple {6714#true} assume true; {6714#true} is VALID [2018-11-14 17:34:58,216 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6714#true} {6714#true} #388#return; {6714#true} is VALID [2018-11-14 17:34:58,216 INFO L256 TraceCheckUtils]: 4: Hoare triple {6714#true} call #t~ret15 := main(); {6714#true} is VALID [2018-11-14 17:34:58,216 INFO L273 TraceCheckUtils]: 5: Hoare triple {6714#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {6714#true} is VALID [2018-11-14 17:34:58,217 INFO L273 TraceCheckUtils]: 6: Hoare triple {6714#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {6716#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:58,217 INFO L273 TraceCheckUtils]: 7: Hoare triple {6716#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {6716#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:58,219 INFO L273 TraceCheckUtils]: 8: Hoare triple {6716#(<= 0 main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_15~0;~__tmp_15~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {6717#(= main_~__VERIFIER_assert__cond~14 1)} is VALID [2018-11-14 17:34:58,219 INFO L273 TraceCheckUtils]: 9: Hoare triple {6717#(= main_~__VERIFIER_assert__cond~14 1)} assume !(~__VERIFIER_assert__cond~14 == 0);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {6714#true} is VALID [2018-11-14 17:34:58,219 INFO L273 TraceCheckUtils]: 10: Hoare triple {6714#true} assume !(~__VERIFIER_assert__cond~15 == 0);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6714#true} is VALID [2018-11-14 17:34:58,219 INFO L273 TraceCheckUtils]: 11: Hoare triple {6714#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {6714#true} is VALID [2018-11-14 17:34:58,220 INFO L273 TraceCheckUtils]: 12: Hoare triple {6714#true} assume !!(~main____CPAchecker_TMP_0~1 == 0);havoc ~__tmp_19~0;~__tmp_19~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {6714#true} is VALID [2018-11-14 17:34:58,220 INFO L273 TraceCheckUtils]: 13: Hoare triple {6714#true} assume !(~__VERIFIER_assert__cond~18 == 0);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {6714#true} is VALID [2018-11-14 17:34:58,220 INFO L273 TraceCheckUtils]: 14: Hoare triple {6714#true} assume !(~__VERIFIER_assert__cond~19 == 0);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6714#true} is VALID [2018-11-14 17:34:58,220 INFO L273 TraceCheckUtils]: 15: Hoare triple {6714#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {6714#true} is VALID [2018-11-14 17:34:58,220 INFO L273 TraceCheckUtils]: 16: Hoare triple {6714#true} assume !!(~main____CPAchecker_TMP_0~2 == 0);havoc ~__tmp_23~0;~__tmp_23~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {6714#true} is VALID [2018-11-14 17:34:58,220 INFO L273 TraceCheckUtils]: 17: Hoare triple {6714#true} assume !(~__VERIFIER_assert__cond~22 == 0);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {6714#true} is VALID [2018-11-14 17:34:58,221 INFO L273 TraceCheckUtils]: 18: Hoare triple {6714#true} assume !(~__VERIFIER_assert__cond~23 == 0);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6714#true} is VALID [2018-11-14 17:34:58,221 INFO L273 TraceCheckUtils]: 19: Hoare triple {6714#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {6714#true} is VALID [2018-11-14 17:34:58,221 INFO L273 TraceCheckUtils]: 20: Hoare triple {6714#true} assume !!(~main____CPAchecker_TMP_0~3 == 0);havoc ~__tmp_27~0;~__tmp_27~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {6714#true} is VALID [2018-11-14 17:34:58,221 INFO L273 TraceCheckUtils]: 21: Hoare triple {6714#true} assume !(~__VERIFIER_assert__cond~26 == 0);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {6714#true} is VALID [2018-11-14 17:34:58,221 INFO L273 TraceCheckUtils]: 22: Hoare triple {6714#true} assume !(~__VERIFIER_assert__cond~27 == 0);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6714#true} is VALID [2018-11-14 17:34:58,222 INFO L273 TraceCheckUtils]: 23: Hoare triple {6714#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~4 := #t~nondet9;havoc #t~nondet9; {6714#true} is VALID [2018-11-14 17:34:58,222 INFO L273 TraceCheckUtils]: 24: Hoare triple {6714#true} assume !!(~main____CPAchecker_TMP_0~4 == 0);havoc ~__tmp_31~0;~__tmp_31~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~30;~__VERIFIER_assert__cond~30 := ~__tmp_31~0; {6714#true} is VALID [2018-11-14 17:34:58,222 INFO L273 TraceCheckUtils]: 25: Hoare triple {6714#true} assume !(~__VERIFIER_assert__cond~30 == 0);havoc ~__tmp_32~0;~__tmp_32~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~31;~__VERIFIER_assert__cond~31 := ~__tmp_32~0; {6714#true} is VALID [2018-11-14 17:34:58,222 INFO L273 TraceCheckUtils]: 26: Hoare triple {6714#true} assume !(~__VERIFIER_assert__cond~31 == 0);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6714#true} is VALID [2018-11-14 17:34:58,223 INFO L273 TraceCheckUtils]: 27: Hoare triple {6714#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~5;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_0~5 := #t~nondet10;havoc #t~nondet10; {6714#true} is VALID [2018-11-14 17:34:58,223 INFO L273 TraceCheckUtils]: 28: Hoare triple {6714#true} assume !!(~main____CPAchecker_TMP_0~5 == 0);havoc ~__tmp_35~0;~__tmp_35~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {6714#true} is VALID [2018-11-14 17:34:58,223 INFO L273 TraceCheckUtils]: 29: Hoare triple {6714#true} assume !(~__VERIFIER_assert__cond~34 == 0);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {6714#true} is VALID [2018-11-14 17:34:58,223 INFO L273 TraceCheckUtils]: 30: Hoare triple {6714#true} assume !(~__VERIFIER_assert__cond~35 == 0);~main____CPAchecker_TMP_1~5 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6714#true} is VALID [2018-11-14 17:34:58,223 INFO L273 TraceCheckUtils]: 31: Hoare triple {6714#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~6;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~main____CPAchecker_TMP_0~6 := #t~nondet11;havoc #t~nondet11; {6714#true} is VALID [2018-11-14 17:34:58,223 INFO L273 TraceCheckUtils]: 32: Hoare triple {6714#true} assume !!(~main____CPAchecker_TMP_0~6 == 0);havoc ~__tmp_39~0;~__tmp_39~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {6714#true} is VALID [2018-11-14 17:34:58,224 INFO L273 TraceCheckUtils]: 33: Hoare triple {6714#true} assume !(~__VERIFIER_assert__cond~38 == 0);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {6714#true} is VALID [2018-11-14 17:34:58,224 INFO L273 TraceCheckUtils]: 34: Hoare triple {6714#true} assume !(~__VERIFIER_assert__cond~39 == 0);~main____CPAchecker_TMP_1~6 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6714#true} is VALID [2018-11-14 17:34:58,224 INFO L273 TraceCheckUtils]: 35: Hoare triple {6714#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~7;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~main____CPAchecker_TMP_0~7 := #t~nondet12;havoc #t~nondet12; {6714#true} is VALID [2018-11-14 17:34:58,224 INFO L273 TraceCheckUtils]: 36: Hoare triple {6714#true} assume !!(~main____CPAchecker_TMP_0~7 == 0);havoc ~__tmp_43~0;~__tmp_43~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {6714#true} is VALID [2018-11-14 17:34:58,224 INFO L273 TraceCheckUtils]: 37: Hoare triple {6714#true} assume !(~__VERIFIER_assert__cond~42 == 0);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {6714#true} is VALID [2018-11-14 17:34:58,224 INFO L273 TraceCheckUtils]: 38: Hoare triple {6714#true} assume !(~__VERIFIER_assert__cond~43 == 0);~main____CPAchecker_TMP_1~7 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6714#true} is VALID [2018-11-14 17:34:58,225 INFO L273 TraceCheckUtils]: 39: Hoare triple {6714#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~8;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~main____CPAchecker_TMP_0~8 := #t~nondet13;havoc #t~nondet13; {6718#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-14 17:34:58,229 INFO L273 TraceCheckUtils]: 40: Hoare triple {6718#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !!(~main____CPAchecker_TMP_0~8 == 0);havoc ~__tmp_47~0;~__tmp_47~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~46;~__VERIFIER_assert__cond~46 := ~__tmp_47~0; {6718#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-14 17:34:58,229 INFO L273 TraceCheckUtils]: 41: Hoare triple {6718#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(~__VERIFIER_assert__cond~46 == 0);havoc ~__tmp_48~0;~__tmp_48~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~47;~__VERIFIER_assert__cond~47 := ~__tmp_48~0; {6719#(or (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (= 0 main_~__VERIFIER_assert__cond~47))} is VALID [2018-11-14 17:34:58,231 INFO L273 TraceCheckUtils]: 42: Hoare triple {6719#(or (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (= 0 main_~__VERIFIER_assert__cond~47))} assume !(~__VERIFIER_assert__cond~47 == 0);~main____CPAchecker_TMP_1~8 := ~main__t~0;~main__t~0 := ~main__t~0 + 1;~__tmp_3137_0~0 := ~main____CPAchecker_TMP_1~8;~__tmp_3137_1~0 := ~main____CPAchecker_TMP_0~8; {6720#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:58,231 INFO L273 TraceCheckUtils]: 43: Hoare triple {6720#(<= main_~main__t~0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_1~8 := ~__tmp_3137_0~0;~main____CPAchecker_TMP_0~8 := ~__tmp_3137_1~0; {6720#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:58,233 INFO L273 TraceCheckUtils]: 44: Hoare triple {6720#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~9;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~main____CPAchecker_TMP_0~9 := #t~nondet14;havoc #t~nondet14; {6720#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:58,233 INFO L273 TraceCheckUtils]: 45: Hoare triple {6720#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(~main____CPAchecker_TMP_0~9 == 0);havoc ~__tmp_51~0;~__tmp_51~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~50;~__VERIFIER_assert__cond~50 := ~__tmp_51~0; {6720#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:58,235 INFO L273 TraceCheckUtils]: 46: Hoare triple {6720#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~__VERIFIER_assert__cond~50 == 0);havoc ~__tmp_52~0;~__tmp_52~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~51;~__VERIFIER_assert__cond~51 := ~__tmp_52~0; {6721#(not (= 0 main_~__VERIFIER_assert__cond~51))} is VALID [2018-11-14 17:34:58,235 INFO L273 TraceCheckUtils]: 47: Hoare triple {6721#(not (= 0 main_~__VERIFIER_assert__cond~51))} assume ~__VERIFIER_assert__cond~51 == 0; {6715#false} is VALID [2018-11-14 17:34:58,235 INFO L273 TraceCheckUtils]: 48: Hoare triple {6715#false} assume !false; {6715#false} is VALID [2018-11-14 17:34:58,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:58,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:58,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-14 17:34:58,238 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-14 17:34:58,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:58,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:34:58,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:58,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:34:58,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:34:58,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:34:58,296 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 8 states. [2018-11-14 17:34:58,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:58,930 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-11-14 17:34:58,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:34:58,930 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-14 17:34:58,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:58,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:34:58,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2018-11-14 17:34:58,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:34:58,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2018-11-14 17:34:58,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2018-11-14 17:34:59,479 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:59,481 INFO L225 Difference]: With dead ends: 62 [2018-11-14 17:34:59,481 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 17:34:59,482 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:34:59,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 17:34:59,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-11-14 17:34:59,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:59,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 52 states. [2018-11-14 17:34:59,489 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 52 states. [2018-11-14 17:34:59,489 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 52 states. [2018-11-14 17:34:59,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:59,490 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-14 17:34:59,491 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-14 17:34:59,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:59,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:59,491 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 60 states. [2018-11-14 17:34:59,491 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 60 states. [2018-11-14 17:34:59,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:59,492 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-14 17:34:59,493 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-14 17:34:59,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:59,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:59,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:59,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:59,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-14 17:34:59,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-11-14 17:34:59,495 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-11-14 17:34:59,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:59,495 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-11-14 17:34:59,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:34:59,495 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-14 17:34:59,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 17:34:59,496 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:59,496 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, 1, 1, 1, 1, 1] [2018-11-14 17:34:59,496 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:59,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:59,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1350950747, now seen corresponding path program 1 times [2018-11-14 17:34:59,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:59,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:59,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:59,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:59,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:59,687 INFO L256 TraceCheckUtils]: 0: Hoare triple {6983#true} call ULTIMATE.init(); {6983#true} is VALID [2018-11-14 17:34:59,688 INFO L273 TraceCheckUtils]: 1: Hoare triple {6983#true} ~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {6983#true} is VALID [2018-11-14 17:34:59,688 INFO L273 TraceCheckUtils]: 2: Hoare triple {6983#true} assume true; {6983#true} is VALID [2018-11-14 17:34:59,688 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6983#true} {6983#true} #388#return; {6983#true} is VALID [2018-11-14 17:34:59,688 INFO L256 TraceCheckUtils]: 4: Hoare triple {6983#true} call #t~ret15 := main(); {6983#true} is VALID [2018-11-14 17:34:59,689 INFO L273 TraceCheckUtils]: 5: Hoare triple {6983#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {6983#true} is VALID [2018-11-14 17:34:59,691 INFO L273 TraceCheckUtils]: 6: Hoare triple {6983#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {6985#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:59,692 INFO L273 TraceCheckUtils]: 7: Hoare triple {6985#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {6985#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:59,692 INFO L273 TraceCheckUtils]: 8: Hoare triple {6985#(<= 0 main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_15~0;~__tmp_15~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {6986#(= main_~__VERIFIER_assert__cond~14 1)} is VALID [2018-11-14 17:34:59,693 INFO L273 TraceCheckUtils]: 9: Hoare triple {6986#(= main_~__VERIFIER_assert__cond~14 1)} assume !(~__VERIFIER_assert__cond~14 == 0);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {6983#true} is VALID [2018-11-14 17:34:59,693 INFO L273 TraceCheckUtils]: 10: Hoare triple {6983#true} assume !(~__VERIFIER_assert__cond~15 == 0);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6983#true} is VALID [2018-11-14 17:34:59,693 INFO L273 TraceCheckUtils]: 11: Hoare triple {6983#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {6983#true} is VALID [2018-11-14 17:34:59,693 INFO L273 TraceCheckUtils]: 12: Hoare triple {6983#true} assume !!(~main____CPAchecker_TMP_0~1 == 0);havoc ~__tmp_19~0;~__tmp_19~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {6983#true} is VALID [2018-11-14 17:34:59,693 INFO L273 TraceCheckUtils]: 13: Hoare triple {6983#true} assume !(~__VERIFIER_assert__cond~18 == 0);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {6983#true} is VALID [2018-11-14 17:34:59,694 INFO L273 TraceCheckUtils]: 14: Hoare triple {6983#true} assume !(~__VERIFIER_assert__cond~19 == 0);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6983#true} is VALID [2018-11-14 17:34:59,694 INFO L273 TraceCheckUtils]: 15: Hoare triple {6983#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {6983#true} is VALID [2018-11-14 17:34:59,694 INFO L273 TraceCheckUtils]: 16: Hoare triple {6983#true} assume !!(~main____CPAchecker_TMP_0~2 == 0);havoc ~__tmp_23~0;~__tmp_23~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {6983#true} is VALID [2018-11-14 17:34:59,694 INFO L273 TraceCheckUtils]: 17: Hoare triple {6983#true} assume !(~__VERIFIER_assert__cond~22 == 0);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {6983#true} is VALID [2018-11-14 17:34:59,695 INFO L273 TraceCheckUtils]: 18: Hoare triple {6983#true} assume !(~__VERIFIER_assert__cond~23 == 0);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6983#true} is VALID [2018-11-14 17:34:59,695 INFO L273 TraceCheckUtils]: 19: Hoare triple {6983#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {6983#true} is VALID [2018-11-14 17:34:59,695 INFO L273 TraceCheckUtils]: 20: Hoare triple {6983#true} assume !!(~main____CPAchecker_TMP_0~3 == 0);havoc ~__tmp_27~0;~__tmp_27~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {6983#true} is VALID [2018-11-14 17:34:59,695 INFO L273 TraceCheckUtils]: 21: Hoare triple {6983#true} assume !(~__VERIFIER_assert__cond~26 == 0);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {6983#true} is VALID [2018-11-14 17:34:59,695 INFO L273 TraceCheckUtils]: 22: Hoare triple {6983#true} assume !(~__VERIFIER_assert__cond~27 == 0);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6983#true} is VALID [2018-11-14 17:34:59,695 INFO L273 TraceCheckUtils]: 23: Hoare triple {6983#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~4 := #t~nondet9;havoc #t~nondet9; {6983#true} is VALID [2018-11-14 17:34:59,695 INFO L273 TraceCheckUtils]: 24: Hoare triple {6983#true} assume !!(~main____CPAchecker_TMP_0~4 == 0);havoc ~__tmp_31~0;~__tmp_31~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~30;~__VERIFIER_assert__cond~30 := ~__tmp_31~0; {6983#true} is VALID [2018-11-14 17:34:59,696 INFO L273 TraceCheckUtils]: 25: Hoare triple {6983#true} assume !(~__VERIFIER_assert__cond~30 == 0);havoc ~__tmp_32~0;~__tmp_32~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~31;~__VERIFIER_assert__cond~31 := ~__tmp_32~0; {6983#true} is VALID [2018-11-14 17:34:59,696 INFO L273 TraceCheckUtils]: 26: Hoare triple {6983#true} assume !(~__VERIFIER_assert__cond~31 == 0);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6983#true} is VALID [2018-11-14 17:34:59,696 INFO L273 TraceCheckUtils]: 27: Hoare triple {6983#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~5;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_0~5 := #t~nondet10;havoc #t~nondet10; {6983#true} is VALID [2018-11-14 17:34:59,696 INFO L273 TraceCheckUtils]: 28: Hoare triple {6983#true} assume !!(~main____CPAchecker_TMP_0~5 == 0);havoc ~__tmp_35~0;~__tmp_35~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {6983#true} is VALID [2018-11-14 17:34:59,696 INFO L273 TraceCheckUtils]: 29: Hoare triple {6983#true} assume !(~__VERIFIER_assert__cond~34 == 0);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {6983#true} is VALID [2018-11-14 17:34:59,696 INFO L273 TraceCheckUtils]: 30: Hoare triple {6983#true} assume !(~__VERIFIER_assert__cond~35 == 0);~main____CPAchecker_TMP_1~5 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6983#true} is VALID [2018-11-14 17:34:59,697 INFO L273 TraceCheckUtils]: 31: Hoare triple {6983#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~6;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~main____CPAchecker_TMP_0~6 := #t~nondet11;havoc #t~nondet11; {6983#true} is VALID [2018-11-14 17:34:59,697 INFO L273 TraceCheckUtils]: 32: Hoare triple {6983#true} assume !!(~main____CPAchecker_TMP_0~6 == 0);havoc ~__tmp_39~0;~__tmp_39~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {6983#true} is VALID [2018-11-14 17:34:59,697 INFO L273 TraceCheckUtils]: 33: Hoare triple {6983#true} assume !(~__VERIFIER_assert__cond~38 == 0);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {6983#true} is VALID [2018-11-14 17:34:59,697 INFO L273 TraceCheckUtils]: 34: Hoare triple {6983#true} assume !(~__VERIFIER_assert__cond~39 == 0);~main____CPAchecker_TMP_1~6 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6983#true} is VALID [2018-11-14 17:34:59,697 INFO L273 TraceCheckUtils]: 35: Hoare triple {6983#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~7;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~main____CPAchecker_TMP_0~7 := #t~nondet12;havoc #t~nondet12; {6983#true} is VALID [2018-11-14 17:34:59,698 INFO L273 TraceCheckUtils]: 36: Hoare triple {6983#true} assume !!(~main____CPAchecker_TMP_0~7 == 0);havoc ~__tmp_43~0;~__tmp_43~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {6983#true} is VALID [2018-11-14 17:34:59,698 INFO L273 TraceCheckUtils]: 37: Hoare triple {6983#true} assume !(~__VERIFIER_assert__cond~42 == 0);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {6983#true} is VALID [2018-11-14 17:34:59,698 INFO L273 TraceCheckUtils]: 38: Hoare triple {6983#true} assume !(~__VERIFIER_assert__cond~43 == 0);~main____CPAchecker_TMP_1~7 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6983#true} is VALID [2018-11-14 17:34:59,704 INFO L273 TraceCheckUtils]: 39: Hoare triple {6983#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~8;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~main____CPAchecker_TMP_0~8 := #t~nondet13;havoc #t~nondet13; {6987#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-14 17:34:59,704 INFO L273 TraceCheckUtils]: 40: Hoare triple {6987#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !!(~main____CPAchecker_TMP_0~8 == 0);havoc ~__tmp_47~0;~__tmp_47~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~46;~__VERIFIER_assert__cond~46 := ~__tmp_47~0; {6987#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-14 17:34:59,705 INFO L273 TraceCheckUtils]: 41: Hoare triple {6987#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(~__VERIFIER_assert__cond~46 == 0);havoc ~__tmp_48~0;~__tmp_48~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~47;~__VERIFIER_assert__cond~47 := ~__tmp_48~0; {6988#(or (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (= 0 main_~__VERIFIER_assert__cond~47))} is VALID [2018-11-14 17:34:59,706 INFO L273 TraceCheckUtils]: 42: Hoare triple {6988#(or (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (= 0 main_~__VERIFIER_assert__cond~47))} assume !(~__VERIFIER_assert__cond~47 == 0);~main____CPAchecker_TMP_1~8 := ~main__t~0;~main__t~0 := ~main__t~0 + 1;~__tmp_3137_0~0 := ~main____CPAchecker_TMP_1~8;~__tmp_3137_1~0 := ~main____CPAchecker_TMP_0~8; {6989#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:59,706 INFO L273 TraceCheckUtils]: 43: Hoare triple {6989#(<= main_~main__t~0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_1~8 := ~__tmp_3137_0~0;~main____CPAchecker_TMP_0~8 := ~__tmp_3137_1~0; {6989#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:59,706 INFO L273 TraceCheckUtils]: 44: Hoare triple {6989#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~9;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~main____CPAchecker_TMP_0~9 := #t~nondet14;havoc #t~nondet14; {6989#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:59,707 INFO L273 TraceCheckUtils]: 45: Hoare triple {6989#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main____CPAchecker_TMP_0~9 == 0);havoc ~__tmp_49~0;~__tmp_49~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~48;~__VERIFIER_assert__cond~48 := ~__tmp_49~0; {6989#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:59,707 INFO L273 TraceCheckUtils]: 46: Hoare triple {6989#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~__VERIFIER_assert__cond~48 == 0);havoc ~__tmp_50~0;~__tmp_50~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~49;~__VERIFIER_assert__cond~49 := ~__tmp_50~0; {6990#(not (= 0 main_~__VERIFIER_assert__cond~49))} is VALID [2018-11-14 17:34:59,707 INFO L273 TraceCheckUtils]: 47: Hoare triple {6990#(not (= 0 main_~__VERIFIER_assert__cond~49))} assume ~__VERIFIER_assert__cond~49 == 0; {6984#false} is VALID [2018-11-14 17:34:59,708 INFO L273 TraceCheckUtils]: 48: Hoare triple {6984#false} assume !false; {6984#false} is VALID [2018-11-14 17:34:59,709 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:59,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:59,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-14 17:34:59,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-14 17:34:59,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:59,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:34:59,759 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:59,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:34:59,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:34:59,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:34:59,760 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 8 states. [2018-11-14 17:35:00,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:00,372 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-14 17:35:00,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:35:00,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-14 17:35:00,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:00,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:35:00,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2018-11-14 17:35:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:35:00,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2018-11-14 17:35:00,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 52 transitions. [2018-11-14 17:35:00,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:00,863 INFO L225 Difference]: With dead ends: 52 [2018-11-14 17:35:00,863 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 17:35:00,864 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-11-14 17:35:00,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 17:35:00,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 17:35:00,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:00,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:00,866 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:00,866 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:00,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:00,866 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:35:00,866 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:35:00,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:00,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:00,867 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:00,867 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:00,867 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:35:00,867 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:35:00,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:00,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:00,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:00,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:00,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 17:35:00,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 17:35:00,868 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2018-11-14 17:35:00,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:00,869 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 17:35:00,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:35:00,869 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:35:00,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:00,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 17:35:01,117 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-14 17:35:01,117 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-14 17:35:01,117 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:35:01,117 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:35:01,117 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 17:35:01,117 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 17:35:01,117 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 17:35:01,117 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 977) no Hoare annotation was computed. [2018-11-14 17:35:01,118 INFO L425 ceAbstractionStarter]: For program point L861(lines 861 941) no Hoare annotation was computed. [2018-11-14 17:35:01,118 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 272) no Hoare annotation was computed. [2018-11-14 17:35:01,118 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 12 1001) no Hoare annotation was computed. [2018-11-14 17:35:01,118 INFO L425 ceAbstractionStarter]: For program point L531(lines 531 555) no Hoare annotation was computed. [2018-11-14 17:35:01,118 INFO L425 ceAbstractionStarter]: For program point L878(line 878) no Hoare annotation was computed. [2018-11-14 17:35:01,118 INFO L425 ceAbstractionStarter]: For program point L746(lines 746 757) no Hoare annotation was computed. [2018-11-14 17:35:01,118 INFO L425 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-11-14 17:35:01,118 INFO L425 ceAbstractionStarter]: For program point L796(lines 796 946) no Hoare annotation was computed. [2018-11-14 17:35:01,118 INFO L425 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 202) no Hoare annotation was computed. [2018-11-14 17:35:01,118 INFO L425 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-11-14 17:35:01,118 INFO L425 ceAbstractionStarter]: For program point L565(lines 565 968) no Hoare annotation was computed. [2018-11-14 17:35:01,118 INFO L425 ceAbstractionStarter]: For program point L912(lines 912 938) no Hoare annotation was computed. [2018-11-14 17:35:01,119 INFO L425 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 878) no Hoare annotation was computed. [2018-11-14 17:35:01,119 INFO L425 ceAbstractionStarter]: For program point L780(lines 780 948) no Hoare annotation was computed. [2018-11-14 17:35:01,120 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-14 17:35:01,120 INFO L425 ceAbstractionStarter]: For program point L516(lines 516 971) no Hoare annotation was computed. [2018-11-14 17:35:01,120 INFO L421 ceAbstractionStarter]: At program point L863(lines 21 995) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2018-11-14 17:35:01,120 INFO L425 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2018-11-14 17:35:01,120 INFO L425 ceAbstractionStarter]: For program point L599(lines 599 623) no Hoare annotation was computed. [2018-11-14 17:35:01,120 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 995) no Hoare annotation was computed. [2018-11-14 17:35:01,120 INFO L425 ceAbstractionStarter]: For program point L814(lines 814 825) no Hoare annotation was computed. [2018-11-14 17:35:01,120 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 12 1001) no Hoare annotation was computed. [2018-11-14 17:35:01,120 INFO L425 ceAbstractionStarter]: For program point L633(lines 633 962) no Hoare annotation was computed. [2018-11-14 17:35:01,120 INFO L425 ceAbstractionStarter]: For program point L914(line 914) no Hoare annotation was computed. [2018-11-14 17:35:01,120 INFO L425 ceAbstractionStarter]: For program point L848(lines 848 942) no Hoare annotation was computed. [2018-11-14 17:35:01,120 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 231) no Hoare annotation was computed. [2018-11-14 17:35:01,121 INFO L425 ceAbstractionStarter]: For program point L584(lines 584 965) no Hoare annotation was computed. [2018-11-14 17:35:01,121 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 988) no Hoare annotation was computed. [2018-11-14 17:35:01,121 INFO L425 ceAbstractionStarter]: For program point L667(lines 667 691) no Hoare annotation was computed. [2018-11-14 17:35:01,121 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2018-11-14 17:35:01,121 INFO L425 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 264) no Hoare annotation was computed. [2018-11-14 17:35:01,121 INFO L425 ceAbstractionStarter]: For program point L304(lines 304 990) no Hoare annotation was computed. [2018-11-14 17:35:01,121 INFO L425 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2018-11-14 17:35:01,121 INFO L421 ceAbstractionStarter]: At program point L899(lines 60 994) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2018-11-14 17:35:01,121 INFO L425 ceAbstractionStarter]: For program point L701(lines 701 956) no Hoare annotation was computed. [2018-11-14 17:35:01,122 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2018-11-14 17:35:01,122 INFO L425 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 926) no Hoare annotation was computed. [2018-11-14 17:35:01,122 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 349) no Hoare annotation was computed. [2018-11-14 17:35:01,122 INFO L425 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-11-14 17:35:01,122 INFO L425 ceAbstractionStarter]: For program point L652(lines 652 959) no Hoare annotation was computed. [2018-11-14 17:35:01,122 INFO L425 ceAbstractionStarter]: For program point L41(lines 41 51) no Hoare annotation was computed. [2018-11-14 17:35:01,122 INFO L428 ceAbstractionStarter]: At program point L999(lines 17 1000) the Hoare annotation is: true [2018-11-14 17:35:01,122 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 982) no Hoare annotation was computed. [2018-11-14 17:35:01,122 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 759) no Hoare annotation was computed. [2018-11-14 17:35:01,122 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 280) no Hoare annotation was computed. [2018-11-14 17:35:01,123 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 31) no Hoare annotation was computed. [2018-11-14 17:35:01,123 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 984) no Hoare annotation was computed. [2018-11-14 17:35:01,123 INFO L425 ceAbstractionStarter]: For program point L769(lines 769 950) no Hoare annotation was computed. [2018-11-14 17:35:01,123 INFO L425 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 914) no Hoare annotation was computed. [2018-11-14 17:35:01,123 INFO L425 ceAbstractionStarter]: For program point L406(lines 406 417) no Hoare annotation was computed. [2018-11-14 17:35:01,123 INFO L425 ceAbstractionStarter]: For program point L720(lines 720 953) no Hoare annotation was computed. [2018-11-14 17:35:01,123 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-14 17:35:01,123 INFO L425 ceAbstractionStarter]: For program point L456(lines 456 976) no Hoare annotation was computed. [2018-11-14 17:35:01,123 INFO L421 ceAbstractionStarter]: At program point L935(lines 853 942) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~14 1) (<= 1 main_~main__t~0)) [2018-11-14 17:35:01,123 INFO L425 ceAbstractionStarter]: For program point L869(lines 869 940) no Hoare annotation was computed. [2018-11-14 17:35:01,123 INFO L425 ceAbstractionStarter]: For program point L803(lines 803 827) no Hoare annotation was computed. [2018-11-14 17:35:01,123 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 228) no Hoare annotation was computed. [2018-11-14 17:35:01,124 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2018-11-14 17:35:01,124 INFO L425 ceAbstractionStarter]: For program point L60(lines 60 994) no Hoare annotation was computed. [2018-11-14 17:35:01,124 INFO L425 ceAbstractionStarter]: For program point L440(lines 440 978) no Hoare annotation was computed. [2018-11-14 17:35:01,124 INFO L425 ceAbstractionStarter]: For program point L110(lines 110 118) no Hoare annotation was computed. [2018-11-14 17:35:01,124 INFO L425 ceAbstractionStarter]: For program point L837(lines 837 944) no Hoare annotation was computed. [2018-11-14 17:35:01,124 INFO L425 ceAbstractionStarter]: For program point L127(lines 127 279) no Hoare annotation was computed. [2018-11-14 17:35:01,124 INFO L425 ceAbstractionStarter]: For program point L474(lines 474 485) no Hoare annotation was computed. [2018-11-14 17:35:01,124 INFO L425 ceAbstractionStarter]: For program point L788(lines 788 947) no Hoare annotation was computed. [2018-11-14 17:35:01,124 INFO L425 ceAbstractionStarter]: For program point L243(lines 243 278) no Hoare annotation was computed. [2018-11-14 17:35:01,125 INFO L425 ceAbstractionStarter]: For program point L78(lines 78 281) no Hoare annotation was computed. [2018-11-14 17:35:01,125 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 970) no Hoare annotation was computed. [2018-11-14 17:35:01,125 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 992) no Hoare annotation was computed. [2018-11-14 17:35:01,125 INFO L425 ceAbstractionStarter]: For program point L29(lines 29 53) no Hoare annotation was computed. [2018-11-14 17:35:01,125 INFO L425 ceAbstractionStarter]: For program point L508(lines 508 972) no Hoare annotation was computed. [2018-11-14 17:35:01,125 INFO L425 ceAbstractionStarter]: For program point L888(lines 888 900) no Hoare annotation was computed. [2018-11-14 17:35:01,125 INFO L421 ceAbstractionStarter]: At program point L277(lines 127 279) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2018-11-14 17:35:01,125 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 186) no Hoare annotation was computed. [2018-11-14 17:35:01,126 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-14 17:35:01,126 INFO L425 ceAbstractionStarter]: For program point L327(lines 327 351) no Hoare annotation was computed. [2018-11-14 17:35:01,126 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2018-11-14 17:35:01,126 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 12 1001) the Hoare annotation is: true [2018-11-14 17:35:01,126 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 224) no Hoare annotation was computed. [2018-11-14 17:35:01,126 INFO L425 ceAbstractionStarter]: For program point L592(lines 592 964) no Hoare annotation was computed. [2018-11-14 17:35:01,126 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 986) no Hoare annotation was computed. [2018-11-14 17:35:01,126 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 270) no Hoare annotation was computed. [2018-11-14 17:35:01,126 INFO L425 ceAbstractionStarter]: For program point L576(lines 576 966) no Hoare annotation was computed. [2018-11-14 17:35:01,126 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-14 17:35:01,127 INFO L425 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed. [2018-11-14 17:35:01,127 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 989) no Hoare annotation was computed. [2018-11-14 17:35:01,127 INFO L425 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-11-14 17:35:01,127 INFO L425 ceAbstractionStarter]: For program point L395(lines 395 419) no Hoare annotation was computed. [2018-11-14 17:35:01,127 INFO L425 ceAbstractionStarter]: For program point L131(lines 131 237) no Hoare annotation was computed. [2018-11-14 17:35:01,127 INFO L425 ceAbstractionStarter]: For program point L98(lines 98 120) no Hoare annotation was computed. [2018-11-14 17:35:01,127 INFO L425 ceAbstractionStarter]: For program point L610(lines 610 621) no Hoare annotation was computed. [2018-11-14 17:35:01,127 INFO L425 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2018-11-14 17:35:01,128 INFO L425 ceAbstractionStarter]: For program point L924(lines 924 936) no Hoare annotation was computed. [2018-11-14 17:35:01,128 INFO L425 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2018-11-14 17:35:01,128 INFO L425 ceAbstractionStarter]: For program point L660(lines 660 958) no Hoare annotation was computed. [2018-11-14 17:35:01,128 INFO L425 ceAbstractionStarter]: For program point L429(lines 429 980) no Hoare annotation was computed. [2018-11-14 17:35:01,128 INFO L425 ceAbstractionStarter]: For program point L264(line 264) no Hoare annotation was computed. [2018-11-14 17:35:01,128 INFO L425 ceAbstractionStarter]: For program point L644(lines 644 960) no Hoare annotation was computed. [2018-11-14 17:35:01,128 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2018-11-14 17:35:01,128 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 983) no Hoare annotation was computed. [2018-11-14 17:35:01,128 INFO L425 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 890) no Hoare annotation was computed. [2018-11-14 17:35:01,129 INFO L425 ceAbstractionStarter]: For program point L17(lines 17 1000) no Hoare annotation was computed. [2018-11-14 17:35:01,129 INFO L425 ceAbstractionStarter]: For program point L463(lines 463 487) no Hoare annotation was computed. [2018-11-14 17:35:01,129 INFO L425 ceAbstractionStarter]: For program point L876(lines 876 902) no Hoare annotation was computed. [2018-11-14 17:35:01,129 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2018-11-14 17:35:01,129 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed. [2018-11-14 17:35:01,129 INFO L425 ceAbstractionStarter]: For program point L166(lines 166 188) no Hoare annotation was computed. [2018-11-14 17:35:01,129 INFO L425 ceAbstractionStarter]: For program point L678(lines 678 689) no Hoare annotation was computed. [2018-11-14 17:35:01,129 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-14 17:35:01,130 INFO L425 ceAbstractionStarter]: For program point L67(lines 67 283) no Hoare annotation was computed. [2018-11-14 17:35:01,130 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2018-11-14 17:35:01,130 INFO L425 ceAbstractionStarter]: For program point L926(line 926) no Hoare annotation was computed. [2018-11-14 17:35:01,130 INFO L425 ceAbstractionStarter]: For program point L728(lines 728 952) no Hoare annotation was computed. [2018-11-14 17:35:01,130 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 229) no Hoare annotation was computed. [2018-11-14 17:35:01,130 INFO L425 ceAbstractionStarter]: For program point L497(lines 497 974) no Hoare annotation was computed. [2018-11-14 17:35:01,130 INFO L425 ceAbstractionStarter]: For program point L200(lines 200 226) no Hoare annotation was computed. [2018-11-14 17:35:01,130 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 954) no Hoare annotation was computed. [2018-11-14 17:35:01,132 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 17:35:01,132 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-14 17:35:01,133 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 17:35:01,133 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:35:01,133 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-14 17:35:01,133 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-14 17:35:01,133 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:35:01,133 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:35:01,133 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-14 17:35:01,133 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-14 17:35:01,134 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:35:01,134 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-14 17:35:01,134 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2018-11-14 17:35:01,134 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2018-11-14 17:35:01,134 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:35:01,134 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-14 17:35:01,134 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-14 17:35:01,134 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2018-11-14 17:35:01,134 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2018-11-14 17:35:01,134 WARN L170 areAnnotationChecker]: L293 has no Hoare annotation [2018-11-14 17:35:01,135 WARN L170 areAnnotationChecker]: L293 has no Hoare annotation [2018-11-14 17:35:01,135 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 17:35:01,135 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2018-11-14 17:35:01,135 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2018-11-14 17:35:01,135 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-14 17:35:01,135 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-14 17:35:01,135 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2018-11-14 17:35:01,135 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2018-11-14 17:35:01,135 WARN L170 areAnnotationChecker]: L304 has no Hoare annotation [2018-11-14 17:35:01,136 WARN L170 areAnnotationChecker]: L304 has no Hoare annotation [2018-11-14 17:35:01,136 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2018-11-14 17:35:01,136 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2018-11-14 17:35:01,136 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2018-11-14 17:35:01,136 WARN L170 areAnnotationChecker]: L312 has no Hoare annotation [2018-11-14 17:35:01,136 WARN L170 areAnnotationChecker]: L312 has no Hoare annotation [2018-11-14 17:35:01,136 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2018-11-14 17:35:01,136 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2018-11-14 17:35:01,136 WARN L170 areAnnotationChecker]: L320 has no Hoare annotation [2018-11-14 17:35:01,137 WARN L170 areAnnotationChecker]: L320 has no Hoare annotation [2018-11-14 17:35:01,137 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2018-11-14 17:35:01,137 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2018-11-14 17:35:01,137 WARN L170 areAnnotationChecker]: L127 has no Hoare annotation [2018-11-14 17:35:01,137 WARN L170 areAnnotationChecker]: L127 has no Hoare annotation [2018-11-14 17:35:01,137 WARN L170 areAnnotationChecker]: L327 has no Hoare annotation [2018-11-14 17:35:01,137 WARN L170 areAnnotationChecker]: L327 has no Hoare annotation [2018-11-14 17:35:01,137 WARN L170 areAnnotationChecker]: L361 has no Hoare annotation [2018-11-14 17:35:01,137 WARN L170 areAnnotationChecker]: L361 has no Hoare annotation [2018-11-14 17:35:01,138 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2018-11-14 17:35:01,138 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2018-11-14 17:35:01,138 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2018-11-14 17:35:01,138 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2018-11-14 17:35:01,138 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2018-11-14 17:35:01,138 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2018-11-14 17:35:01,138 WARN L170 areAnnotationChecker]: L243 has no Hoare annotation [2018-11-14 17:35:01,138 WARN L170 areAnnotationChecker]: L243 has no Hoare annotation [2018-11-14 17:35:01,138 WARN L170 areAnnotationChecker]: L338 has no Hoare annotation [2018-11-14 17:35:01,139 WARN L170 areAnnotationChecker]: L338 has no Hoare annotation [2018-11-14 17:35:01,139 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2018-11-14 17:35:01,139 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2018-11-14 17:35:01,139 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2018-11-14 17:35:01,139 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2018-11-14 17:35:01,139 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2018-11-14 17:35:01,139 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2018-11-14 17:35:01,139 WARN L170 areAnnotationChecker]: L200 has no Hoare annotation [2018-11-14 17:35:01,139 WARN L170 areAnnotationChecker]: L250 has no Hoare annotation [2018-11-14 17:35:01,140 WARN L170 areAnnotationChecker]: L250 has no Hoare annotation [2018-11-14 17:35:01,140 WARN L170 areAnnotationChecker]: L380 has no Hoare annotation [2018-11-14 17:35:01,140 WARN L170 areAnnotationChecker]: L380 has no Hoare annotation [2018-11-14 17:35:01,140 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2018-11-14 17:35:01,140 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2018-11-14 17:35:01,140 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2018-11-14 17:35:01,140 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2018-11-14 17:35:01,140 WARN L170 areAnnotationChecker]: L200 has no Hoare annotation [2018-11-14 17:35:01,140 WARN L170 areAnnotationChecker]: L200 has no Hoare annotation [2018-11-14 17:35:01,141 WARN L170 areAnnotationChecker]: L252 has no Hoare annotation [2018-11-14 17:35:01,141 WARN L170 areAnnotationChecker]: L252 has no Hoare annotation [2018-11-14 17:35:01,141 WARN L170 areAnnotationChecker]: L262 has no Hoare annotation [2018-11-14 17:35:01,141 WARN L170 areAnnotationChecker]: L262 has no Hoare annotation [2018-11-14 17:35:01,141 WARN L170 areAnnotationChecker]: L388 has no Hoare annotation [2018-11-14 17:35:01,141 WARN L170 areAnnotationChecker]: L388 has no Hoare annotation [2018-11-14 17:35:01,141 WARN L170 areAnnotationChecker]: L152 has no Hoare annotation [2018-11-14 17:35:01,141 WARN L170 areAnnotationChecker]: L152 has no Hoare annotation [2018-11-14 17:35:01,141 WARN L170 areAnnotationChecker]: L159 has no Hoare annotation [2018-11-14 17:35:01,142 WARN L170 areAnnotationChecker]: L159 has no Hoare annotation [2018-11-14 17:35:01,142 WARN L170 areAnnotationChecker]: L202 has no Hoare annotation [2018-11-14 17:35:01,142 WARN L170 areAnnotationChecker]: L202 has no Hoare annotation [2018-11-14 17:35:01,142 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2018-11-14 17:35:01,142 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2018-11-14 17:35:01,142 WARN L170 areAnnotationChecker]: L264 has no Hoare annotation [2018-11-14 17:35:01,142 WARN L170 areAnnotationChecker]: L264 has no Hoare annotation [2018-11-14 17:35:01,142 WARN L170 areAnnotationChecker]: L395 has no Hoare annotation [2018-11-14 17:35:01,142 WARN L170 areAnnotationChecker]: L395 has no Hoare annotation [2018-11-14 17:35:01,142 WARN L170 areAnnotationChecker]: L429 has no Hoare annotation [2018-11-14 17:35:01,143 WARN L170 areAnnotationChecker]: L429 has no Hoare annotation [2018-11-14 17:35:01,143 WARN L170 areAnnotationChecker]: L166 has no Hoare annotation [2018-11-14 17:35:01,143 WARN L170 areAnnotationChecker]: L166 has no Hoare annotation [2018-11-14 17:35:01,143 WARN L170 areAnnotationChecker]: L214 has no Hoare annotation [2018-11-14 17:35:01,143 WARN L170 areAnnotationChecker]: L214 has no Hoare annotation [2018-11-14 17:35:01,143 WARN L170 areAnnotationChecker]: L406 has no Hoare annotation [2018-11-14 17:35:01,143 WARN L170 areAnnotationChecker]: L406 has no Hoare annotation [2018-11-14 17:35:01,143 WARN L170 areAnnotationChecker]: L440 has no Hoare annotation [2018-11-14 17:35:01,143 WARN L170 areAnnotationChecker]: L440 has no Hoare annotation [2018-11-14 17:35:01,143 WARN L170 areAnnotationChecker]: L168 has no Hoare annotation [2018-11-14 17:35:01,144 WARN L170 areAnnotationChecker]: L168 has no Hoare annotation [2018-11-14 17:35:01,144 WARN L170 areAnnotationChecker]: L178 has no Hoare annotation [2018-11-14 17:35:01,144 WARN L170 areAnnotationChecker]: L178 has no Hoare annotation [2018-11-14 17:35:01,144 WARN L170 areAnnotationChecker]: L448 has no Hoare annotation [2018-11-14 17:35:01,144 WARN L170 areAnnotationChecker]: L448 has no Hoare annotation [2018-11-14 17:35:01,144 WARN L170 areAnnotationChecker]: L180 has no Hoare annotation [2018-11-14 17:35:01,144 WARN L170 areAnnotationChecker]: L180 has no Hoare annotation [2018-11-14 17:35:01,144 WARN L170 areAnnotationChecker]: L456 has no Hoare annotation [2018-11-14 17:35:01,144 WARN L170 areAnnotationChecker]: L456 has no Hoare annotation [2018-11-14 17:35:01,144 WARN L170 areAnnotationChecker]: L463 has no Hoare annotation [2018-11-14 17:35:01,145 WARN L170 areAnnotationChecker]: L463 has no Hoare annotation [2018-11-14 17:35:01,145 WARN L170 areAnnotationChecker]: L497 has no Hoare annotation [2018-11-14 17:35:01,145 WARN L170 areAnnotationChecker]: L497 has no Hoare annotation [2018-11-14 17:35:01,145 WARN L170 areAnnotationChecker]: L474 has no Hoare annotation [2018-11-14 17:35:01,145 WARN L170 areAnnotationChecker]: L474 has no Hoare annotation [2018-11-14 17:35:01,145 WARN L170 areAnnotationChecker]: L508 has no Hoare annotation [2018-11-14 17:35:01,145 WARN L170 areAnnotationChecker]: L508 has no Hoare annotation [2018-11-14 17:35:01,145 WARN L170 areAnnotationChecker]: L516 has no Hoare annotation [2018-11-14 17:35:01,145 WARN L170 areAnnotationChecker]: L516 has no Hoare annotation [2018-11-14 17:35:01,146 WARN L170 areAnnotationChecker]: L524 has no Hoare annotation [2018-11-14 17:35:01,146 WARN L170 areAnnotationChecker]: L524 has no Hoare annotation [2018-11-14 17:35:01,146 WARN L170 areAnnotationChecker]: L531 has no Hoare annotation [2018-11-14 17:35:01,146 WARN L170 areAnnotationChecker]: L531 has no Hoare annotation [2018-11-14 17:35:01,146 WARN L170 areAnnotationChecker]: L565 has no Hoare annotation [2018-11-14 17:35:01,146 WARN L170 areAnnotationChecker]: L565 has no Hoare annotation [2018-11-14 17:35:01,146 WARN L170 areAnnotationChecker]: L542 has no Hoare annotation [2018-11-14 17:35:01,146 WARN L170 areAnnotationChecker]: L542 has no Hoare annotation [2018-11-14 17:35:01,146 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2018-11-14 17:35:01,146 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2018-11-14 17:35:01,147 WARN L170 areAnnotationChecker]: L584 has no Hoare annotation [2018-11-14 17:35:01,147 WARN L170 areAnnotationChecker]: L584 has no Hoare annotation [2018-11-14 17:35:01,147 WARN L170 areAnnotationChecker]: L592 has no Hoare annotation [2018-11-14 17:35:01,147 WARN L170 areAnnotationChecker]: L592 has no Hoare annotation [2018-11-14 17:35:01,147 WARN L170 areAnnotationChecker]: L599 has no Hoare annotation [2018-11-14 17:35:01,147 WARN L170 areAnnotationChecker]: L599 has no Hoare annotation [2018-11-14 17:35:01,147 WARN L170 areAnnotationChecker]: L633 has no Hoare annotation [2018-11-14 17:35:01,147 WARN L170 areAnnotationChecker]: L633 has no Hoare annotation [2018-11-14 17:35:01,147 WARN L170 areAnnotationChecker]: L610 has no Hoare annotation [2018-11-14 17:35:01,148 WARN L170 areAnnotationChecker]: L610 has no Hoare annotation [2018-11-14 17:35:01,148 WARN L170 areAnnotationChecker]: L644 has no Hoare annotation [2018-11-14 17:35:01,148 WARN L170 areAnnotationChecker]: L644 has no Hoare annotation [2018-11-14 17:35:01,148 WARN L170 areAnnotationChecker]: L652 has no Hoare annotation [2018-11-14 17:35:01,148 WARN L170 areAnnotationChecker]: L652 has no Hoare annotation [2018-11-14 17:35:01,148 WARN L170 areAnnotationChecker]: L660 has no Hoare annotation [2018-11-14 17:35:01,148 WARN L170 areAnnotationChecker]: L660 has no Hoare annotation [2018-11-14 17:35:01,148 WARN L170 areAnnotationChecker]: L667 has no Hoare annotation [2018-11-14 17:35:01,148 WARN L170 areAnnotationChecker]: L667 has no Hoare annotation [2018-11-14 17:35:01,148 WARN L170 areAnnotationChecker]: L701 has no Hoare annotation [2018-11-14 17:35:01,149 WARN L170 areAnnotationChecker]: L701 has no Hoare annotation [2018-11-14 17:35:01,149 WARN L170 areAnnotationChecker]: L678 has no Hoare annotation [2018-11-14 17:35:01,149 WARN L170 areAnnotationChecker]: L678 has no Hoare annotation [2018-11-14 17:35:01,149 WARN L170 areAnnotationChecker]: L712 has no Hoare annotation [2018-11-14 17:35:01,149 WARN L170 areAnnotationChecker]: L712 has no Hoare annotation [2018-11-14 17:35:01,149 WARN L170 areAnnotationChecker]: L720 has no Hoare annotation [2018-11-14 17:35:01,149 WARN L170 areAnnotationChecker]: L720 has no Hoare annotation [2018-11-14 17:35:01,149 WARN L170 areAnnotationChecker]: L728 has no Hoare annotation [2018-11-14 17:35:01,149 WARN L170 areAnnotationChecker]: L728 has no Hoare annotation [2018-11-14 17:35:01,149 WARN L170 areAnnotationChecker]: L735 has no Hoare annotation [2018-11-14 17:35:01,149 WARN L170 areAnnotationChecker]: L735 has no Hoare annotation [2018-11-14 17:35:01,150 WARN L170 areAnnotationChecker]: L769 has no Hoare annotation [2018-11-14 17:35:01,150 WARN L170 areAnnotationChecker]: L769 has no Hoare annotation [2018-11-14 17:35:01,150 WARN L170 areAnnotationChecker]: L746 has no Hoare annotation [2018-11-14 17:35:01,150 WARN L170 areAnnotationChecker]: L746 has no Hoare annotation [2018-11-14 17:35:01,150 WARN L170 areAnnotationChecker]: L780 has no Hoare annotation [2018-11-14 17:35:01,150 WARN L170 areAnnotationChecker]: L780 has no Hoare annotation [2018-11-14 17:35:01,150 WARN L170 areAnnotationChecker]: L788 has no Hoare annotation [2018-11-14 17:35:01,150 WARN L170 areAnnotationChecker]: L788 has no Hoare annotation [2018-11-14 17:35:01,150 WARN L170 areAnnotationChecker]: L796 has no Hoare annotation [2018-11-14 17:35:01,150 WARN L170 areAnnotationChecker]: L796 has no Hoare annotation [2018-11-14 17:35:01,150 WARN L170 areAnnotationChecker]: L803 has no Hoare annotation [2018-11-14 17:35:01,151 WARN L170 areAnnotationChecker]: L803 has no Hoare annotation [2018-11-14 17:35:01,151 WARN L170 areAnnotationChecker]: L837 has no Hoare annotation [2018-11-14 17:35:01,151 WARN L170 areAnnotationChecker]: L837 has no Hoare annotation [2018-11-14 17:35:01,151 WARN L170 areAnnotationChecker]: L814 has no Hoare annotation [2018-11-14 17:35:01,151 WARN L170 areAnnotationChecker]: L814 has no Hoare annotation [2018-11-14 17:35:01,151 WARN L170 areAnnotationChecker]: L848 has no Hoare annotation [2018-11-14 17:35:01,151 WARN L170 areAnnotationChecker]: L848 has no Hoare annotation [2018-11-14 17:35:01,151 WARN L170 areAnnotationChecker]: L861 has no Hoare annotation [2018-11-14 17:35:01,151 WARN L170 areAnnotationChecker]: L861 has no Hoare annotation [2018-11-14 17:35:01,151 WARN L170 areAnnotationChecker]: L861 has no Hoare annotation [2018-11-14 17:35:01,152 WARN L170 areAnnotationChecker]: L869 has no Hoare annotation [2018-11-14 17:35:01,152 WARN L170 areAnnotationChecker]: L869 has no Hoare annotation [2018-11-14 17:35:01,152 WARN L170 areAnnotationChecker]: L876 has no Hoare annotation [2018-11-14 17:35:01,152 WARN L170 areAnnotationChecker]: L876 has no Hoare annotation [2018-11-14 17:35:01,152 WARN L170 areAnnotationChecker]: L912 has no Hoare annotation [2018-11-14 17:35:01,152 WARN L170 areAnnotationChecker]: L912 has no Hoare annotation [2018-11-14 17:35:01,152 WARN L170 areAnnotationChecker]: L878 has no Hoare annotation [2018-11-14 17:35:01,152 WARN L170 areAnnotationChecker]: L878 has no Hoare annotation [2018-11-14 17:35:01,152 WARN L170 areAnnotationChecker]: L888 has no Hoare annotation [2018-11-14 17:35:01,152 WARN L170 areAnnotationChecker]: L888 has no Hoare annotation [2018-11-14 17:35:01,152 WARN L170 areAnnotationChecker]: L914 has no Hoare annotation [2018-11-14 17:35:01,153 WARN L170 areAnnotationChecker]: L914 has no Hoare annotation [2018-11-14 17:35:01,153 WARN L170 areAnnotationChecker]: L924 has no Hoare annotation [2018-11-14 17:35:01,153 WARN L170 areAnnotationChecker]: L924 has no Hoare annotation [2018-11-14 17:35:01,153 WARN L170 areAnnotationChecker]: L890 has no Hoare annotation [2018-11-14 17:35:01,153 WARN L170 areAnnotationChecker]: L890 has no Hoare annotation [2018-11-14 17:35:01,153 WARN L170 areAnnotationChecker]: L926 has no Hoare annotation [2018-11-14 17:35:01,153 WARN L170 areAnnotationChecker]: L926 has no Hoare annotation [2018-11-14 17:35:01,153 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 17:35:01,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:35:01 BoogieIcfgContainer [2018-11-14 17:35:01,166 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 17:35:01,167 INFO L168 Benchmark]: Toolchain (without parser) took 33824.12 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -548.3 MB). Peak memory consumption was 530.1 MB. Max. memory is 7.1 GB. [2018-11-14 17:35:01,169 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:35:01,169 INFO L168 Benchmark]: CACSL2BoogieTranslator took 649.86 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-11-14 17:35:01,170 INFO L168 Benchmark]: Boogie Preprocessor took 168.79 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -807.2 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. [2018-11-14 17:35:01,171 INFO L168 Benchmark]: RCFGBuilder took 2050.20 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 108.3 MB). Peak memory consumption was 108.3 MB. Max. memory is 7.1 GB. [2018-11-14 17:35:01,171 INFO L168 Benchmark]: TraceAbstraction took 30950.58 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 354.4 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 129.4 MB). Peak memory consumption was 483.8 MB. Max. memory is 7.1 GB. [2018-11-14 17:35:01,175 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 649.86 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 168.79 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -807.2 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2050.20 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 108.3 MB). Peak memory consumption was 108.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30950.58 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 354.4 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 129.4 MB). Peak memory consumption was 483.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 180]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 31]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 202]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 914]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 214]: 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: 926]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 100]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 878]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 168]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 890]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 264]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 112]: 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 - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 853]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && __VERIFIER_assert__cond == 1) && 1 <= main__t - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && 1 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 125 locations, 16 error locations. SAFE Result, 30.8s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 23.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 530 SDtfs, 3252 SDslu, 1116 SDs, 0 SdLazy, 3793 SolverSat, 738 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred 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: 0.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 284 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 13 NumberOfFragments, 40 HoareAnnotationTreeSize, 9 FomulaSimplifications, 60910 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 9 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 396 NumberOfCodeBlocks, 396 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 21650 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...