java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:11:50,503 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:11:50,508 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:11:50,522 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:11:50,522 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:11:50,523 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:11:50,525 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:11:50,527 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:11:50,528 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:11:50,529 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:11:50,530 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:11:50,531 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:11:50,532 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:11:50,533 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:11:50,534 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:11:50,535 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:11:50,536 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:11:50,538 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:11:50,540 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:11:50,541 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:11:50,543 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:11:50,544 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:11:50,547 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:11:50,547 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:11:50,547 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:11:50,548 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:11:50,549 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:11:50,550 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:11:50,551 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:11:50,552 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:11:50,552 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:11:50,553 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:11:50,553 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:11:50,554 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:11:50,555 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:11:50,556 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:11:50,556 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:11:50,571 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:11:50,572 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:11:50,573 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:11:50,573 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:11:50,573 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:11:50,574 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:11:50,574 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:11:50,574 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:11:50,574 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:11:50,574 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:11:50,575 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:11:50,575 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:11:50,575 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:11:50,575 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:11:50,576 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:11:50,576 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:11:50,576 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:11:50,576 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:11:50,576 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:11:50,577 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:11:50,577 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:11:50,577 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:11:50,577 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:11:50,577 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:11:50,578 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:11:50,578 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:11:50,578 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:11:50,578 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:11:50,578 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:11:50,579 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:11:50,579 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:11:50,626 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:11:50,644 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:11:50,648 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:11:50,650 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:11:50,650 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:11:50,651 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-23 13:11:50,720 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee127e6f8/618b2ffd877a41e6af02e0b3567f24e5/FLAG2a7ae73b5 [2018-11-23 13:11:51,205 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:11:51,206 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-11-23 13:11:51,215 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee127e6f8/618b2ffd877a41e6af02e0b3567f24e5/FLAG2a7ae73b5 [2018-11-23 13:11:51,534 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee127e6f8/618b2ffd877a41e6af02e0b3567f24e5 [2018-11-23 13:11:51,544 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:11:51,545 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:11:51,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:11:51,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:11:51,550 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:11:51,552 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:11:51" (1/1) ... [2018-11-23 13:11:51,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e02680f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:51, skipping insertion in model container [2018-11-23 13:11:51,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:11:51" (1/1) ... [2018-11-23 13:11:51,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:11:51,603 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:11:51,826 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:11:51,831 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:11:51,902 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:11:51,920 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:11:51,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:51 WrapperNode [2018-11-23 13:11:51,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:11:51,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:11:51,922 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:11:51,922 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:11:51,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:51" (1/1) ... [2018-11-23 13:11:51,941 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:51" (1/1) ... [2018-11-23 13:11:51,949 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:11:51,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:11:51,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:11:51,950 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:11:51,961 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:51" (1/1) ... [2018-11-23 13:11:51,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:51" (1/1) ... [2018-11-23 13:11:51,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:51" (1/1) ... [2018-11-23 13:11:51,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:51" (1/1) ... [2018-11-23 13:11:51,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:51" (1/1) ... [2018-11-23 13:11:51,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:51" (1/1) ... [2018-11-23 13:11:51,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:51" (1/1) ... [2018-11-23 13:11:52,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:11:52,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:11:52,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:11:52,001 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:11:52,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:11:52,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:11:52,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:11:52,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:11:52,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:11:52,129 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:11:52,129 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:11:53,247 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:11:53,247 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 13:11:53,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:11:53 BoogieIcfgContainer [2018-11-23 13:11:53,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:11:53,249 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:11:53,250 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:11:53,254 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:11:53,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:11:51" (1/3) ... [2018-11-23 13:11:53,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70007455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:11:53, skipping insertion in model container [2018-11-23 13:11:53,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:51" (2/3) ... [2018-11-23 13:11:53,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70007455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:11:53, skipping insertion in model container [2018-11-23 13:11:53,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:11:53" (3/3) ... [2018-11-23 13:11:53,259 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-11-23 13:11:53,268 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:11:53,275 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-11-23 13:11:53,291 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-11-23 13:11:53,327 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:11:53,327 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:11:53,328 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:11:53,328 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:11:53,328 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:11:53,328 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:11:53,329 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:11:53,329 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:11:53,329 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:11:53,360 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-11-23 13:11:53,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:11:53,366 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:53,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:53,370 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:53,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:53,377 INFO L82 PathProgramCache]: Analyzing trace with hash -355727005, now seen corresponding path program 1 times [2018-11-23 13:11:53,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:53,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:53,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:53,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:53,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:53,769 INFO L256 TraceCheckUtils]: 0: Hoare triple {79#true} call ULTIMATE.init(); {79#true} is VALID [2018-11-23 13:11:53,773 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-23 13:11:53,774 INFO L273 TraceCheckUtils]: 2: Hoare triple {79#true} assume true; {79#true} is VALID [2018-11-23 13:11:53,774 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {79#true} {79#true} #171#return; {79#true} is VALID [2018-11-23 13:11:53,774 INFO L256 TraceCheckUtils]: 4: Hoare triple {79#true} call #t~ret7 := main(); {79#true} is VALID [2018-11-23 13:11:53,775 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-23 13:11:53,780 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-23 13:11:53,789 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-23 13:11:53,791 INFO L273 TraceCheckUtils]: 8: Hoare triple {81#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} assume !!(0 == ~main____CPAchecker_TMP_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-23 13:11:53,795 INFO L273 TraceCheckUtils]: 9: Hoare triple {82#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~12 1))} assume !(0 == ~__VERIFIER_assert__cond~12);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-23 13:11:53,796 INFO L273 TraceCheckUtils]: 10: Hoare triple {83#(not (= 0 main_~__VERIFIER_assert__cond~13))} assume 0 == ~__VERIFIER_assert__cond~13; {80#false} is VALID [2018-11-23 13:11:53,796 INFO L273 TraceCheckUtils]: 11: Hoare triple {80#false} assume !false; {80#false} is VALID [2018-11-23 13:11:53,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:53,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:53,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:11:53,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 13:11:53,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:53,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:11:53,844 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-23 13:11:53,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:11:53,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:11:53,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:11:53,856 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2018-11-23 13:11:54,597 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-23 13:11:55,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:55,711 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2018-11-23 13:11:55,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:11:55,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 13:11:55,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:55,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:11:55,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 172 transitions. [2018-11-23 13:11:55,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:11:55,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 172 transitions. [2018-11-23 13:11:55,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 172 transitions. [2018-11-23 13:11:56,002 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-23 13:11:56,019 INFO L225 Difference]: With dead ends: 129 [2018-11-23 13:11:56,019 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 13:11:56,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:11:56,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 13:11:56,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 69. [2018-11-23 13:11:56,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:56,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 69 states. [2018-11-23 13:11:56,085 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 69 states. [2018-11-23 13:11:56,085 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 69 states. [2018-11-23 13:11:56,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:56,095 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2018-11-23 13:11:56,095 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-11-23 13:11:56,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:56,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:56,097 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 113 states. [2018-11-23 13:11:56,098 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 113 states. [2018-11-23 13:11:56,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:56,107 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2018-11-23 13:11:56,107 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-11-23 13:11:56,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:56,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:56,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:56,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:56,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 13:11:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-23 13:11:56,116 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2018-11-23 13:11:56,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:56,116 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-23 13:11:56,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:11:56,117 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 13:11:56,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:11:56,118 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:56,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:56,119 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:56,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:56,119 INFO L82 PathProgramCache]: Analyzing trace with hash -358961311, now seen corresponding path program 1 times [2018-11-23 13:11:56,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:56,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:56,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:56,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:56,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:56,222 INFO L256 TraceCheckUtils]: 0: Hoare triple {536#true} call ULTIMATE.init(); {536#true} is VALID [2018-11-23 13:11:56,223 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-23 13:11:56,223 INFO L273 TraceCheckUtils]: 2: Hoare triple {536#true} assume true; {536#true} is VALID [2018-11-23 13:11:56,223 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {536#true} {536#true} #171#return; {536#true} is VALID [2018-11-23 13:11:56,224 INFO L256 TraceCheckUtils]: 4: Hoare triple {536#true} call #t~ret7 := main(); {536#true} is VALID [2018-11-23 13:11:56,224 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-23 13:11:56,225 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-23 13:11:56,225 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-23 13:11:56,226 INFO L273 TraceCheckUtils]: 8: Hoare triple {538#(<= 0 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {538#(<= 0 main_~main__t~0)} is VALID [2018-11-23 13:11:56,228 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-23 13:11:56,228 INFO L273 TraceCheckUtils]: 10: Hoare triple {539#(= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {537#false} is VALID [2018-11-23 13:11:56,228 INFO L273 TraceCheckUtils]: 11: Hoare triple {537#false} assume !false; {537#false} is VALID [2018-11-23 13:11:56,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:56,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:56,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:11:56,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 13:11:56,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:56,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 13:11:56,249 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-23 13:11:56,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:11:56,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:11:56,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:11:56,251 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2018-11-23 13:11:56,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:56,517 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 13:11:56,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:11:56,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 13:11:56,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:56,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:11:56,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2018-11-23 13:11:56,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:11:56,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2018-11-23 13:11:56,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 73 transitions. [2018-11-23 13:11:56,740 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:56,743 INFO L225 Difference]: With dead ends: 69 [2018-11-23 13:11:56,744 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 13:11:56,745 INFO L631 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-23 13:11:56,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 13:11:56,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-23 13:11:56,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:56,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 67 states. [2018-11-23 13:11:56,789 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-23 13:11:56,789 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-23 13:11:56,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:56,793 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-23 13:11:56,794 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 13:11:56,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:56,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:56,795 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-23 13:11:56,795 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-23 13:11:56,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:56,799 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-23 13:11:56,799 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 13:11:56,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:56,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:56,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:56,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:56,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 13:11:56,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-23 13:11:56,805 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2018-11-23 13:11:56,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:56,805 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-23 13:11:56,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:11:56,805 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 13:11:56,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:11:56,806 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:56,806 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:56,807 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:56,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:56,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1757104312, now seen corresponding path program 1 times [2018-11-23 13:11:56,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:56,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:56,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:56,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:56,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:56,988 INFO L256 TraceCheckUtils]: 0: Hoare triple {830#true} call ULTIMATE.init(); {830#true} is VALID [2018-11-23 13:11:56,988 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-23 13:11:56,989 INFO L273 TraceCheckUtils]: 2: Hoare triple {830#true} assume true; {830#true} is VALID [2018-11-23 13:11:56,989 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {830#true} {830#true} #171#return; {830#true} is VALID [2018-11-23 13:11:56,990 INFO L256 TraceCheckUtils]: 4: Hoare triple {830#true} call #t~ret7 := main(); {830#true} is VALID [2018-11-23 13:11:56,990 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-23 13:11:56,991 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-23 13:11:56,992 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-23 13:11:56,993 INFO L273 TraceCheckUtils]: 8: Hoare triple {832#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} assume !(0 == ~main____CPAchecker_TMP_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-23 13:11:56,995 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-23 13:11:56,996 INFO L273 TraceCheckUtils]: 10: Hoare triple {833#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~0 1))} assume !(0 == ~__VERIFIER_assert__cond~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-23 13:11:56,997 INFO L273 TraceCheckUtils]: 11: Hoare triple {834#(not (= 0 main_~__VERIFIER_assert__cond~1))} assume 0 == ~__VERIFIER_assert__cond~1; {831#false} is VALID [2018-11-23 13:11:56,998 INFO L273 TraceCheckUtils]: 12: Hoare triple {831#false} assume !false; {831#false} is VALID [2018-11-23 13:11:57,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:57,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:57,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:11:57,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 13:11:57,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:57,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:11:57,023 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-23 13:11:57,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:11:57,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:11:57,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:11:57,024 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2018-11-23 13:11:57,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:57,468 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-11-23 13:11:57,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:11:57,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 13:11:57,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:57,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:11:57,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2018-11-23 13:11:57,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:11:57,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2018-11-23 13:11:57,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2018-11-23 13:11:57,633 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-23 13:11:57,635 INFO L225 Difference]: With dead ends: 73 [2018-11-23 13:11:57,635 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 13:11:57,636 INFO L631 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-23 13:11:57,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 13:11:57,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-11-23 13:11:57,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:57,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 70 states. [2018-11-23 13:11:57,666 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 70 states. [2018-11-23 13:11:57,667 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 70 states. [2018-11-23 13:11:57,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:57,670 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-11-23 13:11:57,670 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-23 13:11:57,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:57,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:57,671 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 71 states. [2018-11-23 13:11:57,671 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 71 states. [2018-11-23 13:11:57,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:57,675 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-11-23 13:11:57,675 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-23 13:11:57,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:57,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:57,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:57,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:57,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 13:11:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-11-23 13:11:57,680 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2018-11-23 13:11:57,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:57,680 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-11-23 13:11:57,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:11:57,680 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 13:11:57,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:11:57,681 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:57,681 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:57,682 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:57,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:57,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1775862844, now seen corresponding path program 1 times [2018-11-23 13:11:57,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:57,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:57,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:57,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:57,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:57,798 INFO L256 TraceCheckUtils]: 0: Hoare triple {1145#true} call ULTIMATE.init(); {1145#true} is VALID [2018-11-23 13:11:57,799 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-23 13:11:57,799 INFO L273 TraceCheckUtils]: 2: Hoare triple {1145#true} assume true; {1145#true} is VALID [2018-11-23 13:11:57,799 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1145#true} {1145#true} #171#return; {1145#true} is VALID [2018-11-23 13:11:57,799 INFO L256 TraceCheckUtils]: 4: Hoare triple {1145#true} call #t~ret7 := main(); {1145#true} is VALID [2018-11-23 13:11:57,800 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-23 13:11:57,801 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-23 13:11:57,801 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-23 13:11:57,803 INFO L273 TraceCheckUtils]: 8: Hoare triple {1147#(<= 0 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_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-23 13:11:57,803 INFO L273 TraceCheckUtils]: 9: Hoare triple {1148#(and (= main_~__VERIFIER_assert__cond~12 1) (<= 0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~12);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-23 13:11:57,804 INFO L273 TraceCheckUtils]: 10: Hoare triple {1147#(<= 0 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {1147#(<= 0 main_~main__t~0)} is VALID [2018-11-23 13:11:57,808 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 := 1 + ~main__t~0; {1149#(<= 1 main_~main__t~0)} is VALID [2018-11-23 13:11:57,809 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-23 13:11:57,810 INFO L273 TraceCheckUtils]: 13: Hoare triple {1150#(not (= 0 main_~__VERIFIER_assert__cond~14))} assume 0 == ~__VERIFIER_assert__cond~14; {1146#false} is VALID [2018-11-23 13:11:57,810 INFO L273 TraceCheckUtils]: 14: Hoare triple {1146#false} assume !false; {1146#false} is VALID [2018-11-23 13:11:57,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:57,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:57,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:11:57,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 13:11:57,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:57,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:11:57,841 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-23 13:11:57,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:11:57,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:11:57,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:11:57,842 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 6 states. [2018-11-23 13:11:58,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:58,583 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-11-23 13:11:58,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:11:58,583 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 13:11:58,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:58,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:11:58,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2018-11-23 13:11:58,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:11:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2018-11-23 13:11:58,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 113 transitions. [2018-11-23 13:11:58,734 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-23 13:11:58,738 INFO L225 Difference]: With dead ends: 107 [2018-11-23 13:11:58,738 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 13:11:58,739 INFO L631 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-23 13:11:58,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 13:11:58,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 68. [2018-11-23 13:11:58,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:58,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 68 states. [2018-11-23 13:11:58,781 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 68 states. [2018-11-23 13:11:58,781 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 68 states. [2018-11-23 13:11:58,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:58,785 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-11-23 13:11:58,785 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-11-23 13:11:58,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:58,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:58,787 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 105 states. [2018-11-23 13:11:58,787 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 105 states. [2018-11-23 13:11:58,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:58,791 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-11-23 13:11:58,791 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-11-23 13:11:58,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:58,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:58,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:58,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:58,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 13:11:58,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-23 13:11:58,796 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2018-11-23 13:11:58,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:58,796 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-23 13:11:58,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:11:58,796 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-23 13:11:58,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:11:58,797 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:58,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:58,798 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:58,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:58,799 INFO L82 PathProgramCache]: Analyzing trace with hash 655192796, now seen corresponding path program 1 times [2018-11-23 13:11:58,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:58,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:58,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:58,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:58,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:58,979 INFO L256 TraceCheckUtils]: 0: Hoare triple {1563#true} call ULTIMATE.init(); {1563#true} is VALID [2018-11-23 13:11:58,979 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-23 13:11:58,980 INFO L273 TraceCheckUtils]: 2: Hoare triple {1563#true} assume true; {1563#true} is VALID [2018-11-23 13:11:58,980 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1563#true} {1563#true} #171#return; {1563#true} is VALID [2018-11-23 13:11:58,981 INFO L256 TraceCheckUtils]: 4: Hoare triple {1563#true} call #t~ret7 := main(); {1563#true} is VALID [2018-11-23 13:11:58,981 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-23 13:11:58,984 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-23 13:11:58,986 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-23 13:11:58,987 INFO L273 TraceCheckUtils]: 8: Hoare triple {1565#(<= 0 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {1565#(<= 0 main_~main__t~0)} is VALID [2018-11-23 13:11:58,988 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-23 13:11:58,990 INFO L273 TraceCheckUtils]: 10: Hoare triple {1566#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~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-23 13:11:58,992 INFO L273 TraceCheckUtils]: 11: Hoare triple {1565#(<= 0 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {1567#(<= 1 main_~main__t~0)} is VALID [2018-11-23 13:11:58,993 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-23 13:11:58,994 INFO L273 TraceCheckUtils]: 13: Hoare triple {1568#(not (= 0 main_~__VERIFIER_assert__cond~2))} assume 0 == ~__VERIFIER_assert__cond~2; {1564#false} is VALID [2018-11-23 13:11:58,994 INFO L273 TraceCheckUtils]: 14: Hoare triple {1564#false} assume !false; {1564#false} is VALID [2018-11-23 13:11:58,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:58,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:58,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:11:58,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 13:11:58,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:58,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:11:59,015 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-23 13:11:59,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:11:59,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:11:59,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:11:59,016 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 6 states. [2018-11-23 13:11:59,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:59,881 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 13:11:59,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:11:59,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 13:11:59,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:11:59,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2018-11-23 13:11:59,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:11:59,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2018-11-23 13:11:59,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2018-11-23 13:11:59,967 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:59,969 INFO L225 Difference]: With dead ends: 69 [2018-11-23 13:11:59,970 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 13:11:59,970 INFO L631 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-23 13:11:59,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 13:12:00,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-11-23 13:12:00,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:00,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 66 states. [2018-11-23 13:12:00,018 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 66 states. [2018-11-23 13:12:00,018 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 66 states. [2018-11-23 13:12:00,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:00,021 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-23 13:12:00,021 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 13:12:00,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:00,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:00,022 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 67 states. [2018-11-23 13:12:00,022 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 67 states. [2018-11-23 13:12:00,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:00,025 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-23 13:12:00,025 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 13:12:00,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:00,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:00,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:00,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:00,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 13:12:00,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-11-23 13:12:00,029 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2018-11-23 13:12:00,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:00,029 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-11-23 13:12:00,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:12:00,029 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-23 13:12:00,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:12:00,030 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:00,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:00,031 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:00,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:00,031 INFO L82 PathProgramCache]: Analyzing trace with hash 783259850, now seen corresponding path program 1 times [2018-11-23 13:12:00,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:00,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:00,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:00,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:00,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:00,127 INFO L256 TraceCheckUtils]: 0: Hoare triple {1863#true} call ULTIMATE.init(); {1863#true} is VALID [2018-11-23 13:12:00,127 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-23 13:12:00,127 INFO L273 TraceCheckUtils]: 2: Hoare triple {1863#true} assume true; {1863#true} is VALID [2018-11-23 13:12:00,128 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1863#true} {1863#true} #171#return; {1863#true} is VALID [2018-11-23 13:12:00,128 INFO L256 TraceCheckUtils]: 4: Hoare triple {1863#true} call #t~ret7 := main(); {1863#true} is VALID [2018-11-23 13:12:00,128 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-23 13:12:00,129 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-23 13:12:00,130 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-23 13:12:00,130 INFO L273 TraceCheckUtils]: 8: Hoare triple {1865#(<= 0 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_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-23 13:12:00,132 INFO L273 TraceCheckUtils]: 9: Hoare triple {1866#(and (= main_~__VERIFIER_assert__cond~12 1) (<= 0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~12);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-23 13:12:00,132 INFO L273 TraceCheckUtils]: 10: Hoare triple {1865#(<= 0 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {1865#(<= 0 main_~main__t~0)} is VALID [2018-11-23 13:12:00,134 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 := 1 + ~main__t~0; {1867#(<= 1 main_~main__t~0)} is VALID [2018-11-23 13:12:00,134 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-23 13:12:00,136 INFO L273 TraceCheckUtils]: 13: Hoare triple {1867#(<= 1 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~1);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-23 13:12:00,138 INFO L273 TraceCheckUtils]: 14: Hoare triple {1868#(not (= 0 main_~__VERIFIER_assert__cond~16))} assume 0 == ~__VERIFIER_assert__cond~16; {1864#false} is VALID [2018-11-23 13:12:00,138 INFO L273 TraceCheckUtils]: 15: Hoare triple {1864#false} assume !false; {1864#false} is VALID [2018-11-23 13:12:00,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:00,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:00,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:12:00,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 13:12:00,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:00,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:12:00,159 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-23 13:12:00,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:12:00,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:12:00,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:12:00,160 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2018-11-23 13:12:01,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:01,030 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2018-11-23 13:12:01,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:12:01,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 13:12:01,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:01,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2018-11-23 13:12:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:01,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2018-11-23 13:12:01,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 155 transitions. [2018-11-23 13:12:01,424 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-23 13:12:01,427 INFO L225 Difference]: With dead ends: 146 [2018-11-23 13:12:01,428 INFO L226 Difference]: Without dead ends: 144 [2018-11-23 13:12:01,428 INFO L631 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-23 13:12:01,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-23 13:12:01,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 64. [2018-11-23 13:12:01,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:01,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 64 states. [2018-11-23 13:12:01,461 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 64 states. [2018-11-23 13:12:01,461 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 64 states. [2018-11-23 13:12:01,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:01,465 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2018-11-23 13:12:01,465 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-11-23 13:12:01,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:01,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:01,466 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 144 states. [2018-11-23 13:12:01,466 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 144 states. [2018-11-23 13:12:01,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:01,471 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2018-11-23 13:12:01,471 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-11-23 13:12:01,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:01,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:01,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:01,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:01,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 13:12:01,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-11-23 13:12:01,474 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 16 [2018-11-23 13:12:01,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:01,474 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-11-23 13:12:01,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:12:01,474 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-23 13:12:01,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:12:01,475 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:01,475 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:01,476 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:01,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:01,476 INFO L82 PathProgramCache]: Analyzing trace with hash 782829867, now seen corresponding path program 1 times [2018-11-23 13:12:01,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:01,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:01,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:01,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:01,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:01,575 INFO L256 TraceCheckUtils]: 0: Hoare triple {2397#true} call ULTIMATE.init(); {2397#true} is VALID [2018-11-23 13:12:01,576 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-23 13:12:01,576 INFO L273 TraceCheckUtils]: 2: Hoare triple {2397#true} assume true; {2397#true} is VALID [2018-11-23 13:12:01,577 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2397#true} {2397#true} #171#return; {2397#true} is VALID [2018-11-23 13:12:01,577 INFO L256 TraceCheckUtils]: 4: Hoare triple {2397#true} call #t~ret7 := main(); {2397#true} is VALID [2018-11-23 13:12:01,577 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-23 13:12:01,578 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-23 13:12:01,578 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-23 13:12:01,579 INFO L273 TraceCheckUtils]: 8: Hoare triple {2399#(<= 0 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_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-23 13:12:01,579 INFO L273 TraceCheckUtils]: 9: Hoare triple {2400#(= main_~__VERIFIER_assert__cond~12 1)} assume !(0 == ~__VERIFIER_assert__cond~12);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-23 13:12:01,579 INFO L273 TraceCheckUtils]: 10: Hoare triple {2397#true} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {2397#true} is VALID [2018-11-23 13:12:01,580 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 := 1 + ~main__t~0; {2397#true} is VALID [2018-11-23 13:12:01,582 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-23 13:12:01,584 INFO L273 TraceCheckUtils]: 13: Hoare triple {2401#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~14);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-23 13:12:01,586 INFO L273 TraceCheckUtils]: 14: Hoare triple {2402#(not (= 0 main_~__VERIFIER_assert__cond~15))} assume 0 == ~__VERIFIER_assert__cond~15; {2398#false} is VALID [2018-11-23 13:12:01,586 INFO L273 TraceCheckUtils]: 15: Hoare triple {2398#false} assume !false; {2398#false} is VALID [2018-11-23 13:12:01,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:01,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:01,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:12:01,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 13:12:01,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:01,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:12:01,601 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-23 13:12:01,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:12:01,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:12:01,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:12:01,602 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-11-23 13:12:02,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:02,109 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-11-23 13:12:02,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:12:02,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 13:12:02,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:02,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:02,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2018-11-23 13:12:02,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2018-11-23 13:12:02,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 105 transitions. [2018-11-23 13:12:02,220 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-23 13:12:02,222 INFO L225 Difference]: With dead ends: 99 [2018-11-23 13:12:02,222 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 13:12:02,223 INFO L631 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-23 13:12:02,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 13:12:02,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 60. [2018-11-23 13:12:02,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:02,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 60 states. [2018-11-23 13:12:02,245 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 60 states. [2018-11-23 13:12:02,245 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 60 states. [2018-11-23 13:12:02,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:02,248 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2018-11-23 13:12:02,248 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2018-11-23 13:12:02,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:02,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:02,249 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 95 states. [2018-11-23 13:12:02,249 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 95 states. [2018-11-23 13:12:02,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:02,251 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2018-11-23 13:12:02,251 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2018-11-23 13:12:02,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:02,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:02,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:02,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:02,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 13:12:02,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-23 13:12:02,254 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2018-11-23 13:12:02,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:02,254 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-23 13:12:02,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:12:02,254 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-23 13:12:02,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:12:02,255 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:02,255 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:02,256 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:02,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:02,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1163856723, now seen corresponding path program 1 times [2018-11-23 13:12:02,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:02,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:02,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:02,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:02,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:02,576 INFO L256 TraceCheckUtils]: 0: Hoare triple {2785#true} call ULTIMATE.init(); {2785#true} is VALID [2018-11-23 13:12:02,577 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-23 13:12:02,577 INFO L273 TraceCheckUtils]: 2: Hoare triple {2785#true} assume true; {2785#true} is VALID [2018-11-23 13:12:02,577 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2785#true} {2785#true} #171#return; {2785#true} is VALID [2018-11-23 13:12:02,578 INFO L256 TraceCheckUtils]: 4: Hoare triple {2785#true} call #t~ret7 := main(); {2785#true} is VALID [2018-11-23 13:12:02,578 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-23 13:12:02,582 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-23 13:12:02,583 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-23 13:12:02,583 INFO L273 TraceCheckUtils]: 8: Hoare triple {2787#(<= 0 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {2787#(<= 0 main_~main__t~0)} is VALID [2018-11-23 13:12:02,584 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-23 13:12:02,584 INFO L273 TraceCheckUtils]: 10: Hoare triple {2788#(= main_~__VERIFIER_assert__cond~0 1)} assume !(0 == ~__VERIFIER_assert__cond~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-23 13:12:02,584 INFO L273 TraceCheckUtils]: 11: Hoare triple {2785#true} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {2785#true} is VALID [2018-11-23 13:12:02,585 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-23 13:12:02,586 INFO L273 TraceCheckUtils]: 13: Hoare triple {2789#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~2);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-23 13:12:02,586 INFO L273 TraceCheckUtils]: 14: Hoare triple {2790#(not (= 0 main_~__VERIFIER_assert__cond~3))} assume 0 == ~__VERIFIER_assert__cond~3; {2786#false} is VALID [2018-11-23 13:12:02,587 INFO L273 TraceCheckUtils]: 15: Hoare triple {2786#false} assume !false; {2786#false} is VALID [2018-11-23 13:12:02,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:02,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:02,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:12:02,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 13:12:02,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:02,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:12:02,639 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-23 13:12:02,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:12:02,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:12:02,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:12:02,641 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 6 states. [2018-11-23 13:12:02,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:02,975 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-23 13:12:02,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:12:02,975 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 13:12:02,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:02,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:02,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2018-11-23 13:12:02,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2018-11-23 13:12:02,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2018-11-23 13:12:03,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:03,091 INFO L225 Difference]: With dead ends: 61 [2018-11-23 13:12:03,091 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 13:12:03,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:12:03,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 13:12:03,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-23 13:12:03,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:03,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 56 states. [2018-11-23 13:12:03,122 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 56 states. [2018-11-23 13:12:03,122 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 56 states. [2018-11-23 13:12:03,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:03,125 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-23 13:12:03,125 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 13:12:03,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:03,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:03,125 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 57 states. [2018-11-23 13:12:03,125 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 57 states. [2018-11-23 13:12:03,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:03,127 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-23 13:12:03,127 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 13:12:03,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:03,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:03,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:03,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:03,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 13:12:03,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-23 13:12:03,130 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2018-11-23 13:12:03,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:03,130 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-23 13:12:03,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:12:03,130 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-23 13:12:03,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:12:03,131 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:03,131 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:03,132 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:03,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:03,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1488745224, now seen corresponding path program 1 times [2018-11-23 13:12:03,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:03,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:03,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:03,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:03,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:03,569 INFO L256 TraceCheckUtils]: 0: Hoare triple {3053#true} call ULTIMATE.init(); {3053#true} is VALID [2018-11-23 13:12:03,569 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-23 13:12:03,569 INFO L273 TraceCheckUtils]: 2: Hoare triple {3053#true} assume true; {3053#true} is VALID [2018-11-23 13:12:03,570 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3053#true} {3053#true} #171#return; {3053#true} is VALID [2018-11-23 13:12:03,570 INFO L256 TraceCheckUtils]: 4: Hoare triple {3053#true} call #t~ret7 := main(); {3053#true} is VALID [2018-11-23 13:12:03,570 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-23 13:12:03,586 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-23 13:12:03,587 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-23 13:12:03,587 INFO L273 TraceCheckUtils]: 8: Hoare triple {3056#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} assume !!(0 == ~main____CPAchecker_TMP_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-23 13:12:03,588 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 !(0 == ~__VERIFIER_assert__cond~12);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-23 13:12:03,589 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 !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {3059#(<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0)} is VALID [2018-11-23 13:12:03,589 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 := 1 + ~main__t~0; {3060#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 13:12:03,590 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-23 13:12:03,594 INFO L273 TraceCheckUtils]: 13: Hoare triple {3060#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~1);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-23 13:12:03,595 INFO L273 TraceCheckUtils]: 14: Hoare triple {3060#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~16);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-23 13:12:03,595 INFO L273 TraceCheckUtils]: 15: Hoare triple {3061#(not (= 0 main_~__VERIFIER_assert__cond~17))} assume 0 == ~__VERIFIER_assert__cond~17; {3054#false} is VALID [2018-11-23 13:12:03,595 INFO L273 TraceCheckUtils]: 16: Hoare triple {3054#false} assume !false; {3054#false} is VALID [2018-11-23 13:12:03,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:03,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:03,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 13:12:03,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-23 13:12:03,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:03,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:12:03,611 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-23 13:12:03,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:12:03,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:12:03,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:12:03,612 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 9 states. [2018-11-23 13:12:04,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:04,950 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-11-23 13:12:04,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:12:04,951 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-23 13:12:04,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:04,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:12:04,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2018-11-23 13:12:04,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:12:04,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2018-11-23 13:12:04,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 99 transitions. [2018-11-23 13:12:05,061 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-23 13:12:05,064 INFO L225 Difference]: With dead ends: 95 [2018-11-23 13:12:05,064 INFO L226 Difference]: Without dead ends: 93 [2018-11-23 13:12:05,065 INFO L631 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-23 13:12:05,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-23 13:12:05,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 54. [2018-11-23 13:12:05,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:05,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 54 states. [2018-11-23 13:12:05,133 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 54 states. [2018-11-23 13:12:05,133 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 54 states. [2018-11-23 13:12:05,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:05,137 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2018-11-23 13:12:05,137 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-11-23 13:12:05,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:05,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:05,138 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 93 states. [2018-11-23 13:12:05,138 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 93 states. [2018-11-23 13:12:05,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:05,141 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2018-11-23 13:12:05,142 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-11-23 13:12:05,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:05,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:05,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:05,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:05,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 13:12:05,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-23 13:12:05,144 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2018-11-23 13:12:05,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:05,144 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-23 13:12:05,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:12:05,145 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-23 13:12:05,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:12:05,145 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:05,145 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:05,146 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:05,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:05,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1705597714, now seen corresponding path program 1 times [2018-11-23 13:12:05,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:05,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:05,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:05,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:05,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:05,247 INFO L256 TraceCheckUtils]: 0: Hoare triple {3431#true} call ULTIMATE.init(); {3431#true} is VALID [2018-11-23 13:12:05,248 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-23 13:12:05,248 INFO L273 TraceCheckUtils]: 2: Hoare triple {3431#true} assume true; {3431#true} is VALID [2018-11-23 13:12:05,248 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3431#true} {3431#true} #171#return; {3431#true} is VALID [2018-11-23 13:12:05,249 INFO L256 TraceCheckUtils]: 4: Hoare triple {3431#true} call #t~ret7 := main(); {3431#true} is VALID [2018-11-23 13:12:05,249 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-23 13:12:05,250 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-23 13:12:05,250 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-23 13:12:05,250 INFO L273 TraceCheckUtils]: 8: Hoare triple {3433#(<= 0 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {3433#(<= 0 main_~main__t~0)} is VALID [2018-11-23 13:12:05,251 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-23 13:12:05,251 INFO L273 TraceCheckUtils]: 10: Hoare triple {3434#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~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-23 13:12:05,252 INFO L273 TraceCheckUtils]: 11: Hoare triple {3433#(<= 0 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {3435#(<= 1 main_~main__t~0)} is VALID [2018-11-23 13:12:05,252 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-23 13:12:05,253 INFO L273 TraceCheckUtils]: 13: Hoare triple {3435#(<= 1 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_3~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-23 13:12:05,254 INFO L273 TraceCheckUtils]: 14: Hoare triple {3435#(<= 1 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_4~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-23 13:12:05,254 INFO L273 TraceCheckUtils]: 15: Hoare triple {3436#(not (= 0 main_~__VERIFIER_assert__cond~4))} assume 0 == ~__VERIFIER_assert__cond~4; {3432#false} is VALID [2018-11-23 13:12:05,255 INFO L273 TraceCheckUtils]: 16: Hoare triple {3432#false} assume !false; {3432#false} is VALID [2018-11-23 13:12:05,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:05,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:05,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:12:05,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 13:12:05,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:05,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:12:05,282 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-23 13:12:05,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:12:05,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:12:05,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:12:05,283 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 6 states. [2018-11-23 13:12:05,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:05,761 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-11-23 13:12:05,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:12:05,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 13:12:05,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:05,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:05,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2018-11-23 13:12:05,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:05,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2018-11-23 13:12:05,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 78 transitions. [2018-11-23 13:12:05,841 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-23 13:12:05,842 INFO L225 Difference]: With dead ends: 72 [2018-11-23 13:12:05,842 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 13:12:05,843 INFO L631 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-23 13:12:05,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 13:12:05,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2018-11-23 13:12:05,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:05,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 52 states. [2018-11-23 13:12:05,895 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 52 states. [2018-11-23 13:12:05,895 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 52 states. [2018-11-23 13:12:05,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:05,897 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-11-23 13:12:05,898 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-11-23 13:12:05,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:05,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:05,898 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 70 states. [2018-11-23 13:12:05,898 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 70 states. [2018-11-23 13:12:05,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:05,900 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-11-23 13:12:05,900 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-11-23 13:12:05,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:05,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:05,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:05,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:05,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 13:12:05,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-11-23 13:12:05,902 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2018-11-23 13:12:05,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:05,902 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-11-23 13:12:05,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:12:05,903 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 13:12:05,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:12:05,903 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:05,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:05,904 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:05,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:05,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1704058514, now seen corresponding path program 1 times [2018-11-23 13:12:05,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:05,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:05,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:05,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:05,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:06,332 INFO L256 TraceCheckUtils]: 0: Hoare triple {3728#true} call ULTIMATE.init(); {3728#true} is VALID [2018-11-23 13:12:06,333 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-23 13:12:06,333 INFO L273 TraceCheckUtils]: 2: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-23 13:12:06,333 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3728#true} {3728#true} #171#return; {3728#true} is VALID [2018-11-23 13:12:06,333 INFO L256 TraceCheckUtils]: 4: Hoare triple {3728#true} call #t~ret7 := main(); {3728#true} is VALID [2018-11-23 13:12:06,333 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-23 13:12:06,334 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-23 13:12:06,335 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-23 13:12:06,335 INFO L273 TraceCheckUtils]: 8: Hoare triple {3730#(<= 0 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {3730#(<= 0 main_~main__t~0)} is VALID [2018-11-23 13:12:06,336 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-23 13:12:06,336 INFO L273 TraceCheckUtils]: 10: Hoare triple {3731#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~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-23 13:12:06,337 INFO L273 TraceCheckUtils]: 11: Hoare triple {3730#(<= 0 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {3732#(<= 1 main_~main__t~0)} is VALID [2018-11-23 13:12:06,337 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-23 13:12:06,337 INFO L273 TraceCheckUtils]: 13: Hoare triple {3732#(<= 1 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_3~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-23 13:12:06,338 INFO L273 TraceCheckUtils]: 14: Hoare triple {3732#(<= 1 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_6~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-23 13:12:06,339 INFO L273 TraceCheckUtils]: 15: Hoare triple {3733#(not (= 0 main_~__VERIFIER_assert__cond~10))} assume 0 == ~__VERIFIER_assert__cond~10; {3729#false} is VALID [2018-11-23 13:12:06,339 INFO L273 TraceCheckUtils]: 16: Hoare triple {3729#false} assume !false; {3729#false} is VALID [2018-11-23 13:12:06,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:06,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:06,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:12:06,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 13:12:06,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:06,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:12:06,356 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-23 13:12:06,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:12:06,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:12:06,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:12:06,357 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-11-23 13:12:06,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:06,781 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-11-23 13:12:06,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:12:06,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 13:12:06,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:06,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:06,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2018-11-23 13:12:06,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:06,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2018-11-23 13:12:06,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 57 transitions. [2018-11-23 13:12:06,835 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-23 13:12:06,837 INFO L225 Difference]: With dead ends: 53 [2018-11-23 13:12:06,837 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 13:12:06,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:12:06,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 13:12:06,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-23 13:12:06,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:06,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 50 states. [2018-11-23 13:12:06,875 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 50 states. [2018-11-23 13:12:06,875 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 50 states. [2018-11-23 13:12:06,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:06,877 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-23 13:12:06,877 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 13:12:06,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:06,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:06,878 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 51 states. [2018-11-23 13:12:06,878 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 51 states. [2018-11-23 13:12:06,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:06,879 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-23 13:12:06,880 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 13:12:06,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:06,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:06,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:06,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 13:12:06,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-23 13:12:06,881 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2018-11-23 13:12:06,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:06,882 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-23 13:12:06,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:12:06,882 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 13:12:06,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:12:06,882 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:06,883 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:06,883 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:06,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:06,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1087292366, now seen corresponding path program 1 times [2018-11-23 13:12:06,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:06,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:06,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:06,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:06,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:07,069 INFO L256 TraceCheckUtils]: 0: Hoare triple {3964#true} call ULTIMATE.init(); {3964#true} is VALID [2018-11-23 13:12:07,069 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-23 13:12:07,069 INFO L273 TraceCheckUtils]: 2: Hoare triple {3964#true} assume true; {3964#true} is VALID [2018-11-23 13:12:07,069 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3964#true} {3964#true} #171#return; {3964#true} is VALID [2018-11-23 13:12:07,070 INFO L256 TraceCheckUtils]: 4: Hoare triple {3964#true} call #t~ret7 := main(); {3964#true} is VALID [2018-11-23 13:12:07,070 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-23 13:12:07,070 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-23 13:12:07,071 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-23 13:12:07,072 INFO L273 TraceCheckUtils]: 8: Hoare triple {3967#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} assume !!(0 == ~main____CPAchecker_TMP_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-23 13:12:07,073 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 !(0 == ~__VERIFIER_assert__cond~12);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-23 13:12:07,073 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 !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {3970#(<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0)} is VALID [2018-11-23 13:12:07,074 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 := 1 + ~main__t~0; {3971#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 13:12:07,074 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-23 13:12:07,075 INFO L273 TraceCheckUtils]: 13: Hoare triple {3971#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {3971#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 13:12:07,076 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-23 13:12:07,076 INFO L273 TraceCheckUtils]: 15: Hoare triple {3971#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~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-23 13:12:07,077 INFO L273 TraceCheckUtils]: 16: Hoare triple {3972#(not (= 0 main_~__VERIFIER_assert__cond~1))} assume 0 == ~__VERIFIER_assert__cond~1; {3965#false} is VALID [2018-11-23 13:12:07,077 INFO L273 TraceCheckUtils]: 17: Hoare triple {3965#false} assume !false; {3965#false} is VALID [2018-11-23 13:12:07,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:07,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:07,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 13:12:07,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-23 13:12:07,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:07,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:12:07,112 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-23 13:12:07,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:12:07,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:12:07,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:12:07,114 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 9 states. [2018-11-23 13:12:07,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:07,630 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-23 13:12:07,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:12:07,631 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-23 13:12:07,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:07,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:12:07,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2018-11-23 13:12:07,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:12:07,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2018-11-23 13:12:07,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 52 transitions. [2018-11-23 13:12:07,695 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-23 13:12:07,697 INFO L225 Difference]: With dead ends: 51 [2018-11-23 13:12:07,697 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 13:12:07,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:12:07,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 13:12:07,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-11-23 13:12:07,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:07,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 45 states. [2018-11-23 13:12:07,728 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 45 states. [2018-11-23 13:12:07,728 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 45 states. [2018-11-23 13:12:07,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:07,730 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-23 13:12:07,730 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 13:12:07,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:07,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:07,731 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 49 states. [2018-11-23 13:12:07,731 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 49 states. [2018-11-23 13:12:07,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:07,733 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-23 13:12:07,733 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 13:12:07,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:07,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:07,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:07,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:07,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 13:12:07,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-23 13:12:07,735 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2018-11-23 13:12:07,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:07,735 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-23 13:12:07,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:12:07,735 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 13:12:07,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:12:07,736 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:07,736 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:07,737 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:07,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:07,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1332553060, now seen corresponding path program 1 times [2018-11-23 13:12:07,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:07,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:07,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:07,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:07,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:07,826 INFO L256 TraceCheckUtils]: 0: Hoare triple {4197#true} call ULTIMATE.init(); {4197#true} is VALID [2018-11-23 13:12:07,827 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-23 13:12:07,827 INFO L273 TraceCheckUtils]: 2: Hoare triple {4197#true} assume true; {4197#true} is VALID [2018-11-23 13:12:07,827 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4197#true} {4197#true} #171#return; {4197#true} is VALID [2018-11-23 13:12:07,828 INFO L256 TraceCheckUtils]: 4: Hoare triple {4197#true} call #t~ret7 := main(); {4197#true} is VALID [2018-11-23 13:12:07,828 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-23 13:12:07,831 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-23 13:12:07,831 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-23 13:12:07,832 INFO L273 TraceCheckUtils]: 8: Hoare triple {4199#(<= 0 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {4199#(<= 0 main_~main__t~0)} is VALID [2018-11-23 13:12:07,833 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-23 13:12:07,833 INFO L273 TraceCheckUtils]: 10: Hoare triple {4200#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~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-23 13:12:07,834 INFO L273 TraceCheckUtils]: 11: Hoare triple {4199#(<= 0 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {4201#(<= 1 main_~main__t~0)} is VALID [2018-11-23 13:12:07,835 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-23 13:12:07,836 INFO L273 TraceCheckUtils]: 13: Hoare triple {4201#(<= 1 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_3~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-23 13:12:07,836 INFO L273 TraceCheckUtils]: 14: Hoare triple {4201#(<= 1 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_4~0); {4201#(<= 1 main_~main__t~0)} is VALID [2018-11-23 13:12:07,837 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-23 13:12:07,838 INFO L273 TraceCheckUtils]: 16: Hoare triple {4202#(not (= 0 main_~__VERIFIER_assert__cond~8))} assume 0 == ~__VERIFIER_assert__cond~8; {4198#false} is VALID [2018-11-23 13:12:07,838 INFO L273 TraceCheckUtils]: 17: Hoare triple {4198#false} assume !false; {4198#false} is VALID [2018-11-23 13:12:07,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:07,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:07,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:12:07,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 13:12:07,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:07,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:12:07,859 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-23 13:12:07,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:12:07,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:12:07,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:12:07,861 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-11-23 13:12:08,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:08,634 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-11-23 13:12:08,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:12:08,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 13:12:08,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:08,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:08,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2018-11-23 13:12:08,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2018-11-23 13:12:08,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 75 transitions. [2018-11-23 13:12:08,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:08,764 INFO L225 Difference]: With dead ends: 69 [2018-11-23 13:12:08,765 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 13:12:08,765 INFO L631 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-23 13:12:08,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 13:12:08,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2018-11-23 13:12:08,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:08,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 43 states. [2018-11-23 13:12:08,791 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 43 states. [2018-11-23 13:12:08,791 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 43 states. [2018-11-23 13:12:08,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:08,793 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-11-23 13:12:08,793 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-11-23 13:12:08,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:08,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:08,794 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 67 states. [2018-11-23 13:12:08,794 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 67 states. [2018-11-23 13:12:08,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:08,796 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-11-23 13:12:08,796 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-11-23 13:12:08,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:08,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:08,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:08,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:08,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 13:12:08,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-23 13:12:08,797 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2018-11-23 13:12:08,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:08,798 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-23 13:12:08,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:12:08,798 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-23 13:12:08,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:12:08,798 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:08,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:08,799 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:08,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:08,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1333918480, now seen corresponding path program 1 times [2018-11-23 13:12:08,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:08,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:08,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:08,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:08,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:09,055 INFO L256 TraceCheckUtils]: 0: Hoare triple {4475#true} call ULTIMATE.init(); {4475#true} is VALID [2018-11-23 13:12:09,056 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-23 13:12:09,056 INFO L273 TraceCheckUtils]: 2: Hoare triple {4475#true} assume true; {4475#true} is VALID [2018-11-23 13:12:09,057 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4475#true} {4475#true} #171#return; {4475#true} is VALID [2018-11-23 13:12:09,057 INFO L256 TraceCheckUtils]: 4: Hoare triple {4475#true} call #t~ret7 := main(); {4475#true} is VALID [2018-11-23 13:12:09,057 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-23 13:12:09,065 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-23 13:12:09,066 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-23 13:12:09,066 INFO L273 TraceCheckUtils]: 8: Hoare triple {4478#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} assume !(0 == ~main____CPAchecker_TMP_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-23 13:12:09,067 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-23 13:12:09,070 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 !(0 == ~__VERIFIER_assert__cond~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-23 13:12:09,071 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 !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {4481#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 13:12:09,072 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-23 13:12:09,072 INFO L273 TraceCheckUtils]: 13: Hoare triple {4481#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_3~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-23 13:12:09,074 INFO L273 TraceCheckUtils]: 14: Hoare triple {4481#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_4~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-23 13:12:09,074 INFO L273 TraceCheckUtils]: 15: Hoare triple {4481#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~4);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-23 13:12:09,076 INFO L273 TraceCheckUtils]: 16: Hoare triple {4482#(not (= 0 main_~__VERIFIER_assert__cond~5))} assume 0 == ~__VERIFIER_assert__cond~5; {4476#false} is VALID [2018-11-23 13:12:09,076 INFO L273 TraceCheckUtils]: 17: Hoare triple {4476#false} assume !false; {4476#false} is VALID [2018-11-23 13:12:09,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:09,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:09,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 13:12:09,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 13:12:09,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:09,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:12:09,094 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-23 13:12:09,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:12:09,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:12:09,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:12:09,095 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 8 states. [2018-11-23 13:12:09,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:09,756 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-11-23 13:12:09,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:12:09,756 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 13:12:09,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:09,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:12:09,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2018-11-23 13:12:09,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:12:09,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2018-11-23 13:12:09,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2018-11-23 13:12:10,255 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:10,256 INFO L225 Difference]: With dead ends: 57 [2018-11-23 13:12:10,257 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 13:12:10,257 INFO L631 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-23 13:12:10,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 13:12:10,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2018-11-23 13:12:10,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:10,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 41 states. [2018-11-23 13:12:10,286 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 41 states. [2018-11-23 13:12:10,286 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 41 states. [2018-11-23 13:12:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:10,288 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2018-11-23 13:12:10,289 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-11-23 13:12:10,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:10,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:10,290 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 55 states. [2018-11-23 13:12:10,290 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 55 states. [2018-11-23 13:12:10,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:10,291 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2018-11-23 13:12:10,292 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-11-23 13:12:10,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:10,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:10,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:10,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:10,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:12:10,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-23 13:12:10,293 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 18 [2018-11-23 13:12:10,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:10,294 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-23 13:12:10,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:12:10,294 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-23 13:12:10,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:12:10,294 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:10,294 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:10,295 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:10,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:10,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1286203230, now seen corresponding path program 1 times [2018-11-23 13:12:10,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:10,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:10,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:10,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:10,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:10,471 INFO L256 TraceCheckUtils]: 0: Hoare triple {4721#true} call ULTIMATE.init(); {4721#true} is VALID [2018-11-23 13:12:10,472 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-23 13:12:10,472 INFO L273 TraceCheckUtils]: 2: Hoare triple {4721#true} assume true; {4721#true} is VALID [2018-11-23 13:12:10,472 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4721#true} {4721#true} #171#return; {4721#true} is VALID [2018-11-23 13:12:10,472 INFO L256 TraceCheckUtils]: 4: Hoare triple {4721#true} call #t~ret7 := main(); {4721#true} is VALID [2018-11-23 13:12:10,472 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-23 13:12:10,473 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-23 13:12:10,474 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-23 13:12:10,474 INFO L273 TraceCheckUtils]: 8: Hoare triple {4724#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} assume !(0 == ~main____CPAchecker_TMP_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-23 13:12:10,475 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-23 13:12:10,476 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 !(0 == ~__VERIFIER_assert__cond~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-23 13:12:10,477 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 !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {4727#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 13:12:10,477 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-23 13:12:10,477 INFO L273 TraceCheckUtils]: 13: Hoare triple {4727#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_3~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-23 13:12:10,478 INFO L273 TraceCheckUtils]: 14: Hoare triple {4727#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_6~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-23 13:12:10,479 INFO L273 TraceCheckUtils]: 15: Hoare triple {4727#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~10);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-23 13:12:10,479 INFO L273 TraceCheckUtils]: 16: Hoare triple {4728#(not (= 0 main_~__VERIFIER_assert__cond~11))} assume 0 == ~__VERIFIER_assert__cond~11; {4722#false} is VALID [2018-11-23 13:12:10,480 INFO L273 TraceCheckUtils]: 17: Hoare triple {4722#false} assume !false; {4722#false} is VALID [2018-11-23 13:12:10,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:10,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:10,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 13:12:10,481 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 13:12:10,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:10,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:12:10,498 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-23 13:12:10,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:12:10,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:12:10,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:12:10,499 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-11-23 13:12:11,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:11,081 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-23 13:12:11,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:12:11,081 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 13:12:11,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:11,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:12:11,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2018-11-23 13:12:11,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:12:11,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2018-11-23 13:12:11,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2018-11-23 13:12:11,578 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-23 13:12:11,579 INFO L225 Difference]: With dead ends: 41 [2018-11-23 13:12:11,579 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 13:12:11,580 INFO L631 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-23 13:12:11,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 13:12:11,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 13:12:11,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:11,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-23 13:12:11,613 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 13:12:11,613 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 13:12:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:11,615 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 13:12:11,615 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 13:12:11,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:11,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:11,615 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 13:12:11,615 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 13:12:11,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:11,617 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 13:12:11,617 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 13:12:11,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:11,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:11,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:11,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:11,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 13:12:11,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 13:12:11,619 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 18 [2018-11-23 13:12:11,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:11,619 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 13:12:11,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:12:11,619 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 13:12:11,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:12:11,620 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:11,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:11,620 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:11,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:11,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1640531233, now seen corresponding path program 1 times [2018-11-23 13:12:11,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:11,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:11,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:11,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:11,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:11,811 INFO L256 TraceCheckUtils]: 0: Hoare triple {4907#true} call ULTIMATE.init(); {4907#true} is VALID [2018-11-23 13:12:11,811 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-23 13:12:11,812 INFO L273 TraceCheckUtils]: 2: Hoare triple {4907#true} assume true; {4907#true} is VALID [2018-11-23 13:12:11,812 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4907#true} {4907#true} #171#return; {4907#true} is VALID [2018-11-23 13:12:11,812 INFO L256 TraceCheckUtils]: 4: Hoare triple {4907#true} call #t~ret7 := main(); {4907#true} is VALID [2018-11-23 13:12:11,812 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-23 13:12:11,813 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-23 13:12:11,814 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-23 13:12:11,814 INFO L273 TraceCheckUtils]: 8: Hoare triple {4910#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} assume !(0 == ~main____CPAchecker_TMP_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-23 13:12:11,815 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-23 13:12:11,815 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 !(0 == ~__VERIFIER_assert__cond~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-23 13:12:11,817 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 !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {4913#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 13:12:11,818 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-23 13:12:11,818 INFO L273 TraceCheckUtils]: 13: Hoare triple {4913#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_3~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-23 13:12:11,819 INFO L273 TraceCheckUtils]: 14: Hoare triple {4913#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_4~0); {4913#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 13:12:11,820 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-23 13:12:11,823 INFO L273 TraceCheckUtils]: 16: Hoare triple {4913#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~8);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-23 13:12:11,826 INFO L273 TraceCheckUtils]: 17: Hoare triple {4914#(not (= 0 main_~__VERIFIER_assert__cond~9))} assume 0 == ~__VERIFIER_assert__cond~9; {4908#false} is VALID [2018-11-23 13:12:11,827 INFO L273 TraceCheckUtils]: 18: Hoare triple {4908#false} assume !false; {4908#false} is VALID [2018-11-23 13:12:11,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:11,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:11,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 13:12:11,828 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-23 13:12:11,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:11,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:12:11,846 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:11,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:12:11,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:12:11,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:12:11,847 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2018-11-23 13:12:12,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:12,421 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-23 13:12:12,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:12:12,422 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-23 13:12:12,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:12,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:12:12,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2018-11-23 13:12:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:12:12,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2018-11-23 13:12:12,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2018-11-23 13:12:12,484 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-23 13:12:12,485 INFO L225 Difference]: With dead ends: 52 [2018-11-23 13:12:12,485 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 13:12:12,486 INFO L631 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-23 13:12:12,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 13:12:12,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2018-11-23 13:12:12,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:12,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 35 states. [2018-11-23 13:12:12,519 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 35 states. [2018-11-23 13:12:12,519 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 35 states. [2018-11-23 13:12:12,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:12,521 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-23 13:12:12,521 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-23 13:12:12,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:12,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:12,522 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 50 states. [2018-11-23 13:12:12,522 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 50 states. [2018-11-23 13:12:12,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:12,523 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-23 13:12:12,523 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-23 13:12:12,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:12,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:12,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:12,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:12,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:12:12,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-23 13:12:12,525 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2018-11-23 13:12:12,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:12,525 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-23 13:12:12,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:12:12,526 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 13:12:12,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:12:12,526 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:12,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:12,527 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:12,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:12,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1995308589, now seen corresponding path program 1 times [2018-11-23 13:12:12,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:12,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:12,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:12,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:12,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:13,111 INFO L256 TraceCheckUtils]: 0: Hoare triple {5132#true} call ULTIMATE.init(); {5132#true} is VALID [2018-11-23 13:12:13,112 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-23 13:12:13,112 INFO L273 TraceCheckUtils]: 2: Hoare triple {5132#true} assume true; {5132#true} is VALID [2018-11-23 13:12:13,112 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5132#true} {5132#true} #171#return; {5132#true} is VALID [2018-11-23 13:12:13,113 INFO L256 TraceCheckUtils]: 4: Hoare triple {5132#true} call #t~ret7 := main(); {5132#true} is VALID [2018-11-23 13:12:13,113 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-23 13:12:13,113 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-23 13:12:13,114 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-23 13:12:13,116 INFO L273 TraceCheckUtils]: 8: Hoare triple {5134#(<= 0 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {5134#(<= 0 main_~main__t~0)} is VALID [2018-11-23 13:12:13,116 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-23 13:12:13,116 INFO L273 TraceCheckUtils]: 10: Hoare triple {5135#(= main_~__VERIFIER_assert__cond~0 1)} assume !(0 == ~__VERIFIER_assert__cond~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-23 13:12:13,116 INFO L273 TraceCheckUtils]: 11: Hoare triple {5132#true} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {5132#true} is VALID [2018-11-23 13:12:13,117 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-23 13:12:13,117 INFO L273 TraceCheckUtils]: 13: Hoare triple {5132#true} assume !(0 == ~main____CPAchecker_TMP_3~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-23 13:12:13,117 INFO L273 TraceCheckUtils]: 14: Hoare triple {5132#true} assume !(0 == ~main____CPAchecker_TMP_4~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-23 13:12:13,118 INFO L273 TraceCheckUtils]: 15: Hoare triple {5136#(or (= 0 main_~__VERIFIER_assert__cond~4) (<= 0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~4);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-23 13:12:13,118 INFO L273 TraceCheckUtils]: 16: Hoare triple {5134#(<= 0 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {5137#(<= 1 main_~main__t~0)} is VALID [2018-11-23 13:12:13,119 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-23 13:12:13,119 INFO L273 TraceCheckUtils]: 18: Hoare triple {5138#(not (= 0 main_~__VERIFIER_assert__cond~6))} assume 0 == ~__VERIFIER_assert__cond~6; {5133#false} is VALID [2018-11-23 13:12:13,120 INFO L273 TraceCheckUtils]: 19: Hoare triple {5133#false} assume !false; {5133#false} is VALID [2018-11-23 13:12:13,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:13,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:13,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 13:12:13,122 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-23 13:12:13,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:13,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:12:13,139 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:13,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:12:13,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:12:13,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:12:13,140 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 7 states. [2018-11-23 13:12:13,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:13,439 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 13:12:13,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:12:13,440 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-23 13:12:13,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:13,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:12:13,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2018-11-23 13:12:13,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:12:13,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2018-11-23 13:12:13,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 43 transitions. [2018-11-23 13:12:13,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:13,503 INFO L225 Difference]: With dead ends: 39 [2018-11-23 13:12:13,503 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 13:12:13,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:12:13,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 13:12:13,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-11-23 13:12:13,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:13,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 33 states. [2018-11-23 13:12:13,543 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 33 states. [2018-11-23 13:12:13,543 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 33 states. [2018-11-23 13:12:13,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:13,544 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 13:12:13,544 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 13:12:13,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:13,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:13,545 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 37 states. [2018-11-23 13:12:13,545 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 37 states. [2018-11-23 13:12:13,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:13,546 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 13:12:13,546 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 13:12:13,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:13,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:13,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:13,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:13,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:12:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 13:12:13,548 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2018-11-23 13:12:13,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:13,548 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 13:12:13,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:12:13,548 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 13:12:13,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 13:12:13,549 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:13,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:13,550 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:13,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:13,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1725020998, now seen corresponding path program 1 times [2018-11-23 13:12:13,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:13,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:13,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:13,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:13,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:14,199 INFO L256 TraceCheckUtils]: 0: Hoare triple {5313#true} call ULTIMATE.init(); {5313#true} is VALID [2018-11-23 13:12:14,199 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-23 13:12:14,200 INFO L273 TraceCheckUtils]: 2: Hoare triple {5313#true} assume true; {5313#true} is VALID [2018-11-23 13:12:14,200 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5313#true} {5313#true} #171#return; {5313#true} is VALID [2018-11-23 13:12:14,200 INFO L256 TraceCheckUtils]: 4: Hoare triple {5313#true} call #t~ret7 := main(); {5313#true} is VALID [2018-11-23 13:12:14,201 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-23 13:12:14,201 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-23 13:12:14,202 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-23 13:12:14,205 INFO L273 TraceCheckUtils]: 8: Hoare triple {5315#(<= 0 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {5315#(<= 0 main_~main__t~0)} is VALID [2018-11-23 13:12:14,205 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-23 13:12:14,206 INFO L273 TraceCheckUtils]: 10: Hoare triple {5316#(= main_~__VERIFIER_assert__cond~0 1)} assume !(0 == ~__VERIFIER_assert__cond~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-23 13:12:14,206 INFO L273 TraceCheckUtils]: 11: Hoare triple {5313#true} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {5313#true} is VALID [2018-11-23 13:12:14,206 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-23 13:12:14,206 INFO L273 TraceCheckUtils]: 13: Hoare triple {5313#true} assume !(0 == ~main____CPAchecker_TMP_3~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-23 13:12:14,206 INFO L273 TraceCheckUtils]: 14: Hoare triple {5313#true} assume !(0 == ~main____CPAchecker_TMP_4~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-23 13:12:14,206 INFO L273 TraceCheckUtils]: 15: Hoare triple {5313#true} assume !(0 == ~__VERIFIER_assert__cond~4);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-23 13:12:14,206 INFO L273 TraceCheckUtils]: 16: Hoare triple {5313#true} assume !(0 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {5313#true} is VALID [2018-11-23 13:12:14,207 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-23 13:12:14,207 INFO L273 TraceCheckUtils]: 18: Hoare triple {5317#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~6);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-23 13:12:14,211 INFO L273 TraceCheckUtils]: 19: Hoare triple {5318#(not (= 0 main_~__VERIFIER_assert__cond~7))} assume 0 == ~__VERIFIER_assert__cond~7; {5314#false} is VALID [2018-11-23 13:12:14,211 INFO L273 TraceCheckUtils]: 20: Hoare triple {5314#false} assume !false; {5314#false} is VALID [2018-11-23 13:12:14,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:14,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:14,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:12:14,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 13:12:14,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:14,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:12:14,230 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-23 13:12:14,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:12:14,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:12:14,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:12:14,231 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 6 states. [2018-11-23 13:12:14,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:14,560 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 13:12:14,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:12:14,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 13:12:14,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:14,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2018-11-23 13:12:14,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2018-11-23 13:12:14,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 41 transitions. [2018-11-23 13:12:14,603 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:14,603 INFO L225 Difference]: With dead ends: 37 [2018-11-23 13:12:14,603 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:12:14,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:12:14,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:12:14,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:12:14,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:14,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:14,605 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:14,605 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:14,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:14,605 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:12:14,605 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:14,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:14,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:14,606 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:14,606 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:14,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:14,606 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:12:14,606 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:14,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:14,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:14,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:14,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:12:14,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:12:14,607 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-23 13:12:14,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:14,607 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:12:14,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:12:14,607 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:14,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:14,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:12:14,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 13:12:14,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 13:12:14,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 13:12:15,081 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:12:15,082 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:12:15,082 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:12:15,082 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:12:15,082 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:12:15,082 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:12:15,082 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:12:15,082 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 363) no Hoare annotation was computed. [2018-11-23 13:12:15,082 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 370) no Hoare annotation was computed. [2018-11-23 13:12:15,082 INFO L448 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2018-11-23 13:12:15,082 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-23 13:12:15,083 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 364) no Hoare annotation was computed. [2018-11-23 13:12:15,083 INFO L448 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2018-11-23 13:12:15,083 INFO L448 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2018-11-23 13:12:15,083 INFO L448 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-11-23 13:12:15,083 INFO L448 ceAbstractionStarter]: For program point L284(lines 284 358) no Hoare annotation was computed. [2018-11-23 13:12:15,083 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 240) no Hoare annotation was computed. [2018-11-23 13:12:15,083 INFO L448 ceAbstractionStarter]: For program point L78(lines 78 88) no Hoare annotation was computed. [2018-11-23 13:12:15,083 INFO L448 ceAbstractionStarter]: For program point L334(line 334) no Hoare annotation was computed. [2018-11-23 13:12:15,083 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 158) no Hoare annotation was computed. [2018-11-23 13:12:15,083 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 251) no Hoare annotation was computed. [2018-11-23 13:12:15,083 INFO L448 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2018-11-23 13:12:15,083 INFO L448 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2018-11-23 13:12:15,083 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 197) no Hoare annotation was computed. [2018-11-23 13:12:15,084 INFO L448 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2018-11-23 13:12:15,084 INFO L451 ceAbstractionStarter]: At program point L310(lines 27 363) the Hoare annotation is: true [2018-11-23 13:12:15,084 INFO L448 ceAbstractionStarter]: For program point L211(lines 211 246) no Hoare annotation was computed. [2018-11-23 13:12:15,084 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 370) no Hoare annotation was computed. [2018-11-23 13:12:15,084 INFO L448 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2018-11-23 13:12:15,084 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 194) no Hoare annotation was computed. [2018-11-23 13:12:15,084 INFO L448 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2018-11-23 13:12:15,084 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 361) no Hoare annotation was computed. [2018-11-23 13:12:15,084 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 196) no Hoare annotation was computed. [2018-11-23 13:12:15,084 INFO L444 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-23 13:12:15,085 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 370) the Hoare annotation is: true [2018-11-23 13:12:15,085 INFO L448 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2018-11-23 13:12:15,085 INFO L448 ceAbstractionStarter]: For program point L344(lines 344 353) no Hoare annotation was computed. [2018-11-23 13:12:15,085 INFO L448 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-11-23 13:12:15,085 INFO L444 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-23 13:12:15,085 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-11-23 13:12:15,085 INFO L448 ceAbstractionStarter]: For program point L303(lines 303 311) no Hoare annotation was computed. [2018-11-23 13:12:15,085 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-23 13:12:15,085 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-23 13:12:15,086 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 247) no Hoare annotation was computed. [2018-11-23 13:12:15,086 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 357) no Hoare annotation was computed. [2018-11-23 13:12:15,086 INFO L448 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2018-11-23 13:12:15,086 INFO L448 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2018-11-23 13:12:15,086 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2018-11-23 13:12:15,086 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 369) no Hoare annotation was computed. [2018-11-23 13:12:15,086 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2018-11-23 13:12:15,086 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-23 13:12:15,087 INFO L448 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-11-23 13:12:15,087 INFO L448 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2018-11-23 13:12:15,087 INFO L448 ceAbstractionStarter]: For program point L230(lines 230 238) no Hoare annotation was computed. [2018-11-23 13:12:15,087 INFO L448 ceAbstractionStarter]: For program point L346(line 346) no Hoare annotation was computed. [2018-11-23 13:12:15,087 INFO L448 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2018-11-23 13:12:15,087 INFO L448 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2018-11-23 13:12:15,087 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 156) no Hoare annotation was computed. [2018-11-23 13:12:15,087 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 249) no Hoare annotation was computed. [2018-11-23 13:12:15,088 INFO L448 ceAbstractionStarter]: For program point L305(line 305) no Hoare annotation was computed. [2018-11-23 13:12:15,088 INFO L448 ceAbstractionStarter]: For program point L272(lines 272 359) no Hoare annotation was computed. [2018-11-23 13:12:15,088 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 90) no Hoare annotation was computed. [2018-11-23 13:12:15,088 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 192) no Hoare annotation was computed. [2018-11-23 13:12:15,088 INFO L448 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2018-11-23 13:12:15,088 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 199) no Hoare annotation was computed. [2018-11-23 13:12:15,088 INFO L448 ceAbstractionStarter]: For program point L232(line 232) no Hoare annotation was computed. [2018-11-23 13:12:15,088 INFO L444 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-23 13:12:15,088 INFO L444 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-23 13:12:15,089 INFO L448 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2018-11-23 13:12:15,089 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-23 13:12:15,089 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-11-23 13:12:15,089 INFO L448 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2018-11-23 13:12:15,089 INFO L448 ceAbstractionStarter]: For program point L332(lines 332 355) no Hoare annotation was computed. [2018-11-23 13:12:15,089 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 205) no Hoare annotation was computed. [2018-11-23 13:12:15,089 INFO L448 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-11-23 13:12:15,089 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 313) no Hoare annotation was computed. [2018-11-23 13:12:15,091 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:12:15,092 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:12:15,092 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:12:15,092 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:12:15,092 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:12:15,092 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:12:15,092 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:12:15,092 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:12:15,092 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 13:12:15,093 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 13:12:15,093 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:12:15,093 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2018-11-23 13:12:15,093 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2018-11-23 13:12:15,093 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:12:15,093 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2018-11-23 13:12:15,093 WARN L170 areAnnotationChecker]: L261 has no Hoare annotation [2018-11-23 13:12:15,093 WARN L170 areAnnotationChecker]: L261 has no Hoare annotation [2018-11-23 13:12:15,093 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2018-11-23 13:12:15,093 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2018-11-23 13:12:15,094 WARN L170 areAnnotationChecker]: L272 has no Hoare annotation [2018-11-23 13:12:15,094 WARN L170 areAnnotationChecker]: L272 has no Hoare annotation [2018-11-23 13:12:15,094 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2018-11-23 13:12:15,094 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2018-11-23 13:12:15,094 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2018-11-23 13:12:15,094 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2018-11-23 13:12:15,094 WARN L170 areAnnotationChecker]: L274 has no Hoare annotation [2018-11-23 13:12:15,094 WARN L170 areAnnotationChecker]: L274 has no Hoare annotation [2018-11-23 13:12:15,095 WARN L170 areAnnotationChecker]: L284 has no Hoare annotation [2018-11-23 13:12:15,095 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2018-11-23 13:12:15,095 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2018-11-23 13:12:15,095 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2018-11-23 13:12:15,095 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2018-11-23 13:12:15,095 WARN L170 areAnnotationChecker]: L284 has no Hoare annotation [2018-11-23 13:12:15,095 WARN L170 areAnnotationChecker]: L284 has no Hoare annotation [2018-11-23 13:12:15,095 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2018-11-23 13:12:15,095 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2018-11-23 13:12:15,096 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2018-11-23 13:12:15,096 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2018-11-23 13:12:15,096 WARN L170 areAnnotationChecker]: L291 has no Hoare annotation [2018-11-23 13:12:15,096 WARN L170 areAnnotationChecker]: L291 has no Hoare annotation [2018-11-23 13:12:15,096 WARN L170 areAnnotationChecker]: L320 has no Hoare annotation [2018-11-23 13:12:15,096 WARN L170 areAnnotationChecker]: L320 has no Hoare annotation [2018-11-23 13:12:15,096 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2018-11-23 13:12:15,096 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2018-11-23 13:12:15,096 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2018-11-23 13:12:15,096 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2018-11-23 13:12:15,097 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2018-11-23 13:12:15,097 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2018-11-23 13:12:15,097 WARN L170 areAnnotationChecker]: L211 has no Hoare annotation [2018-11-23 13:12:15,097 WARN L170 areAnnotationChecker]: L211 has no Hoare annotation [2018-11-23 13:12:15,097 WARN L170 areAnnotationChecker]: L293 has no Hoare annotation [2018-11-23 13:12:15,097 WARN L170 areAnnotationChecker]: L293 has no Hoare annotation [2018-11-23 13:12:15,097 WARN L170 areAnnotationChecker]: L303 has no Hoare annotation [2018-11-23 13:12:15,097 WARN L170 areAnnotationChecker]: L303 has no Hoare annotation [2018-11-23 13:12:15,097 WARN L170 areAnnotationChecker]: L332 has no Hoare annotation [2018-11-23 13:12:15,098 WARN L170 areAnnotationChecker]: L332 has no Hoare annotation [2018-11-23 13:12:15,098 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2018-11-23 13:12:15,098 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2018-11-23 13:12:15,098 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:12:15,098 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2018-11-23 13:12:15,098 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2018-11-23 13:12:15,098 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2018-11-23 13:12:15,098 WARN L170 areAnnotationChecker]: L218 has no Hoare annotation [2018-11-23 13:12:15,098 WARN L170 areAnnotationChecker]: L218 has no Hoare annotation [2018-11-23 13:12:15,099 WARN L170 areAnnotationChecker]: L305 has no Hoare annotation [2018-11-23 13:12:15,099 WARN L170 areAnnotationChecker]: L305 has no Hoare annotation [2018-11-23 13:12:15,099 WARN L170 areAnnotationChecker]: L334 has no Hoare annotation [2018-11-23 13:12:15,099 WARN L170 areAnnotationChecker]: L334 has no Hoare annotation [2018-11-23 13:12:15,099 WARN L170 areAnnotationChecker]: L344 has no Hoare annotation [2018-11-23 13:12:15,099 WARN L170 areAnnotationChecker]: L344 has no Hoare annotation [2018-11-23 13:12:15,099 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2018-11-23 13:12:15,099 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2018-11-23 13:12:15,099 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2018-11-23 13:12:15,099 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2018-11-23 13:12:15,100 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2018-11-23 13:12:15,100 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2018-11-23 13:12:15,100 WARN L170 areAnnotationChecker]: L220 has no Hoare annotation [2018-11-23 13:12:15,100 WARN L170 areAnnotationChecker]: L220 has no Hoare annotation [2018-11-23 13:12:15,100 WARN L170 areAnnotationChecker]: L230 has no Hoare annotation [2018-11-23 13:12:15,100 WARN L170 areAnnotationChecker]: L230 has no Hoare annotation [2018-11-23 13:12:15,100 WARN L170 areAnnotationChecker]: L346 has no Hoare annotation [2018-11-23 13:12:15,100 WARN L170 areAnnotationChecker]: L346 has no Hoare annotation [2018-11-23 13:12:15,100 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2018-11-23 13:12:15,100 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2018-11-23 13:12:15,101 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2018-11-23 13:12:15,101 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2018-11-23 13:12:15,101 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2018-11-23 13:12:15,101 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2018-11-23 13:12:15,101 WARN L170 areAnnotationChecker]: L182 has no Hoare annotation [2018-11-23 13:12:15,101 WARN L170 areAnnotationChecker]: L182 has no Hoare annotation [2018-11-23 13:12:15,101 WARN L170 areAnnotationChecker]: L232 has no Hoare annotation [2018-11-23 13:12:15,101 WARN L170 areAnnotationChecker]: L232 has no Hoare annotation [2018-11-23 13:12:15,101 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2018-11-23 13:12:15,101 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2018-11-23 13:12:15,102 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2018-11-23 13:12:15,102 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2018-11-23 13:12:15,102 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2018-11-23 13:12:15,102 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2018-11-23 13:12:15,102 WARN L170 areAnnotationChecker]: L148 has no Hoare annotation [2018-11-23 13:12:15,102 WARN L170 areAnnotationChecker]: L148 has no Hoare annotation [2018-11-23 13:12:15,102 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2018-11-23 13:12:15,102 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2018-11-23 13:12:15,102 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-23 13:12:15,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:12:15 BoogieIcfgContainer [2018-11-23 13:12:15,115 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:12:15,116 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:12:15,116 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:12:15,116 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:12:15,117 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:11:53" (3/4) ... [2018-11-23 13:12:15,121 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:12:15,128 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:12:15,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:12:15,137 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 13:12:15,138 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 13:12:15,251 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c-witness.graphml [2018-11-23 13:12:15,251 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:12:15,256 INFO L168 Benchmark]: Toolchain (without parser) took 23711.74 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: -483.4 MB). Peak memory consumption was 565.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:15,257 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-23 13:12:15,257 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:15,260 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.96 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:12:15,260 INFO L168 Benchmark]: Boogie Preprocessor took 50.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:15,260 INFO L168 Benchmark]: RCFGBuilder took 1247.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 725.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -755.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:15,261 INFO L168 Benchmark]: TraceAbstraction took 21866.70 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 323.5 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 248.0 MB). Peak memory consumption was 571.5 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:15,261 INFO L168 Benchmark]: Witness Printer took 135.72 ms. Allocated memory is still 2.6 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 7.1 GB. [2018-11-23 13:12:15,263 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 374.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 27.96 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1247.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 725.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -755.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21866.70 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 323.5 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 248.0 MB). Peak memory consumption was 571.5 MB. Max. memory is 7.1 GB. * Witness Printer took 135.72 ms. Allocated memory is still 2.6 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 172]: 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: 334]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 293]: 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: 150]: 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: 51]: 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: 110]: 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: 184]: 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: 39]: 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: 80]: 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, 21.7s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 15.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 827 SDtfs, 2052 SDslu, 1390 SDs, 0 SdLazy, 1543 SolverSat, 226 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 3.7s 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, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.5s 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...