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.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:22:05,300 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:22:05,305 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:22:05,325 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:22:05,325 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:22:05,327 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:22:05,328 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:22:05,332 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:22:05,341 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:22:05,342 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:22:05,343 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:22:05,343 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:22:05,345 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:22:05,348 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:22:05,349 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:22:05,352 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:22:05,354 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:22:05,355 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:22:05,360 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:22:05,364 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:22:05,366 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:22:05,368 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:22:05,371 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:22:05,372 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:22:05,372 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:22:05,373 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:22:05,375 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:22:05,376 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:22:05,376 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:22:05,377 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:22:05,377 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:22:05,378 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:22:05,378 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:22:05,379 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:22:05,382 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:22:05,382 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:22:05,383 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:22:05,408 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:22:05,408 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:22:05,412 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:22:05,412 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:22:05,413 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:22:05,413 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:22:05,413 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:22:05,413 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:22:05,413 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:22:05,414 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:22:05,414 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:22:05,414 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:22:05,415 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:22:05,415 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:22:05,415 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:22:05,415 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:22:05,415 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:22:05,415 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:22:05,416 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:22:05,416 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:22:05,416 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:22:05,416 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:22:05,416 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:22:05,418 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:22:05,419 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:22:05,419 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:22:05,419 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:22:05,419 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:22:05,420 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:22:05,420 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:22:05,420 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:22:05,480 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:22:05,494 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:22:05,500 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:22:05,501 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:22:05,502 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:22:05,503 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.v+nlh-reducer.c [2018-11-14 19:22:05,567 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a34b5eb50/4656100d0e93405f8586198d52e4fe36/FLAG4647d215b [2018-11-14 19:22:05,987 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:22:05,989 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-11-14 19:22:05,997 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a34b5eb50/4656100d0e93405f8586198d52e4fe36/FLAG4647d215b [2018-11-14 19:22:06,011 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a34b5eb50/4656100d0e93405f8586198d52e4fe36 [2018-11-14 19:22:06,021 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:22:06,022 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:22:06,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:22:06,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:22:06,028 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:22:06,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:22:06" (1/1) ... [2018-11-14 19:22:06,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b9ae0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:06, skipping insertion in model container [2018-11-14 19:22:06,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:22:06" (1/1) ... [2018-11-14 19:22:06,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:22:06,079 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:22:06,389 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:22:06,403 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:22:06,476 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:22:06,490 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:22:06,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:06 WrapperNode [2018-11-14 19:22:06,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:22:06,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:22:06,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:22:06,492 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:22:06,504 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:06" (1/1) ... [2018-11-14 19:22:06,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:06" (1/1) ... [2018-11-14 19:22:06,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:06" (1/1) ... [2018-11-14 19:22:06,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:06" (1/1) ... [2018-11-14 19:22:06,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:06" (1/1) ... [2018-11-14 19:22:06,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:06" (1/1) ... [2018-11-14 19:22:06,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:06" (1/1) ... [2018-11-14 19:22:06,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:22:06,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:22:06,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:22:06,538 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:22:06,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:06" (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:22:06,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:22:06,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:22:06,669 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:22:06,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:22:06,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 19:22:06,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 19:22:06,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 19:22:06,670 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:22:06,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:22:06,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:22:07,740 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:22:07,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:22:07 BoogieIcfgContainer [2018-11-14 19:22:07,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:22:07,742 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:22:07,742 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:22:07,746 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:22:07,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:22:06" (1/3) ... [2018-11-14 19:22:07,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0e7d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:22:07, skipping insertion in model container [2018-11-14 19:22:07,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:06" (2/3) ... [2018-11-14 19:22:07,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0e7d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:22:07, skipping insertion in model container [2018-11-14 19:22:07,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:22:07" (3/3) ... [2018-11-14 19:22:07,750 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-11-14 19:22:07,760 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:22:07,769 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-11-14 19:22:07,787 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-11-14 19:22:07,816 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:22:07,816 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:22:07,817 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:22:07,817 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:22:07,817 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:22:07,819 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:22:07,819 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:22:07,819 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:22:07,819 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:22:07,842 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-11-14 19:22:07,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 19:22:07,849 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:07,850 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:22:07,856 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:07,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:07,864 INFO L82 PathProgramCache]: Analyzing trace with hash -355727005, now seen corresponding path program 1 times [2018-11-14 19:22:07,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:07,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:07,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:07,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:07,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:08,279 INFO L256 TraceCheckUtils]: 0: Hoare triple {79#true} call ULTIMATE.init(); {79#true} is VALID [2018-11-14 19:22:08,283 INFO L273 TraceCheckUtils]: 1: Hoare triple {79#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {79#true} is VALID [2018-11-14 19:22:08,283 INFO L273 TraceCheckUtils]: 2: Hoare triple {79#true} assume true; {79#true} is VALID [2018-11-14 19:22:08,284 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {79#true} {79#true} #171#return; {79#true} is VALID [2018-11-14 19:22:08,284 INFO L256 TraceCheckUtils]: 4: Hoare triple {79#true} call #t~ret7 := main(); {79#true} is VALID [2018-11-14 19:22:08,284 INFO L273 TraceCheckUtils]: 5: Hoare triple {79#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; {79#true} is VALID [2018-11-14 19:22:08,301 INFO L273 TraceCheckUtils]: 6: Hoare triple {79#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {81#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} is VALID [2018-11-14 19:22:08,307 INFO L273 TraceCheckUtils]: 7: Hoare triple {81#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 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; {81#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} is VALID [2018-11-14 19:22:08,317 INFO L273 TraceCheckUtils]: 8: Hoare triple {81#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} assume !!(~main____CPAchecker_TMP_0~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; {82#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~12 1))} is VALID [2018-11-14 19:22:08,327 INFO L273 TraceCheckUtils]: 9: Hoare triple {82#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~12 1))} 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; {83#(not (= 0 main_~__VERIFIER_assert__cond~13))} is VALID [2018-11-14 19:22:08,328 INFO L273 TraceCheckUtils]: 10: Hoare triple {83#(not (= 0 main_~__VERIFIER_assert__cond~13))} assume ~__VERIFIER_assert__cond~13 == 0; {80#false} is VALID [2018-11-14 19:22:08,328 INFO L273 TraceCheckUtils]: 11: Hoare triple {80#false} assume !false; {80#false} is VALID [2018-11-14 19:22:08,331 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,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:08,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:22:08,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-14 19:22:08,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:08,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:22:08,381 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:22:08,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:22:08,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:22:08,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:22:08,391 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2018-11-14 19:22:09,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:09,873 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2018-11-14 19:22:09,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 19:22:09,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-14 19:22:09,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:09,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:22:09,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 172 transitions. [2018-11-14 19:22:09,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:22:09,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 172 transitions. [2018-11-14 19:22:09,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 172 transitions. [2018-11-14 19:22:10,154 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:10,172 INFO L225 Difference]: With dead ends: 129 [2018-11-14 19:22:10,172 INFO L226 Difference]: Without dead ends: 113 [2018-11-14 19:22:10,176 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:22:10,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-14 19:22:10,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 69. [2018-11-14 19:22:10,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:10,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 69 states. [2018-11-14 19:22:10,245 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 69 states. [2018-11-14 19:22:10,245 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 69 states. [2018-11-14 19:22:10,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:10,255 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2018-11-14 19:22:10,256 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-11-14 19:22:10,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:10,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:10,258 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 113 states. [2018-11-14 19:22:10,258 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 113 states. [2018-11-14 19:22:10,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:10,268 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2018-11-14 19:22:10,268 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-11-14 19:22:10,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:10,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:10,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:10,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:10,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-14 19:22:10,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-14 19:22:10,277 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2018-11-14 19:22:10,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:10,278 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-14 19:22:10,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:22:10,278 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-14 19:22:10,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 19:22:10,279 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:10,279 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:22:10,280 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:10,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:10,281 INFO L82 PathProgramCache]: Analyzing trace with hash -358961311, now seen corresponding path program 1 times [2018-11-14 19:22:10,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:10,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:10,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:10,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:10,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:10,413 INFO L256 TraceCheckUtils]: 0: Hoare triple {536#true} call ULTIMATE.init(); {536#true} is VALID [2018-11-14 19:22:10,413 INFO L273 TraceCheckUtils]: 1: Hoare triple {536#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {536#true} is VALID [2018-11-14 19:22:10,414 INFO L273 TraceCheckUtils]: 2: Hoare triple {536#true} assume true; {536#true} is VALID [2018-11-14 19:22:10,414 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {536#true} {536#true} #171#return; {536#true} is VALID [2018-11-14 19:22:10,414 INFO L256 TraceCheckUtils]: 4: Hoare triple {536#true} call #t~ret7 := main(); {536#true} is VALID [2018-11-14 19:22:10,418 INFO L273 TraceCheckUtils]: 5: Hoare triple {536#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; {536#true} is VALID [2018-11-14 19:22:10,433 INFO L273 TraceCheckUtils]: 6: Hoare triple {536#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {538#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:10,446 INFO L273 TraceCheckUtils]: 7: Hoare triple {538#(<= 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; {538#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:10,450 INFO L273 TraceCheckUtils]: 8: Hoare triple {538#(<= 0 main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {538#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:10,451 INFO L273 TraceCheckUtils]: 9: Hoare triple {538#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~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; {539#(= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2018-11-14 19:22:10,452 INFO L273 TraceCheckUtils]: 10: Hoare triple {539#(= 1 main_~__VERIFIER_assert__cond~0)} assume ~__VERIFIER_assert__cond~0 == 0; {537#false} is VALID [2018-11-14 19:22:10,452 INFO L273 TraceCheckUtils]: 11: Hoare triple {537#false} assume !false; {537#false} is VALID [2018-11-14 19:22:10,454 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,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:10,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 19:22:10,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-14 19:22:10,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:10,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 19:22:10,471 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:22:10,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 19:22:10,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 19:22:10,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 19:22:10,473 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2018-11-14 19:22:10,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:10,796 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-14 19:22:10,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 19:22:10,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-14 19:22:10,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:10,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:22:10,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2018-11-14 19:22:10,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:22:10,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2018-11-14 19:22:10,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 73 transitions. [2018-11-14 19:22:10,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:10,938 INFO L225 Difference]: With dead ends: 69 [2018-11-14 19:22:10,938 INFO L226 Difference]: Without dead ends: 67 [2018-11-14 19:22:10,939 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:22:10,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-14 19:22:10,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-14 19:22:10,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:10,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 67 states. [2018-11-14 19:22:10,993 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-14 19:22:10,993 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-14 19:22:10,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:10,997 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-14 19:22:10,997 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-14 19:22:10,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:10,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:10,999 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-14 19:22:10,999 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-14 19:22:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:11,003 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-14 19:22:11,003 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-14 19:22:11,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:11,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:11,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:11,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-14 19:22:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-14 19:22:11,008 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2018-11-14 19:22:11,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:11,009 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-14 19:22:11,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 19:22:11,009 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-14 19:22:11,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 19:22:11,010 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:11,010 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:22:11,011 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:11,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:11,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1757104312, now seen corresponding path program 1 times [2018-11-14 19:22:11,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:11,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:11,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:11,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:11,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:11,190 INFO L256 TraceCheckUtils]: 0: Hoare triple {830#true} call ULTIMATE.init(); {830#true} is VALID [2018-11-14 19:22:11,190 INFO L273 TraceCheckUtils]: 1: Hoare triple {830#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {830#true} is VALID [2018-11-14 19:22:11,191 INFO L273 TraceCheckUtils]: 2: Hoare triple {830#true} assume true; {830#true} is VALID [2018-11-14 19:22:11,191 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {830#true} {830#true} #171#return; {830#true} is VALID [2018-11-14 19:22:11,191 INFO L256 TraceCheckUtils]: 4: Hoare triple {830#true} call #t~ret7 := main(); {830#true} is VALID [2018-11-14 19:22:11,192 INFO L273 TraceCheckUtils]: 5: Hoare triple {830#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; {830#true} is VALID [2018-11-14 19:22:11,193 INFO L273 TraceCheckUtils]: 6: Hoare triple {830#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {832#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} is VALID [2018-11-14 19:22:11,193 INFO L273 TraceCheckUtils]: 7: Hoare triple {832#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 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; {832#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} is VALID [2018-11-14 19:22:11,194 INFO L273 TraceCheckUtils]: 8: Hoare triple {832#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} assume !(~main____CPAchecker_TMP_0~0 == 0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {832#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} is VALID [2018-11-14 19:22:11,197 INFO L273 TraceCheckUtils]: 9: Hoare triple {832#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~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; {833#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~0 1))} is VALID [2018-11-14 19:22:11,198 INFO L273 TraceCheckUtils]: 10: Hoare triple {833#(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; {834#(not (= 0 main_~__VERIFIER_assert__cond~1))} is VALID [2018-11-14 19:22:11,199 INFO L273 TraceCheckUtils]: 11: Hoare triple {834#(not (= 0 main_~__VERIFIER_assert__cond~1))} assume ~__VERIFIER_assert__cond~1 == 0; {831#false} is VALID [2018-11-14 19:22:11,199 INFO L273 TraceCheckUtils]: 12: Hoare triple {831#false} assume !false; {831#false} is VALID [2018-11-14 19:22:11,201 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:11,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:11,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:22:11,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-14 19:22:11,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:11,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:22:11,252 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:11,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:22:11,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:22:11,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:22:11,253 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2018-11-14 19:22:11,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:11,707 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-11-14 19:22:11,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 19:22:11,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-14 19:22:11,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:11,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:22:11,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2018-11-14 19:22:11,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:22:11,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2018-11-14 19:22:11,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2018-11-14 19:22:11,808 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:11,810 INFO L225 Difference]: With dead ends: 73 [2018-11-14 19:22:11,810 INFO L226 Difference]: Without dead ends: 71 [2018-11-14 19:22:11,811 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:22:11,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-14 19:22:11,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-11-14 19:22:11,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:11,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 70 states. [2018-11-14 19:22:11,837 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 70 states. [2018-11-14 19:22:11,837 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 70 states. [2018-11-14 19:22:11,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:11,840 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-11-14 19:22:11,840 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-14 19:22:11,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:11,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:11,841 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 71 states. [2018-11-14 19:22:11,842 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 71 states. [2018-11-14 19:22:11,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:11,845 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-11-14 19:22:11,845 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-14 19:22:11,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:11,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:11,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:11,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-14 19:22:11,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-11-14 19:22:11,850 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2018-11-14 19:22:11,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:11,850 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-11-14 19:22:11,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:22:11,850 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-14 19:22:11,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 19:22:11,851 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:11,851 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:22:11,852 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:11,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:11,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1775862844, now seen corresponding path program 1 times [2018-11-14 19:22:11,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:11,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:11,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:11,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:11,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:11,998 INFO L256 TraceCheckUtils]: 0: Hoare triple {1145#true} call ULTIMATE.init(); {1145#true} is VALID [2018-11-14 19:22:11,999 INFO L273 TraceCheckUtils]: 1: Hoare triple {1145#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {1145#true} is VALID [2018-11-14 19:22:11,999 INFO L273 TraceCheckUtils]: 2: Hoare triple {1145#true} assume true; {1145#true} is VALID [2018-11-14 19:22:11,999 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1145#true} {1145#true} #171#return; {1145#true} is VALID [2018-11-14 19:22:12,000 INFO L256 TraceCheckUtils]: 4: Hoare triple {1145#true} call #t~ret7 := main(); {1145#true} is VALID [2018-11-14 19:22:12,000 INFO L273 TraceCheckUtils]: 5: Hoare triple {1145#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; {1145#true} is VALID [2018-11-14 19:22:12,001 INFO L273 TraceCheckUtils]: 6: Hoare triple {1145#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {1147#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:12,002 INFO L273 TraceCheckUtils]: 7: Hoare triple {1147#(<= 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; {1147#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:12,003 INFO L273 TraceCheckUtils]: 8: Hoare triple {1147#(<= 0 main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~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; {1148#(and (= main_~__VERIFIER_assert__cond~12 1) (<= 0 main_~main__t~0))} is VALID [2018-11-14 19:22:12,004 INFO L273 TraceCheckUtils]: 9: Hoare triple {1148#(and (= main_~__VERIFIER_assert__cond~12 1) (<= 0 main_~main__t~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; {1147#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:12,006 INFO L273 TraceCheckUtils]: 10: Hoare triple {1147#(<= 0 main_~main__t~0)} assume !(~__VERIFIER_assert__cond~13 == 0);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {1147#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:12,007 INFO L273 TraceCheckUtils]: 11: Hoare triple {1147#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {1149#(<= 1 main_~main__t~0)} is VALID [2018-11-14 19:22:12,008 INFO L273 TraceCheckUtils]: 12: Hoare triple {1149#(<= 1 main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~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; {1150#(not (= 0 main_~__VERIFIER_assert__cond~14))} is VALID [2018-11-14 19:22:12,008 INFO L273 TraceCheckUtils]: 13: Hoare triple {1150#(not (= 0 main_~__VERIFIER_assert__cond~14))} assume ~__VERIFIER_assert__cond~14 == 0; {1146#false} is VALID [2018-11-14 19:22:12,009 INFO L273 TraceCheckUtils]: 14: Hoare triple {1146#false} assume !false; {1146#false} is VALID [2018-11-14 19:22:12,010 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,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:12,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:22:12,012 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-14 19:22:12,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:12,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:22:12,031 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:22:12,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:22:12,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:22:12,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:22:12,032 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 6 states. [2018-11-14 19:22:12,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:12,776 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-11-14 19:22:12,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:22:12,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-14 19:22:12,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:12,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:12,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2018-11-14 19:22:12,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:12,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2018-11-14 19:22:12,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 113 transitions. [2018-11-14 19:22:12,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:12,916 INFO L225 Difference]: With dead ends: 107 [2018-11-14 19:22:12,917 INFO L226 Difference]: Without dead ends: 105 [2018-11-14 19:22:12,917 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:22:12,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-14 19:22:12,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 68. [2018-11-14 19:22:12,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:12,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 68 states. [2018-11-14 19:22:12,959 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 68 states. [2018-11-14 19:22:12,959 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 68 states. [2018-11-14 19:22:12,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:12,964 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-11-14 19:22:12,964 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-11-14 19:22:12,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:12,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:12,965 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 105 states. [2018-11-14 19:22:12,965 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 105 states. [2018-11-14 19:22:12,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:12,969 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-11-14 19:22:12,970 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-11-14 19:22:12,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:12,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:12,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:12,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:12,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 19:22:12,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-14 19:22:12,974 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2018-11-14 19:22:12,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:12,974 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-14 19:22:12,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:22:12,974 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-14 19:22:12,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 19:22:12,975 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:12,975 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:22:12,976 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:12,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:12,976 INFO L82 PathProgramCache]: Analyzing trace with hash 655192796, now seen corresponding path program 1 times [2018-11-14 19:22:12,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:12,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:12,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:12,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:12,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:13,138 INFO L256 TraceCheckUtils]: 0: Hoare triple {1563#true} call ULTIMATE.init(); {1563#true} is VALID [2018-11-14 19:22:13,138 INFO L273 TraceCheckUtils]: 1: Hoare triple {1563#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {1563#true} is VALID [2018-11-14 19:22:13,139 INFO L273 TraceCheckUtils]: 2: Hoare triple {1563#true} assume true; {1563#true} is VALID [2018-11-14 19:22:13,139 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1563#true} {1563#true} #171#return; {1563#true} is VALID [2018-11-14 19:22:13,140 INFO L256 TraceCheckUtils]: 4: Hoare triple {1563#true} call #t~ret7 := main(); {1563#true} is VALID [2018-11-14 19:22:13,140 INFO L273 TraceCheckUtils]: 5: Hoare triple {1563#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; {1563#true} is VALID [2018-11-14 19:22:13,142 INFO L273 TraceCheckUtils]: 6: Hoare triple {1563#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {1565#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:13,143 INFO L273 TraceCheckUtils]: 7: Hoare triple {1565#(<= 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; {1565#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:13,144 INFO L273 TraceCheckUtils]: 8: Hoare triple {1565#(<= 0 main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {1565#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:13,144 INFO L273 TraceCheckUtils]: 9: Hoare triple {1565#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~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; {1566#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} is VALID [2018-11-14 19:22:13,146 INFO L273 TraceCheckUtils]: 10: Hoare triple {1566#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} 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; {1565#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:13,148 INFO L273 TraceCheckUtils]: 11: Hoare triple {1565#(<= 0 main_~main__t~0)} assume !(~__VERIFIER_assert__cond~1 == 0);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {1567#(<= 1 main_~main__t~0)} is VALID [2018-11-14 19:22:13,148 INFO L273 TraceCheckUtils]: 12: Hoare triple {1567#(<= 1 main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~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; {1568#(not (= 0 main_~__VERIFIER_assert__cond~2))} is VALID [2018-11-14 19:22:13,150 INFO L273 TraceCheckUtils]: 13: Hoare triple {1568#(not (= 0 main_~__VERIFIER_assert__cond~2))} assume ~__VERIFIER_assert__cond~2 == 0; {1564#false} is VALID [2018-11-14 19:22:13,150 INFO L273 TraceCheckUtils]: 14: Hoare triple {1564#false} assume !false; {1564#false} is VALID [2018-11-14 19:22:13,151 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:13,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:13,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:22:13,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-14 19:22:13,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:13,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:22:13,171 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:22:13,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:22:13,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:22:13,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:22:13,172 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 6 states. [2018-11-14 19:22:13,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:13,944 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-14 19:22:13,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:22:13,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-14 19:22:13,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:13,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:13,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2018-11-14 19:22:13,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:13,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2018-11-14 19:22:13,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2018-11-14 19:22:14,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:14,078 INFO L225 Difference]: With dead ends: 69 [2018-11-14 19:22:14,079 INFO L226 Difference]: Without dead ends: 67 [2018-11-14 19:22:14,079 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:22:14,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-14 19:22:14,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-11-14 19:22:14,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:14,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 66 states. [2018-11-14 19:22:14,133 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 66 states. [2018-11-14 19:22:14,133 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 66 states. [2018-11-14 19:22:14,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:14,137 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-14 19:22:14,137 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-14 19:22:14,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:14,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:14,138 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 67 states. [2018-11-14 19:22:14,138 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 67 states. [2018-11-14 19:22:14,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:14,141 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-14 19:22:14,141 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-14 19:22:14,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:14,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:14,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:14,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:14,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-14 19:22:14,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-11-14 19:22:14,145 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2018-11-14 19:22:14,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:14,145 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-11-14 19:22:14,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:22:14,146 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-14 19:22:14,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 19:22:14,146 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:14,146 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:14,147 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:14,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:14,148 INFO L82 PathProgramCache]: Analyzing trace with hash 783259850, now seen corresponding path program 1 times [2018-11-14 19:22:14,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:14,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:14,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:14,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:14,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:14,284 INFO L256 TraceCheckUtils]: 0: Hoare triple {1863#true} call ULTIMATE.init(); {1863#true} is VALID [2018-11-14 19:22:14,284 INFO L273 TraceCheckUtils]: 1: Hoare triple {1863#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {1863#true} is VALID [2018-11-14 19:22:14,285 INFO L273 TraceCheckUtils]: 2: Hoare triple {1863#true} assume true; {1863#true} is VALID [2018-11-14 19:22:14,285 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1863#true} {1863#true} #171#return; {1863#true} is VALID [2018-11-14 19:22:14,285 INFO L256 TraceCheckUtils]: 4: Hoare triple {1863#true} call #t~ret7 := main(); {1863#true} is VALID [2018-11-14 19:22:14,285 INFO L273 TraceCheckUtils]: 5: Hoare triple {1863#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; {1863#true} is VALID [2018-11-14 19:22:14,286 INFO L273 TraceCheckUtils]: 6: Hoare triple {1863#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {1865#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:14,287 INFO L273 TraceCheckUtils]: 7: Hoare triple {1865#(<= 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; {1865#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:14,287 INFO L273 TraceCheckUtils]: 8: Hoare triple {1865#(<= 0 main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~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; {1866#(and (= main_~__VERIFIER_assert__cond~12 1) (<= 0 main_~main__t~0))} is VALID [2018-11-14 19:22:14,289 INFO L273 TraceCheckUtils]: 9: Hoare triple {1866#(and (= main_~__VERIFIER_assert__cond~12 1) (<= 0 main_~main__t~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; {1865#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:14,289 INFO L273 TraceCheckUtils]: 10: Hoare triple {1865#(<= 0 main_~main__t~0)} assume !(~__VERIFIER_assert__cond~13 == 0);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {1865#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:14,291 INFO L273 TraceCheckUtils]: 11: Hoare triple {1865#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {1867#(<= 1 main_~main__t~0)} is VALID [2018-11-14 19:22:14,291 INFO L273 TraceCheckUtils]: 12: Hoare triple {1867#(<= 1 main_~main__t~0)} 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; {1867#(<= 1 main_~main__t~0)} is VALID [2018-11-14 19:22:14,293 INFO L273 TraceCheckUtils]: 13: Hoare triple {1867#(<= 1 main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~1 == 0);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {1868#(not (= 0 main_~__VERIFIER_assert__cond~16))} is VALID [2018-11-14 19:22:14,294 INFO L273 TraceCheckUtils]: 14: Hoare triple {1868#(not (= 0 main_~__VERIFIER_assert__cond~16))} assume ~__VERIFIER_assert__cond~16 == 0; {1864#false} is VALID [2018-11-14 19:22:14,294 INFO L273 TraceCheckUtils]: 15: Hoare triple {1864#false} assume !false; {1864#false} is VALID [2018-11-14 19:22:14,295 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,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:14,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:22:14,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 19:22:14,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:14,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:22:14,330 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:14,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:22:14,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:22:14,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:22:14,331 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2018-11-14 19:22:15,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:15,079 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2018-11-14 19:22:15,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:22:15,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 19:22:15,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:15,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:15,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2018-11-14 19:22:15,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:15,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2018-11-14 19:22:15,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 155 transitions. [2018-11-14 19:22:15,575 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:15,579 INFO L225 Difference]: With dead ends: 146 [2018-11-14 19:22:15,579 INFO L226 Difference]: Without dead ends: 144 [2018-11-14 19:22:15,579 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:22:15,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-14 19:22:15,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 64. [2018-11-14 19:22:15,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:15,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 64 states. [2018-11-14 19:22:15,622 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 64 states. [2018-11-14 19:22:15,622 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 64 states. [2018-11-14 19:22:15,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:15,627 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2018-11-14 19:22:15,627 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-11-14 19:22:15,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:15,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:15,628 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 144 states. [2018-11-14 19:22:15,628 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 144 states. [2018-11-14 19:22:15,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:15,632 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2018-11-14 19:22:15,632 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-11-14 19:22:15,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:15,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:15,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:15,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:15,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-14 19:22:15,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-11-14 19:22:15,635 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 16 [2018-11-14 19:22:15,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:15,636 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-11-14 19:22:15,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:22:15,636 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-14 19:22:15,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 19:22:15,636 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:15,637 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:15,637 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:15,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:15,638 INFO L82 PathProgramCache]: Analyzing trace with hash 782829867, now seen corresponding path program 1 times [2018-11-14 19:22:15,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:15,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:15,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:15,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:15,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:15,750 INFO L256 TraceCheckUtils]: 0: Hoare triple {2397#true} call ULTIMATE.init(); {2397#true} is VALID [2018-11-14 19:22:15,750 INFO L273 TraceCheckUtils]: 1: Hoare triple {2397#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {2397#true} is VALID [2018-11-14 19:22:15,751 INFO L273 TraceCheckUtils]: 2: Hoare triple {2397#true} assume true; {2397#true} is VALID [2018-11-14 19:22:15,751 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2397#true} {2397#true} #171#return; {2397#true} is VALID [2018-11-14 19:22:15,751 INFO L256 TraceCheckUtils]: 4: Hoare triple {2397#true} call #t~ret7 := main(); {2397#true} is VALID [2018-11-14 19:22:15,751 INFO L273 TraceCheckUtils]: 5: Hoare triple {2397#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; {2397#true} is VALID [2018-11-14 19:22:15,752 INFO L273 TraceCheckUtils]: 6: Hoare triple {2397#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {2399#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:15,753 INFO L273 TraceCheckUtils]: 7: Hoare triple {2399#(<= 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; {2399#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:15,753 INFO L273 TraceCheckUtils]: 8: Hoare triple {2399#(<= 0 main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~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; {2400#(= main_~__VERIFIER_assert__cond~12 1)} is VALID [2018-11-14 19:22:15,754 INFO L273 TraceCheckUtils]: 9: Hoare triple {2400#(= main_~__VERIFIER_assert__cond~12 1)} 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; {2397#true} is VALID [2018-11-14 19:22:15,754 INFO L273 TraceCheckUtils]: 10: Hoare triple {2397#true} assume !(~__VERIFIER_assert__cond~13 == 0);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {2397#true} is VALID [2018-11-14 19:22:15,754 INFO L273 TraceCheckUtils]: 11: Hoare triple {2397#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {2397#true} is VALID [2018-11-14 19:22:15,755 INFO L273 TraceCheckUtils]: 12: Hoare triple {2397#true} assume ~main__t~0 == ~main__tagbuf_len~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; {2401#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 19:22:15,756 INFO L273 TraceCheckUtils]: 13: Hoare triple {2401#(<= main_~main__t~0 main_~main__tagbuf_len~0)} 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; {2402#(not (= 0 main_~__VERIFIER_assert__cond~15))} is VALID [2018-11-14 19:22:15,756 INFO L273 TraceCheckUtils]: 14: Hoare triple {2402#(not (= 0 main_~__VERIFIER_assert__cond~15))} assume ~__VERIFIER_assert__cond~15 == 0; {2398#false} is VALID [2018-11-14 19:22:15,756 INFO L273 TraceCheckUtils]: 15: Hoare triple {2398#false} assume !false; {2398#false} is VALID [2018-11-14 19:22:15,757 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:15,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:15,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:22:15,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 19:22:15,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:15,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:22:15,776 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:15,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:22:15,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:22:15,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:22:15,777 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-11-14 19:22:16,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:16,288 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-11-14 19:22:16,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:22:16,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 19:22:16,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:16,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:16,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2018-11-14 19:22:16,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:16,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2018-11-14 19:22:16,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 105 transitions. [2018-11-14 19:22:16,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:16,404 INFO L225 Difference]: With dead ends: 99 [2018-11-14 19:22:16,404 INFO L226 Difference]: Without dead ends: 95 [2018-11-14 19:22:16,405 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:22:16,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-14 19:22:16,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 60. [2018-11-14 19:22:16,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:16,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 60 states. [2018-11-14 19:22:16,431 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 60 states. [2018-11-14 19:22:16,432 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 60 states. [2018-11-14 19:22:16,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:16,435 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2018-11-14 19:22:16,435 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2018-11-14 19:22:16,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:16,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:16,435 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 95 states. [2018-11-14 19:22:16,435 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 95 states. [2018-11-14 19:22:16,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:16,438 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2018-11-14 19:22:16,438 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2018-11-14 19:22:16,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:16,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:16,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:16,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-14 19:22:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-14 19:22:16,440 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2018-11-14 19:22:16,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:16,441 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-14 19:22:16,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:22:16,441 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-14 19:22:16,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 19:22:16,441 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:16,441 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:16,443 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:16,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:16,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1163856723, now seen corresponding path program 1 times [2018-11-14 19:22:16,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:16,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:16,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:16,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:16,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:16,704 INFO L256 TraceCheckUtils]: 0: Hoare triple {2785#true} call ULTIMATE.init(); {2785#true} is VALID [2018-11-14 19:22:16,705 INFO L273 TraceCheckUtils]: 1: Hoare triple {2785#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {2785#true} is VALID [2018-11-14 19:22:16,705 INFO L273 TraceCheckUtils]: 2: Hoare triple {2785#true} assume true; {2785#true} is VALID [2018-11-14 19:22:16,705 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2785#true} {2785#true} #171#return; {2785#true} is VALID [2018-11-14 19:22:16,706 INFO L256 TraceCheckUtils]: 4: Hoare triple {2785#true} call #t~ret7 := main(); {2785#true} is VALID [2018-11-14 19:22:16,706 INFO L273 TraceCheckUtils]: 5: Hoare triple {2785#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; {2785#true} is VALID [2018-11-14 19:22:16,712 INFO L273 TraceCheckUtils]: 6: Hoare triple {2785#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {2787#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:16,712 INFO L273 TraceCheckUtils]: 7: Hoare triple {2787#(<= 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; {2787#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:16,713 INFO L273 TraceCheckUtils]: 8: Hoare triple {2787#(<= 0 main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {2787#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:16,713 INFO L273 TraceCheckUtils]: 9: Hoare triple {2787#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~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; {2788#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:22:16,713 INFO L273 TraceCheckUtils]: 10: Hoare triple {2788#(= 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; {2785#true} is VALID [2018-11-14 19:22:16,714 INFO L273 TraceCheckUtils]: 11: Hoare triple {2785#true} assume !(~__VERIFIER_assert__cond~1 == 0);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {2785#true} is VALID [2018-11-14 19:22:16,715 INFO L273 TraceCheckUtils]: 12: Hoare triple {2785#true} assume ~main__t~0 == ~main__tagbuf_len~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; {2789#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 19:22:16,715 INFO L273 TraceCheckUtils]: 13: Hoare triple {2789#(<= main_~main__t~0 main_~main__tagbuf_len~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; {2790#(not (= 0 main_~__VERIFIER_assert__cond~3))} is VALID [2018-11-14 19:22:16,716 INFO L273 TraceCheckUtils]: 14: Hoare triple {2790#(not (= 0 main_~__VERIFIER_assert__cond~3))} assume ~__VERIFIER_assert__cond~3 == 0; {2786#false} is VALID [2018-11-14 19:22:16,716 INFO L273 TraceCheckUtils]: 15: Hoare triple {2786#false} assume !false; {2786#false} is VALID [2018-11-14 19:22:16,717 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:16,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:16,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:22:16,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 19:22:16,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:16,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:22:16,732 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:16,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:22:16,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:22:16,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:22:16,733 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 6 states. [2018-11-14 19:22:17,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:17,117 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-14 19:22:17,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:22:17,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 19:22:17,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:17,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:17,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2018-11-14 19:22:17,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:17,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2018-11-14 19:22:17,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2018-11-14 19:22:17,226 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:17,227 INFO L225 Difference]: With dead ends: 61 [2018-11-14 19:22:17,228 INFO L226 Difference]: Without dead ends: 57 [2018-11-14 19:22:17,228 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:22:17,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-14 19:22:17,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-14 19:22:17,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:17,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 56 states. [2018-11-14 19:22:17,267 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 56 states. [2018-11-14 19:22:17,267 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 56 states. [2018-11-14 19:22:17,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:17,270 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-14 19:22:17,270 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-14 19:22:17,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:17,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:17,270 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 57 states. [2018-11-14 19:22:17,270 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 57 states. [2018-11-14 19:22:17,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:17,272 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-14 19:22:17,272 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-14 19:22:17,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:17,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:17,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:17,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:17,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 19:22:17,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-14 19:22:17,275 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2018-11-14 19:22:17,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:17,275 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-14 19:22:17,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:22:17,275 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-14 19:22:17,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 19:22:17,276 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:17,276 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:17,277 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:17,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:17,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1488745224, now seen corresponding path program 1 times [2018-11-14 19:22:17,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:17,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:17,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:17,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:17,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:17,712 INFO L256 TraceCheckUtils]: 0: Hoare triple {3053#true} call ULTIMATE.init(); {3053#true} is VALID [2018-11-14 19:22:17,713 INFO L273 TraceCheckUtils]: 1: Hoare triple {3053#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {3053#true} is VALID [2018-11-14 19:22:17,713 INFO L273 TraceCheckUtils]: 2: Hoare triple {3053#true} assume true; {3053#true} is VALID [2018-11-14 19:22:17,714 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3053#true} {3053#true} #171#return; {3053#true} is VALID [2018-11-14 19:22:17,714 INFO L256 TraceCheckUtils]: 4: Hoare triple {3053#true} call #t~ret7 := main(); {3053#true} is VALID [2018-11-14 19:22:17,714 INFO L273 TraceCheckUtils]: 5: Hoare triple {3053#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; {3053#true} is VALID [2018-11-14 19:22:17,730 INFO L273 TraceCheckUtils]: 6: Hoare triple {3053#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {3055#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:17,731 INFO L273 TraceCheckUtils]: 7: Hoare triple {3055#(<= 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; {3056#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} is VALID [2018-11-14 19:22:17,732 INFO L273 TraceCheckUtils]: 8: Hoare triple {3056#(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_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; {3057#(and (= main_~__VERIFIER_assert__cond~12 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 19:22:17,733 INFO L273 TraceCheckUtils]: 9: Hoare triple {3057#(and (= main_~__VERIFIER_assert__cond~12 1) (not (= main_~main__tagbuf_len~0 main_~main__t~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; {3058#(or (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (= 0 main_~__VERIFIER_assert__cond~13))} is VALID [2018-11-14 19:22:17,734 INFO L273 TraceCheckUtils]: 10: Hoare triple {3058#(or (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (= 0 main_~__VERIFIER_assert__cond~13))} assume !(~__VERIFIER_assert__cond~13 == 0);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {3059#(<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0)} is VALID [2018-11-14 19:22:17,735 INFO L273 TraceCheckUtils]: 11: Hoare triple {3059#(<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {3060#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 19:22:17,735 INFO L273 TraceCheckUtils]: 12: Hoare triple {3060#(<= main_~main__t~0 main_~main__tagbuf_len~0)} 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; {3060#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 19:22:17,739 INFO L273 TraceCheckUtils]: 13: Hoare triple {3060#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(~main____CPAchecker_TMP_0~1 == 0);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {3060#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 19:22:17,740 INFO L273 TraceCheckUtils]: 14: Hoare triple {3060#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~__VERIFIER_assert__cond~16 == 0);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {3061#(not (= 0 main_~__VERIFIER_assert__cond~17))} is VALID [2018-11-14 19:22:17,740 INFO L273 TraceCheckUtils]: 15: Hoare triple {3061#(not (= 0 main_~__VERIFIER_assert__cond~17))} assume ~__VERIFIER_assert__cond~17 == 0; {3054#false} is VALID [2018-11-14 19:22:17,741 INFO L273 TraceCheckUtils]: 16: Hoare triple {3054#false} assume !false; {3054#false} is VALID [2018-11-14 19:22:17,741 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,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:17,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-14 19:22:17,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-14 19:22:17,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:17,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 19:22:17,757 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:17,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 19:22:17,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 19:22:17,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-14 19:22:17,758 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 9 states. [2018-11-14 19:22:19,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:19,137 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-11-14 19:22:19,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:22:19,137 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-14 19:22:19,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:19,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 19:22:19,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2018-11-14 19:22:19,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 19:22:19,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2018-11-14 19:22:19,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 99 transitions. [2018-11-14 19:22:19,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:19,299 INFO L225 Difference]: With dead ends: 95 [2018-11-14 19:22:19,299 INFO L226 Difference]: Without dead ends: 93 [2018-11-14 19:22:19,299 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-14 19:22:19,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-14 19:22:19,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 54. [2018-11-14 19:22:19,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:19,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 54 states. [2018-11-14 19:22:19,404 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 54 states. [2018-11-14 19:22:19,404 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 54 states. [2018-11-14 19:22:19,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:19,407 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2018-11-14 19:22:19,407 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-11-14 19:22:19,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:19,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:19,408 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 93 states. [2018-11-14 19:22:19,408 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 93 states. [2018-11-14 19:22:19,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:19,411 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2018-11-14 19:22:19,411 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-11-14 19:22:19,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:19,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:19,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:19,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:19,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-14 19:22:19,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-14 19:22:19,414 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2018-11-14 19:22:19,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:19,414 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-14 19:22:19,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 19:22:19,415 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-14 19:22:19,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 19:22:19,415 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:19,415 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:19,416 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:19,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:19,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1705597714, now seen corresponding path program 1 times [2018-11-14 19:22:19,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:19,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:19,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:19,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:19,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:19,522 INFO L256 TraceCheckUtils]: 0: Hoare triple {3431#true} call ULTIMATE.init(); {3431#true} is VALID [2018-11-14 19:22:19,522 INFO L273 TraceCheckUtils]: 1: Hoare triple {3431#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {3431#true} is VALID [2018-11-14 19:22:19,523 INFO L273 TraceCheckUtils]: 2: Hoare triple {3431#true} assume true; {3431#true} is VALID [2018-11-14 19:22:19,523 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3431#true} {3431#true} #171#return; {3431#true} is VALID [2018-11-14 19:22:19,523 INFO L256 TraceCheckUtils]: 4: Hoare triple {3431#true} call #t~ret7 := main(); {3431#true} is VALID [2018-11-14 19:22:19,523 INFO L273 TraceCheckUtils]: 5: Hoare triple {3431#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; {3431#true} is VALID [2018-11-14 19:22:19,524 INFO L273 TraceCheckUtils]: 6: Hoare triple {3431#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {3433#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:19,524 INFO L273 TraceCheckUtils]: 7: Hoare triple {3433#(<= 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; {3433#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:19,525 INFO L273 TraceCheckUtils]: 8: Hoare triple {3433#(<= 0 main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {3433#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:19,525 INFO L273 TraceCheckUtils]: 9: Hoare triple {3433#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~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; {3434#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} is VALID [2018-11-14 19:22:19,526 INFO L273 TraceCheckUtils]: 10: Hoare triple {3434#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} 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; {3433#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:19,526 INFO L273 TraceCheckUtils]: 11: Hoare triple {3433#(<= 0 main_~main__t~0)} assume !(~__VERIFIER_assert__cond~1 == 0);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {3435#(<= 1 main_~main__t~0)} is VALID [2018-11-14 19:22:19,526 INFO L273 TraceCheckUtils]: 12: Hoare triple {3435#(<= 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; {3435#(<= 1 main_~main__t~0)} is VALID [2018-11-14 19:22:19,527 INFO L273 TraceCheckUtils]: 13: Hoare triple {3435#(<= 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; {3435#(<= 1 main_~main__t~0)} is VALID [2018-11-14 19:22:19,528 INFO L273 TraceCheckUtils]: 14: Hoare triple {3435#(<= 1 main_~main__t~0)} assume !(~main____CPAchecker_TMP_4~0 == 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; {3436#(not (= 0 main_~__VERIFIER_assert__cond~4))} is VALID [2018-11-14 19:22:19,529 INFO L273 TraceCheckUtils]: 15: Hoare triple {3436#(not (= 0 main_~__VERIFIER_assert__cond~4))} assume ~__VERIFIER_assert__cond~4 == 0; {3432#false} is VALID [2018-11-14 19:22:19,529 INFO L273 TraceCheckUtils]: 16: Hoare triple {3432#false} assume !false; {3432#false} is VALID [2018-11-14 19:22:19,530 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:19,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:19,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:22:19,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-14 19:22:19,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:19,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:22:19,564 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:19,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:22:19,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:22:19,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:22:19,565 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 6 states. [2018-11-14 19:22:19,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:19,931 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-11-14 19:22:19,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:22:19,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-14 19:22:19,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:19,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:19,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2018-11-14 19:22:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:19,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2018-11-14 19:22:19,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 78 transitions. [2018-11-14 19:22:20,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:20,045 INFO L225 Difference]: With dead ends: 72 [2018-11-14 19:22:20,045 INFO L226 Difference]: Without dead ends: 70 [2018-11-14 19:22:20,045 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:22:20,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-14 19:22:20,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2018-11-14 19:22:20,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:20,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 52 states. [2018-11-14 19:22:20,099 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 52 states. [2018-11-14 19:22:20,099 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 52 states. [2018-11-14 19:22:20,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:20,101 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-11-14 19:22:20,101 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-11-14 19:22:20,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:20,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:20,104 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 70 states. [2018-11-14 19:22:20,104 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 70 states. [2018-11-14 19:22:20,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:20,105 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-11-14 19:22:20,106 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-11-14 19:22:20,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:20,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:20,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:20,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:20,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-14 19:22:20,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-11-14 19:22:20,108 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2018-11-14 19:22:20,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:20,108 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-11-14 19:22:20,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:22:20,108 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-14 19:22:20,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 19:22:20,109 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:20,109 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:20,109 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:20,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:20,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1704058514, now seen corresponding path program 1 times [2018-11-14 19:22:20,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:20,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:20,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:20,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:20,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:20,531 INFO L256 TraceCheckUtils]: 0: Hoare triple {3728#true} call ULTIMATE.init(); {3728#true} is VALID [2018-11-14 19:22:20,532 INFO L273 TraceCheckUtils]: 1: Hoare triple {3728#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {3728#true} is VALID [2018-11-14 19:22:20,532 INFO L273 TraceCheckUtils]: 2: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 19:22:20,532 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3728#true} {3728#true} #171#return; {3728#true} is VALID [2018-11-14 19:22:20,533 INFO L256 TraceCheckUtils]: 4: Hoare triple {3728#true} call #t~ret7 := main(); {3728#true} is VALID [2018-11-14 19:22:20,533 INFO L273 TraceCheckUtils]: 5: Hoare triple {3728#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; {3728#true} is VALID [2018-11-14 19:22:20,534 INFO L273 TraceCheckUtils]: 6: Hoare triple {3728#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {3730#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:20,534 INFO L273 TraceCheckUtils]: 7: Hoare triple {3730#(<= 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; {3730#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:20,534 INFO L273 TraceCheckUtils]: 8: Hoare triple {3730#(<= 0 main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {3730#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:20,535 INFO L273 TraceCheckUtils]: 9: Hoare triple {3730#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~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; {3731#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} is VALID [2018-11-14 19:22:20,535 INFO L273 TraceCheckUtils]: 10: Hoare triple {3731#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} 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; {3730#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:20,536 INFO L273 TraceCheckUtils]: 11: Hoare triple {3730#(<= 0 main_~main__t~0)} assume !(~__VERIFIER_assert__cond~1 == 0);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {3732#(<= 1 main_~main__t~0)} is VALID [2018-11-14 19:22:20,536 INFO L273 TraceCheckUtils]: 12: Hoare triple {3732#(<= 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; {3732#(<= 1 main_~main__t~0)} is VALID [2018-11-14 19:22:20,536 INFO L273 TraceCheckUtils]: 13: Hoare triple {3732#(<= 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; {3732#(<= 1 main_~main__t~0)} is VALID [2018-11-14 19:22:20,537 INFO L273 TraceCheckUtils]: 14: Hoare triple {3732#(<= 1 main_~main__t~0)} assume !(~main____CPAchecker_TMP_6~0 == 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; {3733#(not (= 0 main_~__VERIFIER_assert__cond~10))} is VALID [2018-11-14 19:22:20,538 INFO L273 TraceCheckUtils]: 15: Hoare triple {3733#(not (= 0 main_~__VERIFIER_assert__cond~10))} assume ~__VERIFIER_assert__cond~10 == 0; {3729#false} is VALID [2018-11-14 19:22:20,539 INFO L273 TraceCheckUtils]: 16: Hoare triple {3729#false} assume !false; {3729#false} is VALID [2018-11-14 19:22:20,540 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,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:20,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:22:20,541 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-14 19:22:20,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:20,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:22:20,555 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:20,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:22:20,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:22:20,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:22:20,556 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-11-14 19:22:20,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:20,972 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-11-14 19:22:20,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:22:20,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-14 19:22:20,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:20,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:20,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2018-11-14 19:22:20,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:20,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2018-11-14 19:22:20,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 57 transitions. [2018-11-14 19:22:21,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:21,028 INFO L225 Difference]: With dead ends: 53 [2018-11-14 19:22:21,028 INFO L226 Difference]: Without dead ends: 51 [2018-11-14 19:22:21,029 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:22:21,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-14 19:22:21,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-14 19:22:21,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:21,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 50 states. [2018-11-14 19:22:21,065 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 50 states. [2018-11-14 19:22:21,065 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 50 states. [2018-11-14 19:22:21,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:21,067 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-14 19:22:21,067 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-14 19:22:21,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:21,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:21,068 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 51 states. [2018-11-14 19:22:21,068 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 51 states. [2018-11-14 19:22:21,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:21,069 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-14 19:22:21,070 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-14 19:22:21,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:21,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:21,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:21,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:21,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 19:22:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-14 19:22:21,072 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2018-11-14 19:22:21,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:21,072 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-14 19:22:21,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:22:21,072 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-14 19:22:21,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 19:22:21,073 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:21,073 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:21,073 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:21,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:21,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1087292366, now seen corresponding path program 1 times [2018-11-14 19:22:21,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:21,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:21,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:21,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:21,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:21,267 INFO L256 TraceCheckUtils]: 0: Hoare triple {3964#true} call ULTIMATE.init(); {3964#true} is VALID [2018-11-14 19:22:21,267 INFO L273 TraceCheckUtils]: 1: Hoare triple {3964#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {3964#true} is VALID [2018-11-14 19:22:21,267 INFO L273 TraceCheckUtils]: 2: Hoare triple {3964#true} assume true; {3964#true} is VALID [2018-11-14 19:22:21,267 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3964#true} {3964#true} #171#return; {3964#true} is VALID [2018-11-14 19:22:21,268 INFO L256 TraceCheckUtils]: 4: Hoare triple {3964#true} call #t~ret7 := main(); {3964#true} is VALID [2018-11-14 19:22:21,268 INFO L273 TraceCheckUtils]: 5: Hoare triple {3964#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; {3964#true} is VALID [2018-11-14 19:22:21,269 INFO L273 TraceCheckUtils]: 6: Hoare triple {3964#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {3966#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:21,270 INFO L273 TraceCheckUtils]: 7: Hoare triple {3966#(<= 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; {3967#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} is VALID [2018-11-14 19:22:21,271 INFO L273 TraceCheckUtils]: 8: Hoare triple {3967#(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_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; {3968#(and (= main_~__VERIFIER_assert__cond~12 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 19:22:21,272 INFO L273 TraceCheckUtils]: 9: Hoare triple {3968#(and (= main_~__VERIFIER_assert__cond~12 1) (not (= main_~main__tagbuf_len~0 main_~main__t~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; {3969#(or (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (= 0 main_~__VERIFIER_assert__cond~13))} is VALID [2018-11-14 19:22:21,272 INFO L273 TraceCheckUtils]: 10: Hoare triple {3969#(or (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (= 0 main_~__VERIFIER_assert__cond~13))} assume !(~__VERIFIER_assert__cond~13 == 0);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {3970#(<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0)} is VALID [2018-11-14 19:22:21,273 INFO L273 TraceCheckUtils]: 11: Hoare triple {3970#(<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {3971#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 19:22:21,274 INFO L273 TraceCheckUtils]: 12: Hoare triple {3971#(<= main_~main__t~0 main_~main__tagbuf_len~0)} 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; {3971#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 19:22:21,275 INFO L273 TraceCheckUtils]: 13: Hoare triple {3971#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main____CPAchecker_TMP_0~1 == 0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {3971#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 19:22:21,275 INFO L273 TraceCheckUtils]: 14: Hoare triple {3971#(<= main_~main__t~0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~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; {3971#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 19:22:21,276 INFO L273 TraceCheckUtils]: 15: Hoare triple {3971#(<= main_~main__t~0 main_~main__tagbuf_len~0)} 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; {3972#(not (= 0 main_~__VERIFIER_assert__cond~1))} is VALID [2018-11-14 19:22:21,277 INFO L273 TraceCheckUtils]: 16: Hoare triple {3972#(not (= 0 main_~__VERIFIER_assert__cond~1))} assume ~__VERIFIER_assert__cond~1 == 0; {3965#false} is VALID [2018-11-14 19:22:21,277 INFO L273 TraceCheckUtils]: 17: Hoare triple {3965#false} assume !false; {3965#false} is VALID [2018-11-14 19:22:21,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:22:21,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:21,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-14 19:22:21,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-14 19:22:21,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:21,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 19:22:21,310 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:21,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 19:22:21,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 19:22:21,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-14 19:22:21,311 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 9 states. [2018-11-14 19:22:21,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:21,787 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-14 19:22:21,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:22:21,787 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-14 19:22:21,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:21,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 19:22:21,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2018-11-14 19:22:21,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 19:22:21,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2018-11-14 19:22:21,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 52 transitions. [2018-11-14 19:22:21,855 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:21,856 INFO L225 Difference]: With dead ends: 51 [2018-11-14 19:22:21,857 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 19:22:21,858 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-14 19:22:21,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 19:22:21,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-11-14 19:22:21,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:21,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 45 states. [2018-11-14 19:22:21,895 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 45 states. [2018-11-14 19:22:21,895 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 45 states. [2018-11-14 19:22:21,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:21,897 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-14 19:22:21,897 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 19:22:21,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:21,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:21,898 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 49 states. [2018-11-14 19:22:21,898 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 49 states. [2018-11-14 19:22:21,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:21,900 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-14 19:22:21,900 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 19:22:21,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:21,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:21,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:21,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:21,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-14 19:22:21,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-14 19:22:21,902 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2018-11-14 19:22:21,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:21,902 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-14 19:22:21,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 19:22:21,902 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-14 19:22:21,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 19:22:21,903 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:21,903 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:21,904 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:21,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:21,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1332553060, now seen corresponding path program 1 times [2018-11-14 19:22:21,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:21,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:21,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:21,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:21,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:22,000 INFO L256 TraceCheckUtils]: 0: Hoare triple {4197#true} call ULTIMATE.init(); {4197#true} is VALID [2018-11-14 19:22:22,001 INFO L273 TraceCheckUtils]: 1: Hoare triple {4197#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {4197#true} is VALID [2018-11-14 19:22:22,001 INFO L273 TraceCheckUtils]: 2: Hoare triple {4197#true} assume true; {4197#true} is VALID [2018-11-14 19:22:22,001 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4197#true} {4197#true} #171#return; {4197#true} is VALID [2018-11-14 19:22:22,002 INFO L256 TraceCheckUtils]: 4: Hoare triple {4197#true} call #t~ret7 := main(); {4197#true} is VALID [2018-11-14 19:22:22,002 INFO L273 TraceCheckUtils]: 5: Hoare triple {4197#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; {4197#true} is VALID [2018-11-14 19:22:22,004 INFO L273 TraceCheckUtils]: 6: Hoare triple {4197#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {4199#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:22,004 INFO L273 TraceCheckUtils]: 7: Hoare triple {4199#(<= 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; {4199#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:22,006 INFO L273 TraceCheckUtils]: 8: Hoare triple {4199#(<= 0 main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {4199#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:22,006 INFO L273 TraceCheckUtils]: 9: Hoare triple {4199#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~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; {4200#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} is VALID [2018-11-14 19:22:22,008 INFO L273 TraceCheckUtils]: 10: Hoare triple {4200#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} 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; {4199#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:22,009 INFO L273 TraceCheckUtils]: 11: Hoare triple {4199#(<= 0 main_~main__t~0)} assume !(~__VERIFIER_assert__cond~1 == 0);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {4201#(<= 1 main_~main__t~0)} is VALID [2018-11-14 19:22:22,011 INFO L273 TraceCheckUtils]: 12: Hoare triple {4201#(<= 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; {4201#(<= 1 main_~main__t~0)} is VALID [2018-11-14 19:22:22,011 INFO L273 TraceCheckUtils]: 13: Hoare triple {4201#(<= 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; {4201#(<= 1 main_~main__t~0)} is VALID [2018-11-14 19:22:22,014 INFO L273 TraceCheckUtils]: 14: Hoare triple {4201#(<= 1 main_~main__t~0)} assume !!(~main____CPAchecker_TMP_4~0 == 0); {4201#(<= 1 main_~main__t~0)} is VALID [2018-11-14 19:22:22,014 INFO L273 TraceCheckUtils]: 15: Hoare triple {4201#(<= 1 main_~main__t~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; {4202#(not (= 0 main_~__VERIFIER_assert__cond~8))} is VALID [2018-11-14 19:22:22,015 INFO L273 TraceCheckUtils]: 16: Hoare triple {4202#(not (= 0 main_~__VERIFIER_assert__cond~8))} assume ~__VERIFIER_assert__cond~8 == 0; {4198#false} is VALID [2018-11-14 19:22:22,015 INFO L273 TraceCheckUtils]: 17: Hoare triple {4198#false} assume !false; {4198#false} is VALID [2018-11-14 19:22:22,016 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,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:22,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:22:22,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-14 19:22:22,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:22,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:22:22,047 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:22,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:22:22,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:22:22,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:22:22,048 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-11-14 19:22:22,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:22,750 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-11-14 19:22:22,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:22:22,750 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-14 19:22:22,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:22,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:22,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2018-11-14 19:22:22,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:22,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2018-11-14 19:22:22,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 75 transitions. [2018-11-14 19:22:22,942 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:22,943 INFO L225 Difference]: With dead ends: 69 [2018-11-14 19:22:22,943 INFO L226 Difference]: Without dead ends: 67 [2018-11-14 19:22:22,944 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:22:22,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-14 19:22:22,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2018-11-14 19:22:22,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:22,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 43 states. [2018-11-14 19:22:22,968 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 43 states. [2018-11-14 19:22:22,968 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 43 states. [2018-11-14 19:22:22,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:22,970 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-11-14 19:22:22,970 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-11-14 19:22:22,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:22,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:22,970 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 67 states. [2018-11-14 19:22:22,971 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 67 states. [2018-11-14 19:22:22,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:22,972 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-11-14 19:22:22,972 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-11-14 19:22:22,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:22,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:22,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:22,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:22,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-14 19:22:22,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-14 19:22:22,973 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2018-11-14 19:22:22,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:22,973 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-14 19:22:22,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:22:22,974 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-14 19:22:22,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 19:22:22,974 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:22,974 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:22,975 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:22,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:22,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1333918480, now seen corresponding path program 1 times [2018-11-14 19:22:22,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:22,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:22,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:22,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:22,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:23,238 INFO L256 TraceCheckUtils]: 0: Hoare triple {4475#true} call ULTIMATE.init(); {4475#true} is VALID [2018-11-14 19:22:23,238 INFO L273 TraceCheckUtils]: 1: Hoare triple {4475#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {4475#true} is VALID [2018-11-14 19:22:23,239 INFO L273 TraceCheckUtils]: 2: Hoare triple {4475#true} assume true; {4475#true} is VALID [2018-11-14 19:22:23,239 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4475#true} {4475#true} #171#return; {4475#true} is VALID [2018-11-14 19:22:23,239 INFO L256 TraceCheckUtils]: 4: Hoare triple {4475#true} call #t~ret7 := main(); {4475#true} is VALID [2018-11-14 19:22:23,239 INFO L273 TraceCheckUtils]: 5: Hoare triple {4475#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; {4475#true} is VALID [2018-11-14 19:22:23,245 INFO L273 TraceCheckUtils]: 6: Hoare triple {4475#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {4477#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:23,246 INFO L273 TraceCheckUtils]: 7: Hoare triple {4477#(<= 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; {4478#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} is VALID [2018-11-14 19:22:23,247 INFO L273 TraceCheckUtils]: 8: Hoare triple {4478#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} assume !(~main____CPAchecker_TMP_0~0 == 0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {4478#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} is VALID [2018-11-14 19:22:23,253 INFO L273 TraceCheckUtils]: 9: Hoare triple {4478#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~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; {4479#(and (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 19:22:23,254 INFO L273 TraceCheckUtils]: 10: Hoare triple {4479#(and (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} 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; {4480#(or (= 0 main_~__VERIFIER_assert__cond~1) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0))} is VALID [2018-11-14 19:22:23,254 INFO L273 TraceCheckUtils]: 11: Hoare triple {4480#(or (= 0 main_~__VERIFIER_assert__cond~1) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0))} assume !(~__VERIFIER_assert__cond~1 == 0);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {4481#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 19:22:23,255 INFO L273 TraceCheckUtils]: 12: Hoare triple {4481#(<= 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; {4481#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 19:22:23,255 INFO L273 TraceCheckUtils]: 13: Hoare triple {4481#(<= 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; {4481#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 19:22:23,255 INFO L273 TraceCheckUtils]: 14: Hoare triple {4481#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main____CPAchecker_TMP_4~0 == 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; {4481#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 19:22:23,256 INFO L273 TraceCheckUtils]: 15: Hoare triple {4481#(<= 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; {4482#(not (= 0 main_~__VERIFIER_assert__cond~5))} is VALID [2018-11-14 19:22:23,257 INFO L273 TraceCheckUtils]: 16: Hoare triple {4482#(not (= 0 main_~__VERIFIER_assert__cond~5))} assume ~__VERIFIER_assert__cond~5 == 0; {4476#false} is VALID [2018-11-14 19:22:23,257 INFO L273 TraceCheckUtils]: 17: Hoare triple {4476#false} assume !false; {4476#false} is VALID [2018-11-14 19:22:23,258 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:23,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:23,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-14 19:22:23,259 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-14 19:22:23,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:23,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 19:22:23,275 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:23,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 19:22:23,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 19:22:23,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:22:23,276 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 8 states. [2018-11-14 19:22:23,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:23,951 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-11-14 19:22:23,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:22:23,951 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-14 19:22:23,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:23,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:22:23,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2018-11-14 19:22:23,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:22:23,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2018-11-14 19:22:23,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2018-11-14 19:22:24,447 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:24,449 INFO L225 Difference]: With dead ends: 57 [2018-11-14 19:22:24,449 INFO L226 Difference]: Without dead ends: 55 [2018-11-14 19:22:24,450 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:24,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-14 19:22:24,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2018-11-14 19:22:24,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:24,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 41 states. [2018-11-14 19:22:24,482 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 41 states. [2018-11-14 19:22:24,482 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 41 states. [2018-11-14 19:22:24,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:24,484 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2018-11-14 19:22:24,484 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-11-14 19:22:24,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:24,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:24,484 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 55 states. [2018-11-14 19:22:24,484 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 55 states. [2018-11-14 19:22:24,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:24,486 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2018-11-14 19:22:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-11-14 19:22:24,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:24,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:24,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:24,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:24,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 19:22:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-14 19:22:24,488 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 18 [2018-11-14 19:22:24,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:24,488 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-14 19:22:24,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 19:22:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-14 19:22:24,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 19:22:24,489 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:24,489 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:24,489 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:24,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:24,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1286203230, now seen corresponding path program 1 times [2018-11-14 19:22:24,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:24,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:24,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:24,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:24,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:24,626 INFO L256 TraceCheckUtils]: 0: Hoare triple {4721#true} call ULTIMATE.init(); {4721#true} is VALID [2018-11-14 19:22:24,626 INFO L273 TraceCheckUtils]: 1: Hoare triple {4721#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {4721#true} is VALID [2018-11-14 19:22:24,626 INFO L273 TraceCheckUtils]: 2: Hoare triple {4721#true} assume true; {4721#true} is VALID [2018-11-14 19:22:24,627 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4721#true} {4721#true} #171#return; {4721#true} is VALID [2018-11-14 19:22:24,627 INFO L256 TraceCheckUtils]: 4: Hoare triple {4721#true} call #t~ret7 := main(); {4721#true} is VALID [2018-11-14 19:22:24,627 INFO L273 TraceCheckUtils]: 5: Hoare triple {4721#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; {4721#true} is VALID [2018-11-14 19:22:24,628 INFO L273 TraceCheckUtils]: 6: Hoare triple {4721#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {4723#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:24,629 INFO L273 TraceCheckUtils]: 7: Hoare triple {4723#(<= 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; {4724#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} is VALID [2018-11-14 19:22:24,629 INFO L273 TraceCheckUtils]: 8: Hoare triple {4724#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} assume !(~main____CPAchecker_TMP_0~0 == 0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {4724#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} is VALID [2018-11-14 19:22:24,630 INFO L273 TraceCheckUtils]: 9: Hoare triple {4724#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~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; {4725#(and (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 19:22:24,630 INFO L273 TraceCheckUtils]: 10: Hoare triple {4725#(and (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} 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; {4726#(or (= 0 main_~__VERIFIER_assert__cond~1) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0))} is VALID [2018-11-14 19:22:24,631 INFO L273 TraceCheckUtils]: 11: Hoare triple {4726#(or (= 0 main_~__VERIFIER_assert__cond~1) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0))} assume !(~__VERIFIER_assert__cond~1 == 0);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {4727#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 19:22:24,632 INFO L273 TraceCheckUtils]: 12: Hoare triple {4727#(<= 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; {4727#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 19:22:24,632 INFO L273 TraceCheckUtils]: 13: Hoare triple {4727#(<= 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; {4727#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 19:22:24,633 INFO L273 TraceCheckUtils]: 14: Hoare triple {4727#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main____CPAchecker_TMP_6~0 == 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; {4727#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 19:22:24,654 INFO L273 TraceCheckUtils]: 15: Hoare triple {4727#(<= 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; {4728#(not (= 0 main_~__VERIFIER_assert__cond~11))} is VALID [2018-11-14 19:22:24,669 INFO L273 TraceCheckUtils]: 16: Hoare triple {4728#(not (= 0 main_~__VERIFIER_assert__cond~11))} assume ~__VERIFIER_assert__cond~11 == 0; {4722#false} is VALID [2018-11-14 19:22:24,669 INFO L273 TraceCheckUtils]: 17: Hoare triple {4722#false} assume !false; {4722#false} is VALID [2018-11-14 19:22:24,670 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:24,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:24,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-14 19:22:24,670 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-14 19:22:24,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:24,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 19:22:24,690 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:24,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 19:22:24,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 19:22:24,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:22:24,691 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-11-14 19:22:25,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:25,120 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-14 19:22:25,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 19:22:25,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-14 19:22:25,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:25,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:22:25,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2018-11-14 19:22:25,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:22:25,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2018-11-14 19:22:25,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2018-11-14 19:22:25,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:25,585 INFO L225 Difference]: With dead ends: 41 [2018-11-14 19:22:25,585 INFO L226 Difference]: Without dead ends: 37 [2018-11-14 19:22:25,586 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:25,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-14 19:22:25,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-14 19:22:25,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:25,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-14 19:22:25,620 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 19:22:25,620 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 19:22:25,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:25,621 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-14 19:22:25,621 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-14 19:22:25,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:25,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:25,622 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 19:22:25,622 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 19:22:25,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:25,623 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-14 19:22:25,623 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-14 19:22:25,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:25,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:25,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:25,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:25,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 19:22:25,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-14 19:22:25,625 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 18 [2018-11-14 19:22:25,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:25,625 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-14 19:22:25,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 19:22:25,625 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-14 19:22:25,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 19:22:25,626 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:25,626 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:25,627 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:25,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:25,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1640531233, now seen corresponding path program 1 times [2018-11-14 19:22:25,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:25,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:25,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:25,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:25,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:25,847 INFO L256 TraceCheckUtils]: 0: Hoare triple {4907#true} call ULTIMATE.init(); {4907#true} is VALID [2018-11-14 19:22:25,848 INFO L273 TraceCheckUtils]: 1: Hoare triple {4907#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {4907#true} is VALID [2018-11-14 19:22:25,848 INFO L273 TraceCheckUtils]: 2: Hoare triple {4907#true} assume true; {4907#true} is VALID [2018-11-14 19:22:25,848 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4907#true} {4907#true} #171#return; {4907#true} is VALID [2018-11-14 19:22:25,849 INFO L256 TraceCheckUtils]: 4: Hoare triple {4907#true} call #t~ret7 := main(); {4907#true} is VALID [2018-11-14 19:22:25,849 INFO L273 TraceCheckUtils]: 5: Hoare triple {4907#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; {4907#true} is VALID [2018-11-14 19:22:25,850 INFO L273 TraceCheckUtils]: 6: Hoare triple {4907#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {4909#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:25,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {4909#(<= 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; {4910#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} is VALID [2018-11-14 19:22:25,851 INFO L273 TraceCheckUtils]: 8: Hoare triple {4910#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} assume !(~main____CPAchecker_TMP_0~0 == 0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {4910#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} is VALID [2018-11-14 19:22:25,851 INFO L273 TraceCheckUtils]: 9: Hoare triple {4910#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~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; {4911#(and (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 19:22:25,852 INFO L273 TraceCheckUtils]: 10: Hoare triple {4911#(and (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} 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; {4912#(or (= 0 main_~__VERIFIER_assert__cond~1) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0))} is VALID [2018-11-14 19:22:25,854 INFO L273 TraceCheckUtils]: 11: Hoare triple {4912#(or (= 0 main_~__VERIFIER_assert__cond~1) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0))} assume !(~__VERIFIER_assert__cond~1 == 0);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {4913#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 19:22:25,855 INFO L273 TraceCheckUtils]: 12: Hoare triple {4913#(<= 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; {4913#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 19:22:25,855 INFO L273 TraceCheckUtils]: 13: Hoare triple {4913#(<= 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; {4913#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 19:22:25,856 INFO L273 TraceCheckUtils]: 14: Hoare triple {4913#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(~main____CPAchecker_TMP_4~0 == 0); {4913#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 19:22:25,857 INFO L273 TraceCheckUtils]: 15: Hoare triple {4913#(<= main_~main__t~0 main_~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; {4913#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 19:22:25,859 INFO L273 TraceCheckUtils]: 16: Hoare triple {4913#(<= 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; {4914#(not (= 0 main_~__VERIFIER_assert__cond~9))} is VALID [2018-11-14 19:22:25,863 INFO L273 TraceCheckUtils]: 17: Hoare triple {4914#(not (= 0 main_~__VERIFIER_assert__cond~9))} assume ~__VERIFIER_assert__cond~9 == 0; {4908#false} is VALID [2018-11-14 19:22:25,863 INFO L273 TraceCheckUtils]: 18: Hoare triple {4908#false} assume !false; {4908#false} is VALID [2018-11-14 19:22:25,864 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:25,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:25,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-14 19:22:25,864 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-14 19:22:25,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:25,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 19:22:25,883 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:25,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 19:22:25,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 19:22:25,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:22:25,884 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2018-11-14 19:22:26,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:26,483 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-14 19:22:26,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:22:26,483 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-14 19:22:26,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:22:26,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2018-11-14 19:22:26,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:22:26,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2018-11-14 19:22:26,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2018-11-14 19:22:26,565 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:26,566 INFO L225 Difference]: With dead ends: 52 [2018-11-14 19:22:26,566 INFO L226 Difference]: Without dead ends: 50 [2018-11-14 19:22:26,566 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:26,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-14 19:22:26,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2018-11-14 19:22:26,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:26,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 35 states. [2018-11-14 19:22:26,593 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 35 states. [2018-11-14 19:22:26,593 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 35 states. [2018-11-14 19:22:26,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:26,594 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-14 19:22:26,594 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-14 19:22:26,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:26,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:26,595 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 50 states. [2018-11-14 19:22:26,595 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 50 states. [2018-11-14 19:22:26,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:26,596 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-14 19:22:26,596 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-14 19:22:26,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:26,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:26,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:26,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:26,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 19:22:26,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-14 19:22:26,598 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2018-11-14 19:22:26,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:26,598 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-14 19:22:26,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 19:22:26,599 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-14 19:22:26,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 19:22:26,599 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:26,599 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:26,600 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:26,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:26,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1995308589, now seen corresponding path program 1 times [2018-11-14 19:22:26,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:26,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:26,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:26,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:26,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:27,310 INFO L256 TraceCheckUtils]: 0: Hoare triple {5132#true} call ULTIMATE.init(); {5132#true} is VALID [2018-11-14 19:22:27,311 INFO L273 TraceCheckUtils]: 1: Hoare triple {5132#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {5132#true} is VALID [2018-11-14 19:22:27,311 INFO L273 TraceCheckUtils]: 2: Hoare triple {5132#true} assume true; {5132#true} is VALID [2018-11-14 19:22:27,311 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5132#true} {5132#true} #171#return; {5132#true} is VALID [2018-11-14 19:22:27,312 INFO L256 TraceCheckUtils]: 4: Hoare triple {5132#true} call #t~ret7 := main(); {5132#true} is VALID [2018-11-14 19:22:27,312 INFO L273 TraceCheckUtils]: 5: Hoare triple {5132#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; {5132#true} is VALID [2018-11-14 19:22:27,317 INFO L273 TraceCheckUtils]: 6: Hoare triple {5132#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {5134#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:27,317 INFO L273 TraceCheckUtils]: 7: Hoare triple {5134#(<= 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; {5134#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:27,318 INFO L273 TraceCheckUtils]: 8: Hoare triple {5134#(<= 0 main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {5134#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:27,318 INFO L273 TraceCheckUtils]: 9: Hoare triple {5134#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~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; {5135#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:22:27,318 INFO L273 TraceCheckUtils]: 10: Hoare triple {5135#(= 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; {5132#true} is VALID [2018-11-14 19:22:27,319 INFO L273 TraceCheckUtils]: 11: Hoare triple {5132#true} assume !(~__VERIFIER_assert__cond~1 == 0);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {5132#true} is VALID [2018-11-14 19:22:27,319 INFO L273 TraceCheckUtils]: 12: Hoare triple {5132#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; {5132#true} is VALID [2018-11-14 19:22:27,319 INFO L273 TraceCheckUtils]: 13: Hoare triple {5132#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; {5132#true} is VALID [2018-11-14 19:22:27,319 INFO L273 TraceCheckUtils]: 14: Hoare triple {5132#true} assume !(~main____CPAchecker_TMP_4~0 == 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; {5136#(or (= 0 main_~__VERIFIER_assert__cond~4) (<= 0 main_~main__t~0))} is VALID [2018-11-14 19:22:27,320 INFO L273 TraceCheckUtils]: 15: Hoare triple {5136#(or (= 0 main_~__VERIFIER_assert__cond~4) (<= 0 main_~main__t~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; {5134#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:27,321 INFO L273 TraceCheckUtils]: 16: Hoare triple {5134#(<= 0 main_~main__t~0)} assume !(~__VERIFIER_assert__cond~5 == 0);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {5137#(<= 1 main_~main__t~0)} is VALID [2018-11-14 19:22:27,322 INFO L273 TraceCheckUtils]: 17: Hoare triple {5137#(<= 1 main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~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; {5138#(not (= 0 main_~__VERIFIER_assert__cond~6))} is VALID [2018-11-14 19:22:27,322 INFO L273 TraceCheckUtils]: 18: Hoare triple {5138#(not (= 0 main_~__VERIFIER_assert__cond~6))} assume ~__VERIFIER_assert__cond~6 == 0; {5133#false} is VALID [2018-11-14 19:22:27,323 INFO L273 TraceCheckUtils]: 19: Hoare triple {5133#false} assume !false; {5133#false} is VALID [2018-11-14 19:22:27,324 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:27,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:27,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 19:22:27,325 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-14 19:22:27,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:27,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 19:22:27,342 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:27,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 19:22:27,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 19:22:27,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:22:27,343 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 7 states. [2018-11-14 19:22:27,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:27,644 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-14 19:22:27,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:22:27,645 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-14 19:22:27,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:27,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:22:27,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2018-11-14 19:22:27,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:22:27,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2018-11-14 19:22:27,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 43 transitions. [2018-11-14 19:22:27,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:27,690 INFO L225 Difference]: With dead ends: 39 [2018-11-14 19:22:27,690 INFO L226 Difference]: Without dead ends: 37 [2018-11-14 19:22:27,690 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:22:27,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-14 19:22:27,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-11-14 19:22:27,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:27,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 33 states. [2018-11-14 19:22:27,727 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 33 states. [2018-11-14 19:22:27,728 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 33 states. [2018-11-14 19:22:27,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:27,729 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-14 19:22:27,729 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-14 19:22:27,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:27,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:27,729 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 37 states. [2018-11-14 19:22:27,730 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 37 states. [2018-11-14 19:22:27,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:27,731 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-14 19:22:27,731 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-14 19:22:27,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:27,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:27,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:27,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:27,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 19:22:27,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-14 19:22:27,732 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2018-11-14 19:22:27,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:27,733 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-14 19:22:27,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 19:22:27,733 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-14 19:22:27,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 19:22:27,733 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:27,734 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:27,734 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:27,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:27,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1725020998, now seen corresponding path program 1 times [2018-11-14 19:22:27,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:27,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:27,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:27,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:27,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:28,288 INFO L256 TraceCheckUtils]: 0: Hoare triple {5313#true} call ULTIMATE.init(); {5313#true} is VALID [2018-11-14 19:22:28,288 INFO L273 TraceCheckUtils]: 1: Hoare triple {5313#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {5313#true} is VALID [2018-11-14 19:22:28,289 INFO L273 TraceCheckUtils]: 2: Hoare triple {5313#true} assume true; {5313#true} is VALID [2018-11-14 19:22:28,289 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5313#true} {5313#true} #171#return; {5313#true} is VALID [2018-11-14 19:22:28,289 INFO L256 TraceCheckUtils]: 4: Hoare triple {5313#true} call #t~ret7 := main(); {5313#true} is VALID [2018-11-14 19:22:28,289 INFO L273 TraceCheckUtils]: 5: Hoare triple {5313#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; {5313#true} is VALID [2018-11-14 19:22:28,290 INFO L273 TraceCheckUtils]: 6: Hoare triple {5313#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {5315#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:28,291 INFO L273 TraceCheckUtils]: 7: Hoare triple {5315#(<= 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; {5315#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:28,293 INFO L273 TraceCheckUtils]: 8: Hoare triple {5315#(<= 0 main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {5315#(<= 0 main_~main__t~0)} is VALID [2018-11-14 19:22:28,294 INFO L273 TraceCheckUtils]: 9: Hoare triple {5315#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~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; {5316#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:22:28,294 INFO L273 TraceCheckUtils]: 10: Hoare triple {5316#(= 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; {5313#true} is VALID [2018-11-14 19:22:28,294 INFO L273 TraceCheckUtils]: 11: Hoare triple {5313#true} assume !(~__VERIFIER_assert__cond~1 == 0);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {5313#true} is VALID [2018-11-14 19:22:28,294 INFO L273 TraceCheckUtils]: 12: Hoare triple {5313#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; {5313#true} is VALID [2018-11-14 19:22:28,295 INFO L273 TraceCheckUtils]: 13: Hoare triple {5313#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; {5313#true} is VALID [2018-11-14 19:22:28,295 INFO L273 TraceCheckUtils]: 14: Hoare triple {5313#true} assume !(~main____CPAchecker_TMP_4~0 == 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; {5313#true} is VALID [2018-11-14 19:22:28,295 INFO L273 TraceCheckUtils]: 15: Hoare triple {5313#true} 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; {5313#true} is VALID [2018-11-14 19:22:28,295 INFO L273 TraceCheckUtils]: 16: Hoare triple {5313#true} assume !(~__VERIFIER_assert__cond~5 == 0);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {5313#true} is VALID [2018-11-14 19:22:28,296 INFO L273 TraceCheckUtils]: 17: Hoare triple {5313#true} assume ~main__t~0 == ~main__tagbuf_len~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; {5317#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 19:22:28,296 INFO L273 TraceCheckUtils]: 18: Hoare triple {5317#(<= 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; {5318#(not (= 0 main_~__VERIFIER_assert__cond~7))} is VALID [2018-11-14 19:22:28,297 INFO L273 TraceCheckUtils]: 19: Hoare triple {5318#(not (= 0 main_~__VERIFIER_assert__cond~7))} assume ~__VERIFIER_assert__cond~7 == 0; {5314#false} is VALID [2018-11-14 19:22:28,297 INFO L273 TraceCheckUtils]: 20: Hoare triple {5314#false} assume !false; {5314#false} is VALID [2018-11-14 19:22:28,298 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:28,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:28,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:22:28,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-14 19:22:28,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:28,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:22:28,319 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:28,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:22:28,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:22:28,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:22:28,321 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 6 states. [2018-11-14 19:22:28,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:28,665 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-14 19:22:28,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:22:28,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-14 19:22:28,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:28,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:28,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2018-11-14 19:22:28,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:28,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2018-11-14 19:22:28,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 41 transitions. [2018-11-14 19:22:28,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:28,710 INFO L225 Difference]: With dead ends: 37 [2018-11-14 19:22:28,710 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 19:22:28,711 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:22:28,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 19:22:28,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 19:22:28,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:28,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 19:22:28,712 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:22:28,713 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:22:28,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:28,713 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:22:28,713 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:22:28,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:28,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:28,714 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:22:28,714 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:22:28,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:28,715 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:22:28,715 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:22:28,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:28,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:28,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:28,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:28,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 19:22:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 19:22:28,716 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-14 19:22:28,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:28,716 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 19:22:28,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:22:28,716 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:22:28,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:28,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 19:22:28,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-14 19:22:28,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-14 19:22:28,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-14 19:22:29,469 WARN L179 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 8 [2018-11-14 19:22:29,976 WARN L179 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2018-11-14 19:22:30,499 WARN L179 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 15 [2018-11-14 19:22:30,538 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-14 19:22:30,538 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-14 19:22:30,538 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:22:30,538 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:22:30,538 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 19:22:30,539 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 19:22:30,539 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 19:22:30,539 INFO L425 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2018-11-14 19:22:30,539 INFO L425 ceAbstractionStarter]: For program point L27(lines 27 363) no Hoare annotation was computed. [2018-11-14 19:22:30,539 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 370) no Hoare annotation was computed. [2018-11-14 19:22:30,539 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-14 19:22:30,540 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 364) no Hoare annotation was computed. [2018-11-14 19:22:30,540 INFO L425 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-11-14 19:22:30,540 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2018-11-14 19:22:30,540 INFO L425 ceAbstractionStarter]: For program point L284(lines 284 358) no Hoare annotation was computed. [2018-11-14 19:22:30,540 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2018-11-14 19:22:30,540 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 240) no Hoare annotation was computed. [2018-11-14 19:22:30,540 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2018-11-14 19:22:30,540 INFO L425 ceAbstractionStarter]: For program point L78(lines 78 88) no Hoare annotation was computed. [2018-11-14 19:22:30,540 INFO L425 ceAbstractionStarter]: For program point L334(line 334) no Hoare annotation was computed. [2018-11-14 19:22:30,540 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 158) no Hoare annotation was computed. [2018-11-14 19:22:30,540 INFO L425 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2018-11-14 19:22:30,540 INFO L425 ceAbstractionStarter]: For program point L37(lines 37 251) no Hoare annotation was computed. [2018-11-14 19:22:30,541 INFO L425 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2018-11-14 19:22:30,541 INFO L425 ceAbstractionStarter]: For program point L120(lines 120 197) no Hoare annotation was computed. [2018-11-14 19:22:30,541 INFO L428 ceAbstractionStarter]: At program point L310(lines 27 363) the Hoare annotation is: true [2018-11-14 19:22:30,541 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 246) no Hoare annotation was computed. [2018-11-14 19:22:30,541 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2018-11-14 19:22:30,541 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 370) no Hoare annotation was computed. [2018-11-14 19:22:30,541 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 194) no Hoare annotation was computed. [2018-11-14 19:22:30,541 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 361) no Hoare annotation was computed. [2018-11-14 19:22:30,541 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 196) no Hoare annotation was computed. [2018-11-14 19:22:30,541 INFO L421 ceAbstractionStarter]: At program point L352(lines 278 359) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~13)) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~12 1) (<= 0 main_~main__t~0)) [2018-11-14 19:22:30,541 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 370) the Hoare annotation is: true [2018-11-14 19:22:30,542 INFO L425 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2018-11-14 19:22:30,542 INFO L425 ceAbstractionStarter]: For program point L344(lines 344 353) no Hoare annotation was computed. [2018-11-14 19:22:30,542 INFO L421 ceAbstractionStarter]: At program point L245(lines 97 247) the Hoare annotation is: (and (= 1 main_~__VERIFIER_assert__cond~0) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (not (= 0 main_~__VERIFIER_assert__cond~1)) (<= 1 main_~main__t~0)) [2018-11-14 19:22:30,542 INFO L425 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-11-14 19:22:30,542 INFO L425 ceAbstractionStarter]: For program point L303(lines 303 311) no Hoare annotation was computed. [2018-11-14 19:22:30,542 INFO L425 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2018-11-14 19:22:30,542 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-14 19:22:30,542 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-14 19:22:30,542 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 247) no Hoare annotation was computed. [2018-11-14 19:22:30,543 INFO L425 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2018-11-14 19:22:30,543 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 357) no Hoare annotation was computed. [2018-11-14 19:22:30,543 INFO L425 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2018-11-14 19:22:30,543 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2018-11-14 19:22:30,543 INFO L425 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2018-11-14 19:22:30,543 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 369) no Hoare annotation was computed. [2018-11-14 19:22:30,543 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-14 19:22:30,543 INFO L425 ceAbstractionStarter]: For program point L230(lines 230 238) no Hoare annotation was computed. [2018-11-14 19:22:30,544 INFO L425 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2018-11-14 19:22:30,544 INFO L425 ceAbstractionStarter]: For program point L346(line 346) no Hoare annotation was computed. [2018-11-14 19:22:30,544 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2018-11-14 19:22:30,544 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2018-11-14 19:22:30,544 INFO L425 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-11-14 19:22:30,544 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 156) no Hoare annotation was computed. [2018-11-14 19:22:30,544 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 249) no Hoare annotation was computed. [2018-11-14 19:22:30,544 INFO L425 ceAbstractionStarter]: For program point L305(line 305) no Hoare annotation was computed. [2018-11-14 19:22:30,544 INFO L425 ceAbstractionStarter]: For program point L272(lines 272 359) no Hoare annotation was computed. [2018-11-14 19:22:30,545 INFO L425 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2018-11-14 19:22:30,545 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 90) no Hoare annotation was computed. [2018-11-14 19:22:30,545 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-11-14 19:22:30,545 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 192) no Hoare annotation was computed. [2018-11-14 19:22:30,545 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 199) no Hoare annotation was computed. [2018-11-14 19:22:30,545 INFO L425 ceAbstractionStarter]: For program point L232(line 232) no Hoare annotation was computed. [2018-11-14 19:22:30,545 INFO L421 ceAbstractionStarter]: At program point L323(lines 27 363) the Hoare annotation is: (and (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2018-11-14 19:22:30,545 INFO L421 ceAbstractionStarter]: At program point L191(lines 55 249) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~0 1) (not (= 0 main_~__VERIFIER_assert__cond~1)) (<= 1 main_~main__t~0)) [2018-11-14 19:22:30,545 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-14 19:22:30,546 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-11-14 19:22:30,546 INFO L425 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2018-11-14 19:22:30,546 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 355) no Hoare annotation was computed. [2018-11-14 19:22:30,546 INFO L425 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2018-11-14 19:22:30,546 INFO L425 ceAbstractionStarter]: For program point L101(lines 101 205) no Hoare annotation was computed. [2018-11-14 19:22:30,546 INFO L425 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-11-14 19:22:30,546 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 313) no Hoare annotation was computed. [2018-11-14 19:22:30,548 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 19:22:30,548 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-14 19:22:30,549 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 19:22:30,549 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:22:30,549 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-14 19:22:30,549 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-14 19:22:30,549 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 19:22:30,549 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:22:30,549 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-14 19:22:30,549 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-14 19:22:30,549 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 19:22:30,550 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2018-11-14 19:22:30,550 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2018-11-14 19:22:30,550 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 19:22:30,550 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2018-11-14 19:22:30,550 WARN L170 areAnnotationChecker]: L261 has no Hoare annotation [2018-11-14 19:22:30,550 WARN L170 areAnnotationChecker]: L261 has no Hoare annotation [2018-11-14 19:22:30,550 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2018-11-14 19:22:30,550 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2018-11-14 19:22:30,551 WARN L170 areAnnotationChecker]: L272 has no Hoare annotation [2018-11-14 19:22:30,551 WARN L170 areAnnotationChecker]: L272 has no Hoare annotation [2018-11-14 19:22:30,551 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2018-11-14 19:22:30,551 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2018-11-14 19:22:30,551 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2018-11-14 19:22:30,551 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2018-11-14 19:22:30,551 WARN L170 areAnnotationChecker]: L274 has no Hoare annotation [2018-11-14 19:22:30,551 WARN L170 areAnnotationChecker]: L274 has no Hoare annotation [2018-11-14 19:22:30,551 WARN L170 areAnnotationChecker]: L284 has no Hoare annotation [2018-11-14 19:22:30,552 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2018-11-14 19:22:30,552 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2018-11-14 19:22:30,552 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2018-11-14 19:22:30,552 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2018-11-14 19:22:30,552 WARN L170 areAnnotationChecker]: L284 has no Hoare annotation [2018-11-14 19:22:30,552 WARN L170 areAnnotationChecker]: L284 has no Hoare annotation [2018-11-14 19:22:30,552 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2018-11-14 19:22:30,552 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2018-11-14 19:22:30,552 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2018-11-14 19:22:30,553 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2018-11-14 19:22:30,553 WARN L170 areAnnotationChecker]: L291 has no Hoare annotation [2018-11-14 19:22:30,553 WARN L170 areAnnotationChecker]: L291 has no Hoare annotation [2018-11-14 19:22:30,553 WARN L170 areAnnotationChecker]: L320 has no Hoare annotation [2018-11-14 19:22:30,553 WARN L170 areAnnotationChecker]: L320 has no Hoare annotation [2018-11-14 19:22:30,553 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2018-11-14 19:22:30,553 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2018-11-14 19:22:30,553 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2018-11-14 19:22:30,553 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2018-11-14 19:22:30,554 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2018-11-14 19:22:30,554 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2018-11-14 19:22:30,554 WARN L170 areAnnotationChecker]: L211 has no Hoare annotation [2018-11-14 19:22:30,554 WARN L170 areAnnotationChecker]: L211 has no Hoare annotation [2018-11-14 19:22:30,554 WARN L170 areAnnotationChecker]: L293 has no Hoare annotation [2018-11-14 19:22:30,554 WARN L170 areAnnotationChecker]: L293 has no Hoare annotation [2018-11-14 19:22:30,554 WARN L170 areAnnotationChecker]: L303 has no Hoare annotation [2018-11-14 19:22:30,554 WARN L170 areAnnotationChecker]: L303 has no Hoare annotation [2018-11-14 19:22:30,554 WARN L170 areAnnotationChecker]: L332 has no Hoare annotation [2018-11-14 19:22:30,555 WARN L170 areAnnotationChecker]: L332 has no Hoare annotation [2018-11-14 19:22:30,555 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2018-11-14 19:22:30,555 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2018-11-14 19:22:30,555 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 19:22:30,555 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2018-11-14 19:22:30,555 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2018-11-14 19:22:30,555 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2018-11-14 19:22:30,555 WARN L170 areAnnotationChecker]: L218 has no Hoare annotation [2018-11-14 19:22:30,555 WARN L170 areAnnotationChecker]: L218 has no Hoare annotation [2018-11-14 19:22:30,556 WARN L170 areAnnotationChecker]: L305 has no Hoare annotation [2018-11-14 19:22:30,556 WARN L170 areAnnotationChecker]: L305 has no Hoare annotation [2018-11-14 19:22:30,556 WARN L170 areAnnotationChecker]: L334 has no Hoare annotation [2018-11-14 19:22:30,556 WARN L170 areAnnotationChecker]: L334 has no Hoare annotation [2018-11-14 19:22:30,556 WARN L170 areAnnotationChecker]: L344 has no Hoare annotation [2018-11-14 19:22:30,556 WARN L170 areAnnotationChecker]: L344 has no Hoare annotation [2018-11-14 19:22:30,556 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2018-11-14 19:22:30,556 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2018-11-14 19:22:30,556 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2018-11-14 19:22:30,556 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2018-11-14 19:22:30,557 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2018-11-14 19:22:30,557 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2018-11-14 19:22:30,557 WARN L170 areAnnotationChecker]: L220 has no Hoare annotation [2018-11-14 19:22:30,557 WARN L170 areAnnotationChecker]: L220 has no Hoare annotation [2018-11-14 19:22:30,557 WARN L170 areAnnotationChecker]: L230 has no Hoare annotation [2018-11-14 19:22:30,557 WARN L170 areAnnotationChecker]: L230 has no Hoare annotation [2018-11-14 19:22:30,557 WARN L170 areAnnotationChecker]: L346 has no Hoare annotation [2018-11-14 19:22:30,557 WARN L170 areAnnotationChecker]: L346 has no Hoare annotation [2018-11-14 19:22:30,557 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2018-11-14 19:22:30,558 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2018-11-14 19:22:30,558 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2018-11-14 19:22:30,558 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2018-11-14 19:22:30,558 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2018-11-14 19:22:30,558 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2018-11-14 19:22:30,558 WARN L170 areAnnotationChecker]: L182 has no Hoare annotation [2018-11-14 19:22:30,558 WARN L170 areAnnotationChecker]: L182 has no Hoare annotation [2018-11-14 19:22:30,558 WARN L170 areAnnotationChecker]: L232 has no Hoare annotation [2018-11-14 19:22:30,558 WARN L170 areAnnotationChecker]: L232 has no Hoare annotation [2018-11-14 19:22:30,558 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2018-11-14 19:22:30,559 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2018-11-14 19:22:30,559 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2018-11-14 19:22:30,559 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2018-11-14 19:22:30,559 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2018-11-14 19:22:30,559 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2018-11-14 19:22:30,559 WARN L170 areAnnotationChecker]: L148 has no Hoare annotation [2018-11-14 19:22:30,559 WARN L170 areAnnotationChecker]: L148 has no Hoare annotation [2018-11-14 19:22:30,559 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2018-11-14 19:22:30,559 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2018-11-14 19:22:30,559 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:30,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 07:22:30 BoogieIcfgContainer [2018-11-14 19:22:30,572 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 19:22:30,574 INFO L168 Benchmark]: Toolchain (without parser) took 24552.22 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -487.3 MB). Peak memory consumption was 555.5 MB. Max. memory is 7.1 GB. [2018-11-14 19:22:30,575 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:22:30,575 INFO L168 Benchmark]: CACSL2BoogieTranslator took 467.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 19:22:30,576 INFO L168 Benchmark]: Boogie Preprocessor took 45.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:22:30,576 INFO L168 Benchmark]: RCFGBuilder took 1203.94 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -741.2 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-14 19:22:30,577 INFO L168 Benchmark]: TraceAbstraction took 22830.27 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 310.9 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 243.4 MB). Peak memory consumption was 554.3 MB. Max. memory is 7.1 GB. [2018-11-14 19:22:30,581 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 467.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1203.94 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -741.2 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22830.27 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 310.9 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 243.4 MB). Peak memory consumption was 554.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 293]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 305]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 346]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 51]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 334]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 274]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 138]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 122]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 220]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 232]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__t - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((1 == __VERIFIER_assert__cond && main__t + 1 <= main__tagbuf_len) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__t - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: ((!(0 == __VERIFIER_assert__cond) && main__t + 1 <= main__tagbuf_len) && __VERIFIER_assert__cond == 1) && 0 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 76 locations, 17 error locations. SAFE Result, 22.7s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 14.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 827 SDtfs, 2052 SDslu, 1390 SDs, 0 SdLazy, 1543 SolverSat, 226 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred 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.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 318 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 12 NumberOfFragments, 64 HoareAnnotationTreeSize, 9 FomulaSimplifications, 282676 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 222 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 11607 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...