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-Const.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 19:21:51,112 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:21:51,115 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:21:51,131 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:21:51,132 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:21:51,134 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:21:51,135 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:21:51,137 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:21:51,139 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:21:51,142 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:21:51,142 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:21:51,144 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:21:51,145 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:21:51,147 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:21:51,148 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:21:51,148 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:21:51,152 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:21:51,153 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:21:51,155 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:21:51,163 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:21:51,167 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:21:51,171 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:21:51,175 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:21:51,175 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:21:51,175 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:21:51,178 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:21:51,179 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:21:51,179 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:21:51,180 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:21:51,184 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:21:51,184 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:21:51,184 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:21:51,185 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:21:51,185 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:21:51,187 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:21:51,188 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:21:51,188 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:21:51,213 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:21:51,213 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:21:51,214 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:21:51,214 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:21:51,214 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:21:51,215 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:21:51,215 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:21:51,215 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:21:51,215 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:21:51,215 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:21:51,216 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:21:51,216 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:21:51,216 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:21:51,216 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:21:51,216 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:21:51,217 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:21:51,217 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:21:51,217 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:21:51,217 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:21:51,217 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:21:51,218 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:21:51,218 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:21:51,218 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:21:51,218 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:21:51,218 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:21:51,219 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:21:51,219 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:21:51,219 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:21:51,219 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:21:51,219 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:21:51,219 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:21:51,282 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:21:51,301 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:21:51,305 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:21:51,306 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:21:51,306 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:21:51,307 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 19:21:51,365 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a4d82c3/520ed123917844e397b7f22171a86ea9/FLAG7d589ac67 [2018-11-14 19:21:51,821 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:21:51,822 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 19:21:51,840 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a4d82c3/520ed123917844e397b7f22171a86ea9/FLAG7d589ac67 [2018-11-14 19:21:51,856 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a4d82c3/520ed123917844e397b7f22171a86ea9 [2018-11-14 19:21:51,864 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:21:51,866 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:21:51,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:21:51,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:21:51,871 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:21:51,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:21:51" (1/1) ... [2018-11-14 19:21:51,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d9327bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:21:51, skipping insertion in model container [2018-11-14 19:21:51,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:21:51" (1/1) ... [2018-11-14 19:21:51,883 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:21:51,935 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:21:52,303 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:21:52,312 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:21:52,414 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:21:52,430 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:21:52,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:21:52 WrapperNode [2018-11-14 19:21:52,430 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:21:52,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:21:52,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:21:52,432 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:21:52,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:21:52" (1/1) ... [2018-11-14 19:21:52,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:21:52" (1/1) ... [2018-11-14 19:21:52,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:21:52" (1/1) ... [2018-11-14 19:21:52,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:21:52" (1/1) ... [2018-11-14 19:21:52,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:21:52" (1/1) ... [2018-11-14 19:21:52,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:21:52" (1/1) ... [2018-11-14 19:21:52,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:21:52" (1/1) ... [2018-11-14 19:21:52,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:21:52,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:21:52,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:21:52,592 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:21:52,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:21:52" (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 19:21:52,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:21:52,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:21:52,649 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:21:52,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:21:52,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 19:21:52,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 19:21:52,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 19:21:52,650 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:21:52,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:21:52,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:21:54,593 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:21:54,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:21:54 BoogieIcfgContainer [2018-11-14 19:21:54,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:21:54,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:21:54,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:21:54,600 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:21:54,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:21:51" (1/3) ... [2018-11-14 19:21:54,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555b2234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:21:54, skipping insertion in model container [2018-11-14 19:21:54,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:21:52" (2/3) ... [2018-11-14 19:21:54,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555b2234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:21:54, skipping insertion in model container [2018-11-14 19:21:54,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:21:54" (3/3) ... [2018-11-14 19:21:54,604 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.p+lhb-reducer.c [2018-11-14 19:21:54,614 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:21:54,624 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2018-11-14 19:21:54,642 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2018-11-14 19:21:54,674 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:21:54,674 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:21:54,675 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:21:54,675 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:21:54,675 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:21:54,675 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:21:54,675 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:21:54,676 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:21:54,676 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:21:54,698 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2018-11-14 19:21:54,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 19:21:54,705 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:21:54,706 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:21:54,709 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:21:54,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:21:54,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1915845654, now seen corresponding path program 1 times [2018-11-14 19:21:54,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:21:54,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:21:54,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:54,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:21:54,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:55,046 INFO L256 TraceCheckUtils]: 0: Hoare triple {128#true} call ULTIMATE.init(); {128#true} is VALID [2018-11-14 19:21:55,050 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 19:21:55,051 INFO L273 TraceCheckUtils]: 2: Hoare triple {128#true} assume true; {128#true} is VALID [2018-11-14 19:21:55,052 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {128#true} {128#true} #388#return; {128#true} is VALID [2018-11-14 19:21:55,052 INFO L256 TraceCheckUtils]: 4: Hoare triple {128#true} call #t~ret15 := main(); {128#true} is VALID [2018-11-14 19:21:55,053 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 19:21:55,054 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 19:21:55,057 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 19:21:55,059 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 19:21:55,061 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 19:21:55,062 INFO L273 TraceCheckUtils]: 10: Hoare triple {129#false} assume !false; {129#false} is VALID [2018-11-14 19:21:55,065 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 19:21:55,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:21:55,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 19:21:55,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-14 19:21:55,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:55,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 19:21:55,123 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 19:21:55,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 19:21:55,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 19:21:55,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 19:21:55,135 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 4 states. [2018-11-14 19:21:56,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:56,609 INFO L93 Difference]: Finished difference Result 135 states and 211 transitions. [2018-11-14 19:21:56,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 19:21:56,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-14 19:21:56,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:21:56,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:21:56,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2018-11-14 19:21:56,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:21:56,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2018-11-14 19:21:56,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 211 transitions. [2018-11-14 19:21:56,992 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 19:21:57,012 INFO L225 Difference]: With dead ends: 135 [2018-11-14 19:21:57,013 INFO L226 Difference]: Without dead ends: 118 [2018-11-14 19:21:57,016 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:21:57,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-14 19:21:57,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-11-14 19:21:57,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:21:57,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 118 states. [2018-11-14 19:21:57,078 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 118 states. [2018-11-14 19:21:57,078 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 118 states. [2018-11-14 19:21:57,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:57,089 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2018-11-14 19:21:57,090 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2018-11-14 19:21:57,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:57,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:57,092 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 118 states. [2018-11-14 19:21:57,092 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 118 states. [2018-11-14 19:21:57,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:57,103 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2018-11-14 19:21:57,103 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2018-11-14 19:21:57,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:57,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:57,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:21:57,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:21:57,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-14 19:21:57,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2018-11-14 19:21:57,116 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 11 [2018-11-14 19:21:57,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:21:57,117 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2018-11-14 19:21:57,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 19:21:57,117 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2018-11-14 19:21:57,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 19:21:57,118 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:21:57,118 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:21:57,119 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:21:57,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:21:57,120 INFO L82 PathProgramCache]: Analyzing trace with hash 738329931, now seen corresponding path program 1 times [2018-11-14 19:21:57,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:21:57,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:21:57,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:57,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:21:57,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:57,282 INFO L256 TraceCheckUtils]: 0: Hoare triple {644#true} call ULTIMATE.init(); {644#true} is VALID [2018-11-14 19:21:57,283 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 19:21:57,283 INFO L273 TraceCheckUtils]: 2: Hoare triple {644#true} assume true; {644#true} is VALID [2018-11-14 19:21:57,283 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {644#true} {644#true} #388#return; {644#true} is VALID [2018-11-14 19:21:57,283 INFO L256 TraceCheckUtils]: 4: Hoare triple {644#true} call #t~ret15 := main(); {644#true} is VALID [2018-11-14 19:21:57,284 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 19:21:57,286 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 19:21:57,287 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 19:21:57,289 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 19:21:57,290 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 19:21:57,291 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 19:21:57,292 INFO L273 TraceCheckUtils]: 11: Hoare triple {645#false} assume !false; {645#false} is VALID [2018-11-14 19:21:57,293 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 19:21:57,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:21:57,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:21:57,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-14 19:21:57,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:57,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:21:57,371 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 19:21:57,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:21:57,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:21:57,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:21:57,372 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand 6 states. [2018-11-14 19:21:58,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:58,947 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2018-11-14 19:21:58,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 19:21:58,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-14 19:21:58,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:21:58,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:21:58,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2018-11-14 19:21:58,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:21:58,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2018-11-14 19:21:58,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 139 transitions. [2018-11-14 19:21:59,209 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 19:21:59,214 INFO L225 Difference]: With dead ends: 118 [2018-11-14 19:21:59,214 INFO L226 Difference]: Without dead ends: 113 [2018-11-14 19:21:59,215 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 19:21:59,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-14 19:21:59,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-11-14 19:21:59,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:21:59,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 113 states. [2018-11-14 19:21:59,241 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 113 states. [2018-11-14 19:21:59,241 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 113 states. [2018-11-14 19:21:59,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:59,247 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2018-11-14 19:21:59,247 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2018-11-14 19:21:59,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:59,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:59,249 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 113 states. [2018-11-14 19:21:59,249 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 113 states. [2018-11-14 19:21:59,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:59,255 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2018-11-14 19:21:59,255 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2018-11-14 19:21:59,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:59,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:59,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:21:59,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:21:59,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-14 19:21:59,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2018-11-14 19:21:59,262 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 12 [2018-11-14 19:21:59,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:21:59,263 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2018-11-14 19:21:59,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:21:59,263 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2018-11-14 19:21:59,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 19:21:59,264 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:21:59,265 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:21:59,265 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:21:59,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:21:59,266 INFO L82 PathProgramCache]: Analyzing trace with hash -108000398, now seen corresponding path program 1 times [2018-11-14 19:21:59,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:21:59,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:21:59,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:59,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:21:59,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:59,420 INFO L256 TraceCheckUtils]: 0: Hoare triple {1128#true} call ULTIMATE.init(); {1128#true} is VALID [2018-11-14 19:21:59,420 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 19:21:59,421 INFO L273 TraceCheckUtils]: 2: Hoare triple {1128#true} assume true; {1128#true} is VALID [2018-11-14 19:21:59,421 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1128#true} #388#return; {1128#true} is VALID [2018-11-14 19:21:59,421 INFO L256 TraceCheckUtils]: 4: Hoare triple {1128#true} call #t~ret15 := main(); {1128#true} is VALID [2018-11-14 19:21:59,422 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 19:21:59,422 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 19:21:59,423 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 19:21:59,423 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 19:21:59,424 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 19:21:59,425 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 19:21:59,425 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 19:21:59,426 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 19:21:59,428 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 19:21:59,429 INFO L273 TraceCheckUtils]: 14: Hoare triple {1129#false} assume !false; {1129#false} is VALID [2018-11-14 19:21:59,430 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 19:21:59,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:21:59,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:21:59,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-14 19:21:59,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:59,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:21:59,457 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 19:21:59,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:21:59,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:21:59,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:21:59,459 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand 6 states. [2018-11-14 19:22:00,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:00,772 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2018-11-14 19:22:00,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 19:22:00,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-14 19:22:00,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:00,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:00,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2018-11-14 19:22:00,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:00,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2018-11-14 19:22:00,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 163 transitions. [2018-11-14 19:22:00,979 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 19:22:00,983 INFO L225 Difference]: With dead ends: 148 [2018-11-14 19:22:00,983 INFO L226 Difference]: Without dead ends: 146 [2018-11-14 19:22:00,984 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 19:22:00,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-14 19:22:01,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 111. [2018-11-14 19:22:01,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:01,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 111 states. [2018-11-14 19:22:01,030 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 111 states. [2018-11-14 19:22:01,030 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 111 states. [2018-11-14 19:22:01,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:01,035 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2018-11-14 19:22:01,036 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 160 transitions. [2018-11-14 19:22:01,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:01,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:01,056 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 146 states. [2018-11-14 19:22:01,056 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 146 states. [2018-11-14 19:22:01,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:01,065 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2018-11-14 19:22:01,065 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 160 transitions. [2018-11-14 19:22:01,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:01,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:01,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:01,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:01,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-14 19:22:01,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2018-11-14 19:22:01,070 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 15 [2018-11-14 19:22:01,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:01,071 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2018-11-14 19:22:01,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:22:01,071 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2018-11-14 19:22:01,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 19:22:01,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:01,072 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:22:01,072 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:01,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:01,074 INFO L82 PathProgramCache]: Analyzing trace with hash 946958050, now seen corresponding path program 1 times [2018-11-14 19:22:01,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:01,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:01,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:01,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:01,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:01,223 INFO L256 TraceCheckUtils]: 0: Hoare triple {1709#true} call ULTIMATE.init(); {1709#true} is VALID [2018-11-14 19:22:01,224 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 19:22:01,224 INFO L273 TraceCheckUtils]: 2: Hoare triple {1709#true} assume true; {1709#true} is VALID [2018-11-14 19:22:01,224 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1709#true} {1709#true} #388#return; {1709#true} is VALID [2018-11-14 19:22:01,225 INFO L256 TraceCheckUtils]: 4: Hoare triple {1709#true} call #t~ret15 := main(); {1709#true} is VALID [2018-11-14 19:22:01,225 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 19:22:01,226 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 19:22:01,228 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 19:22:01,228 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 19:22:01,229 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 19:22:01,229 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 19:22:01,229 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 19:22:01,230 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 19:22:01,234 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 19:22:01,235 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 19:22:01,235 INFO L273 TraceCheckUtils]: 15: Hoare triple {1710#false} assume !false; {1710#false} is VALID [2018-11-14 19:22:01,236 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 19:22:01,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:01,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:22:01,236 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 19:22:01,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:01,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:22:01,264 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 19:22:01,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:22:01,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:22:01,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:22:01,265 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 6 states. [2018-11-14 19:22:02,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:02,813 INFO L93 Difference]: Finished difference Result 144 states and 159 transitions. [2018-11-14 19:22:02,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 19:22:02,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 19:22:02,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:02,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:02,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2018-11-14 19:22:02,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:02,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2018-11-14 19:22:02,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 159 transitions. [2018-11-14 19:22:02,996 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 19:22:03,000 INFO L225 Difference]: With dead ends: 144 [2018-11-14 19:22:03,000 INFO L226 Difference]: Without dead ends: 138 [2018-11-14 19:22:03,001 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 19:22:03,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-14 19:22:03,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 107. [2018-11-14 19:22:03,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:03,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 107 states. [2018-11-14 19:22:03,027 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 107 states. [2018-11-14 19:22:03,027 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 107 states. [2018-11-14 19:22:03,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:03,032 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2018-11-14 19:22:03,032 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2018-11-14 19:22:03,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:03,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:03,033 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 138 states. [2018-11-14 19:22:03,033 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 138 states. [2018-11-14 19:22:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:03,038 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2018-11-14 19:22:03,039 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2018-11-14 19:22:03,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:03,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:03,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:03,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:03,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-14 19:22:03,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2018-11-14 19:22:03,043 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 16 [2018-11-14 19:22:03,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:03,044 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2018-11-14 19:22:03,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:22:03,044 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2018-11-14 19:22:03,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 19:22:03,044 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:03,045 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 19:22:03,046 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:03,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:03,046 INFO L82 PathProgramCache]: Analyzing trace with hash -695803485, now seen corresponding path program 1 times [2018-11-14 19:22:03,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:03,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:03,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:03,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:03,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:03,258 INFO L256 TraceCheckUtils]: 0: Hoare triple {2272#true} call ULTIMATE.init(); {2272#true} is VALID [2018-11-14 19:22:03,259 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 19:22:03,259 INFO L273 TraceCheckUtils]: 2: Hoare triple {2272#true} assume true; {2272#true} is VALID [2018-11-14 19:22:03,259 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2272#true} {2272#true} #388#return; {2272#true} is VALID [2018-11-14 19:22:03,259 INFO L256 TraceCheckUtils]: 4: Hoare triple {2272#true} call #t~ret15 := main(); {2272#true} is VALID [2018-11-14 19:22:03,260 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 19:22:03,260 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 19:22:03,263 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 19:22:03,265 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 19:22:03,269 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 19:22:03,271 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 19:22:03,271 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 19:22:03,272 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 19:22:03,281 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 19:22:03,282 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 19:22:03,282 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 19:22:03,282 INFO L273 TraceCheckUtils]: 16: Hoare triple {2273#false} assume !false; {2273#false} is VALID [2018-11-14 19:22:03,283 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 19:22:03,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:03,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:22:03,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-14 19:22:03,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:03,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:22:03,300 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 19:22:03,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:22:03,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:22:03,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:22:03,302 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 6 states. [2018-11-14 19:22:04,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:04,536 INFO L93 Difference]: Finished difference Result 172 states and 191 transitions. [2018-11-14 19:22:04,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 19:22:04,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-14 19:22:04,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:04,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2018-11-14 19:22:04,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:04,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2018-11-14 19:22:04,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 191 transitions. [2018-11-14 19:22:05,294 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 19:22:05,297 INFO L225 Difference]: With dead ends: 172 [2018-11-14 19:22:05,298 INFO L226 Difference]: Without dead ends: 170 [2018-11-14 19:22:05,298 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 19:22:05,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-14 19:22:05,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 105. [2018-11-14 19:22:05,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:05,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand 105 states. [2018-11-14 19:22:05,322 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 105 states. [2018-11-14 19:22:05,322 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 105 states. [2018-11-14 19:22:05,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:05,329 INFO L93 Difference]: Finished difference Result 170 states and 188 transitions. [2018-11-14 19:22:05,329 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 188 transitions. [2018-11-14 19:22:05,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:05,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:05,330 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 170 states. [2018-11-14 19:22:05,330 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 170 states. [2018-11-14 19:22:05,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:05,336 INFO L93 Difference]: Finished difference Result 170 states and 188 transitions. [2018-11-14 19:22:05,336 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 188 transitions. [2018-11-14 19:22:05,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:05,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:05,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:05,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:05,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-14 19:22:05,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-11-14 19:22:05,341 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 17 [2018-11-14 19:22:05,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:05,341 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-11-14 19:22:05,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:22:05,342 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-11-14 19:22:05,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 19:22:05,342 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:05,343 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 19:22:05,343 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:05,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:05,344 INFO L82 PathProgramCache]: Analyzing trace with hash -694264285, now seen corresponding path program 1 times [2018-11-14 19:22:05,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:05,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:05,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:05,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:05,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:05,489 INFO L256 TraceCheckUtils]: 0: Hoare triple {2923#true} call ULTIMATE.init(); {2923#true} is VALID [2018-11-14 19:22:05,490 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 19:22:05,490 INFO L273 TraceCheckUtils]: 2: Hoare triple {2923#true} assume true; {2923#true} is VALID [2018-11-14 19:22:05,490 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2923#true} {2923#true} #388#return; {2923#true} is VALID [2018-11-14 19:22:05,491 INFO L256 TraceCheckUtils]: 4: Hoare triple {2923#true} call #t~ret15 := main(); {2923#true} is VALID [2018-11-14 19:22:05,491 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 19:22:05,492 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 19:22:05,492 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 19:22:05,493 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 19:22:05,493 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 19:22:05,494 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 19:22:05,495 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 19:22:05,496 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 19:22:05,496 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 19:22:05,498 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 19:22:05,499 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 19:22:05,499 INFO L273 TraceCheckUtils]: 16: Hoare triple {2924#false} assume !false; {2924#false} is VALID [2018-11-14 19:22:05,500 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 19:22:05,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:05,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:22:05,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-14 19:22:05,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:05,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:22:05,526 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 19:22:05,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:22:05,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:22:05,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:22:05,527 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 6 states. [2018-11-14 19:22:06,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:06,367 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2018-11-14 19:22:06,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 19:22:06,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-14 19:22:06,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:06,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:06,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2018-11-14 19:22:06,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2018-11-14 19:22:06,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 147 transitions. [2018-11-14 19:22:06,843 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 19:22:06,847 INFO L225 Difference]: With dead ends: 132 [2018-11-14 19:22:06,847 INFO L226 Difference]: Without dead ends: 130 [2018-11-14 19:22:06,847 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 19:22:06,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-14 19:22:07,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 103. [2018-11-14 19:22:07,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:07,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand 103 states. [2018-11-14 19:22:07,074 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 103 states. [2018-11-14 19:22:07,075 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 103 states. [2018-11-14 19:22:07,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:07,079 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2018-11-14 19:22:07,079 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 144 transitions. [2018-11-14 19:22:07,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:07,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:07,080 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 130 states. [2018-11-14 19:22:07,080 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 130 states. [2018-11-14 19:22:07,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:07,084 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2018-11-14 19:22:07,085 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 144 transitions. [2018-11-14 19:22:07,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:07,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:07,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:07,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:07,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-14 19:22:07,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2018-11-14 19:22:07,089 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 17 [2018-11-14 19:22:07,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:07,089 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2018-11-14 19:22:07,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:22:07,090 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2018-11-14 19:22:07,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 19:22:07,090 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:07,090 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 19:22:07,091 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:07,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:07,091 INFO L82 PathProgramCache]: Analyzing trace with hash -95068443, now seen corresponding path program 1 times [2018-11-14 19:22:07,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:07,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:07,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:07,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:07,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:07,292 INFO L256 TraceCheckUtils]: 0: Hoare triple {3448#true} call ULTIMATE.init(); {3448#true} is VALID [2018-11-14 19:22:07,292 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 19:22:07,293 INFO L273 TraceCheckUtils]: 2: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-14 19:22:07,293 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3448#true} {3448#true} #388#return; {3448#true} is VALID [2018-11-14 19:22:07,293 INFO L256 TraceCheckUtils]: 4: Hoare triple {3448#true} call #t~ret15 := main(); {3448#true} is VALID [2018-11-14 19:22:07,293 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 19:22:07,294 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 19:22:07,294 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 19:22:07,295 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 19:22:07,296 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 19:22:07,297 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 19:22:07,297 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 19:22:07,300 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 19:22:07,300 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 19:22:07,301 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 19:22:07,301 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 19:22:07,302 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 19:22:07,302 INFO L273 TraceCheckUtils]: 17: Hoare triple {3449#false} assume !false; {3449#false} is VALID [2018-11-14 19:22:07,303 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 19:22:07,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:07,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-14 19:22:07,304 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-14 19:22:07,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:07,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 19:22:07,324 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 19:22:07,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 19:22:07,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 19:22:07,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:22:07,325 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 8 states. [2018-11-14 19:22:08,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:08,597 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2018-11-14 19:22:08,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:22:08,598 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-14 19:22:08,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:08,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:22:08,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2018-11-14 19:22:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:22:08,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2018-11-14 19:22:08,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 134 transitions. [2018-11-14 19:22:08,747 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 19:22:08,750 INFO L225 Difference]: With dead ends: 120 [2018-11-14 19:22:08,750 INFO L226 Difference]: Without dead ends: 118 [2018-11-14 19:22:08,751 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 19:22:08,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-14 19:22:08,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2018-11-14 19:22:08,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:08,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 101 states. [2018-11-14 19:22:08,772 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 101 states. [2018-11-14 19:22:08,772 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 101 states. [2018-11-14 19:22:08,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:08,776 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2018-11-14 19:22:08,776 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2018-11-14 19:22:08,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:08,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:08,777 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 118 states. [2018-11-14 19:22:08,777 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 118 states. [2018-11-14 19:22:08,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:08,780 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2018-11-14 19:22:08,780 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2018-11-14 19:22:08,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:08,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:08,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:08,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:08,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-14 19:22:08,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2018-11-14 19:22:08,784 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 18 [2018-11-14 19:22:08,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:08,785 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2018-11-14 19:22:08,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 19:22:08,785 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2018-11-14 19:22:08,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 19:22:08,786 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:08,786 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 19:22:08,786 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:08,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:08,787 INFO L82 PathProgramCache]: Analyzing trace with hash -93703023, now seen corresponding path program 1 times [2018-11-14 19:22:08,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:08,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:08,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:08,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:08,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:08,920 INFO L256 TraceCheckUtils]: 0: Hoare triple {3941#true} call ULTIMATE.init(); {3941#true} is VALID [2018-11-14 19:22:08,920 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 19:22:08,920 INFO L273 TraceCheckUtils]: 2: Hoare triple {3941#true} assume true; {3941#true} is VALID [2018-11-14 19:22:08,921 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3941#true} {3941#true} #388#return; {3941#true} is VALID [2018-11-14 19:22:08,921 INFO L256 TraceCheckUtils]: 4: Hoare triple {3941#true} call #t~ret15 := main(); {3941#true} is VALID [2018-11-14 19:22:08,921 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 19:22:08,922 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 19:22:08,927 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 19:22:08,930 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 19:22:08,930 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 19:22:08,932 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 19:22:08,932 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 19:22:08,934 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 19:22:08,934 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 19:22:08,937 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 19:22:08,960 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 19:22:08,974 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 19:22:08,974 INFO L273 TraceCheckUtils]: 17: Hoare triple {3942#false} assume !false; {3942#false} is VALID [2018-11-14 19:22:08,975 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 19:22:08,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:08,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:22:08,977 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-14 19:22:08,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:08,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:22:09,007 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 19:22:09,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:22:09,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:22:09,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:22:09,008 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 6 states. [2018-11-14 19:22:10,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:10,457 INFO L93 Difference]: Finished difference Result 162 states and 181 transitions. [2018-11-14 19:22:10,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 19:22:10,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-14 19:22:10,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:10,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:10,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 181 transitions. [2018-11-14 19:22:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:10,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 181 transitions. [2018-11-14 19:22:10,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 181 transitions. [2018-11-14 19:22:10,705 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 19:22:10,708 INFO L225 Difference]: With dead ends: 162 [2018-11-14 19:22:10,709 INFO L226 Difference]: Without dead ends: 160 [2018-11-14 19:22:10,709 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 19:22:10,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-14 19:22:10,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 99. [2018-11-14 19:22:10,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:10,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 99 states. [2018-11-14 19:22:10,726 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 99 states. [2018-11-14 19:22:10,726 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 99 states. [2018-11-14 19:22:10,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:10,734 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2018-11-14 19:22:10,734 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 178 transitions. [2018-11-14 19:22:10,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:10,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:10,735 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 160 states. [2018-11-14 19:22:10,735 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 160 states. [2018-11-14 19:22:10,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:10,740 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2018-11-14 19:22:10,740 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 178 transitions. [2018-11-14 19:22:10,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:10,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:10,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:10,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:10,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-14 19:22:10,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2018-11-14 19:22:10,745 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 18 [2018-11-14 19:22:10,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:10,745 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2018-11-14 19:22:10,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:22:10,745 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-11-14 19:22:10,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 19:22:10,746 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:10,746 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 19:22:10,747 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:10,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:10,747 INFO L82 PathProgramCache]: Analyzing trace with hash -47353193, now seen corresponding path program 1 times [2018-11-14 19:22:10,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:10,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:10,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:10,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:10,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:10,901 INFO L256 TraceCheckUtils]: 0: Hoare triple {4556#true} call ULTIMATE.init(); {4556#true} is VALID [2018-11-14 19:22:10,901 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 19:22:10,902 INFO L273 TraceCheckUtils]: 2: Hoare triple {4556#true} assume true; {4556#true} is VALID [2018-11-14 19:22:10,902 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4556#true} {4556#true} #388#return; {4556#true} is VALID [2018-11-14 19:22:10,902 INFO L256 TraceCheckUtils]: 4: Hoare triple {4556#true} call #t~ret15 := main(); {4556#true} is VALID [2018-11-14 19:22:10,903 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 19:22:10,906 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 19:22:10,907 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 19:22:10,907 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 19:22:10,908 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 19:22:10,909 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 19:22:10,909 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 19:22:10,910 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 19:22:10,910 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 19:22:10,911 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 19:22:10,912 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 19:22:10,912 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 19:22:10,913 INFO L273 TraceCheckUtils]: 17: Hoare triple {4557#false} assume !false; {4557#false} is VALID [2018-11-14 19:22:10,914 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 19:22:10,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:10,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-14 19:22:10,915 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-14 19:22:10,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:10,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 19:22:10,931 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 19:22:10,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 19:22:10,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 19:22:10,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:22:10,933 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 8 states. [2018-11-14 19:22:12,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:12,247 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2018-11-14 19:22:12,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 19:22:12,247 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-14 19:22:12,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:12,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:22:12,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2018-11-14 19:22:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:22:12,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2018-11-14 19:22:12,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 111 transitions. [2018-11-14 19:22:12,372 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 19:22:12,374 INFO L225 Difference]: With dead ends: 99 [2018-11-14 19:22:12,374 INFO L226 Difference]: Without dead ends: 95 [2018-11-14 19:22:12,375 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 19:22:12,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-14 19:22:12,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-11-14 19:22:12,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:12,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 95 states. [2018-11-14 19:22:12,393 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 95 states. [2018-11-14 19:22:12,393 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 95 states. [2018-11-14 19:22:12,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:12,397 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2018-11-14 19:22:12,397 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-11-14 19:22:12,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:12,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:12,398 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 95 states. [2018-11-14 19:22:12,398 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 95 states. [2018-11-14 19:22:12,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:12,400 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2018-11-14 19:22:12,400 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-11-14 19:22:12,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:12,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:12,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:12,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:12,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-14 19:22:12,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-11-14 19:22:12,403 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 18 [2018-11-14 19:22:12,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:12,404 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-11-14 19:22:12,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 19:22:12,404 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-11-14 19:22:12,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 19:22:12,404 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:12,405 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 19:22:12,405 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:12,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:12,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1390176726, now seen corresponding path program 1 times [2018-11-14 19:22:12,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:12,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:12,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:12,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:12,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:12,591 INFO L256 TraceCheckUtils]: 0: Hoare triple {4972#true} call ULTIMATE.init(); {4972#true} is VALID [2018-11-14 19:22:12,592 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 19:22:12,592 INFO L273 TraceCheckUtils]: 2: Hoare triple {4972#true} assume true; {4972#true} is VALID [2018-11-14 19:22:12,592 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4972#true} {4972#true} #388#return; {4972#true} is VALID [2018-11-14 19:22:12,593 INFO L256 TraceCheckUtils]: 4: Hoare triple {4972#true} call #t~ret15 := main(); {4972#true} is VALID [2018-11-14 19:22:12,593 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 19:22:12,594 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 19:22:12,594 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 19:22:12,595 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 19:22:12,595 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 19:22:12,596 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 19:22:12,597 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 19:22:12,597 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 19:22:12,598 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 19:22:12,598 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 19:22:12,599 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 19:22:12,600 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 19:22:12,609 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 19:22:12,609 INFO L273 TraceCheckUtils]: 18: Hoare triple {4973#false} assume !false; {4973#false} is VALID [2018-11-14 19:22:12,610 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 19:22:12,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:12,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-14 19:22:12,611 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-14 19:22:12,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:12,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 19:22:12,648 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 19:22:12,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 19:22:12,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 19:22:12,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:22:12,649 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 8 states. [2018-11-14 19:22:14,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:14,056 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2018-11-14 19:22:14,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:22:14,057 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-14 19:22:14,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:14,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:22:14,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2018-11-14 19:22:14,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:22:14,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2018-11-14 19:22:14,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 125 transitions. [2018-11-14 19:22:14,316 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 19:22:14,318 INFO L225 Difference]: With dead ends: 111 [2018-11-14 19:22:14,319 INFO L226 Difference]: Without dead ends: 109 [2018-11-14 19:22:14,319 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-14 19:22:14,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-14 19:22:14,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2018-11-14 19:22:14,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:14,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 93 states. [2018-11-14 19:22:14,359 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 93 states. [2018-11-14 19:22:14,359 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 93 states. [2018-11-14 19:22:14,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:14,361 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2018-11-14 19:22:14,361 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2018-11-14 19:22:14,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:14,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:14,362 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 109 states. [2018-11-14 19:22:14,362 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 109 states. [2018-11-14 19:22:14,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:14,365 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2018-11-14 19:22:14,365 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2018-11-14 19:22:14,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:14,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:14,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:14,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:14,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-14 19:22:14,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2018-11-14 19:22:14,368 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 19 [2018-11-14 19:22:14,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:14,368 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2018-11-14 19:22:14,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 19:22:14,369 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2018-11-14 19:22:14,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 19:22:14,369 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:14,369 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 19:22:14,370 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:14,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:14,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1166363704, now seen corresponding path program 1 times [2018-11-14 19:22:14,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:14,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:14,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:14,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:14,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:14,514 INFO L256 TraceCheckUtils]: 0: Hoare triple {5430#true} call ULTIMATE.init(); {5430#true} is VALID [2018-11-14 19:22:14,514 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 19:22:14,514 INFO L273 TraceCheckUtils]: 2: Hoare triple {5430#true} assume true; {5430#true} is VALID [2018-11-14 19:22:14,514 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5430#true} {5430#true} #388#return; {5430#true} is VALID [2018-11-14 19:22:14,514 INFO L256 TraceCheckUtils]: 4: Hoare triple {5430#true} call #t~ret15 := main(); {5430#true} is VALID [2018-11-14 19:22:14,515 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 19:22:14,515 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 19:22:14,515 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 19:22:14,516 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 19:22:14,516 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 19:22:14,516 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 19:22:14,516 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 19:22:14,517 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 19:22:14,517 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 19:22:14,517 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 19:22:14,518 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 19:22:14,519 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 19:22:14,519 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 19:22:14,520 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 19:22:14,521 INFO L273 TraceCheckUtils]: 19: Hoare triple {5431#false} assume !false; {5431#false} is VALID [2018-11-14 19:22:14,521 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 19:22:14,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:14,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 19:22:14,523 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-14 19:22:14,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:14,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 19:22:14,547 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 19:22:14,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 19:22:14,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 19:22:14,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:22:14,548 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 7 states. [2018-11-14 19:22:15,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:15,309 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2018-11-14 19:22:15,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 19:22:15,309 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-14 19:22:15,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:15,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:22:15,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2018-11-14 19:22:15,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:22:15,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2018-11-14 19:22:15,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 123 transitions. [2018-11-14 19:22:16,558 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 19:22:16,560 INFO L225 Difference]: With dead ends: 108 [2018-11-14 19:22:16,560 INFO L226 Difference]: Without dead ends: 106 [2018-11-14 19:22:16,561 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 19:22:16,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-14 19:22:16,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 91. [2018-11-14 19:22:16,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:16,730 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 91 states. [2018-11-14 19:22:16,730 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 91 states. [2018-11-14 19:22:16,730 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 91 states. [2018-11-14 19:22:16,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:16,732 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2018-11-14 19:22:16,733 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-11-14 19:22:16,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:16,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:16,734 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 106 states. [2018-11-14 19:22:16,734 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 106 states. [2018-11-14 19:22:16,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:16,737 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2018-11-14 19:22:16,737 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-11-14 19:22:16,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:16,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:16,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:16,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:16,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-14 19:22:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2018-11-14 19:22:16,741 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 20 [2018-11-14 19:22:16,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:16,741 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2018-11-14 19:22:16,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 19:22:16,741 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2018-11-14 19:22:16,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 19:22:16,742 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:16,742 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 19:22:16,743 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:16,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:16,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1797533329, now seen corresponding path program 1 times [2018-11-14 19:22:16,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:16,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:16,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:16,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:16,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:17,281 INFO L256 TraceCheckUtils]: 0: Hoare triple {5876#true} call ULTIMATE.init(); {5876#true} is VALID [2018-11-14 19:22:17,282 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 19:22:17,282 INFO L273 TraceCheckUtils]: 2: Hoare triple {5876#true} assume true; {5876#true} is VALID [2018-11-14 19:22:17,282 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5876#true} {5876#true} #388#return; {5876#true} is VALID [2018-11-14 19:22:17,283 INFO L256 TraceCheckUtils]: 4: Hoare triple {5876#true} call #t~ret15 := main(); {5876#true} is VALID [2018-11-14 19:22:17,283 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 19:22:17,284 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 19:22:17,284 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 19:22:17,285 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 19:22:17,285 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 19:22:17,285 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 19:22:17,285 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 19:22:17,286 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 19:22:17,286 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 19:22:17,286 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 19:22:17,286 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 19:22:17,287 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 19:22:17,287 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 19:22:17,288 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 19:22:17,288 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 19:22:17,288 INFO L273 TraceCheckUtils]: 20: Hoare triple {5877#false} assume !false; {5877#false} is VALID [2018-11-14 19:22:17,289 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 19:22:17,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:17,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:22:17,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-14 19:22:17,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:17,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:22:17,311 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 19:22:17,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:22:17,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:22:17,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:22:17,312 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 6 states. [2018-11-14 19:22:18,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:18,619 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2018-11-14 19:22:18,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 19:22:18,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-14 19:22:18,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:18,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:18,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2018-11-14 19:22:18,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:18,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2018-11-14 19:22:18,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 119 transitions. [2018-11-14 19:22:19,219 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 19:22:19,220 INFO L225 Difference]: With dead ends: 104 [2018-11-14 19:22:19,220 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 19:22:19,220 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-14 19:22:19,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 19:22:19,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-14 19:22:19,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:19,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-14 19:22:19,241 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-14 19:22:19,242 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-14 19:22:19,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:19,243 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-14 19:22:19,243 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-14 19:22:19,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:19,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:19,244 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-14 19:22:19,244 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-14 19:22:19,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:19,246 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-14 19:22:19,246 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-14 19:22:19,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:19,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:19,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:19,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:19,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-14 19:22:19,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-11-14 19:22:19,249 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 21 [2018-11-14 19:22:19,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:19,250 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-11-14 19:22:19,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:22:19,250 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-14 19:22:19,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-14 19:22:19,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:19,251 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 19:22:19,252 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:19,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:19,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1203360725, now seen corresponding path program 1 times [2018-11-14 19:22:19,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:19,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:19,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:19,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:19,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:20,184 INFO L256 TraceCheckUtils]: 0: Hoare triple {6188#true} call ULTIMATE.init(); {6188#true} is VALID [2018-11-14 19:22:20,184 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 19:22:20,185 INFO L273 TraceCheckUtils]: 2: Hoare triple {6188#true} assume true; {6188#true} is VALID [2018-11-14 19:22:20,185 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6188#true} {6188#true} #388#return; {6188#true} is VALID [2018-11-14 19:22:20,186 INFO L256 TraceCheckUtils]: 4: Hoare triple {6188#true} call #t~ret15 := main(); {6188#true} is VALID [2018-11-14 19:22:20,186 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 19:22:20,191 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 19:22:20,192 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 19:22:20,193 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 19:22:20,193 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 19:22:20,193 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 19:22:20,193 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 19:22:20,193 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 19:22:20,194 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 19:22:20,194 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 19:22:20,194 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 19:22:20,194 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 19:22:20,194 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 19:22:20,195 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 19:22:20,195 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 19:22:20,195 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 19:22:20,195 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 19:22:20,195 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 19:22:20,196 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 19:22:20,196 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 19:22:20,196 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 19:22:20,196 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 19:22:20,197 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 19:22:20,197 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 19:22:20,197 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 19:22:20,197 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 19:22:20,197 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 19:22:20,198 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 19:22:20,198 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 19:22:20,198 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 19:22:20,198 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 19:22:20,198 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 19:22:20,199 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 19:22:20,199 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 19:22:20,199 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 19:22:20,200 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 19:22:20,201 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 19:22:20,205 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 19:22:20,205 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 19:22:20,208 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 19:22:20,211 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 19:22:20,211 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 19:22:20,211 INFO L273 TraceCheckUtils]: 47: Hoare triple {6189#false} assume !false; {6189#false} is VALID [2018-11-14 19:22:20,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:22:20,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:20,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 19:22:20,214 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-14 19:22:20,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:20,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 19:22:20,257 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 19:22:20,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 19:22:20,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 19:22:20,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:22:20,258 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 7 states. [2018-11-14 19:22:20,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:20,610 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-11-14 19:22:20,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 19:22:20,610 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-14 19:22:20,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:20,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:22:20,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2018-11-14 19:22:20,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:22:20,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2018-11-14 19:22:20,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 67 transitions. [2018-11-14 19:22:20,687 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 19:22:20,689 INFO L225 Difference]: With dead ends: 67 [2018-11-14 19:22:20,689 INFO L226 Difference]: Without dead ends: 65 [2018-11-14 19:22:20,689 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:22:20,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-14 19:22:20,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-11-14 19:22:20,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:20,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 56 states. [2018-11-14 19:22:20,699 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 56 states. [2018-11-14 19:22:20,699 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 56 states. [2018-11-14 19:22:20,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:20,701 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-11-14 19:22:20,701 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-11-14 19:22:20,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:20,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:20,702 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 65 states. [2018-11-14 19:22:20,702 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 65 states. [2018-11-14 19:22:20,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:20,703 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-11-14 19:22:20,703 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-11-14 19:22:20,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:20,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:20,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:20,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:20,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 19:22:20,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-11-14 19:22:20,704 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 48 [2018-11-14 19:22:20,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:20,705 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-11-14 19:22:20,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 19:22:20,705 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-14 19:22:20,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-14 19:22:20,706 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:20,706 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 19:22:20,706 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:20,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:20,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1203346823, now seen corresponding path program 1 times [2018-11-14 19:22:20,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:20,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:20,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:20,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:20,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:20,861 INFO L256 TraceCheckUtils]: 0: Hoare triple {6469#true} call ULTIMATE.init(); {6469#true} is VALID [2018-11-14 19:22:20,862 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 19:22:20,862 INFO L273 TraceCheckUtils]: 2: Hoare triple {6469#true} assume true; {6469#true} is VALID [2018-11-14 19:22:20,862 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6469#true} {6469#true} #388#return; {6469#true} is VALID [2018-11-14 19:22:20,863 INFO L256 TraceCheckUtils]: 4: Hoare triple {6469#true} call #t~ret15 := main(); {6469#true} is VALID [2018-11-14 19:22:20,863 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 19:22:20,865 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 19:22:20,865 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 19:22:20,866 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 19:22:20,866 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 19:22:20,866 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 19:22:20,866 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 19:22:20,867 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 19:22:20,867 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 19:22:20,867 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 19:22:20,867 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 19:22:20,868 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 19:22:20,868 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 19:22:20,868 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 19:22:20,869 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 19:22:20,869 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 19:22:20,869 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 19:22:20,869 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 19:22:20,869 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 19:22:20,869 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 19:22:20,869 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 19:22:20,870 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 19:22:20,870 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 19:22:20,870 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 19:22:20,870 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 19:22:20,870 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 19:22:20,870 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 19:22:20,871 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 19:22:20,871 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 19:22:20,871 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 19:22:20,871 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 19:22:20,871 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 19:22:20,871 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 19:22:20,872 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 19:22:20,872 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 19:22:20,872 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 19:22:20,873 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 19:22:20,874 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 19:22:20,874 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 19:22:20,874 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 19:22:20,875 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 19:22:20,875 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 19:22:20,875 INFO L273 TraceCheckUtils]: 47: Hoare triple {6470#false} assume !false; {6470#false} is VALID [2018-11-14 19:22:20,878 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 19:22:20,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:20,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 19:22:20,879 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-14 19:22:20,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:20,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 19:22:20,983 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 19:22:20,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 19:22:20,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 19:22:20,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:22:20,984 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 7 states. [2018-11-14 19:22:21,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:21,293 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-14 19:22:21,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 19:22:21,293 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-14 19:22:21,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:21,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:22:21,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2018-11-14 19:22:21,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:22:21,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2018-11-14 19:22:21,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2018-11-14 19:22:21,538 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 19:22:21,540 INFO L225 Difference]: With dead ends: 56 [2018-11-14 19:22:21,540 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 19:22:21,540 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:22:21,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 19:22:21,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-14 19:22:21,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:21,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2018-11-14 19:22:21,546 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-14 19:22:21,547 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-14 19:22:21,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:21,548 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-14 19:22:21,549 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-14 19:22:21,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:21,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:21,550 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-14 19:22:21,550 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-14 19:22:21,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:21,551 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-14 19:22:21,552 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-14 19:22:21,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:21,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:21,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:21,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:21,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-14 19:22:21,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-11-14 19:22:21,554 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 48 [2018-11-14 19:22:21,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:21,554 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-11-14 19:22:21,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 19:22:21,554 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-14 19:22:21,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 19:22:21,555 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:21,555 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 19:22:21,556 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:21,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:21,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1350519771, now seen corresponding path program 1 times [2018-11-14 19:22:21,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:21,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:21,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:21,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:21,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:21,822 INFO L256 TraceCheckUtils]: 0: Hoare triple {6714#true} call ULTIMATE.init(); {6714#true} is VALID [2018-11-14 19:22:21,822 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 19:22:21,822 INFO L273 TraceCheckUtils]: 2: Hoare triple {6714#true} assume true; {6714#true} is VALID [2018-11-14 19:22:21,823 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6714#true} {6714#true} #388#return; {6714#true} is VALID [2018-11-14 19:22:21,823 INFO L256 TraceCheckUtils]: 4: Hoare triple {6714#true} call #t~ret15 := main(); {6714#true} is VALID [2018-11-14 19:22:21,823 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 19:22:21,824 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 19:22:21,824 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 19:22:21,825 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 19:22:21,825 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 19:22:21,825 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 19:22:21,825 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 19:22:21,826 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 19:22:21,826 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 19:22:21,826 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 19:22:21,826 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 19:22:21,826 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 19:22:21,827 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 19:22:21,827 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 19:22:21,827 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 19:22:21,827 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 19:22:21,827 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 19:22:21,827 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 19:22:21,827 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 19:22:21,828 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 19:22:21,828 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 19:22:21,828 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 19:22:21,828 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 19:22:21,828 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 19:22:21,828 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 19:22:21,828 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 19:22:21,829 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 19:22:21,829 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 19:22:21,829 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 19:22:21,829 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 19:22:21,829 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 19:22:21,830 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 19:22:21,830 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 19:22:21,830 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 19:22:21,830 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 19:22:21,831 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 19:22:21,831 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 19:22:21,832 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 19:22:21,832 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 19:22:21,833 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 19:22:21,833 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 19:22:21,833 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 19:22:21,834 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 19:22:21,834 INFO L273 TraceCheckUtils]: 48: Hoare triple {6715#false} assume !false; {6715#false} is VALID [2018-11-14 19:22:21,837 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 19:22:21,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:21,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-14 19:22:21,838 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-14 19:22:21,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:21,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 19:22:21,883 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 19:22:21,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 19:22:21,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 19:22:21,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:22:21,884 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 8 states. [2018-11-14 19:22:22,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:22,446 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-11-14 19:22:22,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 19:22:22,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-14 19:22:22,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:22,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:22:22,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2018-11-14 19:22:22,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:22:22,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2018-11-14 19:22:22,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2018-11-14 19:22:22,522 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 19:22:22,523 INFO L225 Difference]: With dead ends: 62 [2018-11-14 19:22:22,523 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 19:22:22,524 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-14 19:22:22,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 19:22:22,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-11-14 19:22:22,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:22,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 52 states. [2018-11-14 19:22:22,533 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 52 states. [2018-11-14 19:22:22,533 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 52 states. [2018-11-14 19:22:22,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:22,535 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-14 19:22:22,535 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-14 19:22:22,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:22,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:22,536 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 60 states. [2018-11-14 19:22:22,536 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 60 states. [2018-11-14 19:22:22,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:22,537 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-14 19:22:22,537 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-14 19:22:22,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:22,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:22,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:22,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:22,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-14 19:22:22,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-11-14 19:22:22,539 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-11-14 19:22:22,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:22,540 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-11-14 19:22:22,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 19:22:22,540 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-14 19:22:22,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 19:22:22,540 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:22,541 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 19:22:22,541 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:22,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:22,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1350950747, now seen corresponding path program 1 times [2018-11-14 19:22:22,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:22,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:22,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:22,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:22,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:22,853 INFO L256 TraceCheckUtils]: 0: Hoare triple {6983#true} call ULTIMATE.init(); {6983#true} is VALID [2018-11-14 19:22:22,853 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 19:22:22,853 INFO L273 TraceCheckUtils]: 2: Hoare triple {6983#true} assume true; {6983#true} is VALID [2018-11-14 19:22:22,853 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6983#true} {6983#true} #388#return; {6983#true} is VALID [2018-11-14 19:22:22,854 INFO L256 TraceCheckUtils]: 4: Hoare triple {6983#true} call #t~ret15 := main(); {6983#true} is VALID [2018-11-14 19:22:22,854 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 19:22:22,855 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 19:22:22,855 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 19:22:22,859 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 19:22:22,859 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 19:22:22,859 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 19:22:22,859 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 19:22:22,859 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 19:22:22,860 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 19:22:22,860 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 19:22:22,860 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 19:22:22,860 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 19:22:22,860 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 19:22:22,860 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 19:22:22,860 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 19:22:22,861 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 19:22:22,861 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 19:22:22,861 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 19:22:22,861 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 19:22:22,861 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 19:22:22,861 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 19:22:22,861 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 19:22:22,862 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 19:22:22,862 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 19:22:22,862 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 19:22:22,862 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 19:22:22,862 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 19:22:22,862 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 19:22:22,863 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 19:22:22,863 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 19:22:22,863 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 19:22:22,863 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 19:22:22,863 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 19:22:22,864 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 19:22:22,870 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 19:22:22,870 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 19:22:22,871 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 19:22:22,871 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 19:22:22,872 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 19:22:22,872 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 19:22:22,872 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 19:22:22,873 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 19:22:22,873 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 19:22:22,873 INFO L273 TraceCheckUtils]: 48: Hoare triple {6984#false} assume !false; {6984#false} is VALID [2018-11-14 19:22:22,875 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 19:22:22,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:22,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-14 19:22:22,876 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-14 19:22:22,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:22,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 19:22:22,922 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 19:22:22,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 19:22:22,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 19:22:22,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:22:22,923 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 8 states. [2018-11-14 19:22:23,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:23,442 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-14 19:22:23,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:22:23,442 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-14 19:22:23,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:23,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:22:23,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2018-11-14 19:22:23,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:22:23,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2018-11-14 19:22:23,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 52 transitions. [2018-11-14 19:22:23,507 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 19:22:23,508 INFO L225 Difference]: With dead ends: 52 [2018-11-14 19:22:23,508 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 19:22:23,509 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-11-14 19:22:23,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 19:22:23,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 19:22:23,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:23,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 19:22:23,510 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:22:23,510 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:22:23,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:23,510 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:22:23,510 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:22:23,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:23,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:23,511 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:22:23,511 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:22:23,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:23,511 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:22:23,511 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:22:23,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:23,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:23,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:23,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:23,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 19:22:23,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 19:22:23,512 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2018-11-14 19:22:23,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:23,512 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 19:22:23,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 19:22:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:22:23,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:23,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 19:22:24,043 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2018-11-14 19:22:24,117 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-14 19:22:24,117 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-14 19:22:24,117 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:22:24,117 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:22:24,118 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 19:22:24,118 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 19:22:24,118 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 19:22:24,118 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 977) no Hoare annotation was computed. [2018-11-14 19:22:24,118 INFO L425 ceAbstractionStarter]: For program point L861(lines 861 941) no Hoare annotation was computed. [2018-11-14 19:22:24,118 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 272) no Hoare annotation was computed. [2018-11-14 19:22:24,118 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 12 1001) no Hoare annotation was computed. [2018-11-14 19:22:24,119 INFO L425 ceAbstractionStarter]: For program point L531(lines 531 555) no Hoare annotation was computed. [2018-11-14 19:22:24,119 INFO L425 ceAbstractionStarter]: For program point L878(line 878) no Hoare annotation was computed. [2018-11-14 19:22:24,119 INFO L425 ceAbstractionStarter]: For program point L746(lines 746 757) no Hoare annotation was computed. [2018-11-14 19:22:24,119 INFO L425 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-11-14 19:22:24,119 INFO L425 ceAbstractionStarter]: For program point L796(lines 796 946) no Hoare annotation was computed. [2018-11-14 19:22:24,119 INFO L425 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-11-14 19:22:24,120 INFO L425 ceAbstractionStarter]: For program point L565(lines 565 968) no Hoare annotation was computed. [2018-11-14 19:22:24,120 INFO L425 ceAbstractionStarter]: For program point L912(lines 912 938) no Hoare annotation was computed. [2018-11-14 19:22:24,120 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed. [2018-11-14 19:22:24,120 INFO L425 ceAbstractionStarter]: For program point L780(lines 780 948) no Hoare annotation was computed. [2018-11-14 19:22:24,120 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-14 19:22:24,120 INFO L425 ceAbstractionStarter]: For program point L516(lines 516 971) no Hoare annotation was computed. [2018-11-14 19:22:24,121 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 19:22:24,121 INFO L425 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2018-11-14 19:22:24,121 INFO L425 ceAbstractionStarter]: For program point L599(lines 599 623) no Hoare annotation was computed. [2018-11-14 19:22:24,121 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 995) no Hoare annotation was computed. [2018-11-14 19:22:24,121 INFO L425 ceAbstractionStarter]: For program point L814(lines 814 825) no Hoare annotation was computed. [2018-11-14 19:22:24,121 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 12 1001) no Hoare annotation was computed. [2018-11-14 19:22:24,122 INFO L425 ceAbstractionStarter]: For program point L633(lines 633 962) no Hoare annotation was computed. [2018-11-14 19:22:24,122 INFO L425 ceAbstractionStarter]: For program point L914(line 914) no Hoare annotation was computed. [2018-11-14 19:22:24,122 INFO L425 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 914) no Hoare annotation was computed. [2018-11-14 19:22:24,122 INFO L425 ceAbstractionStarter]: For program point L848(lines 848 942) no Hoare annotation was computed. [2018-11-14 19:22:24,122 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 231) no Hoare annotation was computed. [2018-11-14 19:22:24,122 INFO L425 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 926) no Hoare annotation was computed. [2018-11-14 19:22:24,123 INFO L425 ceAbstractionStarter]: For program point L584(lines 584 965) no Hoare annotation was computed. [2018-11-14 19:22:24,123 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 988) no Hoare annotation was computed. [2018-11-14 19:22:24,123 INFO L425 ceAbstractionStarter]: For program point L667(lines 667 691) no Hoare annotation was computed. [2018-11-14 19:22:24,123 INFO L425 ceAbstractionStarter]: For program point L304(lines 304 990) no Hoare annotation was computed. [2018-11-14 19:22:24,123 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 19:22:24,123 INFO L425 ceAbstractionStarter]: For program point L701(lines 701 956) no Hoare annotation was computed. [2018-11-14 19:22:24,124 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 349) no Hoare annotation was computed. [2018-11-14 19:22:24,124 INFO L425 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-11-14 19:22:24,124 INFO L425 ceAbstractionStarter]: For program point L652(lines 652 959) no Hoare annotation was computed. [2018-11-14 19:22:24,124 INFO L425 ceAbstractionStarter]: For program point L41(lines 41 51) no Hoare annotation was computed. [2018-11-14 19:22:24,124 INFO L428 ceAbstractionStarter]: At program point L999(lines 17 1000) the Hoare annotation is: true [2018-11-14 19:22:24,124 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2018-11-14 19:22:24,124 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 982) no Hoare annotation was computed. [2018-11-14 19:22:24,125 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 759) no Hoare annotation was computed. [2018-11-14 19:22:24,125 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 280) no Hoare annotation was computed. [2018-11-14 19:22:24,125 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2018-11-14 19:22:24,125 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 984) no Hoare annotation was computed. [2018-11-14 19:22:24,125 INFO L425 ceAbstractionStarter]: For program point L769(lines 769 950) no Hoare annotation was computed. [2018-11-14 19:22:24,125 INFO L425 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2018-11-14 19:22:24,125 INFO L425 ceAbstractionStarter]: For program point L406(lines 406 417) no Hoare annotation was computed. [2018-11-14 19:22:24,125 INFO L425 ceAbstractionStarter]: For program point L720(lines 720 953) no Hoare annotation was computed. [2018-11-14 19:22:24,126 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2018-11-14 19:22:24,126 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-14 19:22:24,126 INFO L425 ceAbstractionStarter]: For program point L456(lines 456 976) no Hoare annotation was computed. [2018-11-14 19:22:24,126 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 19:22:24,126 INFO L425 ceAbstractionStarter]: For program point L869(lines 869 940) no Hoare annotation was computed. [2018-11-14 19:22:24,126 INFO L425 ceAbstractionStarter]: For program point L803(lines 803 827) no Hoare annotation was computed. [2018-11-14 19:22:24,127 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 228) no Hoare annotation was computed. [2018-11-14 19:22:24,127 INFO L425 ceAbstractionStarter]: For program point L60(lines 60 994) no Hoare annotation was computed. [2018-11-14 19:22:24,127 INFO L425 ceAbstractionStarter]: For program point L440(lines 440 978) no Hoare annotation was computed. [2018-11-14 19:22:24,127 INFO L425 ceAbstractionStarter]: For program point L110(lines 110 118) no Hoare annotation was computed. [2018-11-14 19:22:24,127 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2018-11-14 19:22:24,127 INFO L425 ceAbstractionStarter]: For program point L837(lines 837 944) no Hoare annotation was computed. [2018-11-14 19:22:24,128 INFO L425 ceAbstractionStarter]: For program point L127(lines 127 279) no Hoare annotation was computed. [2018-11-14 19:22:24,128 INFO L425 ceAbstractionStarter]: For program point L474(lines 474 485) no Hoare annotation was computed. [2018-11-14 19:22:24,128 INFO L425 ceAbstractionStarter]: For program point L788(lines 788 947) no Hoare annotation was computed. [2018-11-14 19:22:24,128 INFO L425 ceAbstractionStarter]: For program point L243(lines 243 278) no Hoare annotation was computed. [2018-11-14 19:22:24,128 INFO L425 ceAbstractionStarter]: For program point L78(lines 78 281) no Hoare annotation was computed. [2018-11-14 19:22:24,128 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 970) no Hoare annotation was computed. [2018-11-14 19:22:24,129 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 992) no Hoare annotation was computed. [2018-11-14 19:22:24,129 INFO L425 ceAbstractionStarter]: For program point L29(lines 29 53) no Hoare annotation was computed. [2018-11-14 19:22:24,129 INFO L425 ceAbstractionStarter]: For program point L508(lines 508 972) no Hoare annotation was computed. [2018-11-14 19:22:24,129 INFO L425 ceAbstractionStarter]: For program point L888(lines 888 900) no Hoare annotation was computed. [2018-11-14 19:22:24,129 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 19:22:24,129 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 186) no Hoare annotation was computed. [2018-11-14 19:22:24,130 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-14 19:22:24,130 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 31) no Hoare annotation was computed. [2018-11-14 19:22:24,130 INFO L425 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 890) no Hoare annotation was computed. [2018-11-14 19:22:24,130 INFO L425 ceAbstractionStarter]: For program point L327(lines 327 351) no Hoare annotation was computed. [2018-11-14 19:22:24,130 INFO L425 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2018-11-14 19:22:24,130 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2018-11-14 19:22:24,131 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 12 1001) the Hoare annotation is: true [2018-11-14 19:22:24,131 INFO L425 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 878) no Hoare annotation was computed. [2018-11-14 19:22:24,131 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 224) no Hoare annotation was computed. [2018-11-14 19:22:24,131 INFO L425 ceAbstractionStarter]: For program point L592(lines 592 964) no Hoare annotation was computed. [2018-11-14 19:22:24,131 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 986) no Hoare annotation was computed. [2018-11-14 19:22:24,131 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 270) no Hoare annotation was computed. [2018-11-14 19:22:24,131 INFO L425 ceAbstractionStarter]: For program point L576(lines 576 966) no Hoare annotation was computed. [2018-11-14 19:22:24,132 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-14 19:22:24,132 INFO L425 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed. [2018-11-14 19:22:24,132 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 989) no Hoare annotation was computed. [2018-11-14 19:22:24,132 INFO L425 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-11-14 19:22:24,132 INFO L425 ceAbstractionStarter]: For program point L395(lines 395 419) no Hoare annotation was computed. [2018-11-14 19:22:24,132 INFO L425 ceAbstractionStarter]: For program point L131(lines 131 237) no Hoare annotation was computed. [2018-11-14 19:22:24,132 INFO L425 ceAbstractionStarter]: For program point L98(lines 98 120) no Hoare annotation was computed. [2018-11-14 19:22:24,132 INFO L425 ceAbstractionStarter]: For program point L610(lines 610 621) no Hoare annotation was computed. [2018-11-14 19:22:24,133 INFO L425 ceAbstractionStarter]: For program point L924(lines 924 936) no Hoare annotation was computed. [2018-11-14 19:22:24,133 INFO L425 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2018-11-14 19:22:24,133 INFO L425 ceAbstractionStarter]: For program point L660(lines 660 958) no Hoare annotation was computed. [2018-11-14 19:22:24,133 INFO L425 ceAbstractionStarter]: For program point L429(lines 429 980) no Hoare annotation was computed. [2018-11-14 19:22:24,133 INFO L425 ceAbstractionStarter]: For program point L264(line 264) no Hoare annotation was computed. [2018-11-14 19:22:24,133 INFO L425 ceAbstractionStarter]: For program point L644(lines 644 960) no Hoare annotation was computed. [2018-11-14 19:22:24,133 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 983) no Hoare annotation was computed. [2018-11-14 19:22:24,133 INFO L425 ceAbstractionStarter]: For program point L17(lines 17 1000) no Hoare annotation was computed. [2018-11-14 19:22:24,133 INFO L425 ceAbstractionStarter]: For program point L463(lines 463 487) no Hoare annotation was computed. [2018-11-14 19:22:24,134 INFO L425 ceAbstractionStarter]: For program point L876(lines 876 902) no Hoare annotation was computed. [2018-11-14 19:22:24,134 INFO L425 ceAbstractionStarter]: For program point L166(lines 166 188) no Hoare annotation was computed. [2018-11-14 19:22:24,134 INFO L425 ceAbstractionStarter]: For program point L678(lines 678 689) no Hoare annotation was computed. [2018-11-14 19:22:24,134 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-14 19:22:24,134 INFO L425 ceAbstractionStarter]: For program point L67(lines 67 283) no Hoare annotation was computed. [2018-11-14 19:22:24,134 INFO L425 ceAbstractionStarter]: For program point L926(line 926) no Hoare annotation was computed. [2018-11-14 19:22:24,135 INFO L425 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 264) no Hoare annotation was computed. [2018-11-14 19:22:24,135 INFO L425 ceAbstractionStarter]: For program point L728(lines 728 952) no Hoare annotation was computed. [2018-11-14 19:22:24,135 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 229) no Hoare annotation was computed. [2018-11-14 19:22:24,135 INFO L425 ceAbstractionStarter]: For program point L497(lines 497 974) no Hoare annotation was computed. [2018-11-14 19:22:24,135 INFO L425 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 202) no Hoare annotation was computed. [2018-11-14 19:22:24,135 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2018-11-14 19:22:24,136 INFO L425 ceAbstractionStarter]: For program point L200(lines 200 226) no Hoare annotation was computed. [2018-11-14 19:22:24,136 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 954) no Hoare annotation was computed. [2018-11-14 19:22:24,136 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2018-11-14 19:22:24,138 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 19:22:24,138 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-14 19:22:24,139 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 19:22:24,139 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:22:24,139 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-14 19:22:24,139 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-14 19:22:24,139 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 19:22:24,139 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:22:24,139 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-14 19:22:24,140 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-14 19:22:24,140 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 19:22:24,140 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-14 19:22:24,140 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2018-11-14 19:22:24,140 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2018-11-14 19:22:24,140 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 19:22:24,140 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-14 19:22:24,141 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-14 19:22:24,141 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2018-11-14 19:22:24,141 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2018-11-14 19:22:24,141 WARN L170 areAnnotationChecker]: L293 has no Hoare annotation [2018-11-14 19:22:24,141 WARN L170 areAnnotationChecker]: L293 has no Hoare annotation [2018-11-14 19:22:24,141 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 19:22:24,141 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2018-11-14 19:22:24,142 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2018-11-14 19:22:24,142 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-14 19:22:24,142 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-14 19:22:24,142 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2018-11-14 19:22:24,142 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2018-11-14 19:22:24,142 WARN L170 areAnnotationChecker]: L304 has no Hoare annotation [2018-11-14 19:22:24,142 WARN L170 areAnnotationChecker]: L304 has no Hoare annotation [2018-11-14 19:22:24,142 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2018-11-14 19:22:24,143 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2018-11-14 19:22:24,143 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2018-11-14 19:22:24,143 WARN L170 areAnnotationChecker]: L312 has no Hoare annotation [2018-11-14 19:22:24,143 WARN L170 areAnnotationChecker]: L312 has no Hoare annotation [2018-11-14 19:22:24,143 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2018-11-14 19:22:24,143 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2018-11-14 19:22:24,143 WARN L170 areAnnotationChecker]: L320 has no Hoare annotation [2018-11-14 19:22:24,143 WARN L170 areAnnotationChecker]: L320 has no Hoare annotation [2018-11-14 19:22:24,144 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2018-11-14 19:22:24,144 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2018-11-14 19:22:24,144 WARN L170 areAnnotationChecker]: L127 has no Hoare annotation [2018-11-14 19:22:24,144 WARN L170 areAnnotationChecker]: L127 has no Hoare annotation [2018-11-14 19:22:24,144 WARN L170 areAnnotationChecker]: L327 has no Hoare annotation [2018-11-14 19:22:24,144 WARN L170 areAnnotationChecker]: L327 has no Hoare annotation [2018-11-14 19:22:24,144 WARN L170 areAnnotationChecker]: L361 has no Hoare annotation [2018-11-14 19:22:24,144 WARN L170 areAnnotationChecker]: L361 has no Hoare annotation [2018-11-14 19:22:24,145 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2018-11-14 19:22:24,145 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2018-11-14 19:22:24,145 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2018-11-14 19:22:24,145 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2018-11-14 19:22:24,145 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2018-11-14 19:22:24,145 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2018-11-14 19:22:24,145 WARN L170 areAnnotationChecker]: L243 has no Hoare annotation [2018-11-14 19:22:24,145 WARN L170 areAnnotationChecker]: L243 has no Hoare annotation [2018-11-14 19:22:24,145 WARN L170 areAnnotationChecker]: L338 has no Hoare annotation [2018-11-14 19:22:24,146 WARN L170 areAnnotationChecker]: L338 has no Hoare annotation [2018-11-14 19:22:24,146 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2018-11-14 19:22:24,146 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2018-11-14 19:22:24,146 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2018-11-14 19:22:24,146 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2018-11-14 19:22:24,146 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2018-11-14 19:22:24,146 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2018-11-14 19:22:24,146 WARN L170 areAnnotationChecker]: L200 has no Hoare annotation [2018-11-14 19:22:24,146 WARN L170 areAnnotationChecker]: L250 has no Hoare annotation [2018-11-14 19:22:24,146 WARN L170 areAnnotationChecker]: L250 has no Hoare annotation [2018-11-14 19:22:24,146 WARN L170 areAnnotationChecker]: L380 has no Hoare annotation [2018-11-14 19:22:24,147 WARN L170 areAnnotationChecker]: L380 has no Hoare annotation [2018-11-14 19:22:24,147 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2018-11-14 19:22:24,147 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2018-11-14 19:22:24,147 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2018-11-14 19:22:24,147 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2018-11-14 19:22:24,147 WARN L170 areAnnotationChecker]: L200 has no Hoare annotation [2018-11-14 19:22:24,147 WARN L170 areAnnotationChecker]: L200 has no Hoare annotation [2018-11-14 19:22:24,147 WARN L170 areAnnotationChecker]: L252 has no Hoare annotation [2018-11-14 19:22:24,147 WARN L170 areAnnotationChecker]: L252 has no Hoare annotation [2018-11-14 19:22:24,148 WARN L170 areAnnotationChecker]: L262 has no Hoare annotation [2018-11-14 19:22:24,148 WARN L170 areAnnotationChecker]: L262 has no Hoare annotation [2018-11-14 19:22:24,148 WARN L170 areAnnotationChecker]: L388 has no Hoare annotation [2018-11-14 19:22:24,148 WARN L170 areAnnotationChecker]: L388 has no Hoare annotation [2018-11-14 19:22:24,148 WARN L170 areAnnotationChecker]: L152 has no Hoare annotation [2018-11-14 19:22:24,148 WARN L170 areAnnotationChecker]: L152 has no Hoare annotation [2018-11-14 19:22:24,148 WARN L170 areAnnotationChecker]: L159 has no Hoare annotation [2018-11-14 19:22:24,148 WARN L170 areAnnotationChecker]: L159 has no Hoare annotation [2018-11-14 19:22:24,148 WARN L170 areAnnotationChecker]: L202 has no Hoare annotation [2018-11-14 19:22:24,148 WARN L170 areAnnotationChecker]: L202 has no Hoare annotation [2018-11-14 19:22:24,149 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2018-11-14 19:22:24,149 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2018-11-14 19:22:24,149 WARN L170 areAnnotationChecker]: L264 has no Hoare annotation [2018-11-14 19:22:24,149 WARN L170 areAnnotationChecker]: L264 has no Hoare annotation [2018-11-14 19:22:24,149 WARN L170 areAnnotationChecker]: L395 has no Hoare annotation [2018-11-14 19:22:24,149 WARN L170 areAnnotationChecker]: L395 has no Hoare annotation [2018-11-14 19:22:24,149 WARN L170 areAnnotationChecker]: L429 has no Hoare annotation [2018-11-14 19:22:24,149 WARN L170 areAnnotationChecker]: L429 has no Hoare annotation [2018-11-14 19:22:24,149 WARN L170 areAnnotationChecker]: L166 has no Hoare annotation [2018-11-14 19:22:24,150 WARN L170 areAnnotationChecker]: L166 has no Hoare annotation [2018-11-14 19:22:24,150 WARN L170 areAnnotationChecker]: L214 has no Hoare annotation [2018-11-14 19:22:24,150 WARN L170 areAnnotationChecker]: L214 has no Hoare annotation [2018-11-14 19:22:24,150 WARN L170 areAnnotationChecker]: L406 has no Hoare annotation [2018-11-14 19:22:24,150 WARN L170 areAnnotationChecker]: L406 has no Hoare annotation [2018-11-14 19:22:24,150 WARN L170 areAnnotationChecker]: L440 has no Hoare annotation [2018-11-14 19:22:24,150 WARN L170 areAnnotationChecker]: L440 has no Hoare annotation [2018-11-14 19:22:24,150 WARN L170 areAnnotationChecker]: L168 has no Hoare annotation [2018-11-14 19:22:24,150 WARN L170 areAnnotationChecker]: L168 has no Hoare annotation [2018-11-14 19:22:24,151 WARN L170 areAnnotationChecker]: L178 has no Hoare annotation [2018-11-14 19:22:24,151 WARN L170 areAnnotationChecker]: L178 has no Hoare annotation [2018-11-14 19:22:24,151 WARN L170 areAnnotationChecker]: L448 has no Hoare annotation [2018-11-14 19:22:24,151 WARN L170 areAnnotationChecker]: L448 has no Hoare annotation [2018-11-14 19:22:24,151 WARN L170 areAnnotationChecker]: L180 has no Hoare annotation [2018-11-14 19:22:24,151 WARN L170 areAnnotationChecker]: L180 has no Hoare annotation [2018-11-14 19:22:24,151 WARN L170 areAnnotationChecker]: L456 has no Hoare annotation [2018-11-14 19:22:24,151 WARN L170 areAnnotationChecker]: L456 has no Hoare annotation [2018-11-14 19:22:24,152 WARN L170 areAnnotationChecker]: L463 has no Hoare annotation [2018-11-14 19:22:24,152 WARN L170 areAnnotationChecker]: L463 has no Hoare annotation [2018-11-14 19:22:24,152 WARN L170 areAnnotationChecker]: L497 has no Hoare annotation [2018-11-14 19:22:24,152 WARN L170 areAnnotationChecker]: L497 has no Hoare annotation [2018-11-14 19:22:24,152 WARN L170 areAnnotationChecker]: L474 has no Hoare annotation [2018-11-14 19:22:24,152 WARN L170 areAnnotationChecker]: L474 has no Hoare annotation [2018-11-14 19:22:24,152 WARN L170 areAnnotationChecker]: L508 has no Hoare annotation [2018-11-14 19:22:24,152 WARN L170 areAnnotationChecker]: L508 has no Hoare annotation [2018-11-14 19:22:24,152 WARN L170 areAnnotationChecker]: L516 has no Hoare annotation [2018-11-14 19:22:24,152 WARN L170 areAnnotationChecker]: L516 has no Hoare annotation [2018-11-14 19:22:24,152 WARN L170 areAnnotationChecker]: L524 has no Hoare annotation [2018-11-14 19:22:24,153 WARN L170 areAnnotationChecker]: L524 has no Hoare annotation [2018-11-14 19:22:24,153 WARN L170 areAnnotationChecker]: L531 has no Hoare annotation [2018-11-14 19:22:24,153 WARN L170 areAnnotationChecker]: L531 has no Hoare annotation [2018-11-14 19:22:24,153 WARN L170 areAnnotationChecker]: L565 has no Hoare annotation [2018-11-14 19:22:24,153 WARN L170 areAnnotationChecker]: L565 has no Hoare annotation [2018-11-14 19:22:24,153 WARN L170 areAnnotationChecker]: L542 has no Hoare annotation [2018-11-14 19:22:24,153 WARN L170 areAnnotationChecker]: L542 has no Hoare annotation [2018-11-14 19:22:24,153 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2018-11-14 19:22:24,153 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2018-11-14 19:22:24,153 WARN L170 areAnnotationChecker]: L584 has no Hoare annotation [2018-11-14 19:22:24,154 WARN L170 areAnnotationChecker]: L584 has no Hoare annotation [2018-11-14 19:22:24,154 WARN L170 areAnnotationChecker]: L592 has no Hoare annotation [2018-11-14 19:22:24,154 WARN L170 areAnnotationChecker]: L592 has no Hoare annotation [2018-11-14 19:22:24,154 WARN L170 areAnnotationChecker]: L599 has no Hoare annotation [2018-11-14 19:22:24,154 WARN L170 areAnnotationChecker]: L599 has no Hoare annotation [2018-11-14 19:22:24,154 WARN L170 areAnnotationChecker]: L633 has no Hoare annotation [2018-11-14 19:22:24,154 WARN L170 areAnnotationChecker]: L633 has no Hoare annotation [2018-11-14 19:22:24,154 WARN L170 areAnnotationChecker]: L610 has no Hoare annotation [2018-11-14 19:22:24,154 WARN L170 areAnnotationChecker]: L610 has no Hoare annotation [2018-11-14 19:22:24,154 WARN L170 areAnnotationChecker]: L644 has no Hoare annotation [2018-11-14 19:22:24,155 WARN L170 areAnnotationChecker]: L644 has no Hoare annotation [2018-11-14 19:22:24,155 WARN L170 areAnnotationChecker]: L652 has no Hoare annotation [2018-11-14 19:22:24,155 WARN L170 areAnnotationChecker]: L652 has no Hoare annotation [2018-11-14 19:22:24,155 WARN L170 areAnnotationChecker]: L660 has no Hoare annotation [2018-11-14 19:22:24,155 WARN L170 areAnnotationChecker]: L660 has no Hoare annotation [2018-11-14 19:22:24,155 WARN L170 areAnnotationChecker]: L667 has no Hoare annotation [2018-11-14 19:22:24,155 WARN L170 areAnnotationChecker]: L667 has no Hoare annotation [2018-11-14 19:22:24,155 WARN L170 areAnnotationChecker]: L701 has no Hoare annotation [2018-11-14 19:22:24,155 WARN L170 areAnnotationChecker]: L701 has no Hoare annotation [2018-11-14 19:22:24,156 WARN L170 areAnnotationChecker]: L678 has no Hoare annotation [2018-11-14 19:22:24,156 WARN L170 areAnnotationChecker]: L678 has no Hoare annotation [2018-11-14 19:22:24,156 WARN L170 areAnnotationChecker]: L712 has no Hoare annotation [2018-11-14 19:22:24,156 WARN L170 areAnnotationChecker]: L712 has no Hoare annotation [2018-11-14 19:22:24,156 WARN L170 areAnnotationChecker]: L720 has no Hoare annotation [2018-11-14 19:22:24,156 WARN L170 areAnnotationChecker]: L720 has no Hoare annotation [2018-11-14 19:22:24,156 WARN L170 areAnnotationChecker]: L728 has no Hoare annotation [2018-11-14 19:22:24,157 WARN L170 areAnnotationChecker]: L728 has no Hoare annotation [2018-11-14 19:22:24,157 WARN L170 areAnnotationChecker]: L735 has no Hoare annotation [2018-11-14 19:22:24,157 WARN L170 areAnnotationChecker]: L735 has no Hoare annotation [2018-11-14 19:22:24,157 WARN L170 areAnnotationChecker]: L769 has no Hoare annotation [2018-11-14 19:22:24,157 WARN L170 areAnnotationChecker]: L769 has no Hoare annotation [2018-11-14 19:22:24,157 WARN L170 areAnnotationChecker]: L746 has no Hoare annotation [2018-11-14 19:22:24,157 WARN L170 areAnnotationChecker]: L746 has no Hoare annotation [2018-11-14 19:22:24,157 WARN L170 areAnnotationChecker]: L780 has no Hoare annotation [2018-11-14 19:22:24,158 WARN L170 areAnnotationChecker]: L780 has no Hoare annotation [2018-11-14 19:22:24,158 WARN L170 areAnnotationChecker]: L788 has no Hoare annotation [2018-11-14 19:22:24,158 WARN L170 areAnnotationChecker]: L788 has no Hoare annotation [2018-11-14 19:22:24,158 WARN L170 areAnnotationChecker]: L796 has no Hoare annotation [2018-11-14 19:22:24,158 WARN L170 areAnnotationChecker]: L796 has no Hoare annotation [2018-11-14 19:22:24,158 WARN L170 areAnnotationChecker]: L803 has no Hoare annotation [2018-11-14 19:22:24,158 WARN L170 areAnnotationChecker]: L803 has no Hoare annotation [2018-11-14 19:22:24,159 WARN L170 areAnnotationChecker]: L837 has no Hoare annotation [2018-11-14 19:22:24,159 WARN L170 areAnnotationChecker]: L837 has no Hoare annotation [2018-11-14 19:22:24,159 WARN L170 areAnnotationChecker]: L814 has no Hoare annotation [2018-11-14 19:22:24,159 WARN L170 areAnnotationChecker]: L814 has no Hoare annotation [2018-11-14 19:22:24,159 WARN L170 areAnnotationChecker]: L848 has no Hoare annotation [2018-11-14 19:22:24,159 WARN L170 areAnnotationChecker]: L848 has no Hoare annotation [2018-11-14 19:22:24,159 WARN L170 areAnnotationChecker]: L861 has no Hoare annotation [2018-11-14 19:22:24,159 WARN L170 areAnnotationChecker]: L861 has no Hoare annotation [2018-11-14 19:22:24,159 WARN L170 areAnnotationChecker]: L861 has no Hoare annotation [2018-11-14 19:22:24,160 WARN L170 areAnnotationChecker]: L869 has no Hoare annotation [2018-11-14 19:22:24,160 WARN L170 areAnnotationChecker]: L869 has no Hoare annotation [2018-11-14 19:22:24,160 WARN L170 areAnnotationChecker]: L876 has no Hoare annotation [2018-11-14 19:22:24,160 WARN L170 areAnnotationChecker]: L876 has no Hoare annotation [2018-11-14 19:22:24,160 WARN L170 areAnnotationChecker]: L912 has no Hoare annotation [2018-11-14 19:22:24,160 WARN L170 areAnnotationChecker]: L912 has no Hoare annotation [2018-11-14 19:22:24,160 WARN L170 areAnnotationChecker]: L878 has no Hoare annotation [2018-11-14 19:22:24,160 WARN L170 areAnnotationChecker]: L878 has no Hoare annotation [2018-11-14 19:22:24,160 WARN L170 areAnnotationChecker]: L888 has no Hoare annotation [2018-11-14 19:22:24,160 WARN L170 areAnnotationChecker]: L888 has no Hoare annotation [2018-11-14 19:22:24,161 WARN L170 areAnnotationChecker]: L914 has no Hoare annotation [2018-11-14 19:22:24,161 WARN L170 areAnnotationChecker]: L914 has no Hoare annotation [2018-11-14 19:22:24,161 WARN L170 areAnnotationChecker]: L924 has no Hoare annotation [2018-11-14 19:22:24,161 WARN L170 areAnnotationChecker]: L924 has no Hoare annotation [2018-11-14 19:22:24,161 WARN L170 areAnnotationChecker]: L890 has no Hoare annotation [2018-11-14 19:22:24,161 WARN L170 areAnnotationChecker]: L890 has no Hoare annotation [2018-11-14 19:22:24,161 WARN L170 areAnnotationChecker]: L926 has no Hoare annotation [2018-11-14 19:22:24,162 WARN L170 areAnnotationChecker]: L926 has no Hoare annotation [2018-11-14 19:22:24,162 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 19:22:24,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 07:22:24 BoogieIcfgContainer [2018-11-14 19:22:24,176 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 19:22:24,177 INFO L168 Benchmark]: Toolchain (without parser) took 32312.29 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -477.5 MB). Peak memory consumption was 594.7 MB. Max. memory is 7.1 GB. [2018-11-14 19:22:24,178 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:22:24,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 564.25 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 19:22:24,179 INFO L168 Benchmark]: Boogie Preprocessor took 159.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.4 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -836.1 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. [2018-11-14 19:22:24,180 INFO L168 Benchmark]: RCFGBuilder took 2003.77 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 106.1 MB). Peak memory consumption was 106.1 MB. Max. memory is 7.1 GB. [2018-11-14 19:22:24,180 INFO L168 Benchmark]: TraceAbstraction took 29579.68 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 319.8 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 231.4 MB). Peak memory consumption was 551.2 MB. Max. memory is 7.1 GB. [2018-11-14 19:22:24,184 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.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 564.25 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 159.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.4 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -836.1 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2003.77 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 106.1 MB). Peak memory consumption was 106.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29579.68 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 319.8 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 231.4 MB). Peak memory consumption was 551.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 112]: 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: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 43]: 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: 140]: 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: 914]: 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: 926]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 264]: 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: 878]: 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: 214]: 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, 29.4s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 22.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 530 SDtfs, 3252 SDslu, 1116 SDs, 0 SdLazy, 3793 SolverSat, 738 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 3.0s 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.9s 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.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s 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...