/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:23:03,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:23:03,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:23:03,283 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:23:03,283 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:23:03,284 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:23:03,286 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:23:03,287 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:23:03,289 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:23:03,290 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:23:03,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:23:03,292 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:23:03,292 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:23:03,293 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:23:03,294 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:23:03,295 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:23:03,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:23:03,297 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:23:03,299 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:23:03,301 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:23:03,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:23:03,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:23:03,305 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:23:03,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:23:03,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:23:03,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:23:03,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:23:03,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:23:03,310 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:23:03,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:23:03,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:23:03,312 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:23:03,313 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:23:03,313 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:23:03,314 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:23:03,315 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:23:03,315 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:23:03,315 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:23:03,316 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:23:03,316 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:23:03,317 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:23:03,318 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:23:03,327 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:23:03,328 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:23:03,329 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:23:03,329 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:23:03,329 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:23:03,329 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:23:03,330 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:23:03,330 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:23:03,330 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:23:03,330 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:23:03,330 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:23:03,330 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:23:03,331 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:23:03,331 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:23:03,331 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:23:03,333 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:23:03,333 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:23:03,333 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:23:03,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:23:03,334 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:23:03,334 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:23:03,334 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:23:03,334 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:23:03,640 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:23:03,658 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:23:03,661 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:23:03,663 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:23:03,663 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:23:03,664 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i [2020-07-10 20:23:03,741 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f697e9f37/56639e9669654237957f3e91f31b79d8/FLAGbe09b0ef0 [2020-07-10 20:23:04,219 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:23:04,220 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i [2020-07-10 20:23:04,226 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f697e9f37/56639e9669654237957f3e91f31b79d8/FLAGbe09b0ef0 [2020-07-10 20:23:04,712 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f697e9f37/56639e9669654237957f3e91f31b79d8 [2020-07-10 20:23:04,721 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:23:04,724 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:23:04,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:23:04,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:23:04,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:23:04,730 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:23:04" (1/1) ... [2020-07-10 20:23:04,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16c00295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:23:04, skipping insertion in model container [2020-07-10 20:23:04,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:23:04" (1/1) ... [2020-07-10 20:23:04,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:23:04,759 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:23:04,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:23:04,964 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:23:04,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:23:05,002 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:23:05,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:23:05 WrapperNode [2020-07-10 20:23:05,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:23:05,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:23:05,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:23:05,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:23:05,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:23:05" (1/1) ... [2020-07-10 20:23:05,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:23:05" (1/1) ... [2020-07-10 20:23:05,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:23:05" (1/1) ... [2020-07-10 20:23:05,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:23:05" (1/1) ... [2020-07-10 20:23:05,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:23:05" (1/1) ... [2020-07-10 20:23:05,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:23:05" (1/1) ... [2020-07-10 20:23:05,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:23:05" (1/1) ... [2020-07-10 20:23:05,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:23:05,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:23:05,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:23:05,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:23:05,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:23:05" (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 [2020-07-10 20:23:05,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:23:05,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:23:05,196 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:23:05,196 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:23:05,197 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:23:05,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:23:05,197 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:23:05,197 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:23:05,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:23:05,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:23:05,198 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:23:05,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:23:05,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:23:05,707 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:23:05,708 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 20:23:05,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:23:05 BoogieIcfgContainer [2020-07-10 20:23:05,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:23:05,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:23:05,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:23:05,718 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:23:05,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:23:04" (1/3) ... [2020-07-10 20:23:05,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d7957f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:23:05, skipping insertion in model container [2020-07-10 20:23:05,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:23:05" (2/3) ... [2020-07-10 20:23:05,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d7957f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:23:05, skipping insertion in model container [2020-07-10 20:23:05,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:23:05" (3/3) ... [2020-07-10 20:23:05,722 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i [2020-07-10 20:23:05,733 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:23:05,741 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:23:05,756 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:23:05,781 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:23:05,781 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:23:05,782 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:23:05,782 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:23:05,782 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:23:05,782 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:23:05,783 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:23:05,783 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:23:05,801 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-07-10 20:23:05,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 20:23:05,813 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:05,814 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:05,815 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:05,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:05,822 INFO L82 PathProgramCache]: Analyzing trace with hash -537390573, now seen corresponding path program 1 times [2020-07-10 20:23:05,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:05,832 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [951389407] [2020-07-10 20:23:05,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:05,999 INFO L280 TraceCheckUtils]: 0: Hoare triple {77#true} assume true; {77#true} is VALID [2020-07-10 20:23:05,999 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {77#true} {77#true} #144#return; {77#true} is VALID [2020-07-10 20:23:06,001 INFO L263 TraceCheckUtils]: 0: Hoare triple {77#true} call ULTIMATE.init(); {77#true} is VALID [2020-07-10 20:23:06,001 INFO L280 TraceCheckUtils]: 1: Hoare triple {77#true} assume true; {77#true} is VALID [2020-07-10 20:23:06,003 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {77#true} {77#true} #144#return; {77#true} is VALID [2020-07-10 20:23:06,003 INFO L263 TraceCheckUtils]: 3: Hoare triple {77#true} call #t~ret10 := main(); {77#true} is VALID [2020-07-10 20:23:06,003 INFO L280 TraceCheckUtils]: 4: Hoare triple {77#true} havoc ~tagbuf_len~0; {77#true} is VALID [2020-07-10 20:23:06,004 INFO L280 TraceCheckUtils]: 5: Hoare triple {77#true} havoc ~t~0; {77#true} is VALID [2020-07-10 20:23:06,004 INFO L280 TraceCheckUtils]: 6: Hoare triple {77#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {77#true} is VALID [2020-07-10 20:23:06,005 INFO L280 TraceCheckUtils]: 7: Hoare triple {77#true} ~tagbuf_len~0 := #t~nondet0; {77#true} is VALID [2020-07-10 20:23:06,006 INFO L280 TraceCheckUtils]: 8: Hoare triple {77#true} havoc #t~nondet0; {77#true} is VALID [2020-07-10 20:23:06,006 INFO L280 TraceCheckUtils]: 9: Hoare triple {77#true} assume ~tagbuf_len~0 >= 1; {77#true} is VALID [2020-07-10 20:23:06,006 INFO L280 TraceCheckUtils]: 10: Hoare triple {77#true} ~t~0 := 0; {77#true} is VALID [2020-07-10 20:23:06,007 INFO L280 TraceCheckUtils]: 11: Hoare triple {77#true} #t~pre1 := ~tagbuf_len~0 - 1; {77#true} is VALID [2020-07-10 20:23:06,007 INFO L280 TraceCheckUtils]: 12: Hoare triple {77#true} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {77#true} is VALID [2020-07-10 20:23:06,007 INFO L280 TraceCheckUtils]: 13: Hoare triple {77#true} havoc #t~pre1; {77#true} is VALID [2020-07-10 20:23:06,009 INFO L280 TraceCheckUtils]: 14: Hoare triple {77#true} assume false; {78#false} is VALID [2020-07-10 20:23:06,009 INFO L263 TraceCheckUtils]: 15: Hoare triple {78#false} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {78#false} is VALID [2020-07-10 20:23:06,009 INFO L280 TraceCheckUtils]: 16: Hoare triple {78#false} ~cond := #in~cond; {78#false} is VALID [2020-07-10 20:23:06,010 INFO L280 TraceCheckUtils]: 17: Hoare triple {78#false} assume 0 == ~cond; {78#false} is VALID [2020-07-10 20:23:06,010 INFO L280 TraceCheckUtils]: 18: Hoare triple {78#false} assume !false; {78#false} is VALID [2020-07-10 20:23:06,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:23:06,013 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:06,015 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [951389407] [2020-07-10 20:23:06,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:06,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 20:23:06,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840998535] [2020-07-10 20:23:06,025 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2020-07-10 20:23:06,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:06,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 20:23:06,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:06,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 20:23:06,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:06,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 20:23:06,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 20:23:06,089 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 2 states. [2020-07-10 20:23:06,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:06,338 INFO L93 Difference]: Finished difference Result 134 states and 203 transitions. [2020-07-10 20:23:06,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 20:23:06,338 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2020-07-10 20:23:06,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:06,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 20:23:06,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 203 transitions. [2020-07-10 20:23:06,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 20:23:06,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 203 transitions. [2020-07-10 20:23:06,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 203 transitions. [2020-07-10 20:23:06,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:06,692 INFO L225 Difference]: With dead ends: 134 [2020-07-10 20:23:06,692 INFO L226 Difference]: Without dead ends: 69 [2020-07-10 20:23:06,698 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 20:23:06,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-07-10 20:23:06,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-07-10 20:23:06,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:06,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 69 states. [2020-07-10 20:23:06,772 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 69 states. [2020-07-10 20:23:06,772 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 69 states. [2020-07-10 20:23:06,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:06,781 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2020-07-10 20:23:06,781 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2020-07-10 20:23:06,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:06,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:06,784 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 69 states. [2020-07-10 20:23:06,784 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 69 states. [2020-07-10 20:23:06,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:06,792 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2020-07-10 20:23:06,792 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2020-07-10 20:23:06,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:06,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:06,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:06,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:06,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-10 20:23:06,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2020-07-10 20:23:06,803 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 19 [2020-07-10 20:23:06,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:06,803 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2020-07-10 20:23:06,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 20:23:06,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 69 states and 87 transitions. [2020-07-10 20:23:06,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:06,919 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2020-07-10 20:23:06,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 20:23:06,920 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:06,920 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:06,921 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:23:06,921 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:06,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:06,922 INFO L82 PathProgramCache]: Analyzing trace with hash 471335344, now seen corresponding path program 1 times [2020-07-10 20:23:06,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:06,922 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [38006254] [2020-07-10 20:23:06,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:07,066 INFO L280 TraceCheckUtils]: 0: Hoare triple {627#true} assume true; {627#true} is VALID [2020-07-10 20:23:07,066 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {627#true} {627#true} #144#return; {627#true} is VALID [2020-07-10 20:23:07,067 INFO L263 TraceCheckUtils]: 0: Hoare triple {627#true} call ULTIMATE.init(); {627#true} is VALID [2020-07-10 20:23:07,067 INFO L280 TraceCheckUtils]: 1: Hoare triple {627#true} assume true; {627#true} is VALID [2020-07-10 20:23:07,067 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {627#true} {627#true} #144#return; {627#true} is VALID [2020-07-10 20:23:07,068 INFO L263 TraceCheckUtils]: 3: Hoare triple {627#true} call #t~ret10 := main(); {627#true} is VALID [2020-07-10 20:23:07,068 INFO L280 TraceCheckUtils]: 4: Hoare triple {627#true} havoc ~tagbuf_len~0; {627#true} is VALID [2020-07-10 20:23:07,068 INFO L280 TraceCheckUtils]: 5: Hoare triple {627#true} havoc ~t~0; {627#true} is VALID [2020-07-10 20:23:07,069 INFO L280 TraceCheckUtils]: 6: Hoare triple {627#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {627#true} is VALID [2020-07-10 20:23:07,069 INFO L280 TraceCheckUtils]: 7: Hoare triple {627#true} ~tagbuf_len~0 := #t~nondet0; {627#true} is VALID [2020-07-10 20:23:07,069 INFO L280 TraceCheckUtils]: 8: Hoare triple {627#true} havoc #t~nondet0; {627#true} is VALID [2020-07-10 20:23:07,070 INFO L280 TraceCheckUtils]: 9: Hoare triple {627#true} assume ~tagbuf_len~0 >= 1; {627#true} is VALID [2020-07-10 20:23:07,072 INFO L280 TraceCheckUtils]: 10: Hoare triple {627#true} ~t~0 := 0; {631#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:07,072 INFO L280 TraceCheckUtils]: 11: Hoare triple {631#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {631#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:07,074 INFO L280 TraceCheckUtils]: 12: Hoare triple {631#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {631#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:07,075 INFO L280 TraceCheckUtils]: 13: Hoare triple {631#(<= 0 main_~t~0)} havoc #t~pre1; {631#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:07,076 INFO L280 TraceCheckUtils]: 14: Hoare triple {631#(<= 0 main_~t~0)} assume !false; {631#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:07,077 INFO L280 TraceCheckUtils]: 15: Hoare triple {631#(<= 0 main_~t~0)} assume ~t~0 == ~tagbuf_len~0; {631#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:07,078 INFO L263 TraceCheckUtils]: 16: Hoare triple {631#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {632#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:07,079 INFO L280 TraceCheckUtils]: 17: Hoare triple {632#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {633#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:07,080 INFO L280 TraceCheckUtils]: 18: Hoare triple {633#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {628#false} is VALID [2020-07-10 20:23:07,080 INFO L280 TraceCheckUtils]: 19: Hoare triple {628#false} assume !false; {628#false} is VALID [2020-07-10 20:23:07,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:23:07,084 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:07,085 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [38006254] [2020-07-10 20:23:07,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:07,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:23:07,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768470508] [2020-07-10 20:23:07,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-10 20:23:07,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:07,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:23:07,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:07,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:23:07,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:07,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:23:07,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:23:07,120 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand 5 states. [2020-07-10 20:23:07,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:07,636 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2020-07-10 20:23:07,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:23:07,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-10 20:23:07,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:07,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:23:07,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2020-07-10 20:23:07,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:23:07,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2020-07-10 20:23:07,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 115 transitions. [2020-07-10 20:23:07,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:07,781 INFO L225 Difference]: With dead ends: 91 [2020-07-10 20:23:07,781 INFO L226 Difference]: Without dead ends: 89 [2020-07-10 20:23:07,783 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:23:07,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-10 20:23:07,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2020-07-10 20:23:07,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:07,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 82 states. [2020-07-10 20:23:07,835 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 82 states. [2020-07-10 20:23:07,835 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 82 states. [2020-07-10 20:23:07,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:07,842 INFO L93 Difference]: Finished difference Result 89 states and 113 transitions. [2020-07-10 20:23:07,842 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2020-07-10 20:23:07,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:07,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:07,845 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 89 states. [2020-07-10 20:23:07,845 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 89 states. [2020-07-10 20:23:07,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:07,852 INFO L93 Difference]: Finished difference Result 89 states and 113 transitions. [2020-07-10 20:23:07,852 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2020-07-10 20:23:07,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:07,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:07,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:07,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:07,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-07-10 20:23:07,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions. [2020-07-10 20:23:07,859 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 20 [2020-07-10 20:23:07,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:07,860 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions. [2020-07-10 20:23:07,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:23:07,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 82 states and 104 transitions. [2020-07-10 20:23:07,976 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:07,977 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions. [2020-07-10 20:23:07,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 20:23:07,978 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:07,978 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:07,978 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:23:07,979 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:07,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:07,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1383579147, now seen corresponding path program 1 times [2020-07-10 20:23:07,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:07,980 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [205596540] [2020-07-10 20:23:07,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:08,063 INFO L280 TraceCheckUtils]: 0: Hoare triple {1162#true} assume true; {1162#true} is VALID [2020-07-10 20:23:08,063 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1162#true} {1162#true} #144#return; {1162#true} is VALID [2020-07-10 20:23:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:08,078 INFO L280 TraceCheckUtils]: 0: Hoare triple {1162#true} ~cond := #in~cond; {1162#true} is VALID [2020-07-10 20:23:08,078 INFO L280 TraceCheckUtils]: 1: Hoare triple {1162#true} assume !(0 == ~cond); {1162#true} is VALID [2020-07-10 20:23:08,079 INFO L280 TraceCheckUtils]: 2: Hoare triple {1162#true} assume true; {1162#true} is VALID [2020-07-10 20:23:08,083 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1162#true} {1166#(<= main_~t~0 main_~tagbuf_len~0)} #148#return; {1166#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:08,084 INFO L263 TraceCheckUtils]: 0: Hoare triple {1162#true} call ULTIMATE.init(); {1162#true} is VALID [2020-07-10 20:23:08,084 INFO L280 TraceCheckUtils]: 1: Hoare triple {1162#true} assume true; {1162#true} is VALID [2020-07-10 20:23:08,084 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1162#true} {1162#true} #144#return; {1162#true} is VALID [2020-07-10 20:23:08,085 INFO L263 TraceCheckUtils]: 3: Hoare triple {1162#true} call #t~ret10 := main(); {1162#true} is VALID [2020-07-10 20:23:08,085 INFO L280 TraceCheckUtils]: 4: Hoare triple {1162#true} havoc ~tagbuf_len~0; {1162#true} is VALID [2020-07-10 20:23:08,085 INFO L280 TraceCheckUtils]: 5: Hoare triple {1162#true} havoc ~t~0; {1162#true} is VALID [2020-07-10 20:23:08,085 INFO L280 TraceCheckUtils]: 6: Hoare triple {1162#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1162#true} is VALID [2020-07-10 20:23:08,086 INFO L280 TraceCheckUtils]: 7: Hoare triple {1162#true} ~tagbuf_len~0 := #t~nondet0; {1162#true} is VALID [2020-07-10 20:23:08,086 INFO L280 TraceCheckUtils]: 8: Hoare triple {1162#true} havoc #t~nondet0; {1162#true} is VALID [2020-07-10 20:23:08,086 INFO L280 TraceCheckUtils]: 9: Hoare triple {1162#true} assume ~tagbuf_len~0 >= 1; {1162#true} is VALID [2020-07-10 20:23:08,087 INFO L280 TraceCheckUtils]: 10: Hoare triple {1162#true} ~t~0 := 0; {1162#true} is VALID [2020-07-10 20:23:08,087 INFO L280 TraceCheckUtils]: 11: Hoare triple {1162#true} #t~pre1 := ~tagbuf_len~0 - 1; {1162#true} is VALID [2020-07-10 20:23:08,087 INFO L280 TraceCheckUtils]: 12: Hoare triple {1162#true} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {1162#true} is VALID [2020-07-10 20:23:08,088 INFO L280 TraceCheckUtils]: 13: Hoare triple {1162#true} havoc #t~pre1; {1162#true} is VALID [2020-07-10 20:23:08,088 INFO L280 TraceCheckUtils]: 14: Hoare triple {1162#true} assume !false; {1162#true} is VALID [2020-07-10 20:23:08,089 INFO L280 TraceCheckUtils]: 15: Hoare triple {1162#true} assume ~t~0 == ~tagbuf_len~0; {1166#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:08,090 INFO L263 TraceCheckUtils]: 16: Hoare triple {1166#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1162#true} is VALID [2020-07-10 20:23:08,090 INFO L280 TraceCheckUtils]: 17: Hoare triple {1162#true} ~cond := #in~cond; {1162#true} is VALID [2020-07-10 20:23:08,090 INFO L280 TraceCheckUtils]: 18: Hoare triple {1162#true} assume !(0 == ~cond); {1162#true} is VALID [2020-07-10 20:23:08,091 INFO L280 TraceCheckUtils]: 19: Hoare triple {1162#true} assume true; {1162#true} is VALID [2020-07-10 20:23:08,092 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1162#true} {1166#(<= main_~t~0 main_~tagbuf_len~0)} #148#return; {1166#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:08,094 INFO L263 TraceCheckUtils]: 21: Hoare triple {1166#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1171#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:08,095 INFO L280 TraceCheckUtils]: 22: Hoare triple {1171#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1172#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:08,096 INFO L280 TraceCheckUtils]: 23: Hoare triple {1172#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1163#false} is VALID [2020-07-10 20:23:08,096 INFO L280 TraceCheckUtils]: 24: Hoare triple {1163#false} assume !false; {1163#false} is VALID [2020-07-10 20:23:08,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:23:08,098 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:08,098 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [205596540] [2020-07-10 20:23:08,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:08,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:23:08,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106567738] [2020-07-10 20:23:08,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-10 20:23:08,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:08,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:23:08,125 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:08,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:23:08,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:08,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:23:08,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:23:08,127 INFO L87 Difference]: Start difference. First operand 82 states and 104 transitions. Second operand 5 states. [2020-07-10 20:23:08,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:08,502 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2020-07-10 20:23:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:23:08,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-10 20:23:08,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:08,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:23:08,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2020-07-10 20:23:08,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:23:08,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2020-07-10 20:23:08,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 92 transitions. [2020-07-10 20:23:08,609 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:08,613 INFO L225 Difference]: With dead ends: 88 [2020-07-10 20:23:08,613 INFO L226 Difference]: Without dead ends: 78 [2020-07-10 20:23:08,614 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:23:08,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-10 20:23:08,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-07-10 20:23:08,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:08,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 78 states. [2020-07-10 20:23:08,673 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2020-07-10 20:23:08,673 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2020-07-10 20:23:08,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:08,680 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2020-07-10 20:23:08,680 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2020-07-10 20:23:08,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:08,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:08,682 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2020-07-10 20:23:08,682 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2020-07-10 20:23:08,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:08,688 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2020-07-10 20:23:08,688 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2020-07-10 20:23:08,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:08,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:08,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:08,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:08,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-10 20:23:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2020-07-10 20:23:08,694 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 25 [2020-07-10 20:23:08,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:08,695 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2020-07-10 20:23:08,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:23:08,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states and 95 transitions. [2020-07-10 20:23:08,802 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:08,802 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2020-07-10 20:23:08,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 20:23:08,803 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:08,803 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:08,804 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:23:08,804 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:08,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:08,804 INFO L82 PathProgramCache]: Analyzing trace with hash 344115466, now seen corresponding path program 1 times [2020-07-10 20:23:08,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:08,805 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [232432522] [2020-07-10 20:23:08,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:08,904 INFO L280 TraceCheckUtils]: 0: Hoare triple {1665#true} assume true; {1665#true} is VALID [2020-07-10 20:23:08,904 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1665#true} {1665#true} #144#return; {1665#true} is VALID [2020-07-10 20:23:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:08,920 INFO L280 TraceCheckUtils]: 0: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2020-07-10 20:23:08,920 INFO L280 TraceCheckUtils]: 1: Hoare triple {1665#true} assume !(0 == ~cond); {1665#true} is VALID [2020-07-10 20:23:08,920 INFO L280 TraceCheckUtils]: 2: Hoare triple {1665#true} assume true; {1665#true} is VALID [2020-07-10 20:23:08,921 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1665#true} {1671#(<= main_~t~0 main_~tagbuf_len~0)} #152#return; {1671#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:08,921 INFO L263 TraceCheckUtils]: 0: Hoare triple {1665#true} call ULTIMATE.init(); {1665#true} is VALID [2020-07-10 20:23:08,922 INFO L280 TraceCheckUtils]: 1: Hoare triple {1665#true} assume true; {1665#true} is VALID [2020-07-10 20:23:08,922 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1665#true} {1665#true} #144#return; {1665#true} is VALID [2020-07-10 20:23:08,922 INFO L263 TraceCheckUtils]: 3: Hoare triple {1665#true} call #t~ret10 := main(); {1665#true} is VALID [2020-07-10 20:23:08,923 INFO L280 TraceCheckUtils]: 4: Hoare triple {1665#true} havoc ~tagbuf_len~0; {1665#true} is VALID [2020-07-10 20:23:08,924 INFO L280 TraceCheckUtils]: 5: Hoare triple {1665#true} havoc ~t~0; {1665#true} is VALID [2020-07-10 20:23:08,924 INFO L280 TraceCheckUtils]: 6: Hoare triple {1665#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1665#true} is VALID [2020-07-10 20:23:08,924 INFO L280 TraceCheckUtils]: 7: Hoare triple {1665#true} ~tagbuf_len~0 := #t~nondet0; {1665#true} is VALID [2020-07-10 20:23:08,924 INFO L280 TraceCheckUtils]: 8: Hoare triple {1665#true} havoc #t~nondet0; {1665#true} is VALID [2020-07-10 20:23:08,925 INFO L280 TraceCheckUtils]: 9: Hoare triple {1665#true} assume ~tagbuf_len~0 >= 1; {1669#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:08,925 INFO L280 TraceCheckUtils]: 10: Hoare triple {1669#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {1670#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:08,926 INFO L280 TraceCheckUtils]: 11: Hoare triple {1670#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {1670#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:08,927 INFO L280 TraceCheckUtils]: 12: Hoare triple {1670#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {1671#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:08,927 INFO L280 TraceCheckUtils]: 13: Hoare triple {1671#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {1671#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:08,928 INFO L280 TraceCheckUtils]: 14: Hoare triple {1671#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {1671#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:08,928 INFO L280 TraceCheckUtils]: 15: Hoare triple {1671#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {1671#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:08,929 INFO L280 TraceCheckUtils]: 16: Hoare triple {1671#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1671#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:08,930 INFO L280 TraceCheckUtils]: 17: Hoare triple {1671#(<= main_~t~0 main_~tagbuf_len~0)} assume !(0 != #t~nondet2); {1671#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:08,930 INFO L280 TraceCheckUtils]: 18: Hoare triple {1671#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet2; {1671#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:08,931 INFO L263 TraceCheckUtils]: 19: Hoare triple {1671#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1665#true} is VALID [2020-07-10 20:23:08,931 INFO L280 TraceCheckUtils]: 20: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2020-07-10 20:23:08,931 INFO L280 TraceCheckUtils]: 21: Hoare triple {1665#true} assume !(0 == ~cond); {1665#true} is VALID [2020-07-10 20:23:08,932 INFO L280 TraceCheckUtils]: 22: Hoare triple {1665#true} assume true; {1665#true} is VALID [2020-07-10 20:23:08,932 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1665#true} {1671#(<= main_~t~0 main_~tagbuf_len~0)} #152#return; {1671#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:08,937 INFO L263 TraceCheckUtils]: 24: Hoare triple {1671#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1676#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:08,937 INFO L280 TraceCheckUtils]: 25: Hoare triple {1676#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1677#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:08,938 INFO L280 TraceCheckUtils]: 26: Hoare triple {1677#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1666#false} is VALID [2020-07-10 20:23:08,938 INFO L280 TraceCheckUtils]: 27: Hoare triple {1666#false} assume !false; {1666#false} is VALID [2020-07-10 20:23:08,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:23:08,939 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:08,940 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [232432522] [2020-07-10 20:23:08,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:08,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 20:23:08,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549193047] [2020-07-10 20:23:08,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-07-10 20:23:08,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:08,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 20:23:08,977 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:08,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 20:23:08,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:08,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 20:23:08,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 20:23:08,978 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand 7 states. [2020-07-10 20:23:09,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:09,552 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2020-07-10 20:23:09,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 20:23:09,554 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-07-10 20:23:09,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:09,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:23:09,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2020-07-10 20:23:09,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:23:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2020-07-10 20:23:09,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 105 transitions. [2020-07-10 20:23:09,666 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:09,669 INFO L225 Difference]: With dead ends: 90 [2020-07-10 20:23:09,670 INFO L226 Difference]: Without dead ends: 88 [2020-07-10 20:23:09,672 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-10 20:23:09,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-10 20:23:09,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2020-07-10 20:23:09,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:09,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 84 states. [2020-07-10 20:23:09,743 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 84 states. [2020-07-10 20:23:09,743 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 84 states. [2020-07-10 20:23:09,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:09,749 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2020-07-10 20:23:09,756 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2020-07-10 20:23:09,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:09,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:09,758 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 88 states. [2020-07-10 20:23:09,758 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 88 states. [2020-07-10 20:23:09,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:09,766 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2020-07-10 20:23:09,766 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2020-07-10 20:23:09,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:09,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:09,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:09,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:09,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-07-10 20:23:09,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2020-07-10 20:23:09,772 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 28 [2020-07-10 20:23:09,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:09,775 INFO L479 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2020-07-10 20:23:09,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 20:23:09,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 84 states and 102 transitions. [2020-07-10 20:23:09,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:09,892 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2020-07-10 20:23:09,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-10 20:23:09,893 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:09,894 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:09,894 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 20:23:09,894 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:09,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:09,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1469174755, now seen corresponding path program 1 times [2020-07-10 20:23:09,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:09,896 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1650353171] [2020-07-10 20:23:09,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:10,068 INFO L280 TraceCheckUtils]: 0: Hoare triple {2208#true} assume true; {2208#true} is VALID [2020-07-10 20:23:10,068 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2208#true} {2208#true} #144#return; {2208#true} is VALID [2020-07-10 20:23:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:10,083 INFO L280 TraceCheckUtils]: 0: Hoare triple {2208#true} ~cond := #in~cond; {2208#true} is VALID [2020-07-10 20:23:10,084 INFO L280 TraceCheckUtils]: 1: Hoare triple {2208#true} assume !(0 == ~cond); {2208#true} is VALID [2020-07-10 20:23:10,084 INFO L280 TraceCheckUtils]: 2: Hoare triple {2208#true} assume true; {2208#true} is VALID [2020-07-10 20:23:10,086 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2208#true} {2213#(<= 0 main_~tagbuf_len~0)} #152#return; {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:10,098 INFO L280 TraceCheckUtils]: 0: Hoare triple {2208#true} ~cond := #in~cond; {2208#true} is VALID [2020-07-10 20:23:10,098 INFO L280 TraceCheckUtils]: 1: Hoare triple {2208#true} assume !(0 == ~cond); {2208#true} is VALID [2020-07-10 20:23:10,099 INFO L280 TraceCheckUtils]: 2: Hoare triple {2208#true} assume true; {2208#true} is VALID [2020-07-10 20:23:10,100 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2208#true} {2213#(<= 0 main_~tagbuf_len~0)} #154#return; {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:10,100 INFO L263 TraceCheckUtils]: 0: Hoare triple {2208#true} call ULTIMATE.init(); {2208#true} is VALID [2020-07-10 20:23:10,100 INFO L280 TraceCheckUtils]: 1: Hoare triple {2208#true} assume true; {2208#true} is VALID [2020-07-10 20:23:10,101 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2208#true} {2208#true} #144#return; {2208#true} is VALID [2020-07-10 20:23:10,101 INFO L263 TraceCheckUtils]: 3: Hoare triple {2208#true} call #t~ret10 := main(); {2208#true} is VALID [2020-07-10 20:23:10,101 INFO L280 TraceCheckUtils]: 4: Hoare triple {2208#true} havoc ~tagbuf_len~0; {2208#true} is VALID [2020-07-10 20:23:10,102 INFO L280 TraceCheckUtils]: 5: Hoare triple {2208#true} havoc ~t~0; {2208#true} is VALID [2020-07-10 20:23:10,102 INFO L280 TraceCheckUtils]: 6: Hoare triple {2208#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2208#true} is VALID [2020-07-10 20:23:10,107 INFO L280 TraceCheckUtils]: 7: Hoare triple {2208#true} ~tagbuf_len~0 := #t~nondet0; {2208#true} is VALID [2020-07-10 20:23:10,108 INFO L280 TraceCheckUtils]: 8: Hoare triple {2208#true} havoc #t~nondet0; {2208#true} is VALID [2020-07-10 20:23:10,117 INFO L280 TraceCheckUtils]: 9: Hoare triple {2208#true} assume ~tagbuf_len~0 >= 1; {2212#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:10,120 INFO L280 TraceCheckUtils]: 10: Hoare triple {2212#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {2212#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:10,121 INFO L280 TraceCheckUtils]: 11: Hoare triple {2212#(<= 1 main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {2212#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:10,122 INFO L280 TraceCheckUtils]: 12: Hoare triple {2212#(<= 1 main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:10,122 INFO L280 TraceCheckUtils]: 13: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} havoc #t~pre1; {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:10,123 INFO L280 TraceCheckUtils]: 14: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} assume !false; {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:10,123 INFO L280 TraceCheckUtils]: 15: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:10,124 INFO L280 TraceCheckUtils]: 16: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:10,124 INFO L280 TraceCheckUtils]: 17: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} assume !(0 != #t~nondet2); {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:10,125 INFO L280 TraceCheckUtils]: 18: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} havoc #t~nondet2; {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:10,125 INFO L263 TraceCheckUtils]: 19: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2208#true} is VALID [2020-07-10 20:23:10,125 INFO L280 TraceCheckUtils]: 20: Hoare triple {2208#true} ~cond := #in~cond; {2208#true} is VALID [2020-07-10 20:23:10,125 INFO L280 TraceCheckUtils]: 21: Hoare triple {2208#true} assume !(0 == ~cond); {2208#true} is VALID [2020-07-10 20:23:10,133 INFO L280 TraceCheckUtils]: 22: Hoare triple {2208#true} assume true; {2208#true} is VALID [2020-07-10 20:23:10,134 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {2208#true} {2213#(<= 0 main_~tagbuf_len~0)} #152#return; {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:10,135 INFO L263 TraceCheckUtils]: 24: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {2208#true} is VALID [2020-07-10 20:23:10,135 INFO L280 TraceCheckUtils]: 25: Hoare triple {2208#true} ~cond := #in~cond; {2208#true} is VALID [2020-07-10 20:23:10,135 INFO L280 TraceCheckUtils]: 26: Hoare triple {2208#true} assume !(0 == ~cond); {2208#true} is VALID [2020-07-10 20:23:10,135 INFO L280 TraceCheckUtils]: 27: Hoare triple {2208#true} assume true; {2208#true} is VALID [2020-07-10 20:23:10,137 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2208#true} {2213#(<= 0 main_~tagbuf_len~0)} #154#return; {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:10,139 INFO L280 TraceCheckUtils]: 29: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} #t~post3 := ~t~0; {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:10,140 INFO L280 TraceCheckUtils]: 30: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} ~t~0 := 1 + #t~post3; {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:10,141 INFO L280 TraceCheckUtils]: 31: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} havoc #t~post3; {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:10,141 INFO L280 TraceCheckUtils]: 32: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} assume !false; {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:10,142 INFO L280 TraceCheckUtils]: 33: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} assume ~t~0 == ~tagbuf_len~0; {2222#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:10,143 INFO L263 TraceCheckUtils]: 34: Hoare triple {2222#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2223#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:10,143 INFO L280 TraceCheckUtils]: 35: Hoare triple {2223#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2224#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:10,144 INFO L280 TraceCheckUtils]: 36: Hoare triple {2224#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2209#false} is VALID [2020-07-10 20:23:10,144 INFO L280 TraceCheckUtils]: 37: Hoare triple {2209#false} assume !false; {2209#false} is VALID [2020-07-10 20:23:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:23:10,146 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:10,147 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1650353171] [2020-07-10 20:23:10,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:10,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 20:23:10,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110391277] [2020-07-10 20:23:10,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-10 20:23:10,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:10,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 20:23:10,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:10,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 20:23:10,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:10,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 20:23:10,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 20:23:10,187 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand 7 states. [2020-07-10 20:23:10,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:10,840 INFO L93 Difference]: Finished difference Result 94 states and 111 transitions. [2020-07-10 20:23:10,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 20:23:10,841 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-10 20:23:10,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:23:10,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2020-07-10 20:23:10,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:23:10,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2020-07-10 20:23:10,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 105 transitions. [2020-07-10 20:23:10,960 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:10,963 INFO L225 Difference]: With dead ends: 94 [2020-07-10 20:23:10,964 INFO L226 Difference]: Without dead ends: 85 [2020-07-10 20:23:10,964 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-10 20:23:10,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-07-10 20:23:11,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2020-07-10 20:23:11,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:11,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 81 states. [2020-07-10 20:23:11,069 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 81 states. [2020-07-10 20:23:11,070 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 81 states. [2020-07-10 20:23:11,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:11,074 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2020-07-10 20:23:11,074 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2020-07-10 20:23:11,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:11,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:11,075 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 85 states. [2020-07-10 20:23:11,075 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 85 states. [2020-07-10 20:23:11,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:11,079 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2020-07-10 20:23:11,080 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2020-07-10 20:23:11,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:11,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:11,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:11,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:11,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-10 20:23:11,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2020-07-10 20:23:11,085 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 38 [2020-07-10 20:23:11,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:11,085 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2020-07-10 20:23:11,085 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 20:23:11,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states and 96 transitions. [2020-07-10 20:23:11,215 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:11,215 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2020-07-10 20:23:11,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-10 20:23:11,216 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:11,216 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:11,217 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 20:23:11,217 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:11,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:11,218 INFO L82 PathProgramCache]: Analyzing trace with hash 859677550, now seen corresponding path program 1 times [2020-07-10 20:23:11,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:11,219 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [997897908] [2020-07-10 20:23:11,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:11,320 INFO L280 TraceCheckUtils]: 0: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-10 20:23:11,321 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2753#true} {2753#true} #144#return; {2753#true} is VALID [2020-07-10 20:23:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:11,326 INFO L280 TraceCheckUtils]: 0: Hoare triple {2753#true} ~cond := #in~cond; {2753#true} is VALID [2020-07-10 20:23:11,327 INFO L280 TraceCheckUtils]: 1: Hoare triple {2753#true} assume !(0 == ~cond); {2753#true} is VALID [2020-07-10 20:23:11,327 INFO L280 TraceCheckUtils]: 2: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-10 20:23:11,328 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2753#true} {2757#(<= 0 main_~t~0)} #152#return; {2757#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:11,334 INFO L280 TraceCheckUtils]: 0: Hoare triple {2753#true} ~cond := #in~cond; {2753#true} is VALID [2020-07-10 20:23:11,334 INFO L280 TraceCheckUtils]: 1: Hoare triple {2753#true} assume !(0 == ~cond); {2753#true} is VALID [2020-07-10 20:23:11,335 INFO L280 TraceCheckUtils]: 2: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-10 20:23:11,336 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2753#true} {2757#(<= 0 main_~t~0)} #154#return; {2757#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:11,336 INFO L263 TraceCheckUtils]: 0: Hoare triple {2753#true} call ULTIMATE.init(); {2753#true} is VALID [2020-07-10 20:23:11,336 INFO L280 TraceCheckUtils]: 1: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-10 20:23:11,336 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2753#true} {2753#true} #144#return; {2753#true} is VALID [2020-07-10 20:23:11,337 INFO L263 TraceCheckUtils]: 3: Hoare triple {2753#true} call #t~ret10 := main(); {2753#true} is VALID [2020-07-10 20:23:11,337 INFO L280 TraceCheckUtils]: 4: Hoare triple {2753#true} havoc ~tagbuf_len~0; {2753#true} is VALID [2020-07-10 20:23:11,337 INFO L280 TraceCheckUtils]: 5: Hoare triple {2753#true} havoc ~t~0; {2753#true} is VALID [2020-07-10 20:23:11,337 INFO L280 TraceCheckUtils]: 6: Hoare triple {2753#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2753#true} is VALID [2020-07-10 20:23:11,338 INFO L280 TraceCheckUtils]: 7: Hoare triple {2753#true} ~tagbuf_len~0 := #t~nondet0; {2753#true} is VALID [2020-07-10 20:23:11,338 INFO L280 TraceCheckUtils]: 8: Hoare triple {2753#true} havoc #t~nondet0; {2753#true} is VALID [2020-07-10 20:23:11,338 INFO L280 TraceCheckUtils]: 9: Hoare triple {2753#true} assume ~tagbuf_len~0 >= 1; {2753#true} is VALID [2020-07-10 20:23:11,339 INFO L280 TraceCheckUtils]: 10: Hoare triple {2753#true} ~t~0 := 0; {2757#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:11,340 INFO L280 TraceCheckUtils]: 11: Hoare triple {2757#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {2757#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:11,340 INFO L280 TraceCheckUtils]: 12: Hoare triple {2757#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {2757#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:11,341 INFO L280 TraceCheckUtils]: 13: Hoare triple {2757#(<= 0 main_~t~0)} havoc #t~pre1; {2757#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:11,341 INFO L280 TraceCheckUtils]: 14: Hoare triple {2757#(<= 0 main_~t~0)} assume !false; {2757#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:11,342 INFO L280 TraceCheckUtils]: 15: Hoare triple {2757#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {2757#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:11,342 INFO L280 TraceCheckUtils]: 16: Hoare triple {2757#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2757#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:11,343 INFO L280 TraceCheckUtils]: 17: Hoare triple {2757#(<= 0 main_~t~0)} assume !(0 != #t~nondet2); {2757#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:11,344 INFO L280 TraceCheckUtils]: 18: Hoare triple {2757#(<= 0 main_~t~0)} havoc #t~nondet2; {2757#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:11,344 INFO L263 TraceCheckUtils]: 19: Hoare triple {2757#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2753#true} is VALID [2020-07-10 20:23:11,344 INFO L280 TraceCheckUtils]: 20: Hoare triple {2753#true} ~cond := #in~cond; {2753#true} is VALID [2020-07-10 20:23:11,344 INFO L280 TraceCheckUtils]: 21: Hoare triple {2753#true} assume !(0 == ~cond); {2753#true} is VALID [2020-07-10 20:23:11,345 INFO L280 TraceCheckUtils]: 22: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-10 20:23:11,345 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {2753#true} {2757#(<= 0 main_~t~0)} #152#return; {2757#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:11,346 INFO L263 TraceCheckUtils]: 24: Hoare triple {2757#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {2753#true} is VALID [2020-07-10 20:23:11,346 INFO L280 TraceCheckUtils]: 25: Hoare triple {2753#true} ~cond := #in~cond; {2753#true} is VALID [2020-07-10 20:23:11,346 INFO L280 TraceCheckUtils]: 26: Hoare triple {2753#true} assume !(0 == ~cond); {2753#true} is VALID [2020-07-10 20:23:11,346 INFO L280 TraceCheckUtils]: 27: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-10 20:23:11,347 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2753#true} {2757#(<= 0 main_~t~0)} #154#return; {2757#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:11,348 INFO L280 TraceCheckUtils]: 29: Hoare triple {2757#(<= 0 main_~t~0)} #t~post3 := ~t~0; {2766#(<= 0 |main_#t~post3|)} is VALID [2020-07-10 20:23:11,349 INFO L280 TraceCheckUtils]: 30: Hoare triple {2766#(<= 0 |main_#t~post3|)} ~t~0 := 1 + #t~post3; {2767#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:11,350 INFO L280 TraceCheckUtils]: 31: Hoare triple {2767#(<= 1 main_~t~0)} havoc #t~post3; {2767#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:11,350 INFO L280 TraceCheckUtils]: 32: Hoare triple {2767#(<= 1 main_~t~0)} assume !false; {2767#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:11,351 INFO L280 TraceCheckUtils]: 33: Hoare triple {2767#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {2767#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:11,351 INFO L280 TraceCheckUtils]: 34: Hoare triple {2767#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2767#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:11,352 INFO L280 TraceCheckUtils]: 35: Hoare triple {2767#(<= 1 main_~t~0)} assume !(0 != #t~nondet2); {2767#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:11,352 INFO L280 TraceCheckUtils]: 36: Hoare triple {2767#(<= 1 main_~t~0)} havoc #t~nondet2; {2767#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:11,353 INFO L263 TraceCheckUtils]: 37: Hoare triple {2767#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2768#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:11,354 INFO L280 TraceCheckUtils]: 38: Hoare triple {2768#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2769#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:11,355 INFO L280 TraceCheckUtils]: 39: Hoare triple {2769#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2754#false} is VALID [2020-07-10 20:23:11,355 INFO L280 TraceCheckUtils]: 40: Hoare triple {2754#false} assume !false; {2754#false} is VALID [2020-07-10 20:23:11,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:23:11,357 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:11,358 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [997897908] [2020-07-10 20:23:11,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:11,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 20:23:11,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243266276] [2020-07-10 20:23:11,359 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-07-10 20:23:11,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:11,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 20:23:11,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:11,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 20:23:11,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:11,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 20:23:11,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 20:23:11,394 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand 7 states. [2020-07-10 20:23:11,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:11,958 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2020-07-10 20:23:11,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 20:23:11,958 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-07-10 20:23:11,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:11,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:23:11,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2020-07-10 20:23:11,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:23:11,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2020-07-10 20:23:11,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 99 transitions. [2020-07-10 20:23:12,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:12,087 INFO L225 Difference]: With dead ends: 91 [2020-07-10 20:23:12,088 INFO L226 Difference]: Without dead ends: 89 [2020-07-10 20:23:12,088 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-10 20:23:12,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-10 20:23:12,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2020-07-10 20:23:12,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:12,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 85 states. [2020-07-10 20:23:12,194 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 85 states. [2020-07-10 20:23:12,194 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 85 states. [2020-07-10 20:23:12,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:12,199 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2020-07-10 20:23:12,199 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2020-07-10 20:23:12,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:12,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:12,200 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 89 states. [2020-07-10 20:23:12,200 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 89 states. [2020-07-10 20:23:12,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:12,204 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2020-07-10 20:23:12,204 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2020-07-10 20:23:12,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:12,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:12,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:12,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-10 20:23:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2020-07-10 20:23:12,209 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 41 [2020-07-10 20:23:12,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:12,210 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2020-07-10 20:23:12,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 20:23:12,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 85 states and 99 transitions. [2020-07-10 20:23:12,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:12,336 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2020-07-10 20:23:12,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-10 20:23:12,337 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:12,337 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:12,338 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 20:23:12,338 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:12,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:12,338 INFO L82 PathProgramCache]: Analyzing trace with hash -943144682, now seen corresponding path program 1 times [2020-07-10 20:23:12,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:12,339 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1122785487] [2020-07-10 20:23:12,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:12,450 INFO L280 TraceCheckUtils]: 0: Hoare triple {3308#true} assume true; {3308#true} is VALID [2020-07-10 20:23:12,450 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3308#true} {3308#true} #144#return; {3308#true} is VALID [2020-07-10 20:23:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:12,456 INFO L280 TraceCheckUtils]: 0: Hoare triple {3308#true} ~cond := #in~cond; {3308#true} is VALID [2020-07-10 20:23:12,456 INFO L280 TraceCheckUtils]: 1: Hoare triple {3308#true} assume !(0 == ~cond); {3308#true} is VALID [2020-07-10 20:23:12,456 INFO L280 TraceCheckUtils]: 2: Hoare triple {3308#true} assume true; {3308#true} is VALID [2020-07-10 20:23:12,457 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3308#true} {3312#(<= 0 main_~t~0)} #156#return; {3312#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:12,463 INFO L280 TraceCheckUtils]: 0: Hoare triple {3308#true} ~cond := #in~cond; {3308#true} is VALID [2020-07-10 20:23:12,463 INFO L280 TraceCheckUtils]: 1: Hoare triple {3308#true} assume !(0 == ~cond); {3308#true} is VALID [2020-07-10 20:23:12,463 INFO L280 TraceCheckUtils]: 2: Hoare triple {3308#true} assume true; {3308#true} is VALID [2020-07-10 20:23:12,464 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3308#true} {3312#(<= 0 main_~t~0)} #158#return; {3312#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:12,464 INFO L263 TraceCheckUtils]: 0: Hoare triple {3308#true} call ULTIMATE.init(); {3308#true} is VALID [2020-07-10 20:23:12,465 INFO L280 TraceCheckUtils]: 1: Hoare triple {3308#true} assume true; {3308#true} is VALID [2020-07-10 20:23:12,465 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3308#true} {3308#true} #144#return; {3308#true} is VALID [2020-07-10 20:23:12,465 INFO L263 TraceCheckUtils]: 3: Hoare triple {3308#true} call #t~ret10 := main(); {3308#true} is VALID [2020-07-10 20:23:12,465 INFO L280 TraceCheckUtils]: 4: Hoare triple {3308#true} havoc ~tagbuf_len~0; {3308#true} is VALID [2020-07-10 20:23:12,466 INFO L280 TraceCheckUtils]: 5: Hoare triple {3308#true} havoc ~t~0; {3308#true} is VALID [2020-07-10 20:23:12,466 INFO L280 TraceCheckUtils]: 6: Hoare triple {3308#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3308#true} is VALID [2020-07-10 20:23:12,466 INFO L280 TraceCheckUtils]: 7: Hoare triple {3308#true} ~tagbuf_len~0 := #t~nondet0; {3308#true} is VALID [2020-07-10 20:23:12,466 INFO L280 TraceCheckUtils]: 8: Hoare triple {3308#true} havoc #t~nondet0; {3308#true} is VALID [2020-07-10 20:23:12,467 INFO L280 TraceCheckUtils]: 9: Hoare triple {3308#true} assume ~tagbuf_len~0 >= 1; {3308#true} is VALID [2020-07-10 20:23:12,467 INFO L280 TraceCheckUtils]: 10: Hoare triple {3308#true} ~t~0 := 0; {3312#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:12,468 INFO L280 TraceCheckUtils]: 11: Hoare triple {3312#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {3312#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:12,468 INFO L280 TraceCheckUtils]: 12: Hoare triple {3312#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {3312#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:12,469 INFO L280 TraceCheckUtils]: 13: Hoare triple {3312#(<= 0 main_~t~0)} havoc #t~pre1; {3312#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:12,470 INFO L280 TraceCheckUtils]: 14: Hoare triple {3312#(<= 0 main_~t~0)} assume !false; {3312#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:12,470 INFO L280 TraceCheckUtils]: 15: Hoare triple {3312#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {3312#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:12,471 INFO L280 TraceCheckUtils]: 16: Hoare triple {3312#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3312#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:12,471 INFO L280 TraceCheckUtils]: 17: Hoare triple {3312#(<= 0 main_~t~0)} assume 0 != #t~nondet2; {3312#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:12,472 INFO L280 TraceCheckUtils]: 18: Hoare triple {3312#(<= 0 main_~t~0)} havoc #t~nondet2; {3312#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:12,472 INFO L263 TraceCheckUtils]: 19: Hoare triple {3312#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {3308#true} is VALID [2020-07-10 20:23:12,472 INFO L280 TraceCheckUtils]: 20: Hoare triple {3308#true} ~cond := #in~cond; {3308#true} is VALID [2020-07-10 20:23:12,473 INFO L280 TraceCheckUtils]: 21: Hoare triple {3308#true} assume !(0 == ~cond); {3308#true} is VALID [2020-07-10 20:23:12,473 INFO L280 TraceCheckUtils]: 22: Hoare triple {3308#true} assume true; {3308#true} is VALID [2020-07-10 20:23:12,474 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {3308#true} {3312#(<= 0 main_~t~0)} #156#return; {3312#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:12,474 INFO L263 TraceCheckUtils]: 24: Hoare triple {3312#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {3308#true} is VALID [2020-07-10 20:23:12,474 INFO L280 TraceCheckUtils]: 25: Hoare triple {3308#true} ~cond := #in~cond; {3308#true} is VALID [2020-07-10 20:23:12,474 INFO L280 TraceCheckUtils]: 26: Hoare triple {3308#true} assume !(0 == ~cond); {3308#true} is VALID [2020-07-10 20:23:12,475 INFO L280 TraceCheckUtils]: 27: Hoare triple {3308#true} assume true; {3308#true} is VALID [2020-07-10 20:23:12,475 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3308#true} {3312#(<= 0 main_~t~0)} #158#return; {3312#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:12,476 INFO L280 TraceCheckUtils]: 29: Hoare triple {3312#(<= 0 main_~t~0)} #t~post4 := ~t~0; {3321#(<= 0 |main_#t~post4|)} is VALID [2020-07-10 20:23:12,477 INFO L280 TraceCheckUtils]: 30: Hoare triple {3321#(<= 0 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {3322#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:12,481 INFO L280 TraceCheckUtils]: 31: Hoare triple {3322#(<= 1 main_~t~0)} havoc #t~post4; {3322#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:12,482 INFO L280 TraceCheckUtils]: 32: Hoare triple {3322#(<= 1 main_~t~0)} assume !false; {3322#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:12,483 INFO L280 TraceCheckUtils]: 33: Hoare triple {3322#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {3322#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:12,483 INFO L280 TraceCheckUtils]: 34: Hoare triple {3322#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3322#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:12,484 INFO L280 TraceCheckUtils]: 35: Hoare triple {3322#(<= 1 main_~t~0)} assume 0 != #t~nondet5; {3322#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:12,485 INFO L280 TraceCheckUtils]: 36: Hoare triple {3322#(<= 1 main_~t~0)} havoc #t~nondet5; {3322#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:12,488 INFO L280 TraceCheckUtils]: 37: Hoare triple {3322#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {3322#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:12,492 INFO L280 TraceCheckUtils]: 38: Hoare triple {3322#(<= 1 main_~t~0)} assume !(0 != #t~nondet6); {3322#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:12,502 INFO L280 TraceCheckUtils]: 39: Hoare triple {3322#(<= 1 main_~t~0)} havoc #t~nondet6; {3322#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:12,503 INFO L263 TraceCheckUtils]: 40: Hoare triple {3322#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {3323#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:12,503 INFO L280 TraceCheckUtils]: 41: Hoare triple {3323#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3324#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:12,504 INFO L280 TraceCheckUtils]: 42: Hoare triple {3324#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3309#false} is VALID [2020-07-10 20:23:12,504 INFO L280 TraceCheckUtils]: 43: Hoare triple {3309#false} assume !false; {3309#false} is VALID [2020-07-10 20:23:12,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:23:12,506 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:12,506 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1122785487] [2020-07-10 20:23:12,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:12,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 20:23:12,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6428884] [2020-07-10 20:23:12,507 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2020-07-10 20:23:12,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:12,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 20:23:12,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:12,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 20:23:12,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:12,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 20:23:12,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 20:23:12,556 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand 7 states. [2020-07-10 20:23:13,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:13,173 INFO L93 Difference]: Finished difference Result 120 states and 141 transitions. [2020-07-10 20:23:13,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 20:23:13,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2020-07-10 20:23:13,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:13,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:23:13,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2020-07-10 20:23:13,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:23:13,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2020-07-10 20:23:13,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 132 transitions. [2020-07-10 20:23:13,331 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:13,335 INFO L225 Difference]: With dead ends: 120 [2020-07-10 20:23:13,336 INFO L226 Difference]: Without dead ends: 118 [2020-07-10 20:23:13,336 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-10 20:23:13,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-07-10 20:23:13,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2020-07-10 20:23:13,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:13,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 109 states. [2020-07-10 20:23:13,464 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 109 states. [2020-07-10 20:23:13,464 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 109 states. [2020-07-10 20:23:13,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:13,470 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2020-07-10 20:23:13,470 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2020-07-10 20:23:13,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:13,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:13,471 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 118 states. [2020-07-10 20:23:13,471 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 118 states. [2020-07-10 20:23:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:13,476 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2020-07-10 20:23:13,476 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2020-07-10 20:23:13,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:13,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:13,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:13,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:13,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-07-10 20:23:13,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 128 transitions. [2020-07-10 20:23:13,482 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 128 transitions. Word has length 44 [2020-07-10 20:23:13,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:13,482 INFO L479 AbstractCegarLoop]: Abstraction has 109 states and 128 transitions. [2020-07-10 20:23:13,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 20:23:13,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 109 states and 128 transitions. [2020-07-10 20:23:13,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:13,638 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 128 transitions. [2020-07-10 20:23:13,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-10 20:23:13,639 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:13,639 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:13,640 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 20:23:13,640 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:13,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:13,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1177695863, now seen corresponding path program 2 times [2020-07-10 20:23:13,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:13,641 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1125617936] [2020-07-10 20:23:13,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:13,782 INFO L280 TraceCheckUtils]: 0: Hoare triple {4027#true} assume true; {4027#true} is VALID [2020-07-10 20:23:13,783 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4027#true} {4027#true} #144#return; {4027#true} is VALID [2020-07-10 20:23:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:13,788 INFO L280 TraceCheckUtils]: 0: Hoare triple {4027#true} ~cond := #in~cond; {4027#true} is VALID [2020-07-10 20:23:13,789 INFO L280 TraceCheckUtils]: 1: Hoare triple {4027#true} assume !(0 == ~cond); {4027#true} is VALID [2020-07-10 20:23:13,789 INFO L280 TraceCheckUtils]: 2: Hoare triple {4027#true} assume true; {4027#true} is VALID [2020-07-10 20:23:13,790 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4027#true} {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:13,808 INFO L280 TraceCheckUtils]: 0: Hoare triple {4027#true} ~cond := #in~cond; {4027#true} is VALID [2020-07-10 20:23:13,808 INFO L280 TraceCheckUtils]: 1: Hoare triple {4027#true} assume !(0 == ~cond); {4027#true} is VALID [2020-07-10 20:23:13,808 INFO L280 TraceCheckUtils]: 2: Hoare triple {4027#true} assume true; {4027#true} is VALID [2020-07-10 20:23:13,809 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4027#true} {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:13,815 INFO L280 TraceCheckUtils]: 0: Hoare triple {4027#true} ~cond := #in~cond; {4027#true} is VALID [2020-07-10 20:23:13,816 INFO L280 TraceCheckUtils]: 1: Hoare triple {4027#true} assume !(0 == ~cond); {4027#true} is VALID [2020-07-10 20:23:13,816 INFO L280 TraceCheckUtils]: 2: Hoare triple {4027#true} assume true; {4027#true} is VALID [2020-07-10 20:23:13,816 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4027#true} {4033#(<= main_~t~0 main_~tagbuf_len~0)} #152#return; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:13,817 INFO L263 TraceCheckUtils]: 0: Hoare triple {4027#true} call ULTIMATE.init(); {4027#true} is VALID [2020-07-10 20:23:13,817 INFO L280 TraceCheckUtils]: 1: Hoare triple {4027#true} assume true; {4027#true} is VALID [2020-07-10 20:23:13,817 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4027#true} {4027#true} #144#return; {4027#true} is VALID [2020-07-10 20:23:13,817 INFO L263 TraceCheckUtils]: 3: Hoare triple {4027#true} call #t~ret10 := main(); {4027#true} is VALID [2020-07-10 20:23:13,817 INFO L280 TraceCheckUtils]: 4: Hoare triple {4027#true} havoc ~tagbuf_len~0; {4027#true} is VALID [2020-07-10 20:23:13,818 INFO L280 TraceCheckUtils]: 5: Hoare triple {4027#true} havoc ~t~0; {4027#true} is VALID [2020-07-10 20:23:13,818 INFO L280 TraceCheckUtils]: 6: Hoare triple {4027#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4027#true} is VALID [2020-07-10 20:23:13,818 INFO L280 TraceCheckUtils]: 7: Hoare triple {4027#true} ~tagbuf_len~0 := #t~nondet0; {4027#true} is VALID [2020-07-10 20:23:13,818 INFO L280 TraceCheckUtils]: 8: Hoare triple {4027#true} havoc #t~nondet0; {4027#true} is VALID [2020-07-10 20:23:13,819 INFO L280 TraceCheckUtils]: 9: Hoare triple {4027#true} assume ~tagbuf_len~0 >= 1; {4031#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:13,819 INFO L280 TraceCheckUtils]: 10: Hoare triple {4031#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:13,820 INFO L280 TraceCheckUtils]: 11: Hoare triple {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:13,820 INFO L280 TraceCheckUtils]: 12: Hoare triple {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:13,821 INFO L280 TraceCheckUtils]: 13: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:13,821 INFO L280 TraceCheckUtils]: 14: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:13,822 INFO L280 TraceCheckUtils]: 15: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:13,823 INFO L280 TraceCheckUtils]: 16: Hoare triple {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:13,823 INFO L280 TraceCheckUtils]: 17: Hoare triple {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet2); {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:13,824 INFO L280 TraceCheckUtils]: 18: Hoare triple {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:13,824 INFO L263 TraceCheckUtils]: 19: Hoare triple {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {4027#true} is VALID [2020-07-10 20:23:13,825 INFO L280 TraceCheckUtils]: 20: Hoare triple {4027#true} ~cond := #in~cond; {4027#true} is VALID [2020-07-10 20:23:13,825 INFO L280 TraceCheckUtils]: 21: Hoare triple {4027#true} assume !(0 == ~cond); {4027#true} is VALID [2020-07-10 20:23:13,825 INFO L280 TraceCheckUtils]: 22: Hoare triple {4027#true} assume true; {4027#true} is VALID [2020-07-10 20:23:13,830 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {4027#true} {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:13,830 INFO L263 TraceCheckUtils]: 24: Hoare triple {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {4027#true} is VALID [2020-07-10 20:23:13,830 INFO L280 TraceCheckUtils]: 25: Hoare triple {4027#true} ~cond := #in~cond; {4027#true} is VALID [2020-07-10 20:23:13,831 INFO L280 TraceCheckUtils]: 26: Hoare triple {4027#true} assume !(0 == ~cond); {4027#true} is VALID [2020-07-10 20:23:13,831 INFO L280 TraceCheckUtils]: 27: Hoare triple {4027#true} assume true; {4027#true} is VALID [2020-07-10 20:23:13,833 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {4027#true} {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:13,833 INFO L280 TraceCheckUtils]: 29: Hoare triple {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post3 := ~t~0; {4042#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:13,834 INFO L280 TraceCheckUtils]: 30: Hoare triple {4042#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post3; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:13,834 INFO L280 TraceCheckUtils]: 31: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post3; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:13,835 INFO L280 TraceCheckUtils]: 32: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:13,835 INFO L280 TraceCheckUtils]: 33: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:13,836 INFO L280 TraceCheckUtils]: 34: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:13,836 INFO L280 TraceCheckUtils]: 35: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} assume !(0 != #t~nondet2); {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:13,836 INFO L280 TraceCheckUtils]: 36: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet2; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:13,836 INFO L263 TraceCheckUtils]: 37: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {4027#true} is VALID [2020-07-10 20:23:13,837 INFO L280 TraceCheckUtils]: 38: Hoare triple {4027#true} ~cond := #in~cond; {4027#true} is VALID [2020-07-10 20:23:13,837 INFO L280 TraceCheckUtils]: 39: Hoare triple {4027#true} assume !(0 == ~cond); {4027#true} is VALID [2020-07-10 20:23:13,837 INFO L280 TraceCheckUtils]: 40: Hoare triple {4027#true} assume true; {4027#true} is VALID [2020-07-10 20:23:13,837 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {4027#true} {4033#(<= main_~t~0 main_~tagbuf_len~0)} #152#return; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:13,839 INFO L263 TraceCheckUtils]: 42: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {4047#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:13,839 INFO L280 TraceCheckUtils]: 43: Hoare triple {4047#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {4048#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:13,840 INFO L280 TraceCheckUtils]: 44: Hoare triple {4048#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4028#false} is VALID [2020-07-10 20:23:13,840 INFO L280 TraceCheckUtils]: 45: Hoare triple {4028#false} assume !false; {4028#false} is VALID [2020-07-10 20:23:13,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:23:13,842 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:13,842 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1125617936] [2020-07-10 20:23:13,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:13,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 20:23:13,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210357769] [2020-07-10 20:23:13,843 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2020-07-10 20:23:13,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:13,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 20:23:13,884 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:13,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 20:23:13,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:13,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 20:23:13,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-10 20:23:13,885 INFO L87 Difference]: Start difference. First operand 109 states and 128 transitions. Second operand 8 states. [2020-07-10 20:23:14,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:14,537 INFO L93 Difference]: Finished difference Result 115 states and 133 transitions. [2020-07-10 20:23:14,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 20:23:14,537 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2020-07-10 20:23:14,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:14,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:23:14,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2020-07-10 20:23:14,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:23:14,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2020-07-10 20:23:14,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 80 transitions. [2020-07-10 20:23:14,613 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:14,617 INFO L225 Difference]: With dead ends: 115 [2020-07-10 20:23:14,617 INFO L226 Difference]: Without dead ends: 113 [2020-07-10 20:23:14,618 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-10 20:23:14,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-07-10 20:23:14,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2020-07-10 20:23:14,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:14,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 113 states. [2020-07-10 20:23:14,775 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 113 states. [2020-07-10 20:23:14,775 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 113 states. [2020-07-10 20:23:14,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:14,788 INFO L93 Difference]: Finished difference Result 113 states and 131 transitions. [2020-07-10 20:23:14,788 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2020-07-10 20:23:14,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:14,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:14,789 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 113 states. [2020-07-10 20:23:14,790 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 113 states. [2020-07-10 20:23:14,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:14,797 INFO L93 Difference]: Finished difference Result 113 states and 131 transitions. [2020-07-10 20:23:14,797 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2020-07-10 20:23:14,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:14,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:14,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:14,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:14,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-07-10 20:23:14,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2020-07-10 20:23:14,805 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 46 [2020-07-10 20:23:14,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:14,805 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2020-07-10 20:23:14,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 20:23:14,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 113 states and 131 transitions. [2020-07-10 20:23:14,989 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:14,990 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2020-07-10 20:23:14,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-10 20:23:14,991 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:14,991 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:14,991 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 20:23:14,991 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:14,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:14,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1826770767, now seen corresponding path program 1 times [2020-07-10 20:23:14,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:14,993 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [711424543] [2020-07-10 20:23:14,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:15,185 INFO L280 TraceCheckUtils]: 0: Hoare triple {4741#true} assume true; {4741#true} is VALID [2020-07-10 20:23:15,185 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4741#true} {4741#true} #144#return; {4741#true} is VALID [2020-07-10 20:23:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:15,194 INFO L280 TraceCheckUtils]: 0: Hoare triple {4741#true} ~cond := #in~cond; {4741#true} is VALID [2020-07-10 20:23:15,195 INFO L280 TraceCheckUtils]: 1: Hoare triple {4741#true} assume !(0 == ~cond); {4741#true} is VALID [2020-07-10 20:23:15,195 INFO L280 TraceCheckUtils]: 2: Hoare triple {4741#true} assume true; {4741#true} is VALID [2020-07-10 20:23:15,196 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4741#true} {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:15,204 INFO L280 TraceCheckUtils]: 0: Hoare triple {4741#true} ~cond := #in~cond; {4741#true} is VALID [2020-07-10 20:23:15,204 INFO L280 TraceCheckUtils]: 1: Hoare triple {4741#true} assume !(0 == ~cond); {4741#true} is VALID [2020-07-10 20:23:15,204 INFO L280 TraceCheckUtils]: 2: Hoare triple {4741#true} assume true; {4741#true} is VALID [2020-07-10 20:23:15,205 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4741#true} {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:15,212 INFO L280 TraceCheckUtils]: 0: Hoare triple {4741#true} ~cond := #in~cond; {4741#true} is VALID [2020-07-10 20:23:15,213 INFO L280 TraceCheckUtils]: 1: Hoare triple {4741#true} assume !(0 == ~cond); {4741#true} is VALID [2020-07-10 20:23:15,213 INFO L280 TraceCheckUtils]: 2: Hoare triple {4741#true} assume true; {4741#true} is VALID [2020-07-10 20:23:15,216 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4741#true} {4747#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:15,216 INFO L263 TraceCheckUtils]: 0: Hoare triple {4741#true} call ULTIMATE.init(); {4741#true} is VALID [2020-07-10 20:23:15,216 INFO L280 TraceCheckUtils]: 1: Hoare triple {4741#true} assume true; {4741#true} is VALID [2020-07-10 20:23:15,217 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4741#true} {4741#true} #144#return; {4741#true} is VALID [2020-07-10 20:23:15,217 INFO L263 TraceCheckUtils]: 3: Hoare triple {4741#true} call #t~ret10 := main(); {4741#true} is VALID [2020-07-10 20:23:15,217 INFO L280 TraceCheckUtils]: 4: Hoare triple {4741#true} havoc ~tagbuf_len~0; {4741#true} is VALID [2020-07-10 20:23:15,218 INFO L280 TraceCheckUtils]: 5: Hoare triple {4741#true} havoc ~t~0; {4741#true} is VALID [2020-07-10 20:23:15,218 INFO L280 TraceCheckUtils]: 6: Hoare triple {4741#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4741#true} is VALID [2020-07-10 20:23:15,219 INFO L280 TraceCheckUtils]: 7: Hoare triple {4741#true} ~tagbuf_len~0 := #t~nondet0; {4741#true} is VALID [2020-07-10 20:23:15,219 INFO L280 TraceCheckUtils]: 8: Hoare triple {4741#true} havoc #t~nondet0; {4741#true} is VALID [2020-07-10 20:23:15,219 INFO L280 TraceCheckUtils]: 9: Hoare triple {4741#true} assume ~tagbuf_len~0 >= 1; {4745#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:15,220 INFO L280 TraceCheckUtils]: 10: Hoare triple {4745#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:15,220 INFO L280 TraceCheckUtils]: 11: Hoare triple {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:15,221 INFO L280 TraceCheckUtils]: 12: Hoare triple {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:15,222 INFO L280 TraceCheckUtils]: 13: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:15,223 INFO L280 TraceCheckUtils]: 14: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:15,224 INFO L280 TraceCheckUtils]: 15: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:15,224 INFO L280 TraceCheckUtils]: 16: Hoare triple {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:15,225 INFO L280 TraceCheckUtils]: 17: Hoare triple {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet2; {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:15,225 INFO L280 TraceCheckUtils]: 18: Hoare triple {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:15,226 INFO L263 TraceCheckUtils]: 19: Hoare triple {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {4741#true} is VALID [2020-07-10 20:23:15,226 INFO L280 TraceCheckUtils]: 20: Hoare triple {4741#true} ~cond := #in~cond; {4741#true} is VALID [2020-07-10 20:23:15,226 INFO L280 TraceCheckUtils]: 21: Hoare triple {4741#true} assume !(0 == ~cond); {4741#true} is VALID [2020-07-10 20:23:15,226 INFO L280 TraceCheckUtils]: 22: Hoare triple {4741#true} assume true; {4741#true} is VALID [2020-07-10 20:23:15,227 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {4741#true} {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:15,227 INFO L263 TraceCheckUtils]: 24: Hoare triple {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {4741#true} is VALID [2020-07-10 20:23:15,228 INFO L280 TraceCheckUtils]: 25: Hoare triple {4741#true} ~cond := #in~cond; {4741#true} is VALID [2020-07-10 20:23:15,228 INFO L280 TraceCheckUtils]: 26: Hoare triple {4741#true} assume !(0 == ~cond); {4741#true} is VALID [2020-07-10 20:23:15,228 INFO L280 TraceCheckUtils]: 27: Hoare triple {4741#true} assume true; {4741#true} is VALID [2020-07-10 20:23:15,230 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {4741#true} {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:15,230 INFO L280 TraceCheckUtils]: 29: Hoare triple {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post4 := ~t~0; {4756#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:15,231 INFO L280 TraceCheckUtils]: 30: Hoare triple {4756#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post4; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:15,232 INFO L280 TraceCheckUtils]: 31: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post4; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:15,233 INFO L280 TraceCheckUtils]: 32: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:15,233 INFO L280 TraceCheckUtils]: 33: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:15,234 INFO L280 TraceCheckUtils]: 34: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:15,235 INFO L280 TraceCheckUtils]: 35: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} assume 0 != #t~nondet5; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:15,235 INFO L280 TraceCheckUtils]: 36: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet5; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:15,236 INFO L280 TraceCheckUtils]: 37: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:15,236 INFO L280 TraceCheckUtils]: 38: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} assume !(0 != #t~nondet6); {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:15,237 INFO L280 TraceCheckUtils]: 39: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet6; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:15,237 INFO L263 TraceCheckUtils]: 40: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {4741#true} is VALID [2020-07-10 20:23:15,237 INFO L280 TraceCheckUtils]: 41: Hoare triple {4741#true} ~cond := #in~cond; {4741#true} is VALID [2020-07-10 20:23:15,237 INFO L280 TraceCheckUtils]: 42: Hoare triple {4741#true} assume !(0 == ~cond); {4741#true} is VALID [2020-07-10 20:23:15,238 INFO L280 TraceCheckUtils]: 43: Hoare triple {4741#true} assume true; {4741#true} is VALID [2020-07-10 20:23:15,238 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {4741#true} {4747#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:15,239 INFO L263 TraceCheckUtils]: 45: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {4761#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:15,243 INFO L280 TraceCheckUtils]: 46: Hoare triple {4761#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {4762#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:15,244 INFO L280 TraceCheckUtils]: 47: Hoare triple {4762#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4742#false} is VALID [2020-07-10 20:23:15,244 INFO L280 TraceCheckUtils]: 48: Hoare triple {4742#false} assume !false; {4742#false} is VALID [2020-07-10 20:23:15,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:23:15,248 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:15,248 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [711424543] [2020-07-10 20:23:15,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:15,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 20:23:15,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751714338] [2020-07-10 20:23:15,249 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2020-07-10 20:23:15,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:15,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 20:23:15,293 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:15,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 20:23:15,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:15,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 20:23:15,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-10 20:23:15,295 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 8 states. [2020-07-10 20:23:16,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:16,125 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2020-07-10 20:23:16,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 20:23:16,125 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2020-07-10 20:23:16,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:16,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:23:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2020-07-10 20:23:16,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:23:16,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2020-07-10 20:23:16,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 132 transitions. [2020-07-10 20:23:16,278 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:16,281 INFO L225 Difference]: With dead ends: 128 [2020-07-10 20:23:16,281 INFO L226 Difference]: Without dead ends: 123 [2020-07-10 20:23:16,282 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-10 20:23:16,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-07-10 20:23:16,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2020-07-10 20:23:16,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:16,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 117 states. [2020-07-10 20:23:16,434 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 117 states. [2020-07-10 20:23:16,434 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 117 states. [2020-07-10 20:23:16,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:16,447 INFO L93 Difference]: Finished difference Result 123 states and 140 transitions. [2020-07-10 20:23:16,447 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 140 transitions. [2020-07-10 20:23:16,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:16,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:16,448 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 123 states. [2020-07-10 20:23:16,448 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 123 states. [2020-07-10 20:23:16,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:16,454 INFO L93 Difference]: Finished difference Result 123 states and 140 transitions. [2020-07-10 20:23:16,454 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 140 transitions. [2020-07-10 20:23:16,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:16,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:16,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:16,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:16,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-10 20:23:16,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 134 transitions. [2020-07-10 20:23:16,459 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 134 transitions. Word has length 49 [2020-07-10 20:23:16,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:16,459 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 134 transitions. [2020-07-10 20:23:16,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 20:23:16,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 117 states and 134 transitions. [2020-07-10 20:23:16,611 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:16,611 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 134 transitions. [2020-07-10 20:23:16,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-10 20:23:16,612 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:16,612 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:16,613 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 20:23:16,613 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:16,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:16,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1519048418, now seen corresponding path program 1 times [2020-07-10 20:23:16,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:16,614 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1394900160] [2020-07-10 20:23:16,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:16,730 INFO L280 TraceCheckUtils]: 0: Hoare triple {5509#true} assume true; {5509#true} is VALID [2020-07-10 20:23:16,730 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5509#true} {5509#true} #144#return; {5509#true} is VALID [2020-07-10 20:23:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:16,744 INFO L280 TraceCheckUtils]: 0: Hoare triple {5509#true} ~cond := #in~cond; {5509#true} is VALID [2020-07-10 20:23:16,745 INFO L280 TraceCheckUtils]: 1: Hoare triple {5509#true} assume !(0 == ~cond); {5509#true} is VALID [2020-07-10 20:23:16,745 INFO L280 TraceCheckUtils]: 2: Hoare triple {5509#true} assume true; {5509#true} is VALID [2020-07-10 20:23:16,745 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5509#true} {5513#(<= 0 main_~t~0)} #156#return; {5513#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:16,761 INFO L280 TraceCheckUtils]: 0: Hoare triple {5509#true} ~cond := #in~cond; {5509#true} is VALID [2020-07-10 20:23:16,761 INFO L280 TraceCheckUtils]: 1: Hoare triple {5509#true} assume !(0 == ~cond); {5509#true} is VALID [2020-07-10 20:23:16,761 INFO L280 TraceCheckUtils]: 2: Hoare triple {5509#true} assume true; {5509#true} is VALID [2020-07-10 20:23:16,768 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5509#true} {5513#(<= 0 main_~t~0)} #158#return; {5513#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:16,778 INFO L280 TraceCheckUtils]: 0: Hoare triple {5509#true} ~cond := #in~cond; {5509#true} is VALID [2020-07-10 20:23:16,778 INFO L280 TraceCheckUtils]: 1: Hoare triple {5509#true} assume !(0 == ~cond); {5509#true} is VALID [2020-07-10 20:23:16,778 INFO L280 TraceCheckUtils]: 2: Hoare triple {5509#true} assume true; {5509#true} is VALID [2020-07-10 20:23:16,779 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5509#true} {5523#(<= 1 main_~t~0)} #164#return; {5523#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:16,786 INFO L280 TraceCheckUtils]: 0: Hoare triple {5509#true} ~cond := #in~cond; {5509#true} is VALID [2020-07-10 20:23:16,786 INFO L280 TraceCheckUtils]: 1: Hoare triple {5509#true} assume !(0 == ~cond); {5509#true} is VALID [2020-07-10 20:23:16,787 INFO L280 TraceCheckUtils]: 2: Hoare triple {5509#true} assume true; {5509#true} is VALID [2020-07-10 20:23:16,788 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5509#true} {5523#(<= 1 main_~t~0)} #166#return; {5523#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:16,788 INFO L263 TraceCheckUtils]: 0: Hoare triple {5509#true} call ULTIMATE.init(); {5509#true} is VALID [2020-07-10 20:23:16,788 INFO L280 TraceCheckUtils]: 1: Hoare triple {5509#true} assume true; {5509#true} is VALID [2020-07-10 20:23:16,788 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5509#true} {5509#true} #144#return; {5509#true} is VALID [2020-07-10 20:23:16,789 INFO L263 TraceCheckUtils]: 3: Hoare triple {5509#true} call #t~ret10 := main(); {5509#true} is VALID [2020-07-10 20:23:16,789 INFO L280 TraceCheckUtils]: 4: Hoare triple {5509#true} havoc ~tagbuf_len~0; {5509#true} is VALID [2020-07-10 20:23:16,789 INFO L280 TraceCheckUtils]: 5: Hoare triple {5509#true} havoc ~t~0; {5509#true} is VALID [2020-07-10 20:23:16,789 INFO L280 TraceCheckUtils]: 6: Hoare triple {5509#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {5509#true} is VALID [2020-07-10 20:23:16,790 INFO L280 TraceCheckUtils]: 7: Hoare triple {5509#true} ~tagbuf_len~0 := #t~nondet0; {5509#true} is VALID [2020-07-10 20:23:16,790 INFO L280 TraceCheckUtils]: 8: Hoare triple {5509#true} havoc #t~nondet0; {5509#true} is VALID [2020-07-10 20:23:16,790 INFO L280 TraceCheckUtils]: 9: Hoare triple {5509#true} assume ~tagbuf_len~0 >= 1; {5509#true} is VALID [2020-07-10 20:23:16,792 INFO L280 TraceCheckUtils]: 10: Hoare triple {5509#true} ~t~0 := 0; {5513#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:16,793 INFO L280 TraceCheckUtils]: 11: Hoare triple {5513#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {5513#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:16,794 INFO L280 TraceCheckUtils]: 12: Hoare triple {5513#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {5513#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:16,794 INFO L280 TraceCheckUtils]: 13: Hoare triple {5513#(<= 0 main_~t~0)} havoc #t~pre1; {5513#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:16,795 INFO L280 TraceCheckUtils]: 14: Hoare triple {5513#(<= 0 main_~t~0)} assume !false; {5513#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:16,795 INFO L280 TraceCheckUtils]: 15: Hoare triple {5513#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {5513#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:16,796 INFO L280 TraceCheckUtils]: 16: Hoare triple {5513#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {5513#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:16,797 INFO L280 TraceCheckUtils]: 17: Hoare triple {5513#(<= 0 main_~t~0)} assume 0 != #t~nondet2; {5513#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:16,797 INFO L280 TraceCheckUtils]: 18: Hoare triple {5513#(<= 0 main_~t~0)} havoc #t~nondet2; {5513#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:16,797 INFO L263 TraceCheckUtils]: 19: Hoare triple {5513#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {5509#true} is VALID [2020-07-10 20:23:16,798 INFO L280 TraceCheckUtils]: 20: Hoare triple {5509#true} ~cond := #in~cond; {5509#true} is VALID [2020-07-10 20:23:16,798 INFO L280 TraceCheckUtils]: 21: Hoare triple {5509#true} assume !(0 == ~cond); {5509#true} is VALID [2020-07-10 20:23:16,798 INFO L280 TraceCheckUtils]: 22: Hoare triple {5509#true} assume true; {5509#true} is VALID [2020-07-10 20:23:16,799 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {5509#true} {5513#(<= 0 main_~t~0)} #156#return; {5513#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:16,799 INFO L263 TraceCheckUtils]: 24: Hoare triple {5513#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {5509#true} is VALID [2020-07-10 20:23:16,799 INFO L280 TraceCheckUtils]: 25: Hoare triple {5509#true} ~cond := #in~cond; {5509#true} is VALID [2020-07-10 20:23:16,800 INFO L280 TraceCheckUtils]: 26: Hoare triple {5509#true} assume !(0 == ~cond); {5509#true} is VALID [2020-07-10 20:23:16,800 INFO L280 TraceCheckUtils]: 27: Hoare triple {5509#true} assume true; {5509#true} is VALID [2020-07-10 20:23:16,801 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {5509#true} {5513#(<= 0 main_~t~0)} #158#return; {5513#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:16,801 INFO L280 TraceCheckUtils]: 29: Hoare triple {5513#(<= 0 main_~t~0)} #t~post4 := ~t~0; {5522#(<= 0 |main_#t~post4|)} is VALID [2020-07-10 20:23:16,802 INFO L280 TraceCheckUtils]: 30: Hoare triple {5522#(<= 0 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {5523#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:16,803 INFO L280 TraceCheckUtils]: 31: Hoare triple {5523#(<= 1 main_~t~0)} havoc #t~post4; {5523#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:16,803 INFO L280 TraceCheckUtils]: 32: Hoare triple {5523#(<= 1 main_~t~0)} assume !false; {5523#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:16,804 INFO L280 TraceCheckUtils]: 33: Hoare triple {5523#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {5523#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:16,805 INFO L280 TraceCheckUtils]: 34: Hoare triple {5523#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {5523#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:16,805 INFO L280 TraceCheckUtils]: 35: Hoare triple {5523#(<= 1 main_~t~0)} assume 0 != #t~nondet5; {5523#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:16,806 INFO L280 TraceCheckUtils]: 36: Hoare triple {5523#(<= 1 main_~t~0)} havoc #t~nondet5; {5523#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:16,806 INFO L280 TraceCheckUtils]: 37: Hoare triple {5523#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {5523#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:16,807 INFO L280 TraceCheckUtils]: 38: Hoare triple {5523#(<= 1 main_~t~0)} assume 0 != #t~nondet6; {5523#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:16,808 INFO L280 TraceCheckUtils]: 39: Hoare triple {5523#(<= 1 main_~t~0)} havoc #t~nondet6; {5523#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:16,808 INFO L263 TraceCheckUtils]: 40: Hoare triple {5523#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {5509#true} is VALID [2020-07-10 20:23:16,808 INFO L280 TraceCheckUtils]: 41: Hoare triple {5509#true} ~cond := #in~cond; {5509#true} is VALID [2020-07-10 20:23:16,808 INFO L280 TraceCheckUtils]: 42: Hoare triple {5509#true} assume !(0 == ~cond); {5509#true} is VALID [2020-07-10 20:23:16,809 INFO L280 TraceCheckUtils]: 43: Hoare triple {5509#true} assume true; {5509#true} is VALID [2020-07-10 20:23:16,812 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {5509#true} {5523#(<= 1 main_~t~0)} #164#return; {5523#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:16,812 INFO L263 TraceCheckUtils]: 45: Hoare triple {5523#(<= 1 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {5509#true} is VALID [2020-07-10 20:23:16,812 INFO L280 TraceCheckUtils]: 46: Hoare triple {5509#true} ~cond := #in~cond; {5509#true} is VALID [2020-07-10 20:23:16,813 INFO L280 TraceCheckUtils]: 47: Hoare triple {5509#true} assume !(0 == ~cond); {5509#true} is VALID [2020-07-10 20:23:16,813 INFO L280 TraceCheckUtils]: 48: Hoare triple {5509#true} assume true; {5509#true} is VALID [2020-07-10 20:23:16,814 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {5509#true} {5523#(<= 1 main_~t~0)} #166#return; {5523#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:16,815 INFO L280 TraceCheckUtils]: 50: Hoare triple {5523#(<= 1 main_~t~0)} #t~post7 := ~t~0; {5532#(<= 1 |main_#t~post7|)} is VALID [2020-07-10 20:23:16,815 INFO L280 TraceCheckUtils]: 51: Hoare triple {5532#(<= 1 |main_#t~post7|)} ~t~0 := 1 + #t~post7; {5533#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:16,816 INFO L280 TraceCheckUtils]: 52: Hoare triple {5533#(<= 2 main_~t~0)} havoc #t~post7; {5533#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:16,817 INFO L280 TraceCheckUtils]: 53: Hoare triple {5533#(<= 2 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {5533#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:16,818 INFO L263 TraceCheckUtils]: 54: Hoare triple {5533#(<= 2 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {5534#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:16,819 INFO L280 TraceCheckUtils]: 55: Hoare triple {5534#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {5535#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:16,819 INFO L280 TraceCheckUtils]: 56: Hoare triple {5535#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {5510#false} is VALID [2020-07-10 20:23:16,820 INFO L280 TraceCheckUtils]: 57: Hoare triple {5510#false} assume !false; {5510#false} is VALID [2020-07-10 20:23:16,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:23:16,824 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:16,824 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1394900160] [2020-07-10 20:23:16,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:16,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 20:23:16,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578605638] [2020-07-10 20:23:16,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2020-07-10 20:23:16,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:16,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 20:23:16,891 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:16,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 20:23:16,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:16,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 20:23:16,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-10 20:23:16,892 INFO L87 Difference]: Start difference. First operand 117 states and 134 transitions. Second operand 9 states. [2020-07-10 20:23:17,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:17,751 INFO L93 Difference]: Finished difference Result 135 states and 153 transitions. [2020-07-10 20:23:17,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 20:23:17,752 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2020-07-10 20:23:17,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:17,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:23:17,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2020-07-10 20:23:17,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:23:17,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2020-07-10 20:23:17,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 135 transitions. [2020-07-10 20:23:17,905 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:17,912 INFO L225 Difference]: With dead ends: 135 [2020-07-10 20:23:17,912 INFO L226 Difference]: Without dead ends: 133 [2020-07-10 20:23:17,913 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-07-10 20:23:17,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-07-10 20:23:18,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 126. [2020-07-10 20:23:18,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:18,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 126 states. [2020-07-10 20:23:18,086 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 126 states. [2020-07-10 20:23:18,086 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 126 states. [2020-07-10 20:23:18,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:18,091 INFO L93 Difference]: Finished difference Result 133 states and 151 transitions. [2020-07-10 20:23:18,091 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 151 transitions. [2020-07-10 20:23:18,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:18,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:18,092 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 133 states. [2020-07-10 20:23:18,092 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 133 states. [2020-07-10 20:23:18,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:18,096 INFO L93 Difference]: Finished difference Result 133 states and 151 transitions. [2020-07-10 20:23:18,097 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 151 transitions. [2020-07-10 20:23:18,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:18,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:18,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:18,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:18,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-07-10 20:23:18,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2020-07-10 20:23:18,101 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 58 [2020-07-10 20:23:18,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:18,102 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2020-07-10 20:23:18,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 20:23:18,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 126 states and 143 transitions. [2020-07-10 20:23:18,255 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:18,256 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2020-07-10 20:23:18,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-10 20:23:18,257 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:18,257 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:18,257 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-10 20:23:18,257 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:18,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:18,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1733407875, now seen corresponding path program 1 times [2020-07-10 20:23:18,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:18,258 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1506516950] [2020-07-10 20:23:18,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:18,371 INFO L280 TraceCheckUtils]: 0: Hoare triple {6336#true} assume true; {6336#true} is VALID [2020-07-10 20:23:18,371 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {6336#true} {6336#true} #144#return; {6336#true} is VALID [2020-07-10 20:23:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:18,376 INFO L280 TraceCheckUtils]: 0: Hoare triple {6336#true} ~cond := #in~cond; {6336#true} is VALID [2020-07-10 20:23:18,376 INFO L280 TraceCheckUtils]: 1: Hoare triple {6336#true} assume !(0 == ~cond); {6336#true} is VALID [2020-07-10 20:23:18,376 INFO L280 TraceCheckUtils]: 2: Hoare triple {6336#true} assume true; {6336#true} is VALID [2020-07-10 20:23:18,377 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6336#true} {6340#(<= 0 main_~t~0)} #152#return; {6340#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:18,389 INFO L280 TraceCheckUtils]: 0: Hoare triple {6336#true} ~cond := #in~cond; {6336#true} is VALID [2020-07-10 20:23:18,389 INFO L280 TraceCheckUtils]: 1: Hoare triple {6336#true} assume !(0 == ~cond); {6336#true} is VALID [2020-07-10 20:23:18,389 INFO L280 TraceCheckUtils]: 2: Hoare triple {6336#true} assume true; {6336#true} is VALID [2020-07-10 20:23:18,390 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6336#true} {6340#(<= 0 main_~t~0)} #154#return; {6340#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:18,395 INFO L280 TraceCheckUtils]: 0: Hoare triple {6336#true} ~cond := #in~cond; {6336#true} is VALID [2020-07-10 20:23:18,395 INFO L280 TraceCheckUtils]: 1: Hoare triple {6336#true} assume !(0 == ~cond); {6336#true} is VALID [2020-07-10 20:23:18,395 INFO L280 TraceCheckUtils]: 2: Hoare triple {6336#true} assume true; {6336#true} is VALID [2020-07-10 20:23:18,396 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6336#true} {6350#(<= 1 main_~t~0)} #156#return; {6350#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:18,402 INFO L280 TraceCheckUtils]: 0: Hoare triple {6336#true} ~cond := #in~cond; {6336#true} is VALID [2020-07-10 20:23:18,402 INFO L280 TraceCheckUtils]: 1: Hoare triple {6336#true} assume !(0 == ~cond); {6336#true} is VALID [2020-07-10 20:23:18,403 INFO L280 TraceCheckUtils]: 2: Hoare triple {6336#true} assume true; {6336#true} is VALID [2020-07-10 20:23:18,403 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6336#true} {6350#(<= 1 main_~t~0)} #158#return; {6350#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:18,403 INFO L263 TraceCheckUtils]: 0: Hoare triple {6336#true} call ULTIMATE.init(); {6336#true} is VALID [2020-07-10 20:23:18,404 INFO L280 TraceCheckUtils]: 1: Hoare triple {6336#true} assume true; {6336#true} is VALID [2020-07-10 20:23:18,404 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6336#true} {6336#true} #144#return; {6336#true} is VALID [2020-07-10 20:23:18,404 INFO L263 TraceCheckUtils]: 3: Hoare triple {6336#true} call #t~ret10 := main(); {6336#true} is VALID [2020-07-10 20:23:18,404 INFO L280 TraceCheckUtils]: 4: Hoare triple {6336#true} havoc ~tagbuf_len~0; {6336#true} is VALID [2020-07-10 20:23:18,404 INFO L280 TraceCheckUtils]: 5: Hoare triple {6336#true} havoc ~t~0; {6336#true} is VALID [2020-07-10 20:23:18,404 INFO L280 TraceCheckUtils]: 6: Hoare triple {6336#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {6336#true} is VALID [2020-07-10 20:23:18,404 INFO L280 TraceCheckUtils]: 7: Hoare triple {6336#true} ~tagbuf_len~0 := #t~nondet0; {6336#true} is VALID [2020-07-10 20:23:18,405 INFO L280 TraceCheckUtils]: 8: Hoare triple {6336#true} havoc #t~nondet0; {6336#true} is VALID [2020-07-10 20:23:18,405 INFO L280 TraceCheckUtils]: 9: Hoare triple {6336#true} assume ~tagbuf_len~0 >= 1; {6336#true} is VALID [2020-07-10 20:23:18,410 INFO L280 TraceCheckUtils]: 10: Hoare triple {6336#true} ~t~0 := 0; {6340#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:18,411 INFO L280 TraceCheckUtils]: 11: Hoare triple {6340#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {6340#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:18,412 INFO L280 TraceCheckUtils]: 12: Hoare triple {6340#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {6340#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:18,412 INFO L280 TraceCheckUtils]: 13: Hoare triple {6340#(<= 0 main_~t~0)} havoc #t~pre1; {6340#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:18,413 INFO L280 TraceCheckUtils]: 14: Hoare triple {6340#(<= 0 main_~t~0)} assume !false; {6340#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:18,413 INFO L280 TraceCheckUtils]: 15: Hoare triple {6340#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {6340#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:18,414 INFO L280 TraceCheckUtils]: 16: Hoare triple {6340#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {6340#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:18,414 INFO L280 TraceCheckUtils]: 17: Hoare triple {6340#(<= 0 main_~t~0)} assume !(0 != #t~nondet2); {6340#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:18,415 INFO L280 TraceCheckUtils]: 18: Hoare triple {6340#(<= 0 main_~t~0)} havoc #t~nondet2; {6340#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:18,415 INFO L263 TraceCheckUtils]: 19: Hoare triple {6340#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {6336#true} is VALID [2020-07-10 20:23:18,415 INFO L280 TraceCheckUtils]: 20: Hoare triple {6336#true} ~cond := #in~cond; {6336#true} is VALID [2020-07-10 20:23:18,415 INFO L280 TraceCheckUtils]: 21: Hoare triple {6336#true} assume !(0 == ~cond); {6336#true} is VALID [2020-07-10 20:23:18,415 INFO L280 TraceCheckUtils]: 22: Hoare triple {6336#true} assume true; {6336#true} is VALID [2020-07-10 20:23:18,416 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {6336#true} {6340#(<= 0 main_~t~0)} #152#return; {6340#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:18,416 INFO L263 TraceCheckUtils]: 24: Hoare triple {6340#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {6336#true} is VALID [2020-07-10 20:23:18,417 INFO L280 TraceCheckUtils]: 25: Hoare triple {6336#true} ~cond := #in~cond; {6336#true} is VALID [2020-07-10 20:23:18,417 INFO L280 TraceCheckUtils]: 26: Hoare triple {6336#true} assume !(0 == ~cond); {6336#true} is VALID [2020-07-10 20:23:18,417 INFO L280 TraceCheckUtils]: 27: Hoare triple {6336#true} assume true; {6336#true} is VALID [2020-07-10 20:23:18,418 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {6336#true} {6340#(<= 0 main_~t~0)} #154#return; {6340#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:18,418 INFO L280 TraceCheckUtils]: 29: Hoare triple {6340#(<= 0 main_~t~0)} #t~post3 := ~t~0; {6349#(<= 0 |main_#t~post3|)} is VALID [2020-07-10 20:23:18,419 INFO L280 TraceCheckUtils]: 30: Hoare triple {6349#(<= 0 |main_#t~post3|)} ~t~0 := 1 + #t~post3; {6350#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:18,420 INFO L280 TraceCheckUtils]: 31: Hoare triple {6350#(<= 1 main_~t~0)} havoc #t~post3; {6350#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:18,421 INFO L280 TraceCheckUtils]: 32: Hoare triple {6350#(<= 1 main_~t~0)} assume !false; {6350#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:18,422 INFO L280 TraceCheckUtils]: 33: Hoare triple {6350#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {6350#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:18,428 INFO L280 TraceCheckUtils]: 34: Hoare triple {6350#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {6350#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:18,429 INFO L280 TraceCheckUtils]: 35: Hoare triple {6350#(<= 1 main_~t~0)} assume 0 != #t~nondet2; {6350#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:18,431 INFO L280 TraceCheckUtils]: 36: Hoare triple {6350#(<= 1 main_~t~0)} havoc #t~nondet2; {6350#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:18,432 INFO L263 TraceCheckUtils]: 37: Hoare triple {6350#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {6336#true} is VALID [2020-07-10 20:23:18,432 INFO L280 TraceCheckUtils]: 38: Hoare triple {6336#true} ~cond := #in~cond; {6336#true} is VALID [2020-07-10 20:23:18,432 INFO L280 TraceCheckUtils]: 39: Hoare triple {6336#true} assume !(0 == ~cond); {6336#true} is VALID [2020-07-10 20:23:18,432 INFO L280 TraceCheckUtils]: 40: Hoare triple {6336#true} assume true; {6336#true} is VALID [2020-07-10 20:23:18,433 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {6336#true} {6350#(<= 1 main_~t~0)} #156#return; {6350#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:18,434 INFO L263 TraceCheckUtils]: 42: Hoare triple {6350#(<= 1 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {6336#true} is VALID [2020-07-10 20:23:18,434 INFO L280 TraceCheckUtils]: 43: Hoare triple {6336#true} ~cond := #in~cond; {6336#true} is VALID [2020-07-10 20:23:18,434 INFO L280 TraceCheckUtils]: 44: Hoare triple {6336#true} assume !(0 == ~cond); {6336#true} is VALID [2020-07-10 20:23:18,434 INFO L280 TraceCheckUtils]: 45: Hoare triple {6336#true} assume true; {6336#true} is VALID [2020-07-10 20:23:18,435 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {6336#true} {6350#(<= 1 main_~t~0)} #158#return; {6350#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:18,435 INFO L280 TraceCheckUtils]: 47: Hoare triple {6350#(<= 1 main_~t~0)} #t~post4 := ~t~0; {6359#(<= 1 |main_#t~post4|)} is VALID [2020-07-10 20:23:18,436 INFO L280 TraceCheckUtils]: 48: Hoare triple {6359#(<= 1 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {6360#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:18,436 INFO L280 TraceCheckUtils]: 49: Hoare triple {6360#(<= 2 main_~t~0)} havoc #t~post4; {6360#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:18,436 INFO L280 TraceCheckUtils]: 50: Hoare triple {6360#(<= 2 main_~t~0)} assume !false; {6360#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:18,437 INFO L280 TraceCheckUtils]: 51: Hoare triple {6360#(<= 2 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {6360#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:18,437 INFO L280 TraceCheckUtils]: 52: Hoare triple {6360#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {6360#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:18,438 INFO L280 TraceCheckUtils]: 53: Hoare triple {6360#(<= 2 main_~t~0)} assume 0 != #t~nondet5; {6360#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:18,438 INFO L280 TraceCheckUtils]: 54: Hoare triple {6360#(<= 2 main_~t~0)} havoc #t~nondet5; {6360#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:18,439 INFO L280 TraceCheckUtils]: 55: Hoare triple {6360#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {6360#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:18,440 INFO L280 TraceCheckUtils]: 56: Hoare triple {6360#(<= 2 main_~t~0)} assume !(0 != #t~nondet6); {6360#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:18,440 INFO L280 TraceCheckUtils]: 57: Hoare triple {6360#(<= 2 main_~t~0)} havoc #t~nondet6; {6360#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:18,441 INFO L263 TraceCheckUtils]: 58: Hoare triple {6360#(<= 2 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {6361#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:18,441 INFO L280 TraceCheckUtils]: 59: Hoare triple {6361#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {6362#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:18,442 INFO L280 TraceCheckUtils]: 60: Hoare triple {6362#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {6337#false} is VALID [2020-07-10 20:23:18,442 INFO L280 TraceCheckUtils]: 61: Hoare triple {6337#false} assume !false; {6337#false} is VALID [2020-07-10 20:23:18,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:23:18,444 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:18,444 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1506516950] [2020-07-10 20:23:18,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:18,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 20:23:18,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44015037] [2020-07-10 20:23:18,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2020-07-10 20:23:18,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:18,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 20:23:18,507 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:18,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 20:23:18,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:18,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 20:23:18,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-10 20:23:18,508 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand 9 states. [2020-07-10 20:23:19,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:19,490 INFO L93 Difference]: Finished difference Result 158 states and 182 transitions. [2020-07-10 20:23:19,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 20:23:19,490 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2020-07-10 20:23:19,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:19,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:23:19,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 132 transitions. [2020-07-10 20:23:19,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:23:19,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 132 transitions. [2020-07-10 20:23:19,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 132 transitions. [2020-07-10 20:23:19,640 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:19,643 INFO L225 Difference]: With dead ends: 158 [2020-07-10 20:23:19,643 INFO L226 Difference]: Without dead ends: 156 [2020-07-10 20:23:19,644 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-07-10 20:23:19,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-07-10 20:23:19,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 147. [2020-07-10 20:23:19,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:19,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand 147 states. [2020-07-10 20:23:19,819 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 147 states. [2020-07-10 20:23:19,820 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 147 states. [2020-07-10 20:23:19,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:19,824 INFO L93 Difference]: Finished difference Result 156 states and 180 transitions. [2020-07-10 20:23:19,825 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 180 transitions. [2020-07-10 20:23:19,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:19,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:19,826 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 156 states. [2020-07-10 20:23:19,826 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 156 states. [2020-07-10 20:23:19,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:19,831 INFO L93 Difference]: Finished difference Result 156 states and 180 transitions. [2020-07-10 20:23:19,831 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 180 transitions. [2020-07-10 20:23:19,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:19,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:19,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:19,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:19,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-07-10 20:23:19,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 169 transitions. [2020-07-10 20:23:19,837 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 169 transitions. Word has length 62 [2020-07-10 20:23:19,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:19,837 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 169 transitions. [2020-07-10 20:23:19,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 20:23:19,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 147 states and 169 transitions. [2020-07-10 20:23:20,069 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:20,070 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2020-07-10 20:23:20,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-10 20:23:20,072 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:20,072 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:20,072 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-10 20:23:20,073 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:20,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:20,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1967257859, now seen corresponding path program 1 times [2020-07-10 20:23:20,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:20,073 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1415371155] [2020-07-10 20:23:20,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:20,241 INFO L280 TraceCheckUtils]: 0: Hoare triple {7297#true} assume true; {7297#true} is VALID [2020-07-10 20:23:20,242 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {7297#true} {7297#true} #144#return; {7297#true} is VALID [2020-07-10 20:23:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:20,253 INFO L280 TraceCheckUtils]: 0: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID [2020-07-10 20:23:20,253 INFO L280 TraceCheckUtils]: 1: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID [2020-07-10 20:23:20,254 INFO L280 TraceCheckUtils]: 2: Hoare triple {7297#true} assume true; {7297#true} is VALID [2020-07-10 20:23:20,254 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7297#true} {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:20,264 INFO L280 TraceCheckUtils]: 0: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID [2020-07-10 20:23:20,264 INFO L280 TraceCheckUtils]: 1: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID [2020-07-10 20:23:20,264 INFO L280 TraceCheckUtils]: 2: Hoare triple {7297#true} assume true; {7297#true} is VALID [2020-07-10 20:23:20,265 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7297#true} {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:20,272 INFO L280 TraceCheckUtils]: 0: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID [2020-07-10 20:23:20,273 INFO L280 TraceCheckUtils]: 1: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID [2020-07-10 20:23:20,273 INFO L280 TraceCheckUtils]: 2: Hoare triple {7297#true} assume true; {7297#true} is VALID [2020-07-10 20:23:20,274 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7297#true} {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #164#return; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:20,280 INFO L280 TraceCheckUtils]: 0: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID [2020-07-10 20:23:20,281 INFO L280 TraceCheckUtils]: 1: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID [2020-07-10 20:23:20,281 INFO L280 TraceCheckUtils]: 2: Hoare triple {7297#true} assume true; {7297#true} is VALID [2020-07-10 20:23:20,282 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7297#true} {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #166#return; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:20,286 INFO L280 TraceCheckUtils]: 0: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID [2020-07-10 20:23:20,287 INFO L280 TraceCheckUtils]: 1: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID [2020-07-10 20:23:20,287 INFO L280 TraceCheckUtils]: 2: Hoare triple {7297#true} assume true; {7297#true} is VALID [2020-07-10 20:23:20,288 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7297#true} {7303#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,288 INFO L263 TraceCheckUtils]: 0: Hoare triple {7297#true} call ULTIMATE.init(); {7297#true} is VALID [2020-07-10 20:23:20,288 INFO L280 TraceCheckUtils]: 1: Hoare triple {7297#true} assume true; {7297#true} is VALID [2020-07-10 20:23:20,289 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7297#true} {7297#true} #144#return; {7297#true} is VALID [2020-07-10 20:23:20,289 INFO L263 TraceCheckUtils]: 3: Hoare triple {7297#true} call #t~ret10 := main(); {7297#true} is VALID [2020-07-10 20:23:20,289 INFO L280 TraceCheckUtils]: 4: Hoare triple {7297#true} havoc ~tagbuf_len~0; {7297#true} is VALID [2020-07-10 20:23:20,289 INFO L280 TraceCheckUtils]: 5: Hoare triple {7297#true} havoc ~t~0; {7297#true} is VALID [2020-07-10 20:23:20,289 INFO L280 TraceCheckUtils]: 6: Hoare triple {7297#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {7297#true} is VALID [2020-07-10 20:23:20,290 INFO L280 TraceCheckUtils]: 7: Hoare triple {7297#true} ~tagbuf_len~0 := #t~nondet0; {7297#true} is VALID [2020-07-10 20:23:20,290 INFO L280 TraceCheckUtils]: 8: Hoare triple {7297#true} havoc #t~nondet0; {7297#true} is VALID [2020-07-10 20:23:20,290 INFO L280 TraceCheckUtils]: 9: Hoare triple {7297#true} assume ~tagbuf_len~0 >= 1; {7301#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,291 INFO L280 TraceCheckUtils]: 10: Hoare triple {7301#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,292 INFO L280 TraceCheckUtils]: 11: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,293 INFO L280 TraceCheckUtils]: 12: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,293 INFO L280 TraceCheckUtils]: 13: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,294 INFO L280 TraceCheckUtils]: 14: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,295 INFO L280 TraceCheckUtils]: 15: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,296 INFO L280 TraceCheckUtils]: 16: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,296 INFO L280 TraceCheckUtils]: 17: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet2; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,297 INFO L280 TraceCheckUtils]: 18: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,297 INFO L263 TraceCheckUtils]: 19: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {7297#true} is VALID [2020-07-10 20:23:20,297 INFO L280 TraceCheckUtils]: 20: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID [2020-07-10 20:23:20,297 INFO L280 TraceCheckUtils]: 21: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID [2020-07-10 20:23:20,298 INFO L280 TraceCheckUtils]: 22: Hoare triple {7297#true} assume true; {7297#true} is VALID [2020-07-10 20:23:20,298 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {7297#true} {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,299 INFO L263 TraceCheckUtils]: 24: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {7297#true} is VALID [2020-07-10 20:23:20,299 INFO L280 TraceCheckUtils]: 25: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID [2020-07-10 20:23:20,299 INFO L280 TraceCheckUtils]: 26: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID [2020-07-10 20:23:20,299 INFO L280 TraceCheckUtils]: 27: Hoare triple {7297#true} assume true; {7297#true} is VALID [2020-07-10 20:23:20,300 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {7297#true} {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,301 INFO L280 TraceCheckUtils]: 29: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post4 := ~t~0; {7312#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,302 INFO L280 TraceCheckUtils]: 30: Hoare triple {7312#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post4; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,303 INFO L280 TraceCheckUtils]: 31: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post4; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,304 INFO L280 TraceCheckUtils]: 32: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,305 INFO L280 TraceCheckUtils]: 33: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,306 INFO L280 TraceCheckUtils]: 34: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,307 INFO L280 TraceCheckUtils]: 35: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet5; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,307 INFO L280 TraceCheckUtils]: 36: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet5; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,308 INFO L280 TraceCheckUtils]: 37: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,309 INFO L280 TraceCheckUtils]: 38: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet6; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,309 INFO L280 TraceCheckUtils]: 39: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet6; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,310 INFO L263 TraceCheckUtils]: 40: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {7297#true} is VALID [2020-07-10 20:23:20,310 INFO L280 TraceCheckUtils]: 41: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID [2020-07-10 20:23:20,310 INFO L280 TraceCheckUtils]: 42: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID [2020-07-10 20:23:20,310 INFO L280 TraceCheckUtils]: 43: Hoare triple {7297#true} assume true; {7297#true} is VALID [2020-07-10 20:23:20,311 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {7297#true} {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #164#return; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,311 INFO L263 TraceCheckUtils]: 45: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {7297#true} is VALID [2020-07-10 20:23:20,311 INFO L280 TraceCheckUtils]: 46: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID [2020-07-10 20:23:20,312 INFO L280 TraceCheckUtils]: 47: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID [2020-07-10 20:23:20,312 INFO L280 TraceCheckUtils]: 48: Hoare triple {7297#true} assume true; {7297#true} is VALID [2020-07-10 20:23:20,313 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {7297#true} {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #166#return; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,314 INFO L280 TraceCheckUtils]: 50: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post7 := ~t~0; {7321#(<= (+ |main_#t~post7| 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,315 INFO L280 TraceCheckUtils]: 51: Hoare triple {7321#(<= (+ |main_#t~post7| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post7; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,316 INFO L280 TraceCheckUtils]: 52: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post7; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,316 INFO L280 TraceCheckUtils]: 53: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,317 INFO L263 TraceCheckUtils]: 54: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {7297#true} is VALID [2020-07-10 20:23:20,317 INFO L280 TraceCheckUtils]: 55: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID [2020-07-10 20:23:20,317 INFO L280 TraceCheckUtils]: 56: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID [2020-07-10 20:23:20,317 INFO L280 TraceCheckUtils]: 57: Hoare triple {7297#true} assume true; {7297#true} is VALID [2020-07-10 20:23:20,318 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {7297#true} {7303#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:20,320 INFO L263 TraceCheckUtils]: 59: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {7326#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:20,320 INFO L280 TraceCheckUtils]: 60: Hoare triple {7326#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {7327#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:20,321 INFO L280 TraceCheckUtils]: 61: Hoare triple {7327#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {7298#false} is VALID [2020-07-10 20:23:20,321 INFO L280 TraceCheckUtils]: 62: Hoare triple {7298#false} assume !false; {7298#false} is VALID [2020-07-10 20:23:20,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:23:20,327 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:20,327 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1415371155] [2020-07-10 20:23:20,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:20,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 20:23:20,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404428725] [2020-07-10 20:23:20,329 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2020-07-10 20:23:20,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:20,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 20:23:20,396 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:20,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 20:23:20,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:20,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 20:23:20,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-10 20:23:20,398 INFO L87 Difference]: Start difference. First operand 147 states and 169 transitions. Second operand 9 states. [2020-07-10 20:23:21,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:21,366 INFO L93 Difference]: Finished difference Result 158 states and 180 transitions. [2020-07-10 20:23:21,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-10 20:23:21,366 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2020-07-10 20:23:21,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:21,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:23:21,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 129 transitions. [2020-07-10 20:23:21,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:23:21,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 129 transitions. [2020-07-10 20:23:21,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 129 transitions. [2020-07-10 20:23:21,497 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:21,501 INFO L225 Difference]: With dead ends: 158 [2020-07-10 20:23:21,501 INFO L226 Difference]: Without dead ends: 156 [2020-07-10 20:23:21,502 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-07-10 20:23:21,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-07-10 20:23:21,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2020-07-10 20:23:21,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:21,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand 152 states. [2020-07-10 20:23:21,687 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 152 states. [2020-07-10 20:23:21,687 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 152 states. [2020-07-10 20:23:21,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:21,692 INFO L93 Difference]: Finished difference Result 156 states and 178 transitions. [2020-07-10 20:23:21,692 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 178 transitions. [2020-07-10 20:23:21,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:21,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:21,693 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 156 states. [2020-07-10 20:23:21,693 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 156 states. [2020-07-10 20:23:21,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:21,697 INFO L93 Difference]: Finished difference Result 156 states and 178 transitions. [2020-07-10 20:23:21,697 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 178 transitions. [2020-07-10 20:23:21,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:21,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:21,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:21,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:21,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-07-10 20:23:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 174 transitions. [2020-07-10 20:23:21,704 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 174 transitions. Word has length 63 [2020-07-10 20:23:21,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:21,704 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 174 transitions. [2020-07-10 20:23:21,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 20:23:21,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 152 states and 174 transitions. [2020-07-10 20:23:21,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:21,900 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 174 transitions. [2020-07-10 20:23:21,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-10 20:23:21,901 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:21,901 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:21,902 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-10 20:23:21,902 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:21,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:21,902 INFO L82 PathProgramCache]: Analyzing trace with hash -822659134, now seen corresponding path program 1 times [2020-07-10 20:23:21,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:21,903 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1933167168] [2020-07-10 20:23:21,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:22,015 INFO L280 TraceCheckUtils]: 0: Hoare triple {8274#true} assume true; {8274#true} is VALID [2020-07-10 20:23:22,015 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8274#true} {8274#true} #144#return; {8274#true} is VALID [2020-07-10 20:23:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:22,018 INFO L280 TraceCheckUtils]: 0: Hoare triple {8274#true} ~cond := #in~cond; {8274#true} is VALID [2020-07-10 20:23:22,019 INFO L280 TraceCheckUtils]: 1: Hoare triple {8274#true} assume !(0 == ~cond); {8274#true} is VALID [2020-07-10 20:23:22,019 INFO L280 TraceCheckUtils]: 2: Hoare triple {8274#true} assume true; {8274#true} is VALID [2020-07-10 20:23:22,019 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8274#true} {8278#(<= 0 main_~t~0)} #156#return; {8278#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:22,029 INFO L280 TraceCheckUtils]: 0: Hoare triple {8274#true} ~cond := #in~cond; {8274#true} is VALID [2020-07-10 20:23:22,029 INFO L280 TraceCheckUtils]: 1: Hoare triple {8274#true} assume !(0 == ~cond); {8274#true} is VALID [2020-07-10 20:23:22,030 INFO L280 TraceCheckUtils]: 2: Hoare triple {8274#true} assume true; {8274#true} is VALID [2020-07-10 20:23:22,030 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8274#true} {8278#(<= 0 main_~t~0)} #158#return; {8278#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:22,034 INFO L280 TraceCheckUtils]: 0: Hoare triple {8274#true} ~cond := #in~cond; {8274#true} is VALID [2020-07-10 20:23:22,035 INFO L280 TraceCheckUtils]: 1: Hoare triple {8274#true} assume !(0 == ~cond); {8274#true} is VALID [2020-07-10 20:23:22,035 INFO L280 TraceCheckUtils]: 2: Hoare triple {8274#true} assume true; {8274#true} is VALID [2020-07-10 20:23:22,035 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8274#true} {8288#(<= 1 main_~t~0)} #172#return; {8288#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:22,043 INFO L280 TraceCheckUtils]: 0: Hoare triple {8274#true} ~cond := #in~cond; {8274#true} is VALID [2020-07-10 20:23:22,043 INFO L280 TraceCheckUtils]: 1: Hoare triple {8274#true} assume !(0 == ~cond); {8274#true} is VALID [2020-07-10 20:23:22,044 INFO L280 TraceCheckUtils]: 2: Hoare triple {8274#true} assume true; {8274#true} is VALID [2020-07-10 20:23:22,044 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8274#true} {8288#(<= 1 main_~t~0)} #174#return; {8288#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:22,045 INFO L263 TraceCheckUtils]: 0: Hoare triple {8274#true} call ULTIMATE.init(); {8274#true} is VALID [2020-07-10 20:23:22,045 INFO L280 TraceCheckUtils]: 1: Hoare triple {8274#true} assume true; {8274#true} is VALID [2020-07-10 20:23:22,045 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8274#true} {8274#true} #144#return; {8274#true} is VALID [2020-07-10 20:23:22,045 INFO L263 TraceCheckUtils]: 3: Hoare triple {8274#true} call #t~ret10 := main(); {8274#true} is VALID [2020-07-10 20:23:22,045 INFO L280 TraceCheckUtils]: 4: Hoare triple {8274#true} havoc ~tagbuf_len~0; {8274#true} is VALID [2020-07-10 20:23:22,046 INFO L280 TraceCheckUtils]: 5: Hoare triple {8274#true} havoc ~t~0; {8274#true} is VALID [2020-07-10 20:23:22,046 INFO L280 TraceCheckUtils]: 6: Hoare triple {8274#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {8274#true} is VALID [2020-07-10 20:23:22,046 INFO L280 TraceCheckUtils]: 7: Hoare triple {8274#true} ~tagbuf_len~0 := #t~nondet0; {8274#true} is VALID [2020-07-10 20:23:22,046 INFO L280 TraceCheckUtils]: 8: Hoare triple {8274#true} havoc #t~nondet0; {8274#true} is VALID [2020-07-10 20:23:22,047 INFO L280 TraceCheckUtils]: 9: Hoare triple {8274#true} assume ~tagbuf_len~0 >= 1; {8274#true} is VALID [2020-07-10 20:23:22,047 INFO L280 TraceCheckUtils]: 10: Hoare triple {8274#true} ~t~0 := 0; {8278#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:22,048 INFO L280 TraceCheckUtils]: 11: Hoare triple {8278#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {8278#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:22,049 INFO L280 TraceCheckUtils]: 12: Hoare triple {8278#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {8278#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:22,049 INFO L280 TraceCheckUtils]: 13: Hoare triple {8278#(<= 0 main_~t~0)} havoc #t~pre1; {8278#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:22,050 INFO L280 TraceCheckUtils]: 14: Hoare triple {8278#(<= 0 main_~t~0)} assume !false; {8278#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:22,050 INFO L280 TraceCheckUtils]: 15: Hoare triple {8278#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {8278#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:22,051 INFO L280 TraceCheckUtils]: 16: Hoare triple {8278#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {8278#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:22,051 INFO L280 TraceCheckUtils]: 17: Hoare triple {8278#(<= 0 main_~t~0)} assume 0 != #t~nondet2; {8278#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:22,052 INFO L280 TraceCheckUtils]: 18: Hoare triple {8278#(<= 0 main_~t~0)} havoc #t~nondet2; {8278#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:22,052 INFO L263 TraceCheckUtils]: 19: Hoare triple {8278#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {8274#true} is VALID [2020-07-10 20:23:22,052 INFO L280 TraceCheckUtils]: 20: Hoare triple {8274#true} ~cond := #in~cond; {8274#true} is VALID [2020-07-10 20:23:22,053 INFO L280 TraceCheckUtils]: 21: Hoare triple {8274#true} assume !(0 == ~cond); {8274#true} is VALID [2020-07-10 20:23:22,053 INFO L280 TraceCheckUtils]: 22: Hoare triple {8274#true} assume true; {8274#true} is VALID [2020-07-10 20:23:22,054 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {8274#true} {8278#(<= 0 main_~t~0)} #156#return; {8278#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:22,054 INFO L263 TraceCheckUtils]: 24: Hoare triple {8278#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {8274#true} is VALID [2020-07-10 20:23:22,054 INFO L280 TraceCheckUtils]: 25: Hoare triple {8274#true} ~cond := #in~cond; {8274#true} is VALID [2020-07-10 20:23:22,054 INFO L280 TraceCheckUtils]: 26: Hoare triple {8274#true} assume !(0 == ~cond); {8274#true} is VALID [2020-07-10 20:23:22,055 INFO L280 TraceCheckUtils]: 27: Hoare triple {8274#true} assume true; {8274#true} is VALID [2020-07-10 20:23:22,055 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {8274#true} {8278#(<= 0 main_~t~0)} #158#return; {8278#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:22,056 INFO L280 TraceCheckUtils]: 29: Hoare triple {8278#(<= 0 main_~t~0)} #t~post4 := ~t~0; {8287#(<= 0 |main_#t~post4|)} is VALID [2020-07-10 20:23:22,057 INFO L280 TraceCheckUtils]: 30: Hoare triple {8287#(<= 0 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {8288#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:22,057 INFO L280 TraceCheckUtils]: 31: Hoare triple {8288#(<= 1 main_~t~0)} havoc #t~post4; {8288#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:22,058 INFO L280 TraceCheckUtils]: 32: Hoare triple {8288#(<= 1 main_~t~0)} assume !false; {8288#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:22,059 INFO L280 TraceCheckUtils]: 33: Hoare triple {8288#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {8288#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:22,059 INFO L280 TraceCheckUtils]: 34: Hoare triple {8288#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {8288#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:22,060 INFO L280 TraceCheckUtils]: 35: Hoare triple {8288#(<= 1 main_~t~0)} assume 0 != #t~nondet5; {8288#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:22,060 INFO L280 TraceCheckUtils]: 36: Hoare triple {8288#(<= 1 main_~t~0)} havoc #t~nondet5; {8288#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:22,061 INFO L280 TraceCheckUtils]: 37: Hoare triple {8288#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {8288#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:22,062 INFO L280 TraceCheckUtils]: 38: Hoare triple {8288#(<= 1 main_~t~0)} assume !(0 != #t~nondet6); {8288#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:22,062 INFO L280 TraceCheckUtils]: 39: Hoare triple {8288#(<= 1 main_~t~0)} havoc #t~nondet6; {8288#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:22,062 INFO L263 TraceCheckUtils]: 40: Hoare triple {8288#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {8274#true} is VALID [2020-07-10 20:23:22,063 INFO L280 TraceCheckUtils]: 41: Hoare triple {8274#true} ~cond := #in~cond; {8274#true} is VALID [2020-07-10 20:23:22,063 INFO L280 TraceCheckUtils]: 42: Hoare triple {8274#true} assume !(0 == ~cond); {8274#true} is VALID [2020-07-10 20:23:22,063 INFO L280 TraceCheckUtils]: 43: Hoare triple {8274#true} assume true; {8274#true} is VALID [2020-07-10 20:23:22,064 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {8274#true} {8288#(<= 1 main_~t~0)} #172#return; {8288#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:22,064 INFO L263 TraceCheckUtils]: 45: Hoare triple {8288#(<= 1 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {8274#true} is VALID [2020-07-10 20:23:22,064 INFO L280 TraceCheckUtils]: 46: Hoare triple {8274#true} ~cond := #in~cond; {8274#true} is VALID [2020-07-10 20:23:22,065 INFO L280 TraceCheckUtils]: 47: Hoare triple {8274#true} assume !(0 == ~cond); {8274#true} is VALID [2020-07-10 20:23:22,065 INFO L280 TraceCheckUtils]: 48: Hoare triple {8274#true} assume true; {8274#true} is VALID [2020-07-10 20:23:22,066 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {8274#true} {8288#(<= 1 main_~t~0)} #174#return; {8288#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:22,066 INFO L280 TraceCheckUtils]: 50: Hoare triple {8288#(<= 1 main_~t~0)} #t~post9 := ~t~0; {8297#(<= 1 |main_#t~post9|)} is VALID [2020-07-10 20:23:22,067 INFO L280 TraceCheckUtils]: 51: Hoare triple {8297#(<= 1 |main_#t~post9|)} ~t~0 := 1 + #t~post9; {8298#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:22,068 INFO L280 TraceCheckUtils]: 52: Hoare triple {8298#(<= 2 main_~t~0)} havoc #t~post9; {8298#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:22,068 INFO L280 TraceCheckUtils]: 53: Hoare triple {8298#(<= 2 main_~t~0)} assume !false; {8298#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:22,069 INFO L280 TraceCheckUtils]: 54: Hoare triple {8298#(<= 2 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {8298#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:22,069 INFO L280 TraceCheckUtils]: 55: Hoare triple {8298#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {8298#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:22,070 INFO L280 TraceCheckUtils]: 56: Hoare triple {8298#(<= 2 main_~t~0)} assume 0 != #t~nondet5; {8298#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:22,070 INFO L280 TraceCheckUtils]: 57: Hoare triple {8298#(<= 2 main_~t~0)} havoc #t~nondet5; {8298#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:22,071 INFO L280 TraceCheckUtils]: 58: Hoare triple {8298#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {8298#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:22,072 INFO L280 TraceCheckUtils]: 59: Hoare triple {8298#(<= 2 main_~t~0)} assume !(0 != #t~nondet6); {8298#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:22,072 INFO L280 TraceCheckUtils]: 60: Hoare triple {8298#(<= 2 main_~t~0)} havoc #t~nondet6; {8298#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:22,073 INFO L263 TraceCheckUtils]: 61: Hoare triple {8298#(<= 2 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {8299#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:22,074 INFO L280 TraceCheckUtils]: 62: Hoare triple {8299#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {8300#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:22,074 INFO L280 TraceCheckUtils]: 63: Hoare triple {8300#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {8275#false} is VALID [2020-07-10 20:23:22,075 INFO L280 TraceCheckUtils]: 64: Hoare triple {8275#false} assume !false; {8275#false} is VALID [2020-07-10 20:23:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:23:22,090 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:22,090 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1933167168] [2020-07-10 20:23:22,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:22,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 20:23:22,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385837459] [2020-07-10 20:23:22,091 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2020-07-10 20:23:22,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:22,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 20:23:22,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:22,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 20:23:22,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:22,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 20:23:22,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-10 20:23:22,151 INFO L87 Difference]: Start difference. First operand 152 states and 174 transitions. Second operand 9 states. [2020-07-10 20:23:23,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:23,242 INFO L93 Difference]: Finished difference Result 187 states and 216 transitions. [2020-07-10 20:23:23,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 20:23:23,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2020-07-10 20:23:23,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:23,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:23:23,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 160 transitions. [2020-07-10 20:23:23,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:23:23,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 160 transitions. [2020-07-10 20:23:23,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 160 transitions. [2020-07-10 20:23:23,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:23,431 INFO L225 Difference]: With dead ends: 187 [2020-07-10 20:23:23,431 INFO L226 Difference]: Without dead ends: 185 [2020-07-10 20:23:23,432 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-07-10 20:23:23,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-07-10 20:23:23,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 177. [2020-07-10 20:23:23,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:23,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 177 states. [2020-07-10 20:23:23,666 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 177 states. [2020-07-10 20:23:23,666 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 177 states. [2020-07-10 20:23:23,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:23,672 INFO L93 Difference]: Finished difference Result 185 states and 214 transitions. [2020-07-10 20:23:23,672 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 214 transitions. [2020-07-10 20:23:23,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:23,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:23,673 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 185 states. [2020-07-10 20:23:23,673 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 185 states. [2020-07-10 20:23:23,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:23,681 INFO L93 Difference]: Finished difference Result 185 states and 214 transitions. [2020-07-10 20:23:23,681 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 214 transitions. [2020-07-10 20:23:23,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:23,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:23,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:23,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:23,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-07-10 20:23:23,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 205 transitions. [2020-07-10 20:23:23,687 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 205 transitions. Word has length 65 [2020-07-10 20:23:23,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:23,688 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 205 transitions. [2020-07-10 20:23:23,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 20:23:23,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 177 states and 205 transitions. [2020-07-10 20:23:23,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:23,931 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 205 transitions. [2020-07-10 20:23:23,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-10 20:23:23,932 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:23,932 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:23,932 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-10 20:23:23,932 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:23,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:23,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1510377470, now seen corresponding path program 1 times [2020-07-10 20:23:23,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:23,933 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [770976332] [2020-07-10 20:23:23,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:24,103 INFO L280 TraceCheckUtils]: 0: Hoare triple {9411#true} assume true; {9411#true} is VALID [2020-07-10 20:23:24,103 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {9411#true} {9411#true} #144#return; {9411#true} is VALID [2020-07-10 20:23:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:24,120 INFO L280 TraceCheckUtils]: 0: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID [2020-07-10 20:23:24,120 INFO L280 TraceCheckUtils]: 1: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID [2020-07-10 20:23:24,121 INFO L280 TraceCheckUtils]: 2: Hoare triple {9411#true} assume true; {9411#true} is VALID [2020-07-10 20:23:24,122 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {9411#true} {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:24,128 INFO L280 TraceCheckUtils]: 0: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID [2020-07-10 20:23:24,128 INFO L280 TraceCheckUtils]: 1: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID [2020-07-10 20:23:24,128 INFO L280 TraceCheckUtils]: 2: Hoare triple {9411#true} assume true; {9411#true} is VALID [2020-07-10 20:23:24,129 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {9411#true} {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:24,134 INFO L280 TraceCheckUtils]: 0: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID [2020-07-10 20:23:24,135 INFO L280 TraceCheckUtils]: 1: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID [2020-07-10 20:23:24,135 INFO L280 TraceCheckUtils]: 2: Hoare triple {9411#true} assume true; {9411#true} is VALID [2020-07-10 20:23:24,136 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {9411#true} {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:24,142 INFO L280 TraceCheckUtils]: 0: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID [2020-07-10 20:23:24,143 INFO L280 TraceCheckUtils]: 1: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID [2020-07-10 20:23:24,143 INFO L280 TraceCheckUtils]: 2: Hoare triple {9411#true} assume true; {9411#true} is VALID [2020-07-10 20:23:24,144 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {9411#true} {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:24,151 INFO L280 TraceCheckUtils]: 0: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID [2020-07-10 20:23:24,152 INFO L280 TraceCheckUtils]: 1: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID [2020-07-10 20:23:24,152 INFO L280 TraceCheckUtils]: 2: Hoare triple {9411#true} assume true; {9411#true} is VALID [2020-07-10 20:23:24,153 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {9411#true} {9417#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,154 INFO L263 TraceCheckUtils]: 0: Hoare triple {9411#true} call ULTIMATE.init(); {9411#true} is VALID [2020-07-10 20:23:24,154 INFO L280 TraceCheckUtils]: 1: Hoare triple {9411#true} assume true; {9411#true} is VALID [2020-07-10 20:23:24,154 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9411#true} {9411#true} #144#return; {9411#true} is VALID [2020-07-10 20:23:24,155 INFO L263 TraceCheckUtils]: 3: Hoare triple {9411#true} call #t~ret10 := main(); {9411#true} is VALID [2020-07-10 20:23:24,155 INFO L280 TraceCheckUtils]: 4: Hoare triple {9411#true} havoc ~tagbuf_len~0; {9411#true} is VALID [2020-07-10 20:23:24,155 INFO L280 TraceCheckUtils]: 5: Hoare triple {9411#true} havoc ~t~0; {9411#true} is VALID [2020-07-10 20:23:24,156 INFO L280 TraceCheckUtils]: 6: Hoare triple {9411#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {9411#true} is VALID [2020-07-10 20:23:24,156 INFO L280 TraceCheckUtils]: 7: Hoare triple {9411#true} ~tagbuf_len~0 := #t~nondet0; {9411#true} is VALID [2020-07-10 20:23:24,156 INFO L280 TraceCheckUtils]: 8: Hoare triple {9411#true} havoc #t~nondet0; {9411#true} is VALID [2020-07-10 20:23:24,158 INFO L280 TraceCheckUtils]: 9: Hoare triple {9411#true} assume ~tagbuf_len~0 >= 1; {9415#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,159 INFO L280 TraceCheckUtils]: 10: Hoare triple {9415#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,160 INFO L280 TraceCheckUtils]: 11: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,161 INFO L280 TraceCheckUtils]: 12: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,162 INFO L280 TraceCheckUtils]: 13: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,163 INFO L280 TraceCheckUtils]: 14: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,164 INFO L280 TraceCheckUtils]: 15: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,165 INFO L280 TraceCheckUtils]: 16: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,166 INFO L280 TraceCheckUtils]: 17: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet2); {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,166 INFO L280 TraceCheckUtils]: 18: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,167 INFO L263 TraceCheckUtils]: 19: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {9411#true} is VALID [2020-07-10 20:23:24,167 INFO L280 TraceCheckUtils]: 20: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID [2020-07-10 20:23:24,167 INFO L280 TraceCheckUtils]: 21: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID [2020-07-10 20:23:24,168 INFO L280 TraceCheckUtils]: 22: Hoare triple {9411#true} assume true; {9411#true} is VALID [2020-07-10 20:23:24,169 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {9411#true} {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,169 INFO L263 TraceCheckUtils]: 24: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {9411#true} is VALID [2020-07-10 20:23:24,169 INFO L280 TraceCheckUtils]: 25: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID [2020-07-10 20:23:24,170 INFO L280 TraceCheckUtils]: 26: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID [2020-07-10 20:23:24,170 INFO L280 TraceCheckUtils]: 27: Hoare triple {9411#true} assume true; {9411#true} is VALID [2020-07-10 20:23:24,171 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {9411#true} {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,172 INFO L280 TraceCheckUtils]: 29: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post3 := ~t~0; {9426#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,173 INFO L280 TraceCheckUtils]: 30: Hoare triple {9426#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post3; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,174 INFO L280 TraceCheckUtils]: 31: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post3; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,175 INFO L280 TraceCheckUtils]: 32: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,176 INFO L280 TraceCheckUtils]: 33: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,177 INFO L280 TraceCheckUtils]: 34: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,178 INFO L280 TraceCheckUtils]: 35: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet2; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,179 INFO L280 TraceCheckUtils]: 36: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,179 INFO L263 TraceCheckUtils]: 37: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {9411#true} is VALID [2020-07-10 20:23:24,179 INFO L280 TraceCheckUtils]: 38: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID [2020-07-10 20:23:24,180 INFO L280 TraceCheckUtils]: 39: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID [2020-07-10 20:23:24,180 INFO L280 TraceCheckUtils]: 40: Hoare triple {9411#true} assume true; {9411#true} is VALID [2020-07-10 20:23:24,181 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {9411#true} {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,181 INFO L263 TraceCheckUtils]: 42: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {9411#true} is VALID [2020-07-10 20:23:24,181 INFO L280 TraceCheckUtils]: 43: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID [2020-07-10 20:23:24,182 INFO L280 TraceCheckUtils]: 44: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID [2020-07-10 20:23:24,182 INFO L280 TraceCheckUtils]: 45: Hoare triple {9411#true} assume true; {9411#true} is VALID [2020-07-10 20:23:24,183 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {9411#true} {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,184 INFO L280 TraceCheckUtils]: 47: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post4 := ~t~0; {9435#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,185 INFO L280 TraceCheckUtils]: 48: Hoare triple {9435#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post4; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,186 INFO L280 TraceCheckUtils]: 49: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post4; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,187 INFO L280 TraceCheckUtils]: 50: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,188 INFO L280 TraceCheckUtils]: 51: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,188 INFO L280 TraceCheckUtils]: 52: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,189 INFO L280 TraceCheckUtils]: 53: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume 0 != #t~nondet5; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,189 INFO L280 TraceCheckUtils]: 54: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet5; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,190 INFO L280 TraceCheckUtils]: 55: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,190 INFO L280 TraceCheckUtils]: 56: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume !(0 != #t~nondet6); {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,191 INFO L280 TraceCheckUtils]: 57: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet6; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,191 INFO L263 TraceCheckUtils]: 58: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {9411#true} is VALID [2020-07-10 20:23:24,191 INFO L280 TraceCheckUtils]: 59: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID [2020-07-10 20:23:24,192 INFO L280 TraceCheckUtils]: 60: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID [2020-07-10 20:23:24,192 INFO L280 TraceCheckUtils]: 61: Hoare triple {9411#true} assume true; {9411#true} is VALID [2020-07-10 20:23:24,193 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {9411#true} {9417#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:24,194 INFO L263 TraceCheckUtils]: 63: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {9440#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:24,195 INFO L280 TraceCheckUtils]: 64: Hoare triple {9440#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {9441#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:24,196 INFO L280 TraceCheckUtils]: 65: Hoare triple {9441#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {9412#false} is VALID [2020-07-10 20:23:24,196 INFO L280 TraceCheckUtils]: 66: Hoare triple {9412#false} assume !false; {9412#false} is VALID [2020-07-10 20:23:24,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:23:24,205 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:24,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [770976332] [2020-07-10 20:23:24,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:24,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 20:23:24,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53838872] [2020-07-10 20:23:24,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2020-07-10 20:23:24,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:24,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 20:23:24,279 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:24,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 20:23:24,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:24,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 20:23:24,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-10 20:23:24,281 INFO L87 Difference]: Start difference. First operand 177 states and 205 transitions. Second operand 9 states. [2020-07-10 20:23:25,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:25,476 INFO L93 Difference]: Finished difference Result 192 states and 221 transitions. [2020-07-10 20:23:25,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-10 20:23:25,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2020-07-10 20:23:25,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:23:25,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2020-07-10 20:23:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:23:25,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2020-07-10 20:23:25,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 112 transitions. [2020-07-10 20:23:25,664 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:25,672 INFO L225 Difference]: With dead ends: 192 [2020-07-10 20:23:25,673 INFO L226 Difference]: Without dead ends: 187 [2020-07-10 20:23:25,677 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-07-10 20:23:25,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-07-10 20:23:26,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 181. [2020-07-10 20:23:26,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:26,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand 181 states. [2020-07-10 20:23:26,036 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand 181 states. [2020-07-10 20:23:26,036 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 181 states. [2020-07-10 20:23:26,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:26,043 INFO L93 Difference]: Finished difference Result 187 states and 214 transitions. [2020-07-10 20:23:26,043 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 214 transitions. [2020-07-10 20:23:26,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:26,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:26,044 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand 187 states. [2020-07-10 20:23:26,044 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 187 states. [2020-07-10 20:23:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:26,050 INFO L93 Difference]: Finished difference Result 187 states and 214 transitions. [2020-07-10 20:23:26,050 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 214 transitions. [2020-07-10 20:23:26,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:26,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:26,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:26,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:26,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-07-10 20:23:26,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 208 transitions. [2020-07-10 20:23:26,058 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 208 transitions. Word has length 67 [2020-07-10 20:23:26,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:26,058 INFO L479 AbstractCegarLoop]: Abstraction has 181 states and 208 transitions. [2020-07-10 20:23:26,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 20:23:26,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 181 states and 208 transitions. [2020-07-10 20:23:26,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:26,450 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 208 transitions. [2020-07-10 20:23:26,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-07-10 20:23:26,452 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:26,453 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:26,453 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-10 20:23:26,453 INFO L427 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:26,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:26,454 INFO L82 PathProgramCache]: Analyzing trace with hash 869213219, now seen corresponding path program 2 times [2020-07-10 20:23:26,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:26,455 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [518133999] [2020-07-10 20:23:26,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:26,715 INFO L280 TraceCheckUtils]: 0: Hoare triple {10576#true} assume true; {10576#true} is VALID [2020-07-10 20:23:26,715 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {10576#true} {10576#true} #144#return; {10576#true} is VALID [2020-07-10 20:23:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:26,724 INFO L280 TraceCheckUtils]: 0: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID [2020-07-10 20:23:26,725 INFO L280 TraceCheckUtils]: 1: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID [2020-07-10 20:23:26,725 INFO L280 TraceCheckUtils]: 2: Hoare triple {10576#true} assume true; {10576#true} is VALID [2020-07-10 20:23:26,727 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10576#true} {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:26,732 INFO L280 TraceCheckUtils]: 0: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID [2020-07-10 20:23:26,733 INFO L280 TraceCheckUtils]: 1: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID [2020-07-10 20:23:26,733 INFO L280 TraceCheckUtils]: 2: Hoare triple {10576#true} assume true; {10576#true} is VALID [2020-07-10 20:23:26,734 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10576#true} {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:26,740 INFO L280 TraceCheckUtils]: 0: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID [2020-07-10 20:23:26,740 INFO L280 TraceCheckUtils]: 1: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID [2020-07-10 20:23:26,741 INFO L280 TraceCheckUtils]: 2: Hoare triple {10576#true} assume true; {10576#true} is VALID [2020-07-10 20:23:26,742 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10576#true} {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #172#return; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:26,760 INFO L280 TraceCheckUtils]: 0: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID [2020-07-10 20:23:26,760 INFO L280 TraceCheckUtils]: 1: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID [2020-07-10 20:23:26,761 INFO L280 TraceCheckUtils]: 2: Hoare triple {10576#true} assume true; {10576#true} is VALID [2020-07-10 20:23:26,762 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10576#true} {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #174#return; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:26,768 INFO L280 TraceCheckUtils]: 0: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID [2020-07-10 20:23:26,768 INFO L280 TraceCheckUtils]: 1: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID [2020-07-10 20:23:26,768 INFO L280 TraceCheckUtils]: 2: Hoare triple {10576#true} assume true; {10576#true} is VALID [2020-07-10 20:23:26,770 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10576#true} {10582#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,770 INFO L263 TraceCheckUtils]: 0: Hoare triple {10576#true} call ULTIMATE.init(); {10576#true} is VALID [2020-07-10 20:23:26,770 INFO L280 TraceCheckUtils]: 1: Hoare triple {10576#true} assume true; {10576#true} is VALID [2020-07-10 20:23:26,771 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {10576#true} {10576#true} #144#return; {10576#true} is VALID [2020-07-10 20:23:26,771 INFO L263 TraceCheckUtils]: 3: Hoare triple {10576#true} call #t~ret10 := main(); {10576#true} is VALID [2020-07-10 20:23:26,771 INFO L280 TraceCheckUtils]: 4: Hoare triple {10576#true} havoc ~tagbuf_len~0; {10576#true} is VALID [2020-07-10 20:23:26,772 INFO L280 TraceCheckUtils]: 5: Hoare triple {10576#true} havoc ~t~0; {10576#true} is VALID [2020-07-10 20:23:26,772 INFO L280 TraceCheckUtils]: 6: Hoare triple {10576#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {10576#true} is VALID [2020-07-10 20:23:26,772 INFO L280 TraceCheckUtils]: 7: Hoare triple {10576#true} ~tagbuf_len~0 := #t~nondet0; {10576#true} is VALID [2020-07-10 20:23:26,772 INFO L280 TraceCheckUtils]: 8: Hoare triple {10576#true} havoc #t~nondet0; {10576#true} is VALID [2020-07-10 20:23:26,773 INFO L280 TraceCheckUtils]: 9: Hoare triple {10576#true} assume ~tagbuf_len~0 >= 1; {10580#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,774 INFO L280 TraceCheckUtils]: 10: Hoare triple {10580#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,775 INFO L280 TraceCheckUtils]: 11: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,776 INFO L280 TraceCheckUtils]: 12: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,777 INFO L280 TraceCheckUtils]: 13: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,778 INFO L280 TraceCheckUtils]: 14: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,779 INFO L280 TraceCheckUtils]: 15: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,780 INFO L280 TraceCheckUtils]: 16: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,781 INFO L280 TraceCheckUtils]: 17: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet2; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,782 INFO L280 TraceCheckUtils]: 18: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,782 INFO L263 TraceCheckUtils]: 19: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {10576#true} is VALID [2020-07-10 20:23:26,782 INFO L280 TraceCheckUtils]: 20: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID [2020-07-10 20:23:26,782 INFO L280 TraceCheckUtils]: 21: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID [2020-07-10 20:23:26,783 INFO L280 TraceCheckUtils]: 22: Hoare triple {10576#true} assume true; {10576#true} is VALID [2020-07-10 20:23:26,784 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {10576#true} {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,784 INFO L263 TraceCheckUtils]: 24: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {10576#true} is VALID [2020-07-10 20:23:26,785 INFO L280 TraceCheckUtils]: 25: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID [2020-07-10 20:23:26,785 INFO L280 TraceCheckUtils]: 26: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID [2020-07-10 20:23:26,785 INFO L280 TraceCheckUtils]: 27: Hoare triple {10576#true} assume true; {10576#true} is VALID [2020-07-10 20:23:26,786 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {10576#true} {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,787 INFO L280 TraceCheckUtils]: 29: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post4 := ~t~0; {10591#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,789 INFO L280 TraceCheckUtils]: 30: Hoare triple {10591#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post4; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,789 INFO L280 TraceCheckUtils]: 31: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post4; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,790 INFO L280 TraceCheckUtils]: 32: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,791 INFO L280 TraceCheckUtils]: 33: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,792 INFO L280 TraceCheckUtils]: 34: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,793 INFO L280 TraceCheckUtils]: 35: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet5; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,794 INFO L280 TraceCheckUtils]: 36: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet5; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,795 INFO L280 TraceCheckUtils]: 37: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,795 INFO L280 TraceCheckUtils]: 38: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet6); {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,796 INFO L280 TraceCheckUtils]: 39: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet6; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,797 INFO L263 TraceCheckUtils]: 40: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {10576#true} is VALID [2020-07-10 20:23:26,797 INFO L280 TraceCheckUtils]: 41: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID [2020-07-10 20:23:26,797 INFO L280 TraceCheckUtils]: 42: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID [2020-07-10 20:23:26,798 INFO L280 TraceCheckUtils]: 43: Hoare triple {10576#true} assume true; {10576#true} is VALID [2020-07-10 20:23:26,799 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {10576#true} {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #172#return; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,799 INFO L263 TraceCheckUtils]: 45: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {10576#true} is VALID [2020-07-10 20:23:26,800 INFO L280 TraceCheckUtils]: 46: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID [2020-07-10 20:23:26,800 INFO L280 TraceCheckUtils]: 47: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID [2020-07-10 20:23:26,800 INFO L280 TraceCheckUtils]: 48: Hoare triple {10576#true} assume true; {10576#true} is VALID [2020-07-10 20:23:26,801 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {10576#true} {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #174#return; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,802 INFO L280 TraceCheckUtils]: 50: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post9 := ~t~0; {10600#(<= (+ |main_#t~post9| 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,804 INFO L280 TraceCheckUtils]: 51: Hoare triple {10600#(<= (+ |main_#t~post9| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post9; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,805 INFO L280 TraceCheckUtils]: 52: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post9; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,806 INFO L280 TraceCheckUtils]: 53: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,807 INFO L280 TraceCheckUtils]: 54: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,807 INFO L280 TraceCheckUtils]: 55: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,808 INFO L280 TraceCheckUtils]: 56: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume 0 != #t~nondet5; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,809 INFO L280 TraceCheckUtils]: 57: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet5; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,810 INFO L280 TraceCheckUtils]: 58: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,811 INFO L280 TraceCheckUtils]: 59: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume !(0 != #t~nondet6); {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,812 INFO L280 TraceCheckUtils]: 60: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet6; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,812 INFO L263 TraceCheckUtils]: 61: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {10576#true} is VALID [2020-07-10 20:23:26,813 INFO L280 TraceCheckUtils]: 62: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID [2020-07-10 20:23:26,813 INFO L280 TraceCheckUtils]: 63: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID [2020-07-10 20:23:26,813 INFO L280 TraceCheckUtils]: 64: Hoare triple {10576#true} assume true; {10576#true} is VALID [2020-07-10 20:23:26,814 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {10576#true} {10582#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:26,816 INFO L263 TraceCheckUtils]: 66: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {10605#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:26,817 INFO L280 TraceCheckUtils]: 67: Hoare triple {10605#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {10606#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:26,818 INFO L280 TraceCheckUtils]: 68: Hoare triple {10606#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {10577#false} is VALID [2020-07-10 20:23:26,818 INFO L280 TraceCheckUtils]: 69: Hoare triple {10577#false} assume !false; {10577#false} is VALID [2020-07-10 20:23:26,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:23:26,828 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:26,829 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [518133999] [2020-07-10 20:23:26,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:26,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 20:23:26,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291894458] [2020-07-10 20:23:26,830 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2020-07-10 20:23:26,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:26,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 20:23:26,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:26,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 20:23:26,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:26,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 20:23:26,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-10 20:23:26,917 INFO L87 Difference]: Start difference. First operand 181 states and 208 transitions. Second operand 9 states. [2020-07-10 20:23:28,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:28,235 INFO L93 Difference]: Finished difference Result 193 states and 220 transitions. [2020-07-10 20:23:28,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-10 20:23:28,235 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2020-07-10 20:23:28,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:28,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:23:28,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 133 transitions. [2020-07-10 20:23:28,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:23:28,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 133 transitions. [2020-07-10 20:23:28,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 133 transitions. [2020-07-10 20:23:28,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:28,439 INFO L225 Difference]: With dead ends: 193 [2020-07-10 20:23:28,439 INFO L226 Difference]: Without dead ends: 188 [2020-07-10 20:23:28,442 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-07-10 20:23:28,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-07-10 20:23:28,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184. [2020-07-10 20:23:28,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:28,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand 184 states. [2020-07-10 20:23:28,712 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 184 states. [2020-07-10 20:23:28,712 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 184 states. [2020-07-10 20:23:28,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:28,719 INFO L93 Difference]: Finished difference Result 188 states and 213 transitions. [2020-07-10 20:23:28,719 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 213 transitions. [2020-07-10 20:23:28,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:28,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:28,720 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 188 states. [2020-07-10 20:23:28,720 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 188 states. [2020-07-10 20:23:28,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:28,726 INFO L93 Difference]: Finished difference Result 188 states and 213 transitions. [2020-07-10 20:23:28,726 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 213 transitions. [2020-07-10 20:23:28,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:28,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:28,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:28,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:28,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-07-10 20:23:28,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 209 transitions. [2020-07-10 20:23:28,732 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 209 transitions. Word has length 70 [2020-07-10 20:23:28,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:28,732 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 209 transitions. [2020-07-10 20:23:28,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 20:23:28,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 184 states and 209 transitions. [2020-07-10 20:23:29,009 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:29,009 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 209 transitions. [2020-07-10 20:23:29,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-07-10 20:23:29,011 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:29,011 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:29,011 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-10 20:23:29,011 INFO L427 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:29,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:29,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1269119089, now seen corresponding path program 1 times [2020-07-10 20:23:29,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:29,012 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1498630462] [2020-07-10 20:23:29,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:29,172 INFO L280 TraceCheckUtils]: 0: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-10 20:23:29,172 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {11751#true} {11751#true} #144#return; {11751#true} is VALID [2020-07-10 20:23:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:29,175 INFO L280 TraceCheckUtils]: 0: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID [2020-07-10 20:23:29,175 INFO L280 TraceCheckUtils]: 1: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID [2020-07-10 20:23:29,176 INFO L280 TraceCheckUtils]: 2: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-10 20:23:29,176 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {11751#true} {11755#(<= 0 main_~t~0)} #152#return; {11755#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:29,179 INFO L280 TraceCheckUtils]: 0: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID [2020-07-10 20:23:29,179 INFO L280 TraceCheckUtils]: 1: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID [2020-07-10 20:23:29,179 INFO L280 TraceCheckUtils]: 2: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-10 20:23:29,180 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {11751#true} {11755#(<= 0 main_~t~0)} #154#return; {11755#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:29,186 INFO L280 TraceCheckUtils]: 0: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID [2020-07-10 20:23:29,186 INFO L280 TraceCheckUtils]: 1: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID [2020-07-10 20:23:29,187 INFO L280 TraceCheckUtils]: 2: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-10 20:23:29,187 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {11751#true} {11765#(<= 1 main_~t~0)} #156#return; {11765#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:29,197 INFO L280 TraceCheckUtils]: 0: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID [2020-07-10 20:23:29,197 INFO L280 TraceCheckUtils]: 1: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID [2020-07-10 20:23:29,198 INFO L280 TraceCheckUtils]: 2: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-10 20:23:29,198 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {11751#true} {11765#(<= 1 main_~t~0)} #158#return; {11765#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:29,203 INFO L280 TraceCheckUtils]: 0: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID [2020-07-10 20:23:29,203 INFO L280 TraceCheckUtils]: 1: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID [2020-07-10 20:23:29,203 INFO L280 TraceCheckUtils]: 2: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-10 20:23:29,204 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {11751#true} {11775#(<= 2 main_~t~0)} #164#return; {11775#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:29,207 INFO L280 TraceCheckUtils]: 0: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID [2020-07-10 20:23:29,208 INFO L280 TraceCheckUtils]: 1: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID [2020-07-10 20:23:29,208 INFO L280 TraceCheckUtils]: 2: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-10 20:23:29,208 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {11751#true} {11775#(<= 2 main_~t~0)} #166#return; {11775#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:29,209 INFO L263 TraceCheckUtils]: 0: Hoare triple {11751#true} call ULTIMATE.init(); {11751#true} is VALID [2020-07-10 20:23:29,209 INFO L280 TraceCheckUtils]: 1: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-10 20:23:29,209 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {11751#true} {11751#true} #144#return; {11751#true} is VALID [2020-07-10 20:23:29,209 INFO L263 TraceCheckUtils]: 3: Hoare triple {11751#true} call #t~ret10 := main(); {11751#true} is VALID [2020-07-10 20:23:29,209 INFO L280 TraceCheckUtils]: 4: Hoare triple {11751#true} havoc ~tagbuf_len~0; {11751#true} is VALID [2020-07-10 20:23:29,210 INFO L280 TraceCheckUtils]: 5: Hoare triple {11751#true} havoc ~t~0; {11751#true} is VALID [2020-07-10 20:23:29,210 INFO L280 TraceCheckUtils]: 6: Hoare triple {11751#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {11751#true} is VALID [2020-07-10 20:23:29,210 INFO L280 TraceCheckUtils]: 7: Hoare triple {11751#true} ~tagbuf_len~0 := #t~nondet0; {11751#true} is VALID [2020-07-10 20:23:29,210 INFO L280 TraceCheckUtils]: 8: Hoare triple {11751#true} havoc #t~nondet0; {11751#true} is VALID [2020-07-10 20:23:29,210 INFO L280 TraceCheckUtils]: 9: Hoare triple {11751#true} assume ~tagbuf_len~0 >= 1; {11751#true} is VALID [2020-07-10 20:23:29,211 INFO L280 TraceCheckUtils]: 10: Hoare triple {11751#true} ~t~0 := 0; {11755#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:29,212 INFO L280 TraceCheckUtils]: 11: Hoare triple {11755#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {11755#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:29,212 INFO L280 TraceCheckUtils]: 12: Hoare triple {11755#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {11755#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:29,213 INFO L280 TraceCheckUtils]: 13: Hoare triple {11755#(<= 0 main_~t~0)} havoc #t~pre1; {11755#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:29,213 INFO L280 TraceCheckUtils]: 14: Hoare triple {11755#(<= 0 main_~t~0)} assume !false; {11755#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:29,213 INFO L280 TraceCheckUtils]: 15: Hoare triple {11755#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {11755#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:29,214 INFO L280 TraceCheckUtils]: 16: Hoare triple {11755#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {11755#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:29,214 INFO L280 TraceCheckUtils]: 17: Hoare triple {11755#(<= 0 main_~t~0)} assume !(0 != #t~nondet2); {11755#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:29,215 INFO L280 TraceCheckUtils]: 18: Hoare triple {11755#(<= 0 main_~t~0)} havoc #t~nondet2; {11755#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:29,215 INFO L263 TraceCheckUtils]: 19: Hoare triple {11755#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {11751#true} is VALID [2020-07-10 20:23:29,215 INFO L280 TraceCheckUtils]: 20: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID [2020-07-10 20:23:29,216 INFO L280 TraceCheckUtils]: 21: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID [2020-07-10 20:23:29,216 INFO L280 TraceCheckUtils]: 22: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-10 20:23:29,216 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {11751#true} {11755#(<= 0 main_~t~0)} #152#return; {11755#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:29,217 INFO L263 TraceCheckUtils]: 24: Hoare triple {11755#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {11751#true} is VALID [2020-07-10 20:23:29,217 INFO L280 TraceCheckUtils]: 25: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID [2020-07-10 20:23:29,217 INFO L280 TraceCheckUtils]: 26: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID [2020-07-10 20:23:29,217 INFO L280 TraceCheckUtils]: 27: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-10 20:23:29,218 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {11751#true} {11755#(<= 0 main_~t~0)} #154#return; {11755#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:29,218 INFO L280 TraceCheckUtils]: 29: Hoare triple {11755#(<= 0 main_~t~0)} #t~post3 := ~t~0; {11764#(<= 0 |main_#t~post3|)} is VALID [2020-07-10 20:23:29,220 INFO L280 TraceCheckUtils]: 30: Hoare triple {11764#(<= 0 |main_#t~post3|)} ~t~0 := 1 + #t~post3; {11765#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:29,220 INFO L280 TraceCheckUtils]: 31: Hoare triple {11765#(<= 1 main_~t~0)} havoc #t~post3; {11765#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:29,221 INFO L280 TraceCheckUtils]: 32: Hoare triple {11765#(<= 1 main_~t~0)} assume !false; {11765#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:29,221 INFO L280 TraceCheckUtils]: 33: Hoare triple {11765#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {11765#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:29,222 INFO L280 TraceCheckUtils]: 34: Hoare triple {11765#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {11765#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:29,222 INFO L280 TraceCheckUtils]: 35: Hoare triple {11765#(<= 1 main_~t~0)} assume 0 != #t~nondet2; {11765#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:29,223 INFO L280 TraceCheckUtils]: 36: Hoare triple {11765#(<= 1 main_~t~0)} havoc #t~nondet2; {11765#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:29,223 INFO L263 TraceCheckUtils]: 37: Hoare triple {11765#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {11751#true} is VALID [2020-07-10 20:23:29,223 INFO L280 TraceCheckUtils]: 38: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID [2020-07-10 20:23:29,223 INFO L280 TraceCheckUtils]: 39: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID [2020-07-10 20:23:29,223 INFO L280 TraceCheckUtils]: 40: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-10 20:23:29,224 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {11751#true} {11765#(<= 1 main_~t~0)} #156#return; {11765#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:29,224 INFO L263 TraceCheckUtils]: 42: Hoare triple {11765#(<= 1 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {11751#true} is VALID [2020-07-10 20:23:29,224 INFO L280 TraceCheckUtils]: 43: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID [2020-07-10 20:23:29,225 INFO L280 TraceCheckUtils]: 44: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID [2020-07-10 20:23:29,225 INFO L280 TraceCheckUtils]: 45: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-10 20:23:29,225 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {11751#true} {11765#(<= 1 main_~t~0)} #158#return; {11765#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:29,226 INFO L280 TraceCheckUtils]: 47: Hoare triple {11765#(<= 1 main_~t~0)} #t~post4 := ~t~0; {11774#(<= 1 |main_#t~post4|)} is VALID [2020-07-10 20:23:29,227 INFO L280 TraceCheckUtils]: 48: Hoare triple {11774#(<= 1 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {11775#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:29,227 INFO L280 TraceCheckUtils]: 49: Hoare triple {11775#(<= 2 main_~t~0)} havoc #t~post4; {11775#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:29,228 INFO L280 TraceCheckUtils]: 50: Hoare triple {11775#(<= 2 main_~t~0)} assume !false; {11775#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:29,228 INFO L280 TraceCheckUtils]: 51: Hoare triple {11775#(<= 2 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {11775#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:29,229 INFO L280 TraceCheckUtils]: 52: Hoare triple {11775#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {11775#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:29,229 INFO L280 TraceCheckUtils]: 53: Hoare triple {11775#(<= 2 main_~t~0)} assume 0 != #t~nondet5; {11775#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:29,230 INFO L280 TraceCheckUtils]: 54: Hoare triple {11775#(<= 2 main_~t~0)} havoc #t~nondet5; {11775#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:29,230 INFO L280 TraceCheckUtils]: 55: Hoare triple {11775#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {11775#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:29,231 INFO L280 TraceCheckUtils]: 56: Hoare triple {11775#(<= 2 main_~t~0)} assume 0 != #t~nondet6; {11775#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:29,231 INFO L280 TraceCheckUtils]: 57: Hoare triple {11775#(<= 2 main_~t~0)} havoc #t~nondet6; {11775#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:29,231 INFO L263 TraceCheckUtils]: 58: Hoare triple {11775#(<= 2 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {11751#true} is VALID [2020-07-10 20:23:29,232 INFO L280 TraceCheckUtils]: 59: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID [2020-07-10 20:23:29,232 INFO L280 TraceCheckUtils]: 60: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID [2020-07-10 20:23:29,232 INFO L280 TraceCheckUtils]: 61: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-10 20:23:29,233 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {11751#true} {11775#(<= 2 main_~t~0)} #164#return; {11775#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:29,233 INFO L263 TraceCheckUtils]: 63: Hoare triple {11775#(<= 2 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {11751#true} is VALID [2020-07-10 20:23:29,233 INFO L280 TraceCheckUtils]: 64: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID [2020-07-10 20:23:29,233 INFO L280 TraceCheckUtils]: 65: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID [2020-07-10 20:23:29,233 INFO L280 TraceCheckUtils]: 66: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-10 20:23:29,234 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {11751#true} {11775#(<= 2 main_~t~0)} #166#return; {11775#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:29,235 INFO L280 TraceCheckUtils]: 68: Hoare triple {11775#(<= 2 main_~t~0)} #t~post7 := ~t~0; {11784#(<= 2 |main_#t~post7|)} is VALID [2020-07-10 20:23:29,236 INFO L280 TraceCheckUtils]: 69: Hoare triple {11784#(<= 2 |main_#t~post7|)} ~t~0 := 1 + #t~post7; {11785#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:29,236 INFO L280 TraceCheckUtils]: 70: Hoare triple {11785#(<= 3 main_~t~0)} havoc #t~post7; {11785#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:29,237 INFO L280 TraceCheckUtils]: 71: Hoare triple {11785#(<= 3 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {11785#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:29,237 INFO L263 TraceCheckUtils]: 72: Hoare triple {11785#(<= 3 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {11786#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:29,238 INFO L280 TraceCheckUtils]: 73: Hoare triple {11786#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {11787#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:29,238 INFO L280 TraceCheckUtils]: 74: Hoare triple {11787#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {11752#false} is VALID [2020-07-10 20:23:29,239 INFO L280 TraceCheckUtils]: 75: Hoare triple {11752#false} assume !false; {11752#false} is VALID [2020-07-10 20:23:29,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:23:29,243 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:29,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1498630462] [2020-07-10 20:23:29,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:29,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-10 20:23:29,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963468410] [2020-07-10 20:23:29,244 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 76 [2020-07-10 20:23:29,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:29,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 20:23:29,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:29,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 20:23:29,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:29,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 20:23:29,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-10 20:23:29,302 INFO L87 Difference]: Start difference. First operand 184 states and 209 transitions. Second operand 11 states. [2020-07-10 20:23:30,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:30,771 INFO L93 Difference]: Finished difference Result 202 states and 228 transitions. [2020-07-10 20:23:30,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-10 20:23:30,772 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 76 [2020-07-10 20:23:30,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:30,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 20:23:30,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 135 transitions. [2020-07-10 20:23:30,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 20:23:30,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 135 transitions. [2020-07-10 20:23:30,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 135 transitions. [2020-07-10 20:23:30,946 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:30,953 INFO L225 Difference]: With dead ends: 202 [2020-07-10 20:23:30,953 INFO L226 Difference]: Without dead ends: 200 [2020-07-10 20:23:30,954 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-07-10 20:23:30,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-07-10 20:23:31,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 193. [2020-07-10 20:23:31,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:31,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand 193 states. [2020-07-10 20:23:31,276 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 193 states. [2020-07-10 20:23:31,276 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 193 states. [2020-07-10 20:23:31,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:31,283 INFO L93 Difference]: Finished difference Result 200 states and 226 transitions. [2020-07-10 20:23:31,283 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 226 transitions. [2020-07-10 20:23:31,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:31,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:31,284 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand 200 states. [2020-07-10 20:23:31,284 INFO L87 Difference]: Start difference. First operand 193 states. Second operand 200 states. [2020-07-10 20:23:31,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:31,290 INFO L93 Difference]: Finished difference Result 200 states and 226 transitions. [2020-07-10 20:23:31,290 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 226 transitions. [2020-07-10 20:23:31,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:31,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:31,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:31,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:31,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-07-10 20:23:31,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 218 transitions. [2020-07-10 20:23:31,296 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 218 transitions. Word has length 76 [2020-07-10 20:23:31,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:31,297 INFO L479 AbstractCegarLoop]: Abstraction has 193 states and 218 transitions. [2020-07-10 20:23:31,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 20:23:31,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 193 states and 218 transitions. [2020-07-10 20:23:31,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:31,584 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 218 transitions. [2020-07-10 20:23:31,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-07-10 20:23:31,586 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:31,586 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:31,586 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-10 20:23:31,586 INFO L427 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:31,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:31,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1147260786, now seen corresponding path program 1 times [2020-07-10 20:23:31,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:31,587 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [284952973] [2020-07-10 20:23:31,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:31,725 INFO L280 TraceCheckUtils]: 0: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-10 20:23:31,726 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {12994#true} {12994#true} #144#return; {12994#true} is VALID [2020-07-10 20:23:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:31,730 INFO L280 TraceCheckUtils]: 0: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID [2020-07-10 20:23:31,731 INFO L280 TraceCheckUtils]: 1: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID [2020-07-10 20:23:31,731 INFO L280 TraceCheckUtils]: 2: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-10 20:23:31,732 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12994#true} {12998#(<= 0 main_~t~0)} #156#return; {12998#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:31,736 INFO L280 TraceCheckUtils]: 0: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID [2020-07-10 20:23:31,736 INFO L280 TraceCheckUtils]: 1: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID [2020-07-10 20:23:31,737 INFO L280 TraceCheckUtils]: 2: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-10 20:23:31,737 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12994#true} {12998#(<= 0 main_~t~0)} #158#return; {12998#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:31,744 INFO L280 TraceCheckUtils]: 0: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID [2020-07-10 20:23:31,745 INFO L280 TraceCheckUtils]: 1: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID [2020-07-10 20:23:31,745 INFO L280 TraceCheckUtils]: 2: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-10 20:23:31,747 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12994#true} {13008#(<= 1 main_~t~0)} #172#return; {13008#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:31,751 INFO L280 TraceCheckUtils]: 0: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID [2020-07-10 20:23:31,751 INFO L280 TraceCheckUtils]: 1: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID [2020-07-10 20:23:31,751 INFO L280 TraceCheckUtils]: 2: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-10 20:23:31,752 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12994#true} {13008#(<= 1 main_~t~0)} #174#return; {13008#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:31,757 INFO L280 TraceCheckUtils]: 0: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID [2020-07-10 20:23:31,758 INFO L280 TraceCheckUtils]: 1: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID [2020-07-10 20:23:31,758 INFO L280 TraceCheckUtils]: 2: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-10 20:23:31,759 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12994#true} {13018#(<= 2 main_~t~0)} #164#return; {13018#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:31,763 INFO L280 TraceCheckUtils]: 0: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID [2020-07-10 20:23:31,763 INFO L280 TraceCheckUtils]: 1: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID [2020-07-10 20:23:31,763 INFO L280 TraceCheckUtils]: 2: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-10 20:23:31,764 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12994#true} {13018#(<= 2 main_~t~0)} #166#return; {13018#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:31,765 INFO L263 TraceCheckUtils]: 0: Hoare triple {12994#true} call ULTIMATE.init(); {12994#true} is VALID [2020-07-10 20:23:31,765 INFO L280 TraceCheckUtils]: 1: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-10 20:23:31,765 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {12994#true} {12994#true} #144#return; {12994#true} is VALID [2020-07-10 20:23:31,765 INFO L263 TraceCheckUtils]: 3: Hoare triple {12994#true} call #t~ret10 := main(); {12994#true} is VALID [2020-07-10 20:23:31,766 INFO L280 TraceCheckUtils]: 4: Hoare triple {12994#true} havoc ~tagbuf_len~0; {12994#true} is VALID [2020-07-10 20:23:31,766 INFO L280 TraceCheckUtils]: 5: Hoare triple {12994#true} havoc ~t~0; {12994#true} is VALID [2020-07-10 20:23:31,766 INFO L280 TraceCheckUtils]: 6: Hoare triple {12994#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {12994#true} is VALID [2020-07-10 20:23:31,766 INFO L280 TraceCheckUtils]: 7: Hoare triple {12994#true} ~tagbuf_len~0 := #t~nondet0; {12994#true} is VALID [2020-07-10 20:23:31,767 INFO L280 TraceCheckUtils]: 8: Hoare triple {12994#true} havoc #t~nondet0; {12994#true} is VALID [2020-07-10 20:23:31,767 INFO L280 TraceCheckUtils]: 9: Hoare triple {12994#true} assume ~tagbuf_len~0 >= 1; {12994#true} is VALID [2020-07-10 20:23:31,768 INFO L280 TraceCheckUtils]: 10: Hoare triple {12994#true} ~t~0 := 0; {12998#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:31,768 INFO L280 TraceCheckUtils]: 11: Hoare triple {12998#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {12998#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:31,769 INFO L280 TraceCheckUtils]: 12: Hoare triple {12998#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {12998#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:31,769 INFO L280 TraceCheckUtils]: 13: Hoare triple {12998#(<= 0 main_~t~0)} havoc #t~pre1; {12998#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:31,770 INFO L280 TraceCheckUtils]: 14: Hoare triple {12998#(<= 0 main_~t~0)} assume !false; {12998#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:31,770 INFO L280 TraceCheckUtils]: 15: Hoare triple {12998#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {12998#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:31,771 INFO L280 TraceCheckUtils]: 16: Hoare triple {12998#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {12998#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:31,772 INFO L280 TraceCheckUtils]: 17: Hoare triple {12998#(<= 0 main_~t~0)} assume 0 != #t~nondet2; {12998#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:31,772 INFO L280 TraceCheckUtils]: 18: Hoare triple {12998#(<= 0 main_~t~0)} havoc #t~nondet2; {12998#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:31,772 INFO L263 TraceCheckUtils]: 19: Hoare triple {12998#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {12994#true} is VALID [2020-07-10 20:23:31,773 INFO L280 TraceCheckUtils]: 20: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID [2020-07-10 20:23:31,773 INFO L280 TraceCheckUtils]: 21: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID [2020-07-10 20:23:31,773 INFO L280 TraceCheckUtils]: 22: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-10 20:23:31,774 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {12994#true} {12998#(<= 0 main_~t~0)} #156#return; {12998#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:31,774 INFO L263 TraceCheckUtils]: 24: Hoare triple {12998#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {12994#true} is VALID [2020-07-10 20:23:31,774 INFO L280 TraceCheckUtils]: 25: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID [2020-07-10 20:23:31,774 INFO L280 TraceCheckUtils]: 26: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID [2020-07-10 20:23:31,774 INFO L280 TraceCheckUtils]: 27: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-10 20:23:31,775 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {12994#true} {12998#(<= 0 main_~t~0)} #158#return; {12998#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:31,775 INFO L280 TraceCheckUtils]: 29: Hoare triple {12998#(<= 0 main_~t~0)} #t~post4 := ~t~0; {13007#(<= 0 |main_#t~post4|)} is VALID [2020-07-10 20:23:31,776 INFO L280 TraceCheckUtils]: 30: Hoare triple {13007#(<= 0 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {13008#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:31,777 INFO L280 TraceCheckUtils]: 31: Hoare triple {13008#(<= 1 main_~t~0)} havoc #t~post4; {13008#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:31,777 INFO L280 TraceCheckUtils]: 32: Hoare triple {13008#(<= 1 main_~t~0)} assume !false; {13008#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:31,778 INFO L280 TraceCheckUtils]: 33: Hoare triple {13008#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {13008#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:31,778 INFO L280 TraceCheckUtils]: 34: Hoare triple {13008#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {13008#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:31,779 INFO L280 TraceCheckUtils]: 35: Hoare triple {13008#(<= 1 main_~t~0)} assume 0 != #t~nondet5; {13008#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:31,779 INFO L280 TraceCheckUtils]: 36: Hoare triple {13008#(<= 1 main_~t~0)} havoc #t~nondet5; {13008#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:31,780 INFO L280 TraceCheckUtils]: 37: Hoare triple {13008#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {13008#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:31,780 INFO L280 TraceCheckUtils]: 38: Hoare triple {13008#(<= 1 main_~t~0)} assume !(0 != #t~nondet6); {13008#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:31,781 INFO L280 TraceCheckUtils]: 39: Hoare triple {13008#(<= 1 main_~t~0)} havoc #t~nondet6; {13008#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:31,781 INFO L263 TraceCheckUtils]: 40: Hoare triple {13008#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {12994#true} is VALID [2020-07-10 20:23:31,781 INFO L280 TraceCheckUtils]: 41: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID [2020-07-10 20:23:31,781 INFO L280 TraceCheckUtils]: 42: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID [2020-07-10 20:23:31,782 INFO L280 TraceCheckUtils]: 43: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-10 20:23:31,782 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {12994#true} {13008#(<= 1 main_~t~0)} #172#return; {13008#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:31,783 INFO L263 TraceCheckUtils]: 45: Hoare triple {13008#(<= 1 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {12994#true} is VALID [2020-07-10 20:23:31,783 INFO L280 TraceCheckUtils]: 46: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID [2020-07-10 20:23:31,783 INFO L280 TraceCheckUtils]: 47: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID [2020-07-10 20:23:31,783 INFO L280 TraceCheckUtils]: 48: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-10 20:23:31,784 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {12994#true} {13008#(<= 1 main_~t~0)} #174#return; {13008#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:31,785 INFO L280 TraceCheckUtils]: 50: Hoare triple {13008#(<= 1 main_~t~0)} #t~post9 := ~t~0; {13017#(<= 1 |main_#t~post9|)} is VALID [2020-07-10 20:23:31,786 INFO L280 TraceCheckUtils]: 51: Hoare triple {13017#(<= 1 |main_#t~post9|)} ~t~0 := 1 + #t~post9; {13018#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:31,786 INFO L280 TraceCheckUtils]: 52: Hoare triple {13018#(<= 2 main_~t~0)} havoc #t~post9; {13018#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:31,787 INFO L280 TraceCheckUtils]: 53: Hoare triple {13018#(<= 2 main_~t~0)} assume !false; {13018#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:31,787 INFO L280 TraceCheckUtils]: 54: Hoare triple {13018#(<= 2 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {13018#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:31,788 INFO L280 TraceCheckUtils]: 55: Hoare triple {13018#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {13018#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:31,788 INFO L280 TraceCheckUtils]: 56: Hoare triple {13018#(<= 2 main_~t~0)} assume 0 != #t~nondet5; {13018#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:31,789 INFO L280 TraceCheckUtils]: 57: Hoare triple {13018#(<= 2 main_~t~0)} havoc #t~nondet5; {13018#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:31,789 INFO L280 TraceCheckUtils]: 58: Hoare triple {13018#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {13018#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:31,790 INFO L280 TraceCheckUtils]: 59: Hoare triple {13018#(<= 2 main_~t~0)} assume 0 != #t~nondet6; {13018#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:31,790 INFO L280 TraceCheckUtils]: 60: Hoare triple {13018#(<= 2 main_~t~0)} havoc #t~nondet6; {13018#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:31,790 INFO L263 TraceCheckUtils]: 61: Hoare triple {13018#(<= 2 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {12994#true} is VALID [2020-07-10 20:23:31,791 INFO L280 TraceCheckUtils]: 62: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID [2020-07-10 20:23:31,791 INFO L280 TraceCheckUtils]: 63: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID [2020-07-10 20:23:31,791 INFO L280 TraceCheckUtils]: 64: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-10 20:23:31,792 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {12994#true} {13018#(<= 2 main_~t~0)} #164#return; {13018#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:31,792 INFO L263 TraceCheckUtils]: 66: Hoare triple {13018#(<= 2 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {12994#true} is VALID [2020-07-10 20:23:31,792 INFO L280 TraceCheckUtils]: 67: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID [2020-07-10 20:23:31,792 INFO L280 TraceCheckUtils]: 68: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID [2020-07-10 20:23:31,793 INFO L280 TraceCheckUtils]: 69: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-10 20:23:31,793 INFO L275 TraceCheckUtils]: 70: Hoare quadruple {12994#true} {13018#(<= 2 main_~t~0)} #166#return; {13018#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:31,794 INFO L280 TraceCheckUtils]: 71: Hoare triple {13018#(<= 2 main_~t~0)} #t~post7 := ~t~0; {13027#(<= 2 |main_#t~post7|)} is VALID [2020-07-10 20:23:31,795 INFO L280 TraceCheckUtils]: 72: Hoare triple {13027#(<= 2 |main_#t~post7|)} ~t~0 := 1 + #t~post7; {13028#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:31,796 INFO L280 TraceCheckUtils]: 73: Hoare triple {13028#(<= 3 main_~t~0)} havoc #t~post7; {13028#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:31,796 INFO L280 TraceCheckUtils]: 74: Hoare triple {13028#(<= 3 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {13028#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:31,797 INFO L263 TraceCheckUtils]: 75: Hoare triple {13028#(<= 3 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {13029#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:31,798 INFO L280 TraceCheckUtils]: 76: Hoare triple {13029#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {13030#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:31,798 INFO L280 TraceCheckUtils]: 77: Hoare triple {13030#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {12995#false} is VALID [2020-07-10 20:23:31,798 INFO L280 TraceCheckUtils]: 78: Hoare triple {12995#false} assume !false; {12995#false} is VALID [2020-07-10 20:23:31,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:23:31,807 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:31,807 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [284952973] [2020-07-10 20:23:31,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:31,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-10 20:23:31,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570065137] [2020-07-10 20:23:31,808 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79 [2020-07-10 20:23:31,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:31,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 20:23:31,887 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:31,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 20:23:31,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:31,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 20:23:31,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-10 20:23:31,888 INFO L87 Difference]: Start difference. First operand 193 states and 218 transitions. Second operand 11 states. [2020-07-10 20:23:33,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:33,320 INFO L93 Difference]: Finished difference Result 234 states and 268 transitions. [2020-07-10 20:23:33,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-10 20:23:33,321 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79 [2020-07-10 20:23:33,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:33,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 20:23:33,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 168 transitions. [2020-07-10 20:23:33,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 20:23:33,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 168 transitions. [2020-07-10 20:23:33,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 168 transitions. [2020-07-10 20:23:33,515 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:33,520 INFO L225 Difference]: With dead ends: 234 [2020-07-10 20:23:33,521 INFO L226 Difference]: Without dead ends: 232 [2020-07-10 20:23:33,522 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2020-07-10 20:23:33,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-07-10 20:23:33,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 223. [2020-07-10 20:23:33,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:33,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand 223 states. [2020-07-10 20:23:33,851 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand 223 states. [2020-07-10 20:23:33,851 INFO L87 Difference]: Start difference. First operand 232 states. Second operand 223 states. [2020-07-10 20:23:33,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:33,860 INFO L93 Difference]: Finished difference Result 232 states and 266 transitions. [2020-07-10 20:23:33,860 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 266 transitions. [2020-07-10 20:23:33,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:33,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:33,862 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand 232 states. [2020-07-10 20:23:33,862 INFO L87 Difference]: Start difference. First operand 223 states. Second operand 232 states. [2020-07-10 20:23:33,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:33,873 INFO L93 Difference]: Finished difference Result 232 states and 266 transitions. [2020-07-10 20:23:33,873 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 266 transitions. [2020-07-10 20:23:33,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:33,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:33,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:33,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:33,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-07-10 20:23:33,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 255 transitions. [2020-07-10 20:23:33,880 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 255 transitions. Word has length 79 [2020-07-10 20:23:33,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:33,880 INFO L479 AbstractCegarLoop]: Abstraction has 223 states and 255 transitions. [2020-07-10 20:23:33,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 20:23:33,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 223 states and 255 transitions. [2020-07-10 20:23:34,248 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:34,248 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 255 transitions. [2020-07-10 20:23:34,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-07-10 20:23:34,250 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:34,251 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:34,251 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-10 20:23:34,251 INFO L427 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:34,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:34,252 INFO L82 PathProgramCache]: Analyzing trace with hash 341113206, now seen corresponding path program 2 times [2020-07-10 20:23:34,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:34,252 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2053359174] [2020-07-10 20:23:34,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:34,466 INFO L280 TraceCheckUtils]: 0: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-10 20:23:34,466 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {14427#true} {14427#true} #144#return; {14427#true} is VALID [2020-07-10 20:23:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:34,470 INFO L280 TraceCheckUtils]: 0: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID [2020-07-10 20:23:34,471 INFO L280 TraceCheckUtils]: 1: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID [2020-07-10 20:23:34,471 INFO L280 TraceCheckUtils]: 2: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-10 20:23:34,472 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {14427#true} {14431#(<= 0 main_~t~0)} #156#return; {14431#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:34,479 INFO L280 TraceCheckUtils]: 0: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID [2020-07-10 20:23:34,479 INFO L280 TraceCheckUtils]: 1: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID [2020-07-10 20:23:34,479 INFO L280 TraceCheckUtils]: 2: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-10 20:23:34,480 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {14427#true} {14431#(<= 0 main_~t~0)} #158#return; {14431#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:34,487 INFO L280 TraceCheckUtils]: 0: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID [2020-07-10 20:23:34,487 INFO L280 TraceCheckUtils]: 1: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID [2020-07-10 20:23:34,487 INFO L280 TraceCheckUtils]: 2: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-10 20:23:34,488 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {14427#true} {14441#(<= 1 main_~t~0)} #164#return; {14441#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:34,496 INFO L280 TraceCheckUtils]: 0: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID [2020-07-10 20:23:34,496 INFO L280 TraceCheckUtils]: 1: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID [2020-07-10 20:23:34,496 INFO L280 TraceCheckUtils]: 2: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-10 20:23:34,497 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {14427#true} {14441#(<= 1 main_~t~0)} #166#return; {14441#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:34,505 INFO L280 TraceCheckUtils]: 0: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID [2020-07-10 20:23:34,505 INFO L280 TraceCheckUtils]: 1: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID [2020-07-10 20:23:34,505 INFO L280 TraceCheckUtils]: 2: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-10 20:23:34,506 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {14427#true} {14451#(<= 2 main_~t~0)} #172#return; {14451#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:34,514 INFO L280 TraceCheckUtils]: 0: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID [2020-07-10 20:23:34,515 INFO L280 TraceCheckUtils]: 1: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID [2020-07-10 20:23:34,515 INFO L280 TraceCheckUtils]: 2: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-10 20:23:34,516 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {14427#true} {14451#(<= 2 main_~t~0)} #174#return; {14451#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:34,517 INFO L263 TraceCheckUtils]: 0: Hoare triple {14427#true} call ULTIMATE.init(); {14427#true} is VALID [2020-07-10 20:23:34,517 INFO L280 TraceCheckUtils]: 1: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-10 20:23:34,517 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {14427#true} {14427#true} #144#return; {14427#true} is VALID [2020-07-10 20:23:34,518 INFO L263 TraceCheckUtils]: 3: Hoare triple {14427#true} call #t~ret10 := main(); {14427#true} is VALID [2020-07-10 20:23:34,518 INFO L280 TraceCheckUtils]: 4: Hoare triple {14427#true} havoc ~tagbuf_len~0; {14427#true} is VALID [2020-07-10 20:23:34,518 INFO L280 TraceCheckUtils]: 5: Hoare triple {14427#true} havoc ~t~0; {14427#true} is VALID [2020-07-10 20:23:34,519 INFO L280 TraceCheckUtils]: 6: Hoare triple {14427#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {14427#true} is VALID [2020-07-10 20:23:34,519 INFO L280 TraceCheckUtils]: 7: Hoare triple {14427#true} ~tagbuf_len~0 := #t~nondet0; {14427#true} is VALID [2020-07-10 20:23:34,519 INFO L280 TraceCheckUtils]: 8: Hoare triple {14427#true} havoc #t~nondet0; {14427#true} is VALID [2020-07-10 20:23:34,519 INFO L280 TraceCheckUtils]: 9: Hoare triple {14427#true} assume ~tagbuf_len~0 >= 1; {14427#true} is VALID [2020-07-10 20:23:34,520 INFO L280 TraceCheckUtils]: 10: Hoare triple {14427#true} ~t~0 := 0; {14431#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:34,522 INFO L280 TraceCheckUtils]: 11: Hoare triple {14431#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {14431#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:34,524 INFO L280 TraceCheckUtils]: 12: Hoare triple {14431#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {14431#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:34,525 INFO L280 TraceCheckUtils]: 13: Hoare triple {14431#(<= 0 main_~t~0)} havoc #t~pre1; {14431#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:34,526 INFO L280 TraceCheckUtils]: 14: Hoare triple {14431#(<= 0 main_~t~0)} assume !false; {14431#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:34,527 INFO L280 TraceCheckUtils]: 15: Hoare triple {14431#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {14431#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:34,528 INFO L280 TraceCheckUtils]: 16: Hoare triple {14431#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {14431#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:34,528 INFO L280 TraceCheckUtils]: 17: Hoare triple {14431#(<= 0 main_~t~0)} assume 0 != #t~nondet2; {14431#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:34,529 INFO L280 TraceCheckUtils]: 18: Hoare triple {14431#(<= 0 main_~t~0)} havoc #t~nondet2; {14431#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:34,530 INFO L263 TraceCheckUtils]: 19: Hoare triple {14431#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {14427#true} is VALID [2020-07-10 20:23:34,530 INFO L280 TraceCheckUtils]: 20: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID [2020-07-10 20:23:34,530 INFO L280 TraceCheckUtils]: 21: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID [2020-07-10 20:23:34,530 INFO L280 TraceCheckUtils]: 22: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-10 20:23:34,531 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {14427#true} {14431#(<= 0 main_~t~0)} #156#return; {14431#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:34,532 INFO L263 TraceCheckUtils]: 24: Hoare triple {14431#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {14427#true} is VALID [2020-07-10 20:23:34,532 INFO L280 TraceCheckUtils]: 25: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID [2020-07-10 20:23:34,532 INFO L280 TraceCheckUtils]: 26: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID [2020-07-10 20:23:34,533 INFO L280 TraceCheckUtils]: 27: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-10 20:23:34,534 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {14427#true} {14431#(<= 0 main_~t~0)} #158#return; {14431#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:34,535 INFO L280 TraceCheckUtils]: 29: Hoare triple {14431#(<= 0 main_~t~0)} #t~post4 := ~t~0; {14440#(<= 0 |main_#t~post4|)} is VALID [2020-07-10 20:23:34,536 INFO L280 TraceCheckUtils]: 30: Hoare triple {14440#(<= 0 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {14441#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:34,537 INFO L280 TraceCheckUtils]: 31: Hoare triple {14441#(<= 1 main_~t~0)} havoc #t~post4; {14441#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:34,538 INFO L280 TraceCheckUtils]: 32: Hoare triple {14441#(<= 1 main_~t~0)} assume !false; {14441#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:34,538 INFO L280 TraceCheckUtils]: 33: Hoare triple {14441#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {14441#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:34,539 INFO L280 TraceCheckUtils]: 34: Hoare triple {14441#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {14441#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:34,540 INFO L280 TraceCheckUtils]: 35: Hoare triple {14441#(<= 1 main_~t~0)} assume 0 != #t~nondet5; {14441#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:34,541 INFO L280 TraceCheckUtils]: 36: Hoare triple {14441#(<= 1 main_~t~0)} havoc #t~nondet5; {14441#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:34,542 INFO L280 TraceCheckUtils]: 37: Hoare triple {14441#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {14441#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:34,542 INFO L280 TraceCheckUtils]: 38: Hoare triple {14441#(<= 1 main_~t~0)} assume 0 != #t~nondet6; {14441#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:34,543 INFO L280 TraceCheckUtils]: 39: Hoare triple {14441#(<= 1 main_~t~0)} havoc #t~nondet6; {14441#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:34,544 INFO L263 TraceCheckUtils]: 40: Hoare triple {14441#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {14427#true} is VALID [2020-07-10 20:23:34,544 INFO L280 TraceCheckUtils]: 41: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID [2020-07-10 20:23:34,544 INFO L280 TraceCheckUtils]: 42: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID [2020-07-10 20:23:34,544 INFO L280 TraceCheckUtils]: 43: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-10 20:23:34,545 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {14427#true} {14441#(<= 1 main_~t~0)} #164#return; {14441#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:34,546 INFO L263 TraceCheckUtils]: 45: Hoare triple {14441#(<= 1 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {14427#true} is VALID [2020-07-10 20:23:34,546 INFO L280 TraceCheckUtils]: 46: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID [2020-07-10 20:23:34,546 INFO L280 TraceCheckUtils]: 47: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID [2020-07-10 20:23:34,547 INFO L280 TraceCheckUtils]: 48: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-10 20:23:34,548 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {14427#true} {14441#(<= 1 main_~t~0)} #166#return; {14441#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:34,549 INFO L280 TraceCheckUtils]: 50: Hoare triple {14441#(<= 1 main_~t~0)} #t~post7 := ~t~0; {14450#(<= 1 |main_#t~post7|)} is VALID [2020-07-10 20:23:34,550 INFO L280 TraceCheckUtils]: 51: Hoare triple {14450#(<= 1 |main_#t~post7|)} ~t~0 := 1 + #t~post7; {14451#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:34,551 INFO L280 TraceCheckUtils]: 52: Hoare triple {14451#(<= 2 main_~t~0)} havoc #t~post7; {14451#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:34,552 INFO L280 TraceCheckUtils]: 53: Hoare triple {14451#(<= 2 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {14451#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:34,552 INFO L263 TraceCheckUtils]: 54: Hoare triple {14451#(<= 2 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {14427#true} is VALID [2020-07-10 20:23:34,552 INFO L280 TraceCheckUtils]: 55: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID [2020-07-10 20:23:34,553 INFO L280 TraceCheckUtils]: 56: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID [2020-07-10 20:23:34,553 INFO L280 TraceCheckUtils]: 57: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-10 20:23:34,554 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {14427#true} {14451#(<= 2 main_~t~0)} #172#return; {14451#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:34,554 INFO L263 TraceCheckUtils]: 59: Hoare triple {14451#(<= 2 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {14427#true} is VALID [2020-07-10 20:23:34,555 INFO L280 TraceCheckUtils]: 60: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID [2020-07-10 20:23:34,555 INFO L280 TraceCheckUtils]: 61: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID [2020-07-10 20:23:34,555 INFO L280 TraceCheckUtils]: 62: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-10 20:23:34,556 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {14427#true} {14451#(<= 2 main_~t~0)} #174#return; {14451#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:34,557 INFO L280 TraceCheckUtils]: 64: Hoare triple {14451#(<= 2 main_~t~0)} #t~post9 := ~t~0; {14460#(<= 2 |main_#t~post9|)} is VALID [2020-07-10 20:23:34,558 INFO L280 TraceCheckUtils]: 65: Hoare triple {14460#(<= 2 |main_#t~post9|)} ~t~0 := 1 + #t~post9; {14461#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:34,559 INFO L280 TraceCheckUtils]: 66: Hoare triple {14461#(<= 3 main_~t~0)} havoc #t~post9; {14461#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:34,560 INFO L280 TraceCheckUtils]: 67: Hoare triple {14461#(<= 3 main_~t~0)} assume !false; {14461#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:34,561 INFO L280 TraceCheckUtils]: 68: Hoare triple {14461#(<= 3 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {14461#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:34,562 INFO L280 TraceCheckUtils]: 69: Hoare triple {14461#(<= 3 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {14461#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:34,562 INFO L280 TraceCheckUtils]: 70: Hoare triple {14461#(<= 3 main_~t~0)} assume 0 != #t~nondet5; {14461#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:34,563 INFO L280 TraceCheckUtils]: 71: Hoare triple {14461#(<= 3 main_~t~0)} havoc #t~nondet5; {14461#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:34,564 INFO L280 TraceCheckUtils]: 72: Hoare triple {14461#(<= 3 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {14461#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:34,564 INFO L280 TraceCheckUtils]: 73: Hoare triple {14461#(<= 3 main_~t~0)} assume !(0 != #t~nondet6); {14461#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:34,565 INFO L280 TraceCheckUtils]: 74: Hoare triple {14461#(<= 3 main_~t~0)} havoc #t~nondet6; {14461#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:34,566 INFO L263 TraceCheckUtils]: 75: Hoare triple {14461#(<= 3 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {14462#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:34,566 INFO L280 TraceCheckUtils]: 76: Hoare triple {14462#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {14463#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:34,567 INFO L280 TraceCheckUtils]: 77: Hoare triple {14463#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {14428#false} is VALID [2020-07-10 20:23:34,567 INFO L280 TraceCheckUtils]: 78: Hoare triple {14428#false} assume !false; {14428#false} is VALID [2020-07-10 20:23:34,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:23:34,576 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:34,576 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2053359174] [2020-07-10 20:23:34,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:34,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-10 20:23:34,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048422015] [2020-07-10 20:23:34,578 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79 [2020-07-10 20:23:34,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:34,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 20:23:34,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:34,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 20:23:34,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:34,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 20:23:34,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-10 20:23:34,675 INFO L87 Difference]: Start difference. First operand 223 states and 255 transitions. Second operand 11 states. [2020-07-10 20:23:36,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:36,173 INFO L93 Difference]: Finished difference Result 264 states and 305 transitions. [2020-07-10 20:23:36,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-10 20:23:36,173 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79 [2020-07-10 20:23:36,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:36,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 20:23:36,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 168 transitions. [2020-07-10 20:23:36,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 20:23:36,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 168 transitions. [2020-07-10 20:23:36,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 168 transitions. [2020-07-10 20:23:36,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:36,384 INFO L225 Difference]: With dead ends: 264 [2020-07-10 20:23:36,384 INFO L226 Difference]: Without dead ends: 262 [2020-07-10 20:23:36,385 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2020-07-10 20:23:36,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-07-10 20:23:36,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 223. [2020-07-10 20:23:36,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:36,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand 223 states. [2020-07-10 20:23:36,738 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand 223 states. [2020-07-10 20:23:36,738 INFO L87 Difference]: Start difference. First operand 262 states. Second operand 223 states. [2020-07-10 20:23:36,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:36,745 INFO L93 Difference]: Finished difference Result 262 states and 303 transitions. [2020-07-10 20:23:36,745 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 303 transitions. [2020-07-10 20:23:36,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:36,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:36,746 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand 262 states. [2020-07-10 20:23:36,746 INFO L87 Difference]: Start difference. First operand 223 states. Second operand 262 states. [2020-07-10 20:23:36,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:36,754 INFO L93 Difference]: Finished difference Result 262 states and 303 transitions. [2020-07-10 20:23:36,754 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 303 transitions. [2020-07-10 20:23:36,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:36,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:36,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:36,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:36,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-07-10 20:23:36,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 255 transitions. [2020-07-10 20:23:36,761 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 255 transitions. Word has length 79 [2020-07-10 20:23:36,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:36,761 INFO L479 AbstractCegarLoop]: Abstraction has 223 states and 255 transitions. [2020-07-10 20:23:36,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 20:23:36,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 223 states and 255 transitions. [2020-07-10 20:23:37,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:37,112 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 255 transitions. [2020-07-10 20:23:37,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-07-10 20:23:37,113 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:37,114 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:37,114 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-10 20:23:37,114 INFO L427 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:37,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:37,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1759613834, now seen corresponding path program 1 times [2020-07-10 20:23:37,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:37,117 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1798407865] [2020-07-10 20:23:37,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:37,336 INFO L280 TraceCheckUtils]: 0: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-10 20:23:37,337 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {15980#true} {15980#true} #144#return; {15980#true} is VALID [2020-07-10 20:23:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:37,340 INFO L280 TraceCheckUtils]: 0: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-10 20:23:37,341 INFO L280 TraceCheckUtils]: 1: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-10 20:23:37,341 INFO L280 TraceCheckUtils]: 2: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-10 20:23:37,342 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:37,345 INFO L280 TraceCheckUtils]: 0: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-10 20:23:37,345 INFO L280 TraceCheckUtils]: 1: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-10 20:23:37,345 INFO L280 TraceCheckUtils]: 2: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-10 20:23:37,346 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:37,356 INFO L280 TraceCheckUtils]: 0: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-10 20:23:37,356 INFO L280 TraceCheckUtils]: 1: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-10 20:23:37,356 INFO L280 TraceCheckUtils]: 2: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-10 20:23:37,357 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:37,366 INFO L280 TraceCheckUtils]: 0: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-10 20:23:37,366 INFO L280 TraceCheckUtils]: 1: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-10 20:23:37,367 INFO L280 TraceCheckUtils]: 2: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-10 20:23:37,367 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:37,374 INFO L280 TraceCheckUtils]: 0: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-10 20:23:37,374 INFO L280 TraceCheckUtils]: 1: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-10 20:23:37,374 INFO L280 TraceCheckUtils]: 2: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-10 20:23:37,375 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #164#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:37,379 INFO L280 TraceCheckUtils]: 0: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-10 20:23:37,379 INFO L280 TraceCheckUtils]: 1: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-10 20:23:37,380 INFO L280 TraceCheckUtils]: 2: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-10 20:23:37,380 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #166#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:37,384 INFO L280 TraceCheckUtils]: 0: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-10 20:23:37,384 INFO L280 TraceCheckUtils]: 1: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-10 20:23:37,384 INFO L280 TraceCheckUtils]: 2: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-10 20:23:37,385 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {15980#true} {15986#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,385 INFO L263 TraceCheckUtils]: 0: Hoare triple {15980#true} call ULTIMATE.init(); {15980#true} is VALID [2020-07-10 20:23:37,386 INFO L280 TraceCheckUtils]: 1: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-10 20:23:37,386 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {15980#true} {15980#true} #144#return; {15980#true} is VALID [2020-07-10 20:23:37,386 INFO L263 TraceCheckUtils]: 3: Hoare triple {15980#true} call #t~ret10 := main(); {15980#true} is VALID [2020-07-10 20:23:37,386 INFO L280 TraceCheckUtils]: 4: Hoare triple {15980#true} havoc ~tagbuf_len~0; {15980#true} is VALID [2020-07-10 20:23:37,386 INFO L280 TraceCheckUtils]: 5: Hoare triple {15980#true} havoc ~t~0; {15980#true} is VALID [2020-07-10 20:23:37,386 INFO L280 TraceCheckUtils]: 6: Hoare triple {15980#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {15980#true} is VALID [2020-07-10 20:23:37,387 INFO L280 TraceCheckUtils]: 7: Hoare triple {15980#true} ~tagbuf_len~0 := #t~nondet0; {15980#true} is VALID [2020-07-10 20:23:37,387 INFO L280 TraceCheckUtils]: 8: Hoare triple {15980#true} havoc #t~nondet0; {15980#true} is VALID [2020-07-10 20:23:37,387 INFO L280 TraceCheckUtils]: 9: Hoare triple {15980#true} assume ~tagbuf_len~0 >= 1; {15984#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,388 INFO L280 TraceCheckUtils]: 10: Hoare triple {15984#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,389 INFO L280 TraceCheckUtils]: 11: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,390 INFO L280 TraceCheckUtils]: 12: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,390 INFO L280 TraceCheckUtils]: 13: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,391 INFO L280 TraceCheckUtils]: 14: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,391 INFO L280 TraceCheckUtils]: 15: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,392 INFO L280 TraceCheckUtils]: 16: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,393 INFO L280 TraceCheckUtils]: 17: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet2); {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,393 INFO L280 TraceCheckUtils]: 18: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,393 INFO L263 TraceCheckUtils]: 19: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {15980#true} is VALID [2020-07-10 20:23:37,393 INFO L280 TraceCheckUtils]: 20: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-10 20:23:37,394 INFO L280 TraceCheckUtils]: 21: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-10 20:23:37,394 INFO L280 TraceCheckUtils]: 22: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-10 20:23:37,395 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,395 INFO L263 TraceCheckUtils]: 24: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {15980#true} is VALID [2020-07-10 20:23:37,395 INFO L280 TraceCheckUtils]: 25: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-10 20:23:37,395 INFO L280 TraceCheckUtils]: 26: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-10 20:23:37,395 INFO L280 TraceCheckUtils]: 27: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-10 20:23:37,396 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,397 INFO L280 TraceCheckUtils]: 29: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post3 := ~t~0; {15995#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,398 INFO L280 TraceCheckUtils]: 30: Hoare triple {15995#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post3; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,399 INFO L280 TraceCheckUtils]: 31: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post3; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,400 INFO L280 TraceCheckUtils]: 32: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,401 INFO L280 TraceCheckUtils]: 33: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,402 INFO L280 TraceCheckUtils]: 34: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,402 INFO L280 TraceCheckUtils]: 35: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet2; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,403 INFO L280 TraceCheckUtils]: 36: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,403 INFO L263 TraceCheckUtils]: 37: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {15980#true} is VALID [2020-07-10 20:23:37,403 INFO L280 TraceCheckUtils]: 38: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-10 20:23:37,403 INFO L280 TraceCheckUtils]: 39: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-10 20:23:37,403 INFO L280 TraceCheckUtils]: 40: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-10 20:23:37,404 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,404 INFO L263 TraceCheckUtils]: 42: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {15980#true} is VALID [2020-07-10 20:23:37,405 INFO L280 TraceCheckUtils]: 43: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-10 20:23:37,405 INFO L280 TraceCheckUtils]: 44: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-10 20:23:37,405 INFO L280 TraceCheckUtils]: 45: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-10 20:23:37,406 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,407 INFO L280 TraceCheckUtils]: 47: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post4 := ~t~0; {16004#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,408 INFO L280 TraceCheckUtils]: 48: Hoare triple {16004#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post4; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,409 INFO L280 TraceCheckUtils]: 49: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post4; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,409 INFO L280 TraceCheckUtils]: 50: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,410 INFO L280 TraceCheckUtils]: 51: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,411 INFO L280 TraceCheckUtils]: 52: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,411 INFO L280 TraceCheckUtils]: 53: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet5; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,412 INFO L280 TraceCheckUtils]: 54: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet5; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,412 INFO L280 TraceCheckUtils]: 55: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,413 INFO L280 TraceCheckUtils]: 56: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet6; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,414 INFO L280 TraceCheckUtils]: 57: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet6; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,414 INFO L263 TraceCheckUtils]: 58: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {15980#true} is VALID [2020-07-10 20:23:37,414 INFO L280 TraceCheckUtils]: 59: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-10 20:23:37,415 INFO L280 TraceCheckUtils]: 60: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-10 20:23:37,415 INFO L280 TraceCheckUtils]: 61: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-10 20:23:37,416 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #164#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,416 INFO L263 TraceCheckUtils]: 63: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {15980#true} is VALID [2020-07-10 20:23:37,417 INFO L280 TraceCheckUtils]: 64: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-10 20:23:37,417 INFO L280 TraceCheckUtils]: 65: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-10 20:23:37,417 INFO L280 TraceCheckUtils]: 66: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-10 20:23:37,418 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #166#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,419 INFO L280 TraceCheckUtils]: 68: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post7 := ~t~0; {16013#(<= (+ |main_#t~post7| 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,419 INFO L280 TraceCheckUtils]: 69: Hoare triple {16013#(<= (+ |main_#t~post7| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post7; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,420 INFO L280 TraceCheckUtils]: 70: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post7; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,421 INFO L280 TraceCheckUtils]: 71: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,421 INFO L263 TraceCheckUtils]: 72: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {15980#true} is VALID [2020-07-10 20:23:37,421 INFO L280 TraceCheckUtils]: 73: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-10 20:23:37,421 INFO L280 TraceCheckUtils]: 74: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-10 20:23:37,421 INFO L280 TraceCheckUtils]: 75: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-10 20:23:37,422 INFO L275 TraceCheckUtils]: 76: Hoare quadruple {15980#true} {15986#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:37,423 INFO L263 TraceCheckUtils]: 77: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {16018#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:37,424 INFO L280 TraceCheckUtils]: 78: Hoare triple {16018#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {16019#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:37,424 INFO L280 TraceCheckUtils]: 79: Hoare triple {16019#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {15981#false} is VALID [2020-07-10 20:23:37,425 INFO L280 TraceCheckUtils]: 80: Hoare triple {15981#false} assume !false; {15981#false} is VALID [2020-07-10 20:23:37,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:23:37,433 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:37,434 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1798407865] [2020-07-10 20:23:37,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:37,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-10 20:23:37,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592359530] [2020-07-10 20:23:37,435 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2020-07-10 20:23:37,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:37,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 20:23:37,501 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:37,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 20:23:37,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:37,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 20:23:37,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-10 20:23:37,502 INFO L87 Difference]: Start difference. First operand 223 states and 255 transitions. Second operand 10 states. [2020-07-10 20:23:38,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:38,752 INFO L93 Difference]: Finished difference Result 236 states and 268 transitions. [2020-07-10 20:23:38,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-10 20:23:38,752 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2020-07-10 20:23:38,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 20:23:38,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 109 transitions. [2020-07-10 20:23:38,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 20:23:38,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 109 transitions. [2020-07-10 20:23:38,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 109 transitions. [2020-07-10 20:23:38,908 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:38,914 INFO L225 Difference]: With dead ends: 236 [2020-07-10 20:23:38,914 INFO L226 Difference]: Without dead ends: 234 [2020-07-10 20:23:38,914 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2020-07-10 20:23:38,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-07-10 20:23:39,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 228. [2020-07-10 20:23:39,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:39,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand 228 states. [2020-07-10 20:23:39,276 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 228 states. [2020-07-10 20:23:39,276 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 228 states. [2020-07-10 20:23:39,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:39,282 INFO L93 Difference]: Finished difference Result 234 states and 266 transitions. [2020-07-10 20:23:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 266 transitions. [2020-07-10 20:23:39,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:39,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:39,283 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states. Second operand 234 states. [2020-07-10 20:23:39,283 INFO L87 Difference]: Start difference. First operand 228 states. Second operand 234 states. [2020-07-10 20:23:39,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:39,288 INFO L93 Difference]: Finished difference Result 234 states and 266 transitions. [2020-07-10 20:23:39,289 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 266 transitions. [2020-07-10 20:23:39,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:39,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:39,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:39,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:39,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2020-07-10 20:23:39,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 260 transitions. [2020-07-10 20:23:39,295 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 260 transitions. Word has length 81 [2020-07-10 20:23:39,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:39,296 INFO L479 AbstractCegarLoop]: Abstraction has 228 states and 260 transitions. [2020-07-10 20:23:39,296 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 20:23:39,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 228 states and 260 transitions. [2020-07-10 20:23:39,659 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:39,659 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 260 transitions. [2020-07-10 20:23:39,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-07-10 20:23:39,661 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:39,661 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:39,662 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-10 20:23:39,662 INFO L427 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:39,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:39,662 INFO L82 PathProgramCache]: Analyzing trace with hash -343631243, now seen corresponding path program 1 times [2020-07-10 20:23:39,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:39,663 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [571643029] [2020-07-10 20:23:39,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:39,790 INFO L280 TraceCheckUtils]: 0: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-10 20:23:39,791 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {17434#true} {17434#true} #144#return; {17434#true} is VALID [2020-07-10 20:23:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:39,794 INFO L280 TraceCheckUtils]: 0: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID [2020-07-10 20:23:39,795 INFO L280 TraceCheckUtils]: 1: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID [2020-07-10 20:23:39,795 INFO L280 TraceCheckUtils]: 2: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-10 20:23:39,796 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {17434#true} {17438#(<= 0 main_~t~0)} #152#return; {17438#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:39,800 INFO L280 TraceCheckUtils]: 0: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID [2020-07-10 20:23:39,800 INFO L280 TraceCheckUtils]: 1: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID [2020-07-10 20:23:39,800 INFO L280 TraceCheckUtils]: 2: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-10 20:23:39,801 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {17434#true} {17438#(<= 0 main_~t~0)} #154#return; {17438#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:39,806 INFO L280 TraceCheckUtils]: 0: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID [2020-07-10 20:23:39,807 INFO L280 TraceCheckUtils]: 1: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID [2020-07-10 20:23:39,807 INFO L280 TraceCheckUtils]: 2: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-10 20:23:39,808 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {17434#true} {17448#(<= 1 main_~t~0)} #156#return; {17448#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:39,811 INFO L280 TraceCheckUtils]: 0: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID [2020-07-10 20:23:39,811 INFO L280 TraceCheckUtils]: 1: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID [2020-07-10 20:23:39,811 INFO L280 TraceCheckUtils]: 2: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-10 20:23:39,812 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {17434#true} {17448#(<= 1 main_~t~0)} #158#return; {17448#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:39,816 INFO L280 TraceCheckUtils]: 0: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID [2020-07-10 20:23:39,816 INFO L280 TraceCheckUtils]: 1: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID [2020-07-10 20:23:39,816 INFO L280 TraceCheckUtils]: 2: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-10 20:23:39,817 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {17434#true} {17458#(<= 2 main_~t~0)} #172#return; {17458#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:39,821 INFO L280 TraceCheckUtils]: 0: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID [2020-07-10 20:23:39,821 INFO L280 TraceCheckUtils]: 1: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID [2020-07-10 20:23:39,822 INFO L280 TraceCheckUtils]: 2: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-10 20:23:39,823 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {17434#true} {17458#(<= 2 main_~t~0)} #174#return; {17458#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:39,823 INFO L263 TraceCheckUtils]: 0: Hoare triple {17434#true} call ULTIMATE.init(); {17434#true} is VALID [2020-07-10 20:23:39,823 INFO L280 TraceCheckUtils]: 1: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-10 20:23:39,823 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {17434#true} {17434#true} #144#return; {17434#true} is VALID [2020-07-10 20:23:39,823 INFO L263 TraceCheckUtils]: 3: Hoare triple {17434#true} call #t~ret10 := main(); {17434#true} is VALID [2020-07-10 20:23:39,824 INFO L280 TraceCheckUtils]: 4: Hoare triple {17434#true} havoc ~tagbuf_len~0; {17434#true} is VALID [2020-07-10 20:23:39,824 INFO L280 TraceCheckUtils]: 5: Hoare triple {17434#true} havoc ~t~0; {17434#true} is VALID [2020-07-10 20:23:39,824 INFO L280 TraceCheckUtils]: 6: Hoare triple {17434#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {17434#true} is VALID [2020-07-10 20:23:39,824 INFO L280 TraceCheckUtils]: 7: Hoare triple {17434#true} ~tagbuf_len~0 := #t~nondet0; {17434#true} is VALID [2020-07-10 20:23:39,824 INFO L280 TraceCheckUtils]: 8: Hoare triple {17434#true} havoc #t~nondet0; {17434#true} is VALID [2020-07-10 20:23:39,825 INFO L280 TraceCheckUtils]: 9: Hoare triple {17434#true} assume ~tagbuf_len~0 >= 1; {17434#true} is VALID [2020-07-10 20:23:39,825 INFO L280 TraceCheckUtils]: 10: Hoare triple {17434#true} ~t~0 := 0; {17438#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:39,826 INFO L280 TraceCheckUtils]: 11: Hoare triple {17438#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {17438#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:39,826 INFO L280 TraceCheckUtils]: 12: Hoare triple {17438#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {17438#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:39,827 INFO L280 TraceCheckUtils]: 13: Hoare triple {17438#(<= 0 main_~t~0)} havoc #t~pre1; {17438#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:39,827 INFO L280 TraceCheckUtils]: 14: Hoare triple {17438#(<= 0 main_~t~0)} assume !false; {17438#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:39,828 INFO L280 TraceCheckUtils]: 15: Hoare triple {17438#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {17438#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:39,828 INFO L280 TraceCheckUtils]: 16: Hoare triple {17438#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {17438#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:39,829 INFO L280 TraceCheckUtils]: 17: Hoare triple {17438#(<= 0 main_~t~0)} assume !(0 != #t~nondet2); {17438#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:39,829 INFO L280 TraceCheckUtils]: 18: Hoare triple {17438#(<= 0 main_~t~0)} havoc #t~nondet2; {17438#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:39,829 INFO L263 TraceCheckUtils]: 19: Hoare triple {17438#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {17434#true} is VALID [2020-07-10 20:23:39,830 INFO L280 TraceCheckUtils]: 20: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID [2020-07-10 20:23:39,830 INFO L280 TraceCheckUtils]: 21: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID [2020-07-10 20:23:39,830 INFO L280 TraceCheckUtils]: 22: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-10 20:23:39,831 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {17434#true} {17438#(<= 0 main_~t~0)} #152#return; {17438#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:39,831 INFO L263 TraceCheckUtils]: 24: Hoare triple {17438#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {17434#true} is VALID [2020-07-10 20:23:39,831 INFO L280 TraceCheckUtils]: 25: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID [2020-07-10 20:23:39,831 INFO L280 TraceCheckUtils]: 26: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID [2020-07-10 20:23:39,832 INFO L280 TraceCheckUtils]: 27: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-10 20:23:39,832 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {17434#true} {17438#(<= 0 main_~t~0)} #154#return; {17438#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:39,833 INFO L280 TraceCheckUtils]: 29: Hoare triple {17438#(<= 0 main_~t~0)} #t~post3 := ~t~0; {17447#(<= 0 |main_#t~post3|)} is VALID [2020-07-10 20:23:39,834 INFO L280 TraceCheckUtils]: 30: Hoare triple {17447#(<= 0 |main_#t~post3|)} ~t~0 := 1 + #t~post3; {17448#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:39,835 INFO L280 TraceCheckUtils]: 31: Hoare triple {17448#(<= 1 main_~t~0)} havoc #t~post3; {17448#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:39,835 INFO L280 TraceCheckUtils]: 32: Hoare triple {17448#(<= 1 main_~t~0)} assume !false; {17448#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:39,836 INFO L280 TraceCheckUtils]: 33: Hoare triple {17448#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {17448#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:39,837 INFO L280 TraceCheckUtils]: 34: Hoare triple {17448#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {17448#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:39,837 INFO L280 TraceCheckUtils]: 35: Hoare triple {17448#(<= 1 main_~t~0)} assume 0 != #t~nondet2; {17448#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:39,838 INFO L280 TraceCheckUtils]: 36: Hoare triple {17448#(<= 1 main_~t~0)} havoc #t~nondet2; {17448#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:39,838 INFO L263 TraceCheckUtils]: 37: Hoare triple {17448#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {17434#true} is VALID [2020-07-10 20:23:39,838 INFO L280 TraceCheckUtils]: 38: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID [2020-07-10 20:23:39,838 INFO L280 TraceCheckUtils]: 39: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID [2020-07-10 20:23:39,839 INFO L280 TraceCheckUtils]: 40: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-10 20:23:39,840 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {17434#true} {17448#(<= 1 main_~t~0)} #156#return; {17448#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:39,840 INFO L263 TraceCheckUtils]: 42: Hoare triple {17448#(<= 1 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {17434#true} is VALID [2020-07-10 20:23:39,840 INFO L280 TraceCheckUtils]: 43: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID [2020-07-10 20:23:39,840 INFO L280 TraceCheckUtils]: 44: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID [2020-07-10 20:23:39,841 INFO L280 TraceCheckUtils]: 45: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-10 20:23:39,841 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {17434#true} {17448#(<= 1 main_~t~0)} #158#return; {17448#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:39,842 INFO L280 TraceCheckUtils]: 47: Hoare triple {17448#(<= 1 main_~t~0)} #t~post4 := ~t~0; {17457#(<= 1 |main_#t~post4|)} is VALID [2020-07-10 20:23:39,843 INFO L280 TraceCheckUtils]: 48: Hoare triple {17457#(<= 1 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {17458#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:39,844 INFO L280 TraceCheckUtils]: 49: Hoare triple {17458#(<= 2 main_~t~0)} havoc #t~post4; {17458#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:39,845 INFO L280 TraceCheckUtils]: 50: Hoare triple {17458#(<= 2 main_~t~0)} assume !false; {17458#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:39,845 INFO L280 TraceCheckUtils]: 51: Hoare triple {17458#(<= 2 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {17458#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:39,846 INFO L280 TraceCheckUtils]: 52: Hoare triple {17458#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {17458#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:39,847 INFO L280 TraceCheckUtils]: 53: Hoare triple {17458#(<= 2 main_~t~0)} assume 0 != #t~nondet5; {17458#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:39,848 INFO L280 TraceCheckUtils]: 54: Hoare triple {17458#(<= 2 main_~t~0)} havoc #t~nondet5; {17458#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:39,849 INFO L280 TraceCheckUtils]: 55: Hoare triple {17458#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {17458#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:39,850 INFO L280 TraceCheckUtils]: 56: Hoare triple {17458#(<= 2 main_~t~0)} assume !(0 != #t~nondet6); {17458#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:39,851 INFO L280 TraceCheckUtils]: 57: Hoare triple {17458#(<= 2 main_~t~0)} havoc #t~nondet6; {17458#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:39,851 INFO L263 TraceCheckUtils]: 58: Hoare triple {17458#(<= 2 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {17434#true} is VALID [2020-07-10 20:23:39,851 INFO L280 TraceCheckUtils]: 59: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID [2020-07-10 20:23:39,852 INFO L280 TraceCheckUtils]: 60: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID [2020-07-10 20:23:39,852 INFO L280 TraceCheckUtils]: 61: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-10 20:23:39,853 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {17434#true} {17458#(<= 2 main_~t~0)} #172#return; {17458#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:39,854 INFO L263 TraceCheckUtils]: 63: Hoare triple {17458#(<= 2 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {17434#true} is VALID [2020-07-10 20:23:39,854 INFO L280 TraceCheckUtils]: 64: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID [2020-07-10 20:23:39,855 INFO L280 TraceCheckUtils]: 65: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID [2020-07-10 20:23:39,855 INFO L280 TraceCheckUtils]: 66: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-10 20:23:39,856 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {17434#true} {17458#(<= 2 main_~t~0)} #174#return; {17458#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:39,857 INFO L280 TraceCheckUtils]: 68: Hoare triple {17458#(<= 2 main_~t~0)} #t~post9 := ~t~0; {17467#(<= 2 |main_#t~post9|)} is VALID [2020-07-10 20:23:39,858 INFO L280 TraceCheckUtils]: 69: Hoare triple {17467#(<= 2 |main_#t~post9|)} ~t~0 := 1 + #t~post9; {17468#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:39,859 INFO L280 TraceCheckUtils]: 70: Hoare triple {17468#(<= 3 main_~t~0)} havoc #t~post9; {17468#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:39,861 INFO L280 TraceCheckUtils]: 71: Hoare triple {17468#(<= 3 main_~t~0)} assume !false; {17468#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:39,861 INFO L280 TraceCheckUtils]: 72: Hoare triple {17468#(<= 3 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {17468#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:39,863 INFO L280 TraceCheckUtils]: 73: Hoare triple {17468#(<= 3 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {17468#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:39,863 INFO L280 TraceCheckUtils]: 74: Hoare triple {17468#(<= 3 main_~t~0)} assume 0 != #t~nondet5; {17468#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:39,864 INFO L280 TraceCheckUtils]: 75: Hoare triple {17468#(<= 3 main_~t~0)} havoc #t~nondet5; {17468#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:39,865 INFO L280 TraceCheckUtils]: 76: Hoare triple {17468#(<= 3 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {17468#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:39,865 INFO L280 TraceCheckUtils]: 77: Hoare triple {17468#(<= 3 main_~t~0)} assume !(0 != #t~nondet6); {17468#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:39,866 INFO L280 TraceCheckUtils]: 78: Hoare triple {17468#(<= 3 main_~t~0)} havoc #t~nondet6; {17468#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:39,868 INFO L263 TraceCheckUtils]: 79: Hoare triple {17468#(<= 3 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {17469#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:39,869 INFO L280 TraceCheckUtils]: 80: Hoare triple {17469#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {17470#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:39,869 INFO L280 TraceCheckUtils]: 81: Hoare triple {17470#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {17435#false} is VALID [2020-07-10 20:23:39,870 INFO L280 TraceCheckUtils]: 82: Hoare triple {17435#false} assume !false; {17435#false} is VALID [2020-07-10 20:23:39,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:23:39,897 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:39,898 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [571643029] [2020-07-10 20:23:39,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:39,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-10 20:23:39,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659314238] [2020-07-10 20:23:39,899 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2020-07-10 20:23:39,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:39,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 20:23:40,001 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:40,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 20:23:40,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:40,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 20:23:40,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-10 20:23:40,003 INFO L87 Difference]: Start difference. First operand 228 states and 260 transitions. Second operand 11 states. [2020-07-10 20:23:41,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:41,895 INFO L93 Difference]: Finished difference Result 263 states and 302 transitions. [2020-07-10 20:23:41,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-10 20:23:41,896 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2020-07-10 20:23:41,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:41,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 20:23:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 160 transitions. [2020-07-10 20:23:41,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 20:23:41,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 160 transitions. [2020-07-10 20:23:41,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 160 transitions. [2020-07-10 20:23:42,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:42,128 INFO L225 Difference]: With dead ends: 263 [2020-07-10 20:23:42,128 INFO L226 Difference]: Without dead ends: 261 [2020-07-10 20:23:42,129 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-07-10 20:23:42,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2020-07-10 20:23:42,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 253. [2020-07-10 20:23:42,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:42,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand 253 states. [2020-07-10 20:23:42,547 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand 253 states. [2020-07-10 20:23:42,548 INFO L87 Difference]: Start difference. First operand 261 states. Second operand 253 states. [2020-07-10 20:23:42,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:42,555 INFO L93 Difference]: Finished difference Result 261 states and 300 transitions. [2020-07-10 20:23:42,555 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 300 transitions. [2020-07-10 20:23:42,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:42,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:42,556 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand 261 states. [2020-07-10 20:23:42,556 INFO L87 Difference]: Start difference. First operand 253 states. Second operand 261 states. [2020-07-10 20:23:42,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:42,562 INFO L93 Difference]: Finished difference Result 261 states and 300 transitions. [2020-07-10 20:23:42,563 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 300 transitions. [2020-07-10 20:23:42,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:42,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:42,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:42,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:42,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-07-10 20:23:42,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 291 transitions. [2020-07-10 20:23:42,570 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 291 transitions. Word has length 83 [2020-07-10 20:23:42,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:42,570 INFO L479 AbstractCegarLoop]: Abstraction has 253 states and 291 transitions. [2020-07-10 20:23:42,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 20:23:42,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 253 states and 291 transitions. [2020-07-10 20:23:42,977 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:42,978 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 291 transitions. [2020-07-10 20:23:42,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-07-10 20:23:42,981 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:42,982 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:42,982 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-10 20:23:42,982 INFO L427 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:42,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:42,983 INFO L82 PathProgramCache]: Analyzing trace with hash -857748777, now seen corresponding path program 3 times [2020-07-10 20:23:42,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:42,983 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [753684006] [2020-07-10 20:23:42,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:43,162 INFO L280 TraceCheckUtils]: 0: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-10 20:23:43,163 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {19041#true} {19041#true} #144#return; {19041#true} is VALID [2020-07-10 20:23:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:43,166 INFO L280 TraceCheckUtils]: 0: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-10 20:23:43,166 INFO L280 TraceCheckUtils]: 1: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-10 20:23:43,166 INFO L280 TraceCheckUtils]: 2: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-10 20:23:43,167 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:43,171 INFO L280 TraceCheckUtils]: 0: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-10 20:23:43,171 INFO L280 TraceCheckUtils]: 1: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-10 20:23:43,171 INFO L280 TraceCheckUtils]: 2: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-10 20:23:43,172 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:43,176 INFO L280 TraceCheckUtils]: 0: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-10 20:23:43,176 INFO L280 TraceCheckUtils]: 1: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-10 20:23:43,176 INFO L280 TraceCheckUtils]: 2: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-10 20:23:43,177 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #172#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:43,180 INFO L280 TraceCheckUtils]: 0: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-10 20:23:43,181 INFO L280 TraceCheckUtils]: 1: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-10 20:23:43,181 INFO L280 TraceCheckUtils]: 2: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-10 20:23:43,182 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #174#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:43,185 INFO L280 TraceCheckUtils]: 0: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-10 20:23:43,185 INFO L280 TraceCheckUtils]: 1: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-10 20:23:43,186 INFO L280 TraceCheckUtils]: 2: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-10 20:23:43,186 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #164#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:43,190 INFO L280 TraceCheckUtils]: 0: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-10 20:23:43,190 INFO L280 TraceCheckUtils]: 1: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-10 20:23:43,191 INFO L280 TraceCheckUtils]: 2: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-10 20:23:43,191 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #166#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:43,195 INFO L280 TraceCheckUtils]: 0: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-10 20:23:43,195 INFO L280 TraceCheckUtils]: 1: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-10 20:23:43,195 INFO L280 TraceCheckUtils]: 2: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-10 20:23:43,196 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {19041#true} {19047#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,196 INFO L263 TraceCheckUtils]: 0: Hoare triple {19041#true} call ULTIMATE.init(); {19041#true} is VALID [2020-07-10 20:23:43,196 INFO L280 TraceCheckUtils]: 1: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-10 20:23:43,197 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {19041#true} {19041#true} #144#return; {19041#true} is VALID [2020-07-10 20:23:43,197 INFO L263 TraceCheckUtils]: 3: Hoare triple {19041#true} call #t~ret10 := main(); {19041#true} is VALID [2020-07-10 20:23:43,197 INFO L280 TraceCheckUtils]: 4: Hoare triple {19041#true} havoc ~tagbuf_len~0; {19041#true} is VALID [2020-07-10 20:23:43,197 INFO L280 TraceCheckUtils]: 5: Hoare triple {19041#true} havoc ~t~0; {19041#true} is VALID [2020-07-10 20:23:43,197 INFO L280 TraceCheckUtils]: 6: Hoare triple {19041#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {19041#true} is VALID [2020-07-10 20:23:43,198 INFO L280 TraceCheckUtils]: 7: Hoare triple {19041#true} ~tagbuf_len~0 := #t~nondet0; {19041#true} is VALID [2020-07-10 20:23:43,198 INFO L280 TraceCheckUtils]: 8: Hoare triple {19041#true} havoc #t~nondet0; {19041#true} is VALID [2020-07-10 20:23:43,198 INFO L280 TraceCheckUtils]: 9: Hoare triple {19041#true} assume ~tagbuf_len~0 >= 1; {19045#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,199 INFO L280 TraceCheckUtils]: 10: Hoare triple {19045#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,200 INFO L280 TraceCheckUtils]: 11: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,201 INFO L280 TraceCheckUtils]: 12: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,202 INFO L280 TraceCheckUtils]: 13: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,203 INFO L280 TraceCheckUtils]: 14: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,204 INFO L280 TraceCheckUtils]: 15: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,205 INFO L280 TraceCheckUtils]: 16: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,205 INFO L280 TraceCheckUtils]: 17: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet2; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,206 INFO L280 TraceCheckUtils]: 18: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,207 INFO L263 TraceCheckUtils]: 19: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {19041#true} is VALID [2020-07-10 20:23:43,207 INFO L280 TraceCheckUtils]: 20: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-10 20:23:43,207 INFO L280 TraceCheckUtils]: 21: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-10 20:23:43,207 INFO L280 TraceCheckUtils]: 22: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-10 20:23:43,209 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,209 INFO L263 TraceCheckUtils]: 24: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {19041#true} is VALID [2020-07-10 20:23:43,209 INFO L280 TraceCheckUtils]: 25: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-10 20:23:43,210 INFO L280 TraceCheckUtils]: 26: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-10 20:23:43,210 INFO L280 TraceCheckUtils]: 27: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-10 20:23:43,211 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,212 INFO L280 TraceCheckUtils]: 29: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post4 := ~t~0; {19056#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,213 INFO L280 TraceCheckUtils]: 30: Hoare triple {19056#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post4; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,214 INFO L280 TraceCheckUtils]: 31: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post4; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,215 INFO L280 TraceCheckUtils]: 32: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,216 INFO L280 TraceCheckUtils]: 33: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,217 INFO L280 TraceCheckUtils]: 34: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,217 INFO L280 TraceCheckUtils]: 35: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet5; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,218 INFO L280 TraceCheckUtils]: 36: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet5; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,219 INFO L280 TraceCheckUtils]: 37: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,220 INFO L280 TraceCheckUtils]: 38: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet6); {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,220 INFO L280 TraceCheckUtils]: 39: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet6; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,221 INFO L263 TraceCheckUtils]: 40: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {19041#true} is VALID [2020-07-10 20:23:43,221 INFO L280 TraceCheckUtils]: 41: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-10 20:23:43,221 INFO L280 TraceCheckUtils]: 42: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-10 20:23:43,222 INFO L280 TraceCheckUtils]: 43: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-10 20:23:43,223 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #172#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,223 INFO L263 TraceCheckUtils]: 45: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {19041#true} is VALID [2020-07-10 20:23:43,223 INFO L280 TraceCheckUtils]: 46: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-10 20:23:43,224 INFO L280 TraceCheckUtils]: 47: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-10 20:23:43,224 INFO L280 TraceCheckUtils]: 48: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-10 20:23:43,225 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #174#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,226 INFO L280 TraceCheckUtils]: 50: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post9 := ~t~0; {19065#(<= (+ |main_#t~post9| 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,227 INFO L280 TraceCheckUtils]: 51: Hoare triple {19065#(<= (+ |main_#t~post9| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post9; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,228 INFO L280 TraceCheckUtils]: 52: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post9; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,229 INFO L280 TraceCheckUtils]: 53: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,230 INFO L280 TraceCheckUtils]: 54: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,230 INFO L280 TraceCheckUtils]: 55: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,231 INFO L280 TraceCheckUtils]: 56: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet5; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,232 INFO L280 TraceCheckUtils]: 57: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet5; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,232 INFO L280 TraceCheckUtils]: 58: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,233 INFO L280 TraceCheckUtils]: 59: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet6; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,235 INFO L280 TraceCheckUtils]: 60: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet6; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,235 INFO L263 TraceCheckUtils]: 61: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {19041#true} is VALID [2020-07-10 20:23:43,235 INFO L280 TraceCheckUtils]: 62: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-10 20:23:43,235 INFO L280 TraceCheckUtils]: 63: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-10 20:23:43,236 INFO L280 TraceCheckUtils]: 64: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-10 20:23:43,238 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #164#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,238 INFO L263 TraceCheckUtils]: 66: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {19041#true} is VALID [2020-07-10 20:23:43,239 INFO L280 TraceCheckUtils]: 67: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-10 20:23:43,239 INFO L280 TraceCheckUtils]: 68: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-10 20:23:43,239 INFO L280 TraceCheckUtils]: 69: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-10 20:23:43,240 INFO L275 TraceCheckUtils]: 70: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #166#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,241 INFO L280 TraceCheckUtils]: 71: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post7 := ~t~0; {19074#(<= (+ |main_#t~post7| 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,242 INFO L280 TraceCheckUtils]: 72: Hoare triple {19074#(<= (+ |main_#t~post7| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post7; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,243 INFO L280 TraceCheckUtils]: 73: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post7; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,244 INFO L280 TraceCheckUtils]: 74: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,244 INFO L263 TraceCheckUtils]: 75: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {19041#true} is VALID [2020-07-10 20:23:43,244 INFO L280 TraceCheckUtils]: 76: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-10 20:23:43,245 INFO L280 TraceCheckUtils]: 77: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-10 20:23:43,245 INFO L280 TraceCheckUtils]: 78: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-10 20:23:43,246 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {19041#true} {19047#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:43,246 INFO L263 TraceCheckUtils]: 80: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {19079#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:43,247 INFO L280 TraceCheckUtils]: 81: Hoare triple {19079#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {19080#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:43,248 INFO L280 TraceCheckUtils]: 82: Hoare triple {19080#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {19042#false} is VALID [2020-07-10 20:23:43,248 INFO L280 TraceCheckUtils]: 83: Hoare triple {19042#false} assume !false; {19042#false} is VALID [2020-07-10 20:23:43,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:23:43,256 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:43,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [753684006] [2020-07-10 20:23:43,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:43,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-10 20:23:43,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534229291] [2020-07-10 20:23:43,257 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2020-07-10 20:23:43,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:43,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 20:23:43,342 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:43,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 20:23:43,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:43,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 20:23:43,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-10 20:23:43,343 INFO L87 Difference]: Start difference. First operand 253 states and 291 transitions. Second operand 10 states. [2020-07-10 20:23:44,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:44,685 INFO L93 Difference]: Finished difference Result 262 states and 299 transitions. [2020-07-10 20:23:44,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-10 20:23:44,685 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2020-07-10 20:23:44,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:44,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 20:23:44,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 135 transitions. [2020-07-10 20:23:44,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 20:23:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 135 transitions. [2020-07-10 20:23:44,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 135 transitions. [2020-07-10 20:23:44,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:44,852 INFO L225 Difference]: With dead ends: 262 [2020-07-10 20:23:44,852 INFO L226 Difference]: Without dead ends: 152 [2020-07-10 20:23:44,853 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2020-07-10 20:23:44,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-07-10 20:23:45,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2020-07-10 20:23:45,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:45,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 150 states. [2020-07-10 20:23:45,060 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 150 states. [2020-07-10 20:23:45,060 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 150 states. [2020-07-10 20:23:45,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:45,063 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2020-07-10 20:23:45,064 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 172 transitions. [2020-07-10 20:23:45,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:45,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:45,064 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 152 states. [2020-07-10 20:23:45,065 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 152 states. [2020-07-10 20:23:45,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:45,068 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2020-07-10 20:23:45,068 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 172 transitions. [2020-07-10 20:23:45,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:45,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:45,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:45,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:45,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-07-10 20:23:45,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 170 transitions. [2020-07-10 20:23:45,072 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 170 transitions. Word has length 84 [2020-07-10 20:23:45,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:45,072 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 170 transitions. [2020-07-10 20:23:45,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 20:23:45,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 150 states and 170 transitions. [2020-07-10 20:23:45,311 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:45,311 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2020-07-10 20:23:45,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-07-10 20:23:45,312 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:45,313 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:45,314 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-10 20:23:45,314 INFO L427 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:45,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:45,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1405253968, now seen corresponding path program 2 times [2020-07-10 20:23:45,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:45,315 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1558983655] [2020-07-10 20:23:45,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:45,526 INFO L280 TraceCheckUtils]: 0: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-10 20:23:45,527 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {20227#true} {20227#true} #144#return; {20227#true} is VALID [2020-07-10 20:23:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:45,531 INFO L280 TraceCheckUtils]: 0: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-10 20:23:45,531 INFO L280 TraceCheckUtils]: 1: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-10 20:23:45,531 INFO L280 TraceCheckUtils]: 2: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-10 20:23:45,532 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:45,536 INFO L280 TraceCheckUtils]: 0: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-10 20:23:45,536 INFO L280 TraceCheckUtils]: 1: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-10 20:23:45,536 INFO L280 TraceCheckUtils]: 2: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-10 20:23:45,537 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:45,544 INFO L280 TraceCheckUtils]: 0: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-10 20:23:45,544 INFO L280 TraceCheckUtils]: 1: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-10 20:23:45,544 INFO L280 TraceCheckUtils]: 2: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-10 20:23:45,545 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:45,553 INFO L280 TraceCheckUtils]: 0: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-10 20:23:45,554 INFO L280 TraceCheckUtils]: 1: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-10 20:23:45,554 INFO L280 TraceCheckUtils]: 2: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-10 20:23:45,555 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:45,560 INFO L280 TraceCheckUtils]: 0: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-10 20:23:45,560 INFO L280 TraceCheckUtils]: 1: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-10 20:23:45,560 INFO L280 TraceCheckUtils]: 2: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-10 20:23:45,561 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #172#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:45,564 INFO L280 TraceCheckUtils]: 0: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-10 20:23:45,564 INFO L280 TraceCheckUtils]: 1: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-10 20:23:45,564 INFO L280 TraceCheckUtils]: 2: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-10 20:23:45,565 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #174#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:45,575 INFO L280 TraceCheckUtils]: 0: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-10 20:23:45,576 INFO L280 TraceCheckUtils]: 1: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-10 20:23:45,576 INFO L280 TraceCheckUtils]: 2: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-10 20:23:45,577 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {20227#true} {20233#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,577 INFO L263 TraceCheckUtils]: 0: Hoare triple {20227#true} call ULTIMATE.init(); {20227#true} is VALID [2020-07-10 20:23:45,577 INFO L280 TraceCheckUtils]: 1: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-10 20:23:45,578 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {20227#true} {20227#true} #144#return; {20227#true} is VALID [2020-07-10 20:23:45,578 INFO L263 TraceCheckUtils]: 3: Hoare triple {20227#true} call #t~ret10 := main(); {20227#true} is VALID [2020-07-10 20:23:45,578 INFO L280 TraceCheckUtils]: 4: Hoare triple {20227#true} havoc ~tagbuf_len~0; {20227#true} is VALID [2020-07-10 20:23:45,578 INFO L280 TraceCheckUtils]: 5: Hoare triple {20227#true} havoc ~t~0; {20227#true} is VALID [2020-07-10 20:23:45,578 INFO L280 TraceCheckUtils]: 6: Hoare triple {20227#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {20227#true} is VALID [2020-07-10 20:23:45,579 INFO L280 TraceCheckUtils]: 7: Hoare triple {20227#true} ~tagbuf_len~0 := #t~nondet0; {20227#true} is VALID [2020-07-10 20:23:45,579 INFO L280 TraceCheckUtils]: 8: Hoare triple {20227#true} havoc #t~nondet0; {20227#true} is VALID [2020-07-10 20:23:45,579 INFO L280 TraceCheckUtils]: 9: Hoare triple {20227#true} assume ~tagbuf_len~0 >= 1; {20231#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,580 INFO L280 TraceCheckUtils]: 10: Hoare triple {20231#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,581 INFO L280 TraceCheckUtils]: 11: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,582 INFO L280 TraceCheckUtils]: 12: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,582 INFO L280 TraceCheckUtils]: 13: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,583 INFO L280 TraceCheckUtils]: 14: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,584 INFO L280 TraceCheckUtils]: 15: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,584 INFO L280 TraceCheckUtils]: 16: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,585 INFO L280 TraceCheckUtils]: 17: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet2); {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,586 INFO L280 TraceCheckUtils]: 18: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,586 INFO L263 TraceCheckUtils]: 19: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {20227#true} is VALID [2020-07-10 20:23:45,586 INFO L280 TraceCheckUtils]: 20: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-10 20:23:45,586 INFO L280 TraceCheckUtils]: 21: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-10 20:23:45,587 INFO L280 TraceCheckUtils]: 22: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-10 20:23:45,588 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,588 INFO L263 TraceCheckUtils]: 24: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {20227#true} is VALID [2020-07-10 20:23:45,588 INFO L280 TraceCheckUtils]: 25: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-10 20:23:45,588 INFO L280 TraceCheckUtils]: 26: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-10 20:23:45,588 INFO L280 TraceCheckUtils]: 27: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-10 20:23:45,589 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,590 INFO L280 TraceCheckUtils]: 29: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post3 := ~t~0; {20242#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,591 INFO L280 TraceCheckUtils]: 30: Hoare triple {20242#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post3; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,592 INFO L280 TraceCheckUtils]: 31: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post3; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,592 INFO L280 TraceCheckUtils]: 32: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,593 INFO L280 TraceCheckUtils]: 33: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,594 INFO L280 TraceCheckUtils]: 34: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,595 INFO L280 TraceCheckUtils]: 35: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet2; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,595 INFO L280 TraceCheckUtils]: 36: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,595 INFO L263 TraceCheckUtils]: 37: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {20227#true} is VALID [2020-07-10 20:23:45,596 INFO L280 TraceCheckUtils]: 38: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-10 20:23:45,596 INFO L280 TraceCheckUtils]: 39: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-10 20:23:45,596 INFO L280 TraceCheckUtils]: 40: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-10 20:23:45,597 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,597 INFO L263 TraceCheckUtils]: 42: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {20227#true} is VALID [2020-07-10 20:23:45,597 INFO L280 TraceCheckUtils]: 43: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-10 20:23:45,597 INFO L280 TraceCheckUtils]: 44: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-10 20:23:45,598 INFO L280 TraceCheckUtils]: 45: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-10 20:23:45,598 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,599 INFO L280 TraceCheckUtils]: 47: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post4 := ~t~0; {20251#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,600 INFO L280 TraceCheckUtils]: 48: Hoare triple {20251#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post4; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,601 INFO L280 TraceCheckUtils]: 49: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post4; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,601 INFO L280 TraceCheckUtils]: 50: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,602 INFO L280 TraceCheckUtils]: 51: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,603 INFO L280 TraceCheckUtils]: 52: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,603 INFO L280 TraceCheckUtils]: 53: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet5; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,604 INFO L280 TraceCheckUtils]: 54: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet5; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,604 INFO L280 TraceCheckUtils]: 55: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,605 INFO L280 TraceCheckUtils]: 56: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet6); {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,605 INFO L280 TraceCheckUtils]: 57: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet6; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,606 INFO L263 TraceCheckUtils]: 58: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {20227#true} is VALID [2020-07-10 20:23:45,606 INFO L280 TraceCheckUtils]: 59: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-10 20:23:45,606 INFO L280 TraceCheckUtils]: 60: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-10 20:23:45,606 INFO L280 TraceCheckUtils]: 61: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-10 20:23:45,607 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #172#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,607 INFO L263 TraceCheckUtils]: 63: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {20227#true} is VALID [2020-07-10 20:23:45,607 INFO L280 TraceCheckUtils]: 64: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-10 20:23:45,608 INFO L280 TraceCheckUtils]: 65: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-10 20:23:45,608 INFO L280 TraceCheckUtils]: 66: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-10 20:23:45,609 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #174#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,609 INFO L280 TraceCheckUtils]: 68: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post9 := ~t~0; {20260#(<= (+ |main_#t~post9| 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,610 INFO L280 TraceCheckUtils]: 69: Hoare triple {20260#(<= (+ |main_#t~post9| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post9; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,611 INFO L280 TraceCheckUtils]: 70: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post9; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,611 INFO L280 TraceCheckUtils]: 71: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,612 INFO L280 TraceCheckUtils]: 72: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,612 INFO L280 TraceCheckUtils]: 73: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,613 INFO L280 TraceCheckUtils]: 74: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume 0 != #t~nondet5; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,614 INFO L280 TraceCheckUtils]: 75: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet5; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,614 INFO L280 TraceCheckUtils]: 76: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,615 INFO L280 TraceCheckUtils]: 77: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume !(0 != #t~nondet6); {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,615 INFO L280 TraceCheckUtils]: 78: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet6; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,616 INFO L263 TraceCheckUtils]: 79: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {20227#true} is VALID [2020-07-10 20:23:45,616 INFO L280 TraceCheckUtils]: 80: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-10 20:23:45,616 INFO L280 TraceCheckUtils]: 81: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-10 20:23:45,616 INFO L280 TraceCheckUtils]: 82: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-10 20:23:45,617 INFO L275 TraceCheckUtils]: 83: Hoare quadruple {20227#true} {20233#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:45,618 INFO L263 TraceCheckUtils]: 84: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {20265#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:45,619 INFO L280 TraceCheckUtils]: 85: Hoare triple {20265#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {20266#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:45,619 INFO L280 TraceCheckUtils]: 86: Hoare triple {20266#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {20228#false} is VALID [2020-07-10 20:23:45,620 INFO L280 TraceCheckUtils]: 87: Hoare triple {20228#false} assume !false; {20228#false} is VALID [2020-07-10 20:23:45,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:23:45,627 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:45,627 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1558983655] [2020-07-10 20:23:45,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:45,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-10 20:23:45,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149582673] [2020-07-10 20:23:45,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2020-07-10 20:23:45,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:45,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 20:23:45,705 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:45,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 20:23:45,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:45,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 20:23:45,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-10 20:23:45,706 INFO L87 Difference]: Start difference. First operand 150 states and 170 transitions. Second operand 10 states. [2020-07-10 20:23:46,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:46,812 INFO L93 Difference]: Finished difference Result 160 states and 180 transitions. [2020-07-10 20:23:46,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-10 20:23:46,812 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2020-07-10 20:23:46,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:46,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 20:23:46,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 113 transitions. [2020-07-10 20:23:46,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 20:23:46,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 113 transitions. [2020-07-10 20:23:46,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 113 transitions. [2020-07-10 20:23:46,949 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:46,953 INFO L225 Difference]: With dead ends: 160 [2020-07-10 20:23:46,953 INFO L226 Difference]: Without dead ends: 155 [2020-07-10 20:23:46,953 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2020-07-10 20:23:46,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-07-10 20:23:47,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2020-07-10 20:23:47,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:47,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand 153 states. [2020-07-10 20:23:47,164 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 153 states. [2020-07-10 20:23:47,165 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 153 states. [2020-07-10 20:23:47,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:47,168 INFO L93 Difference]: Finished difference Result 155 states and 173 transitions. [2020-07-10 20:23:47,168 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions. [2020-07-10 20:23:47,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:47,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:47,169 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 155 states. [2020-07-10 20:23:47,169 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 155 states. [2020-07-10 20:23:47,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:47,171 INFO L93 Difference]: Finished difference Result 155 states and 173 transitions. [2020-07-10 20:23:47,172 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions. [2020-07-10 20:23:47,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:47,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:47,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:47,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-07-10 20:23:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 171 transitions. [2020-07-10 20:23:47,174 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 171 transitions. Word has length 88 [2020-07-10 20:23:47,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:47,175 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 171 transitions. [2020-07-10 20:23:47,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 20:23:47,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 153 states and 171 transitions. [2020-07-10 20:23:47,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:47,418 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions. [2020-07-10 20:23:47,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-07-10 20:23:47,419 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:47,419 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:47,419 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-10 20:23:47,420 INFO L427 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:47,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:47,420 INFO L82 PathProgramCache]: Analyzing trace with hash 813915649, now seen corresponding path program 1 times [2020-07-10 20:23:47,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:47,420 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1618924802] [2020-07-10 20:23:47,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:47,582 INFO L280 TraceCheckUtils]: 0: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-10 20:23:47,582 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {21221#true} {21221#true} #144#return; {21221#true} is VALID [2020-07-10 20:23:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:47,585 INFO L280 TraceCheckUtils]: 0: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-10 20:23:47,585 INFO L280 TraceCheckUtils]: 1: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-10 20:23:47,585 INFO L280 TraceCheckUtils]: 2: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-10 20:23:47,586 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21221#true} {21225#(<= 0 main_~t~0)} #152#return; {21225#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:47,595 INFO L280 TraceCheckUtils]: 0: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-10 20:23:47,596 INFO L280 TraceCheckUtils]: 1: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-10 20:23:47,596 INFO L280 TraceCheckUtils]: 2: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-10 20:23:47,597 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21221#true} {21225#(<= 0 main_~t~0)} #154#return; {21225#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:47,599 INFO L280 TraceCheckUtils]: 0: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-10 20:23:47,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-10 20:23:47,600 INFO L280 TraceCheckUtils]: 2: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-10 20:23:47,600 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21221#true} {21235#(<= 1 main_~t~0)} #156#return; {21235#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:47,604 INFO L280 TraceCheckUtils]: 0: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-10 20:23:47,604 INFO L280 TraceCheckUtils]: 1: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-10 20:23:47,604 INFO L280 TraceCheckUtils]: 2: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-10 20:23:47,605 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21221#true} {21235#(<= 1 main_~t~0)} #158#return; {21235#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:47,608 INFO L280 TraceCheckUtils]: 0: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-10 20:23:47,608 INFO L280 TraceCheckUtils]: 1: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-10 20:23:47,608 INFO L280 TraceCheckUtils]: 2: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-10 20:23:47,609 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21221#true} {21245#(<= 2 main_~t~0)} #172#return; {21245#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:47,618 INFO L280 TraceCheckUtils]: 0: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-10 20:23:47,618 INFO L280 TraceCheckUtils]: 1: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-10 20:23:47,618 INFO L280 TraceCheckUtils]: 2: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-10 20:23:47,619 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21221#true} {21245#(<= 2 main_~t~0)} #174#return; {21245#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:47,623 INFO L280 TraceCheckUtils]: 0: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-10 20:23:47,623 INFO L280 TraceCheckUtils]: 1: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-10 20:23:47,623 INFO L280 TraceCheckUtils]: 2: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-10 20:23:47,624 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21221#true} {21255#(<= 3 main_~t~0)} #164#return; {21255#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:47,628 INFO L280 TraceCheckUtils]: 0: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-10 20:23:47,629 INFO L280 TraceCheckUtils]: 1: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-10 20:23:47,629 INFO L280 TraceCheckUtils]: 2: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-10 20:23:47,630 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21221#true} {21255#(<= 3 main_~t~0)} #166#return; {21255#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:47,630 INFO L263 TraceCheckUtils]: 0: Hoare triple {21221#true} call ULTIMATE.init(); {21221#true} is VALID [2020-07-10 20:23:47,630 INFO L280 TraceCheckUtils]: 1: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-10 20:23:47,630 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {21221#true} {21221#true} #144#return; {21221#true} is VALID [2020-07-10 20:23:47,630 INFO L263 TraceCheckUtils]: 3: Hoare triple {21221#true} call #t~ret10 := main(); {21221#true} is VALID [2020-07-10 20:23:47,631 INFO L280 TraceCheckUtils]: 4: Hoare triple {21221#true} havoc ~tagbuf_len~0; {21221#true} is VALID [2020-07-10 20:23:47,631 INFO L280 TraceCheckUtils]: 5: Hoare triple {21221#true} havoc ~t~0; {21221#true} is VALID [2020-07-10 20:23:47,631 INFO L280 TraceCheckUtils]: 6: Hoare triple {21221#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {21221#true} is VALID [2020-07-10 20:23:47,631 INFO L280 TraceCheckUtils]: 7: Hoare triple {21221#true} ~tagbuf_len~0 := #t~nondet0; {21221#true} is VALID [2020-07-10 20:23:47,631 INFO L280 TraceCheckUtils]: 8: Hoare triple {21221#true} havoc #t~nondet0; {21221#true} is VALID [2020-07-10 20:23:47,632 INFO L280 TraceCheckUtils]: 9: Hoare triple {21221#true} assume ~tagbuf_len~0 >= 1; {21221#true} is VALID [2020-07-10 20:23:47,632 INFO L280 TraceCheckUtils]: 10: Hoare triple {21221#true} ~t~0 := 0; {21225#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:47,633 INFO L280 TraceCheckUtils]: 11: Hoare triple {21225#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {21225#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:47,633 INFO L280 TraceCheckUtils]: 12: Hoare triple {21225#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {21225#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:47,634 INFO L280 TraceCheckUtils]: 13: Hoare triple {21225#(<= 0 main_~t~0)} havoc #t~pre1; {21225#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:47,634 INFO L280 TraceCheckUtils]: 14: Hoare triple {21225#(<= 0 main_~t~0)} assume !false; {21225#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:47,635 INFO L280 TraceCheckUtils]: 15: Hoare triple {21225#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {21225#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:47,636 INFO L280 TraceCheckUtils]: 16: Hoare triple {21225#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {21225#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:47,636 INFO L280 TraceCheckUtils]: 17: Hoare triple {21225#(<= 0 main_~t~0)} assume !(0 != #t~nondet2); {21225#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:47,637 INFO L280 TraceCheckUtils]: 18: Hoare triple {21225#(<= 0 main_~t~0)} havoc #t~nondet2; {21225#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:47,637 INFO L263 TraceCheckUtils]: 19: Hoare triple {21225#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {21221#true} is VALID [2020-07-10 20:23:47,637 INFO L280 TraceCheckUtils]: 20: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-10 20:23:47,637 INFO L280 TraceCheckUtils]: 21: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-10 20:23:47,638 INFO L280 TraceCheckUtils]: 22: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-10 20:23:47,638 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {21221#true} {21225#(<= 0 main_~t~0)} #152#return; {21225#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:47,639 INFO L263 TraceCheckUtils]: 24: Hoare triple {21225#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {21221#true} is VALID [2020-07-10 20:23:47,639 INFO L280 TraceCheckUtils]: 25: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-10 20:23:47,639 INFO L280 TraceCheckUtils]: 26: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-10 20:23:47,639 INFO L280 TraceCheckUtils]: 27: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-10 20:23:47,640 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {21221#true} {21225#(<= 0 main_~t~0)} #154#return; {21225#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:47,641 INFO L280 TraceCheckUtils]: 29: Hoare triple {21225#(<= 0 main_~t~0)} #t~post3 := ~t~0; {21234#(<= 0 |main_#t~post3|)} is VALID [2020-07-10 20:23:47,642 INFO L280 TraceCheckUtils]: 30: Hoare triple {21234#(<= 0 |main_#t~post3|)} ~t~0 := 1 + #t~post3; {21235#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:47,642 INFO L280 TraceCheckUtils]: 31: Hoare triple {21235#(<= 1 main_~t~0)} havoc #t~post3; {21235#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:47,643 INFO L280 TraceCheckUtils]: 32: Hoare triple {21235#(<= 1 main_~t~0)} assume !false; {21235#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:47,643 INFO L280 TraceCheckUtils]: 33: Hoare triple {21235#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {21235#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:47,644 INFO L280 TraceCheckUtils]: 34: Hoare triple {21235#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {21235#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:47,644 INFO L280 TraceCheckUtils]: 35: Hoare triple {21235#(<= 1 main_~t~0)} assume 0 != #t~nondet2; {21235#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:47,645 INFO L280 TraceCheckUtils]: 36: Hoare triple {21235#(<= 1 main_~t~0)} havoc #t~nondet2; {21235#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:47,645 INFO L263 TraceCheckUtils]: 37: Hoare triple {21235#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {21221#true} is VALID [2020-07-10 20:23:47,645 INFO L280 TraceCheckUtils]: 38: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-10 20:23:47,645 INFO L280 TraceCheckUtils]: 39: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-10 20:23:47,646 INFO L280 TraceCheckUtils]: 40: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-10 20:23:47,646 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {21221#true} {21235#(<= 1 main_~t~0)} #156#return; {21235#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:47,647 INFO L263 TraceCheckUtils]: 42: Hoare triple {21235#(<= 1 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {21221#true} is VALID [2020-07-10 20:23:47,647 INFO L280 TraceCheckUtils]: 43: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-10 20:23:47,647 INFO L280 TraceCheckUtils]: 44: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-10 20:23:47,647 INFO L280 TraceCheckUtils]: 45: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-10 20:23:47,648 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {21221#true} {21235#(<= 1 main_~t~0)} #158#return; {21235#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:47,649 INFO L280 TraceCheckUtils]: 47: Hoare triple {21235#(<= 1 main_~t~0)} #t~post4 := ~t~0; {21244#(<= 1 |main_#t~post4|)} is VALID [2020-07-10 20:23:47,649 INFO L280 TraceCheckUtils]: 48: Hoare triple {21244#(<= 1 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {21245#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:47,650 INFO L280 TraceCheckUtils]: 49: Hoare triple {21245#(<= 2 main_~t~0)} havoc #t~post4; {21245#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:47,651 INFO L280 TraceCheckUtils]: 50: Hoare triple {21245#(<= 2 main_~t~0)} assume !false; {21245#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:47,651 INFO L280 TraceCheckUtils]: 51: Hoare triple {21245#(<= 2 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {21245#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:47,652 INFO L280 TraceCheckUtils]: 52: Hoare triple {21245#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {21245#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:47,652 INFO L280 TraceCheckUtils]: 53: Hoare triple {21245#(<= 2 main_~t~0)} assume 0 != #t~nondet5; {21245#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:47,653 INFO L280 TraceCheckUtils]: 54: Hoare triple {21245#(<= 2 main_~t~0)} havoc #t~nondet5; {21245#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:47,653 INFO L280 TraceCheckUtils]: 55: Hoare triple {21245#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {21245#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:47,654 INFO L280 TraceCheckUtils]: 56: Hoare triple {21245#(<= 2 main_~t~0)} assume !(0 != #t~nondet6); {21245#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:47,654 INFO L280 TraceCheckUtils]: 57: Hoare triple {21245#(<= 2 main_~t~0)} havoc #t~nondet6; {21245#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:47,655 INFO L263 TraceCheckUtils]: 58: Hoare triple {21245#(<= 2 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {21221#true} is VALID [2020-07-10 20:23:47,655 INFO L280 TraceCheckUtils]: 59: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-10 20:23:47,655 INFO L280 TraceCheckUtils]: 60: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-10 20:23:47,655 INFO L280 TraceCheckUtils]: 61: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-10 20:23:47,656 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {21221#true} {21245#(<= 2 main_~t~0)} #172#return; {21245#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:47,656 INFO L263 TraceCheckUtils]: 63: Hoare triple {21245#(<= 2 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {21221#true} is VALID [2020-07-10 20:23:47,656 INFO L280 TraceCheckUtils]: 64: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-10 20:23:47,657 INFO L280 TraceCheckUtils]: 65: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-10 20:23:47,657 INFO L280 TraceCheckUtils]: 66: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-10 20:23:47,658 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {21221#true} {21245#(<= 2 main_~t~0)} #174#return; {21245#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:47,658 INFO L280 TraceCheckUtils]: 68: Hoare triple {21245#(<= 2 main_~t~0)} #t~post9 := ~t~0; {21254#(<= 2 |main_#t~post9|)} is VALID [2020-07-10 20:23:47,659 INFO L280 TraceCheckUtils]: 69: Hoare triple {21254#(<= 2 |main_#t~post9|)} ~t~0 := 1 + #t~post9; {21255#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:47,660 INFO L280 TraceCheckUtils]: 70: Hoare triple {21255#(<= 3 main_~t~0)} havoc #t~post9; {21255#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:47,660 INFO L280 TraceCheckUtils]: 71: Hoare triple {21255#(<= 3 main_~t~0)} assume !false; {21255#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:47,661 INFO L280 TraceCheckUtils]: 72: Hoare triple {21255#(<= 3 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {21255#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:47,661 INFO L280 TraceCheckUtils]: 73: Hoare triple {21255#(<= 3 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {21255#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:47,662 INFO L280 TraceCheckUtils]: 74: Hoare triple {21255#(<= 3 main_~t~0)} assume 0 != #t~nondet5; {21255#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:47,662 INFO L280 TraceCheckUtils]: 75: Hoare triple {21255#(<= 3 main_~t~0)} havoc #t~nondet5; {21255#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:47,663 INFO L280 TraceCheckUtils]: 76: Hoare triple {21255#(<= 3 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {21255#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:47,664 INFO L280 TraceCheckUtils]: 77: Hoare triple {21255#(<= 3 main_~t~0)} assume 0 != #t~nondet6; {21255#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:47,664 INFO L280 TraceCheckUtils]: 78: Hoare triple {21255#(<= 3 main_~t~0)} havoc #t~nondet6; {21255#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:47,664 INFO L263 TraceCheckUtils]: 79: Hoare triple {21255#(<= 3 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {21221#true} is VALID [2020-07-10 20:23:47,665 INFO L280 TraceCheckUtils]: 80: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-10 20:23:47,665 INFO L280 TraceCheckUtils]: 81: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-10 20:23:47,665 INFO L280 TraceCheckUtils]: 82: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-10 20:23:47,666 INFO L275 TraceCheckUtils]: 83: Hoare quadruple {21221#true} {21255#(<= 3 main_~t~0)} #164#return; {21255#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:47,666 INFO L263 TraceCheckUtils]: 84: Hoare triple {21255#(<= 3 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {21221#true} is VALID [2020-07-10 20:23:47,666 INFO L280 TraceCheckUtils]: 85: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-10 20:23:47,666 INFO L280 TraceCheckUtils]: 86: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-10 20:23:47,666 INFO L280 TraceCheckUtils]: 87: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-10 20:23:47,667 INFO L275 TraceCheckUtils]: 88: Hoare quadruple {21221#true} {21255#(<= 3 main_~t~0)} #166#return; {21255#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:47,668 INFO L280 TraceCheckUtils]: 89: Hoare triple {21255#(<= 3 main_~t~0)} #t~post7 := ~t~0; {21264#(<= 3 |main_#t~post7|)} is VALID [2020-07-10 20:23:47,669 INFO L280 TraceCheckUtils]: 90: Hoare triple {21264#(<= 3 |main_#t~post7|)} ~t~0 := 1 + #t~post7; {21265#(<= 4 main_~t~0)} is VALID [2020-07-10 20:23:47,669 INFO L280 TraceCheckUtils]: 91: Hoare triple {21265#(<= 4 main_~t~0)} havoc #t~post7; {21265#(<= 4 main_~t~0)} is VALID [2020-07-10 20:23:47,670 INFO L280 TraceCheckUtils]: 92: Hoare triple {21265#(<= 4 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {21265#(<= 4 main_~t~0)} is VALID [2020-07-10 20:23:47,671 INFO L263 TraceCheckUtils]: 93: Hoare triple {21265#(<= 4 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {21266#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:47,671 INFO L280 TraceCheckUtils]: 94: Hoare triple {21266#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {21267#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:47,672 INFO L280 TraceCheckUtils]: 95: Hoare triple {21267#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {21222#false} is VALID [2020-07-10 20:23:47,672 INFO L280 TraceCheckUtils]: 96: Hoare triple {21222#false} assume !false; {21222#false} is VALID [2020-07-10 20:23:47,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:23:47,682 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:47,682 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1618924802] [2020-07-10 20:23:47,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:47,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-10 20:23:47,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355767097] [2020-07-10 20:23:47,683 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2020-07-10 20:23:47,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:47,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 20:23:47,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:47,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 20:23:47,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:47,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 20:23:47,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-07-10 20:23:47,785 INFO L87 Difference]: Start difference. First operand 153 states and 171 transitions. Second operand 13 states. [2020-07-10 20:23:49,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:49,521 INFO L93 Difference]: Finished difference Result 194 states and 221 transitions. [2020-07-10 20:23:49,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-10 20:23:49,522 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2020-07-10 20:23:49,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:49,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 20:23:49,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 159 transitions. [2020-07-10 20:23:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 20:23:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 159 transitions. [2020-07-10 20:23:49,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 159 transitions. [2020-07-10 20:23:49,715 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:49,719 INFO L225 Difference]: With dead ends: 194 [2020-07-10 20:23:49,719 INFO L226 Difference]: Without dead ends: 192 [2020-07-10 20:23:49,720 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2020-07-10 20:23:49,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-07-10 20:23:49,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 183. [2020-07-10 20:23:49,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:49,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand 183 states. [2020-07-10 20:23:49,985 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand 183 states. [2020-07-10 20:23:49,985 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 183 states. [2020-07-10 20:23:49,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:49,989 INFO L93 Difference]: Finished difference Result 192 states and 219 transitions. [2020-07-10 20:23:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 219 transitions. [2020-07-10 20:23:49,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:49,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:49,990 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 192 states. [2020-07-10 20:23:49,990 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 192 states. [2020-07-10 20:23:49,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:49,994 INFO L93 Difference]: Finished difference Result 192 states and 219 transitions. [2020-07-10 20:23:49,994 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 219 transitions. [2020-07-10 20:23:49,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:49,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:49,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:49,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:49,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-07-10 20:23:49,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 208 transitions. [2020-07-10 20:23:49,999 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 208 transitions. Word has length 97 [2020-07-10 20:23:49,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:49,999 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 208 transitions. [2020-07-10 20:23:49,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 20:23:50,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 183 states and 208 transitions. [2020-07-10 20:23:50,307 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:50,307 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 208 transitions. [2020-07-10 20:23:50,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-07-10 20:23:50,308 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:50,308 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:50,308 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-10 20:23:50,309 INFO L427 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:50,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:50,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1992677655, now seen corresponding path program 2 times [2020-07-10 20:23:50,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:50,310 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1462271351] [2020-07-10 20:23:50,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:50,476 INFO L280 TraceCheckUtils]: 0: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-10 20:23:50,477 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {22428#true} {22428#true} #144#return; {22428#true} is VALID [2020-07-10 20:23:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:50,483 INFO L280 TraceCheckUtils]: 0: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-10 20:23:50,483 INFO L280 TraceCheckUtils]: 1: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-10 20:23:50,483 INFO L280 TraceCheckUtils]: 2: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-10 20:23:50,484 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {22428#true} {22432#(<= 0 main_~t~0)} #152#return; {22432#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:50,488 INFO L280 TraceCheckUtils]: 0: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-10 20:23:50,489 INFO L280 TraceCheckUtils]: 1: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-10 20:23:50,489 INFO L280 TraceCheckUtils]: 2: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-10 20:23:50,489 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {22428#true} {22432#(<= 0 main_~t~0)} #154#return; {22432#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:50,493 INFO L280 TraceCheckUtils]: 0: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-10 20:23:50,493 INFO L280 TraceCheckUtils]: 1: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-10 20:23:50,494 INFO L280 TraceCheckUtils]: 2: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-10 20:23:50,494 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {22428#true} {22442#(<= 1 main_~t~0)} #156#return; {22442#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:50,499 INFO L280 TraceCheckUtils]: 0: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-10 20:23:50,499 INFO L280 TraceCheckUtils]: 1: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-10 20:23:50,500 INFO L280 TraceCheckUtils]: 2: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-10 20:23:50,500 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {22428#true} {22442#(<= 1 main_~t~0)} #158#return; {22442#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:50,504 INFO L280 TraceCheckUtils]: 0: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-10 20:23:50,505 INFO L280 TraceCheckUtils]: 1: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-10 20:23:50,505 INFO L280 TraceCheckUtils]: 2: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-10 20:23:50,506 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {22428#true} {22452#(<= 2 main_~t~0)} #164#return; {22452#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:50,510 INFO L280 TraceCheckUtils]: 0: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-10 20:23:50,511 INFO L280 TraceCheckUtils]: 1: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-10 20:23:50,511 INFO L280 TraceCheckUtils]: 2: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-10 20:23:50,512 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {22428#true} {22452#(<= 2 main_~t~0)} #166#return; {22452#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:50,516 INFO L280 TraceCheckUtils]: 0: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-10 20:23:50,516 INFO L280 TraceCheckUtils]: 1: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-10 20:23:50,516 INFO L280 TraceCheckUtils]: 2: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-10 20:23:50,517 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {22428#true} {22462#(<= 3 main_~t~0)} #172#return; {22462#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:50,521 INFO L280 TraceCheckUtils]: 0: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-10 20:23:50,521 INFO L280 TraceCheckUtils]: 1: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-10 20:23:50,521 INFO L280 TraceCheckUtils]: 2: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-10 20:23:50,522 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {22428#true} {22462#(<= 3 main_~t~0)} #174#return; {22462#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:50,522 INFO L263 TraceCheckUtils]: 0: Hoare triple {22428#true} call ULTIMATE.init(); {22428#true} is VALID [2020-07-10 20:23:50,523 INFO L280 TraceCheckUtils]: 1: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-10 20:23:50,523 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {22428#true} {22428#true} #144#return; {22428#true} is VALID [2020-07-10 20:23:50,523 INFO L263 TraceCheckUtils]: 3: Hoare triple {22428#true} call #t~ret10 := main(); {22428#true} is VALID [2020-07-10 20:23:50,523 INFO L280 TraceCheckUtils]: 4: Hoare triple {22428#true} havoc ~tagbuf_len~0; {22428#true} is VALID [2020-07-10 20:23:50,523 INFO L280 TraceCheckUtils]: 5: Hoare triple {22428#true} havoc ~t~0; {22428#true} is VALID [2020-07-10 20:23:50,524 INFO L280 TraceCheckUtils]: 6: Hoare triple {22428#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {22428#true} is VALID [2020-07-10 20:23:50,524 INFO L280 TraceCheckUtils]: 7: Hoare triple {22428#true} ~tagbuf_len~0 := #t~nondet0; {22428#true} is VALID [2020-07-10 20:23:50,524 INFO L280 TraceCheckUtils]: 8: Hoare triple {22428#true} havoc #t~nondet0; {22428#true} is VALID [2020-07-10 20:23:50,524 INFO L280 TraceCheckUtils]: 9: Hoare triple {22428#true} assume ~tagbuf_len~0 >= 1; {22428#true} is VALID [2020-07-10 20:23:50,525 INFO L280 TraceCheckUtils]: 10: Hoare triple {22428#true} ~t~0 := 0; {22432#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:50,525 INFO L280 TraceCheckUtils]: 11: Hoare triple {22432#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {22432#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:50,526 INFO L280 TraceCheckUtils]: 12: Hoare triple {22432#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {22432#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:50,526 INFO L280 TraceCheckUtils]: 13: Hoare triple {22432#(<= 0 main_~t~0)} havoc #t~pre1; {22432#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:50,527 INFO L280 TraceCheckUtils]: 14: Hoare triple {22432#(<= 0 main_~t~0)} assume !false; {22432#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:50,528 INFO L280 TraceCheckUtils]: 15: Hoare triple {22432#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {22432#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:50,529 INFO L280 TraceCheckUtils]: 16: Hoare triple {22432#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {22432#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:50,529 INFO L280 TraceCheckUtils]: 17: Hoare triple {22432#(<= 0 main_~t~0)} assume !(0 != #t~nondet2); {22432#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:50,531 INFO L280 TraceCheckUtils]: 18: Hoare triple {22432#(<= 0 main_~t~0)} havoc #t~nondet2; {22432#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:50,531 INFO L263 TraceCheckUtils]: 19: Hoare triple {22432#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {22428#true} is VALID [2020-07-10 20:23:50,531 INFO L280 TraceCheckUtils]: 20: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-10 20:23:50,531 INFO L280 TraceCheckUtils]: 21: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-10 20:23:50,532 INFO L280 TraceCheckUtils]: 22: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-10 20:23:50,534 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {22428#true} {22432#(<= 0 main_~t~0)} #152#return; {22432#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:50,534 INFO L263 TraceCheckUtils]: 24: Hoare triple {22432#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {22428#true} is VALID [2020-07-10 20:23:50,534 INFO L280 TraceCheckUtils]: 25: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-10 20:23:50,535 INFO L280 TraceCheckUtils]: 26: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-10 20:23:50,535 INFO L280 TraceCheckUtils]: 27: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-10 20:23:50,536 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {22428#true} {22432#(<= 0 main_~t~0)} #154#return; {22432#(<= 0 main_~t~0)} is VALID [2020-07-10 20:23:50,537 INFO L280 TraceCheckUtils]: 29: Hoare triple {22432#(<= 0 main_~t~0)} #t~post3 := ~t~0; {22441#(<= 0 |main_#t~post3|)} is VALID [2020-07-10 20:23:50,538 INFO L280 TraceCheckUtils]: 30: Hoare triple {22441#(<= 0 |main_#t~post3|)} ~t~0 := 1 + #t~post3; {22442#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:50,538 INFO L280 TraceCheckUtils]: 31: Hoare triple {22442#(<= 1 main_~t~0)} havoc #t~post3; {22442#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:50,539 INFO L280 TraceCheckUtils]: 32: Hoare triple {22442#(<= 1 main_~t~0)} assume !false; {22442#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:50,540 INFO L280 TraceCheckUtils]: 33: Hoare triple {22442#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {22442#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:50,541 INFO L280 TraceCheckUtils]: 34: Hoare triple {22442#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {22442#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:50,541 INFO L280 TraceCheckUtils]: 35: Hoare triple {22442#(<= 1 main_~t~0)} assume 0 != #t~nondet2; {22442#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:50,542 INFO L280 TraceCheckUtils]: 36: Hoare triple {22442#(<= 1 main_~t~0)} havoc #t~nondet2; {22442#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:50,542 INFO L263 TraceCheckUtils]: 37: Hoare triple {22442#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {22428#true} is VALID [2020-07-10 20:23:50,542 INFO L280 TraceCheckUtils]: 38: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-10 20:23:50,543 INFO L280 TraceCheckUtils]: 39: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-10 20:23:50,543 INFO L280 TraceCheckUtils]: 40: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-10 20:23:50,544 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {22428#true} {22442#(<= 1 main_~t~0)} #156#return; {22442#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:50,544 INFO L263 TraceCheckUtils]: 42: Hoare triple {22442#(<= 1 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {22428#true} is VALID [2020-07-10 20:23:50,544 INFO L280 TraceCheckUtils]: 43: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-10 20:23:50,545 INFO L280 TraceCheckUtils]: 44: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-10 20:23:50,545 INFO L280 TraceCheckUtils]: 45: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-10 20:23:50,547 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {22428#true} {22442#(<= 1 main_~t~0)} #158#return; {22442#(<= 1 main_~t~0)} is VALID [2020-07-10 20:23:50,547 INFO L280 TraceCheckUtils]: 47: Hoare triple {22442#(<= 1 main_~t~0)} #t~post4 := ~t~0; {22451#(<= 1 |main_#t~post4|)} is VALID [2020-07-10 20:23:50,548 INFO L280 TraceCheckUtils]: 48: Hoare triple {22451#(<= 1 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {22452#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:50,549 INFO L280 TraceCheckUtils]: 49: Hoare triple {22452#(<= 2 main_~t~0)} havoc #t~post4; {22452#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:50,549 INFO L280 TraceCheckUtils]: 50: Hoare triple {22452#(<= 2 main_~t~0)} assume !false; {22452#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:50,550 INFO L280 TraceCheckUtils]: 51: Hoare triple {22452#(<= 2 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {22452#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:50,551 INFO L280 TraceCheckUtils]: 52: Hoare triple {22452#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {22452#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:50,551 INFO L280 TraceCheckUtils]: 53: Hoare triple {22452#(<= 2 main_~t~0)} assume 0 != #t~nondet5; {22452#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:50,552 INFO L280 TraceCheckUtils]: 54: Hoare triple {22452#(<= 2 main_~t~0)} havoc #t~nondet5; {22452#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:50,553 INFO L280 TraceCheckUtils]: 55: Hoare triple {22452#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {22452#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:50,553 INFO L280 TraceCheckUtils]: 56: Hoare triple {22452#(<= 2 main_~t~0)} assume 0 != #t~nondet6; {22452#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:50,554 INFO L280 TraceCheckUtils]: 57: Hoare triple {22452#(<= 2 main_~t~0)} havoc #t~nondet6; {22452#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:50,554 INFO L263 TraceCheckUtils]: 58: Hoare triple {22452#(<= 2 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {22428#true} is VALID [2020-07-10 20:23:50,554 INFO L280 TraceCheckUtils]: 59: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-10 20:23:50,555 INFO L280 TraceCheckUtils]: 60: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-10 20:23:50,555 INFO L280 TraceCheckUtils]: 61: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-10 20:23:50,556 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {22428#true} {22452#(<= 2 main_~t~0)} #164#return; {22452#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:50,556 INFO L263 TraceCheckUtils]: 63: Hoare triple {22452#(<= 2 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {22428#true} is VALID [2020-07-10 20:23:50,556 INFO L280 TraceCheckUtils]: 64: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-10 20:23:50,556 INFO L280 TraceCheckUtils]: 65: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-10 20:23:50,556 INFO L280 TraceCheckUtils]: 66: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-10 20:23:50,557 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {22428#true} {22452#(<= 2 main_~t~0)} #166#return; {22452#(<= 2 main_~t~0)} is VALID [2020-07-10 20:23:50,558 INFO L280 TraceCheckUtils]: 68: Hoare triple {22452#(<= 2 main_~t~0)} #t~post7 := ~t~0; {22461#(<= 2 |main_#t~post7|)} is VALID [2020-07-10 20:23:50,559 INFO L280 TraceCheckUtils]: 69: Hoare triple {22461#(<= 2 |main_#t~post7|)} ~t~0 := 1 + #t~post7; {22462#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:50,559 INFO L280 TraceCheckUtils]: 70: Hoare triple {22462#(<= 3 main_~t~0)} havoc #t~post7; {22462#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:50,560 INFO L280 TraceCheckUtils]: 71: Hoare triple {22462#(<= 3 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {22462#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:50,560 INFO L263 TraceCheckUtils]: 72: Hoare triple {22462#(<= 3 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {22428#true} is VALID [2020-07-10 20:23:50,560 INFO L280 TraceCheckUtils]: 73: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-10 20:23:50,560 INFO L280 TraceCheckUtils]: 74: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-10 20:23:50,561 INFO L280 TraceCheckUtils]: 75: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-10 20:23:50,561 INFO L275 TraceCheckUtils]: 76: Hoare quadruple {22428#true} {22462#(<= 3 main_~t~0)} #172#return; {22462#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:50,561 INFO L263 TraceCheckUtils]: 77: Hoare triple {22462#(<= 3 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {22428#true} is VALID [2020-07-10 20:23:50,562 INFO L280 TraceCheckUtils]: 78: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-10 20:23:50,562 INFO L280 TraceCheckUtils]: 79: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-10 20:23:50,562 INFO L280 TraceCheckUtils]: 80: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-10 20:23:50,563 INFO L275 TraceCheckUtils]: 81: Hoare quadruple {22428#true} {22462#(<= 3 main_~t~0)} #174#return; {22462#(<= 3 main_~t~0)} is VALID [2020-07-10 20:23:50,563 INFO L280 TraceCheckUtils]: 82: Hoare triple {22462#(<= 3 main_~t~0)} #t~post9 := ~t~0; {22471#(<= 3 |main_#t~post9|)} is VALID [2020-07-10 20:23:50,564 INFO L280 TraceCheckUtils]: 83: Hoare triple {22471#(<= 3 |main_#t~post9|)} ~t~0 := 1 + #t~post9; {22472#(<= 4 main_~t~0)} is VALID [2020-07-10 20:23:50,565 INFO L280 TraceCheckUtils]: 84: Hoare triple {22472#(<= 4 main_~t~0)} havoc #t~post9; {22472#(<= 4 main_~t~0)} is VALID [2020-07-10 20:23:50,566 INFO L280 TraceCheckUtils]: 85: Hoare triple {22472#(<= 4 main_~t~0)} assume !false; {22472#(<= 4 main_~t~0)} is VALID [2020-07-10 20:23:50,567 INFO L280 TraceCheckUtils]: 86: Hoare triple {22472#(<= 4 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {22472#(<= 4 main_~t~0)} is VALID [2020-07-10 20:23:50,567 INFO L280 TraceCheckUtils]: 87: Hoare triple {22472#(<= 4 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {22472#(<= 4 main_~t~0)} is VALID [2020-07-10 20:23:50,568 INFO L280 TraceCheckUtils]: 88: Hoare triple {22472#(<= 4 main_~t~0)} assume 0 != #t~nondet5; {22472#(<= 4 main_~t~0)} is VALID [2020-07-10 20:23:50,569 INFO L280 TraceCheckUtils]: 89: Hoare triple {22472#(<= 4 main_~t~0)} havoc #t~nondet5; {22472#(<= 4 main_~t~0)} is VALID [2020-07-10 20:23:50,570 INFO L280 TraceCheckUtils]: 90: Hoare triple {22472#(<= 4 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {22472#(<= 4 main_~t~0)} is VALID [2020-07-10 20:23:50,570 INFO L280 TraceCheckUtils]: 91: Hoare triple {22472#(<= 4 main_~t~0)} assume !(0 != #t~nondet6); {22472#(<= 4 main_~t~0)} is VALID [2020-07-10 20:23:50,571 INFO L280 TraceCheckUtils]: 92: Hoare triple {22472#(<= 4 main_~t~0)} havoc #t~nondet6; {22472#(<= 4 main_~t~0)} is VALID [2020-07-10 20:23:50,572 INFO L263 TraceCheckUtils]: 93: Hoare triple {22472#(<= 4 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {22473#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:50,573 INFO L280 TraceCheckUtils]: 94: Hoare triple {22473#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {22474#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:50,574 INFO L280 TraceCheckUtils]: 95: Hoare triple {22474#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {22429#false} is VALID [2020-07-10 20:23:50,574 INFO L280 TraceCheckUtils]: 96: Hoare triple {22429#false} assume !false; {22429#false} is VALID [2020-07-10 20:23:50,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:23:50,584 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:50,585 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1462271351] [2020-07-10 20:23:50,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:50,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-10 20:23:50,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228058474] [2020-07-10 20:23:50,586 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2020-07-10 20:23:50,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:50,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 20:23:50,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:50,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 20:23:50,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:50,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 20:23:50,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-07-10 20:23:50,680 INFO L87 Difference]: Start difference. First operand 183 states and 208 transitions. Second operand 13 states. [2020-07-10 20:23:52,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:52,231 INFO L93 Difference]: Finished difference Result 198 states and 224 transitions. [2020-07-10 20:23:52,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-10 20:23:52,231 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2020-07-10 20:23:52,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:52,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 20:23:52,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 159 transitions. [2020-07-10 20:23:52,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 20:23:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 159 transitions. [2020-07-10 20:23:52,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 159 transitions. [2020-07-10 20:23:52,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:52,427 INFO L225 Difference]: With dead ends: 198 [2020-07-10 20:23:52,427 INFO L226 Difference]: Without dead ends: 196 [2020-07-10 20:23:52,428 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2020-07-10 20:23:52,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-07-10 20:23:52,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 157. [2020-07-10 20:23:52,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:52,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand 157 states. [2020-07-10 20:23:52,663 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand 157 states. [2020-07-10 20:23:52,663 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 157 states. [2020-07-10 20:23:52,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:52,668 INFO L93 Difference]: Finished difference Result 196 states and 222 transitions. [2020-07-10 20:23:52,668 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 222 transitions. [2020-07-10 20:23:52,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:52,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:52,669 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 196 states. [2020-07-10 20:23:52,669 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 196 states. [2020-07-10 20:23:52,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:52,673 INFO L93 Difference]: Finished difference Result 196 states and 222 transitions. [2020-07-10 20:23:52,673 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 222 transitions. [2020-07-10 20:23:52,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:52,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:52,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:52,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:52,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-07-10 20:23:52,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 174 transitions. [2020-07-10 20:23:52,677 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 174 transitions. Word has length 97 [2020-07-10 20:23:52,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:52,677 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 174 transitions. [2020-07-10 20:23:52,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 20:23:52,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 157 states and 174 transitions. [2020-07-10 20:23:52,950 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:52,950 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 174 transitions. [2020-07-10 20:23:52,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-07-10 20:23:52,951 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:23:52,952 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:23:52,952 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-07-10 20:23:52,952 INFO L427 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:23:52,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:23:52,952 INFO L82 PathProgramCache]: Analyzing trace with hash 762056004, now seen corresponding path program 3 times [2020-07-10 20:23:52,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:23:52,953 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [567089016] [2020-07-10 20:23:52,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:23:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:53,191 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-10 20:23:53,191 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23599#true} {23599#true} #144#return; {23599#true} is VALID [2020-07-10 20:23:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:53,194 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-10 20:23:53,195 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-10 20:23:53,195 INFO L280 TraceCheckUtils]: 2: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-10 20:23:53,196 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:53,199 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-10 20:23:53,200 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-10 20:23:53,200 INFO L280 TraceCheckUtils]: 2: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-10 20:23:53,201 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:53,204 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-10 20:23:53,204 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-10 20:23:53,205 INFO L280 TraceCheckUtils]: 2: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-10 20:23:53,205 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:53,210 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-10 20:23:53,211 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-10 20:23:53,211 INFO L280 TraceCheckUtils]: 2: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-10 20:23:53,212 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:53,215 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-10 20:23:53,215 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-10 20:23:53,215 INFO L280 TraceCheckUtils]: 2: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-10 20:23:53,216 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #172#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:53,220 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-10 20:23:53,221 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-10 20:23:53,221 INFO L280 TraceCheckUtils]: 2: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-10 20:23:53,223 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #174#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:53,226 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-10 20:23:53,227 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-10 20:23:53,227 INFO L280 TraceCheckUtils]: 2: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-10 20:23:53,228 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #164#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:53,238 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-10 20:23:53,238 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-10 20:23:53,239 INFO L280 TraceCheckUtils]: 2: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-10 20:23:53,239 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #166#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:23:53,246 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-10 20:23:53,246 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-10 20:23:53,246 INFO L280 TraceCheckUtils]: 2: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-10 20:23:53,247 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23599#true} {23605#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,247 INFO L263 TraceCheckUtils]: 0: Hoare triple {23599#true} call ULTIMATE.init(); {23599#true} is VALID [2020-07-10 20:23:53,248 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-10 20:23:53,248 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23599#true} {23599#true} #144#return; {23599#true} is VALID [2020-07-10 20:23:53,248 INFO L263 TraceCheckUtils]: 3: Hoare triple {23599#true} call #t~ret10 := main(); {23599#true} is VALID [2020-07-10 20:23:53,248 INFO L280 TraceCheckUtils]: 4: Hoare triple {23599#true} havoc ~tagbuf_len~0; {23599#true} is VALID [2020-07-10 20:23:53,248 INFO L280 TraceCheckUtils]: 5: Hoare triple {23599#true} havoc ~t~0; {23599#true} is VALID [2020-07-10 20:23:53,249 INFO L280 TraceCheckUtils]: 6: Hoare triple {23599#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {23599#true} is VALID [2020-07-10 20:23:53,249 INFO L280 TraceCheckUtils]: 7: Hoare triple {23599#true} ~tagbuf_len~0 := #t~nondet0; {23599#true} is VALID [2020-07-10 20:23:53,249 INFO L280 TraceCheckUtils]: 8: Hoare triple {23599#true} havoc #t~nondet0; {23599#true} is VALID [2020-07-10 20:23:53,250 INFO L280 TraceCheckUtils]: 9: Hoare triple {23599#true} assume ~tagbuf_len~0 >= 1; {23603#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,251 INFO L280 TraceCheckUtils]: 10: Hoare triple {23603#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,252 INFO L280 TraceCheckUtils]: 11: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,253 INFO L280 TraceCheckUtils]: 12: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,253 INFO L280 TraceCheckUtils]: 13: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,254 INFO L280 TraceCheckUtils]: 14: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,254 INFO L280 TraceCheckUtils]: 15: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,255 INFO L280 TraceCheckUtils]: 16: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,255 INFO L280 TraceCheckUtils]: 17: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet2); {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,256 INFO L280 TraceCheckUtils]: 18: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,256 INFO L263 TraceCheckUtils]: 19: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {23599#true} is VALID [2020-07-10 20:23:53,256 INFO L280 TraceCheckUtils]: 20: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-10 20:23:53,256 INFO L280 TraceCheckUtils]: 21: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-10 20:23:53,257 INFO L280 TraceCheckUtils]: 22: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-10 20:23:53,257 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,257 INFO L263 TraceCheckUtils]: 24: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {23599#true} is VALID [2020-07-10 20:23:53,258 INFO L280 TraceCheckUtils]: 25: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-10 20:23:53,258 INFO L280 TraceCheckUtils]: 26: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-10 20:23:53,258 INFO L280 TraceCheckUtils]: 27: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-10 20:23:53,259 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,259 INFO L280 TraceCheckUtils]: 29: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post3 := ~t~0; {23614#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,260 INFO L280 TraceCheckUtils]: 30: Hoare triple {23614#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post3; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,261 INFO L280 TraceCheckUtils]: 31: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post3; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,261 INFO L280 TraceCheckUtils]: 32: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,262 INFO L280 TraceCheckUtils]: 33: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,262 INFO L280 TraceCheckUtils]: 34: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,263 INFO L280 TraceCheckUtils]: 35: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet2; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,263 INFO L280 TraceCheckUtils]: 36: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,264 INFO L263 TraceCheckUtils]: 37: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {23599#true} is VALID [2020-07-10 20:23:53,264 INFO L280 TraceCheckUtils]: 38: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-10 20:23:53,264 INFO L280 TraceCheckUtils]: 39: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-10 20:23:53,264 INFO L280 TraceCheckUtils]: 40: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-10 20:23:53,266 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,266 INFO L263 TraceCheckUtils]: 42: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {23599#true} is VALID [2020-07-10 20:23:53,266 INFO L280 TraceCheckUtils]: 43: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-10 20:23:53,266 INFO L280 TraceCheckUtils]: 44: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-10 20:23:53,266 INFO L280 TraceCheckUtils]: 45: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-10 20:23:53,269 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,269 INFO L280 TraceCheckUtils]: 47: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post4 := ~t~0; {23623#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,270 INFO L280 TraceCheckUtils]: 48: Hoare triple {23623#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post4; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,271 INFO L280 TraceCheckUtils]: 49: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post4; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,271 INFO L280 TraceCheckUtils]: 50: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,272 INFO L280 TraceCheckUtils]: 51: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,273 INFO L280 TraceCheckUtils]: 52: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,273 INFO L280 TraceCheckUtils]: 53: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet5; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,274 INFO L280 TraceCheckUtils]: 54: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet5; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,274 INFO L280 TraceCheckUtils]: 55: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,275 INFO L280 TraceCheckUtils]: 56: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet6); {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,275 INFO L280 TraceCheckUtils]: 57: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet6; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,275 INFO L263 TraceCheckUtils]: 58: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {23599#true} is VALID [2020-07-10 20:23:53,276 INFO L280 TraceCheckUtils]: 59: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-10 20:23:53,276 INFO L280 TraceCheckUtils]: 60: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-10 20:23:53,276 INFO L280 TraceCheckUtils]: 61: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-10 20:23:53,277 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #172#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,277 INFO L263 TraceCheckUtils]: 63: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {23599#true} is VALID [2020-07-10 20:23:53,277 INFO L280 TraceCheckUtils]: 64: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-10 20:23:53,277 INFO L280 TraceCheckUtils]: 65: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-10 20:23:53,277 INFO L280 TraceCheckUtils]: 66: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-10 20:23:53,278 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #174#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,279 INFO L280 TraceCheckUtils]: 68: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post9 := ~t~0; {23632#(<= (+ |main_#t~post9| 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,280 INFO L280 TraceCheckUtils]: 69: Hoare triple {23632#(<= (+ |main_#t~post9| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post9; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,280 INFO L280 TraceCheckUtils]: 70: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post9; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,281 INFO L280 TraceCheckUtils]: 71: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,281 INFO L280 TraceCheckUtils]: 72: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,282 INFO L280 TraceCheckUtils]: 73: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,282 INFO L280 TraceCheckUtils]: 74: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet5; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,283 INFO L280 TraceCheckUtils]: 75: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet5; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,283 INFO L280 TraceCheckUtils]: 76: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,284 INFO L280 TraceCheckUtils]: 77: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet6; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,284 INFO L280 TraceCheckUtils]: 78: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet6; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,285 INFO L263 TraceCheckUtils]: 79: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {23599#true} is VALID [2020-07-10 20:23:53,285 INFO L280 TraceCheckUtils]: 80: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-10 20:23:53,285 INFO L280 TraceCheckUtils]: 81: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-10 20:23:53,285 INFO L280 TraceCheckUtils]: 82: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-10 20:23:53,286 INFO L275 TraceCheckUtils]: 83: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #164#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,286 INFO L263 TraceCheckUtils]: 84: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {23599#true} is VALID [2020-07-10 20:23:53,286 INFO L280 TraceCheckUtils]: 85: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-10 20:23:53,286 INFO L280 TraceCheckUtils]: 86: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-10 20:23:53,287 INFO L280 TraceCheckUtils]: 87: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-10 20:23:53,287 INFO L275 TraceCheckUtils]: 88: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #166#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,288 INFO L280 TraceCheckUtils]: 89: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post7 := ~t~0; {23641#(<= (+ |main_#t~post7| 1) main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,289 INFO L280 TraceCheckUtils]: 90: Hoare triple {23641#(<= (+ |main_#t~post7| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post7; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,289 INFO L280 TraceCheckUtils]: 91: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post7; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,290 INFO L280 TraceCheckUtils]: 92: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,290 INFO L263 TraceCheckUtils]: 93: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {23599#true} is VALID [2020-07-10 20:23:53,291 INFO L280 TraceCheckUtils]: 94: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-10 20:23:53,291 INFO L280 TraceCheckUtils]: 95: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-10 20:23:53,292 INFO L280 TraceCheckUtils]: 96: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-10 20:23:53,292 INFO L275 TraceCheckUtils]: 97: Hoare quadruple {23599#true} {23605#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-10 20:23:53,293 INFO L263 TraceCheckUtils]: 98: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {23646#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:23:53,294 INFO L280 TraceCheckUtils]: 99: Hoare triple {23646#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {23647#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:23:53,294 INFO L280 TraceCheckUtils]: 100: Hoare triple {23647#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {23600#false} is VALID [2020-07-10 20:23:53,295 INFO L280 TraceCheckUtils]: 101: Hoare triple {23600#false} assume !false; {23600#false} is VALID [2020-07-10 20:23:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:23:53,308 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:23:53,309 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [567089016] [2020-07-10 20:23:53,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:23:53,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-10 20:23:53,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077471421] [2020-07-10 20:23:53,310 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 102 [2020-07-10 20:23:53,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:23:53,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 20:23:53,397 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:53,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 20:23:53,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:23:53,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 20:23:53,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-07-10 20:23:53,399 INFO L87 Difference]: Start difference. First operand 157 states and 174 transitions. Second operand 11 states. [2020-07-10 20:23:54,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:54,595 INFO L93 Difference]: Finished difference Result 157 states and 174 transitions. [2020-07-10 20:23:54,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-10 20:23:54,595 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 102 [2020-07-10 20:23:54,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:23:54,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 20:23:54,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 78 transitions. [2020-07-10 20:23:54,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 20:23:54,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 78 transitions. [2020-07-10 20:23:54,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 78 transitions. [2020-07-10 20:23:54,695 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:54,695 INFO L225 Difference]: With dead ends: 157 [2020-07-10 20:23:54,696 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 20:23:54,697 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2020-07-10 20:23:54,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 20:23:54,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 20:23:54,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:23:54,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 20:23:54,698 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:23:54,698 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:23:54,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:54,698 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:23:54,698 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:23:54,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:54,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:54,699 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:23:54,699 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:23:54,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:23:54,699 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:23:54,700 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:23:54,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:54,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:23:54,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:23:54,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:23:54,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 20:23:54,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 20:23:54,700 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2020-07-10 20:23:54,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:23:54,700 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 20:23:54,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 20:23:54,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 20:23:54,701 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:23:54,701 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:23:54,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:23:54,701 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-07-10 20:23:54,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 20:23:56,716 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:23:56,716 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:23:56,716 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:23:56,716 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 20:23:56,716 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 20:23:56,716 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:23:56,717 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:23:56,717 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:23:56,717 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 20:23:56,717 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-10 20:23:56,717 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:23:56,717 INFO L264 CegarLoopResult]: At program point L60(line 60) the Hoare annotation is: (and (<= (+ |main_#t~post9| 1) main_~tagbuf_len~0) (<= 1 |main_#t~post9|) (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-10 20:23:56,718 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-10 20:23:56,718 INFO L264 CegarLoopResult]: At program point L60-1(line 60) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= (+ |main_#t~post9| 1) main_~tagbuf_len~0) (<= 1 |main_#t~post9|) (<= 2 main_~t~0)) [2020-07-10 20:23:56,718 INFO L264 CegarLoopResult]: At program point L27-1(lines 27 29) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-10 20:23:56,718 INFO L264 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-10 20:23:56,718 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 66) the Hoare annotation is: true [2020-07-10 20:23:56,719 INFO L264 CegarLoopResult]: At program point L27-3(line 27) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-10 20:23:56,719 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-10 20:23:56,719 INFO L264 CegarLoopResult]: At program point L44-1(lines 44 53) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-10 20:23:56,719 INFO L264 CegarLoopResult]: At program point L44-2(line 44) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-10 20:23:56,719 INFO L264 CegarLoopResult]: At program point L44-4(line 44) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-10 20:23:56,719 INFO L264 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (and (<= (+ |main_#t~post4| 1) main_~tagbuf_len~0) (<= 0 |main_#t~post4|) (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-10 20:23:56,719 INFO L264 CegarLoopResult]: At program point L36-1(line 36) the Hoare annotation is: (and (<= (+ |main_#t~post4| 1) main_~tagbuf_len~0) (<= 0 |main_#t~post4|) (<= main_~t~0 main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-10 20:23:56,720 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-10 20:23:56,720 INFO L264 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-10 20:23:56,720 INFO L264 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2020-07-10 20:23:56,720 INFO L264 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-10 20:23:56,720 INFO L264 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-10 20:23:56,720 INFO L264 CegarLoopResult]: At program point L37-2(lines 37 61) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-10 20:23:56,720 INFO L264 CegarLoopResult]: At program point L37-3(lines 37 61) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-10 20:23:56,720 INFO L264 CegarLoopResult]: At program point L62(line 62) the Hoare annotation is: (and (<= 0 main_~tagbuf_len~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-10 20:23:56,721 INFO L264 CegarLoopResult]: At program point L21-2(lines 21 33) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2020-07-10 20:23:56,721 INFO L264 CegarLoopResult]: At program point L21-3(lines 21 33) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-10 20:23:56,721 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-10 20:23:56,721 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 66) the Hoare annotation is: true [2020-07-10 20:23:56,721 INFO L264 CegarLoopResult]: At program point L38(lines 38 42) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-10 20:23:56,721 INFO L271 CegarLoopResult]: At program point L63(lines 14 66) the Hoare annotation is: true [2020-07-10 20:23:56,721 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-10 20:23:56,721 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 66) the Hoare annotation is: true [2020-07-10 20:23:56,722 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-10 20:23:56,722 INFO L264 CegarLoopResult]: At program point L55(line 55) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-10 20:23:56,722 INFO L264 CegarLoopResult]: At program point L22(lines 22 26) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2020-07-10 20:23:56,722 INFO L264 CegarLoopResult]: At program point L55-1(lines 55 57) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-10 20:23:56,722 INFO L264 CegarLoopResult]: At program point L55-2(line 55) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-10 20:23:56,722 INFO L264 CegarLoopResult]: At program point L55-3(line 55) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-10 20:23:56,722 INFO L264 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: (and (<= (+ |main_#t~post7| 1) main_~tagbuf_len~0) (<= 1 |main_#t~post7|) (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-10 20:23:56,722 INFO L264 CegarLoopResult]: At program point L47-1(line 47) the Hoare annotation is: (and (<= (+ |main_#t~post7| 1) main_~tagbuf_len~0) (<= main_~t~0 main_~tagbuf_len~0) (<= 1 |main_#t~post7|) (<= 2 main_~t~0)) [2020-07-10 20:23:56,722 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2020-07-10 20:23:56,722 INFO L264 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (<= main_~t~0 main_~tagbuf_len~0) [2020-07-10 20:23:56,722 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-10 20:23:56,723 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2020-07-10 20:23:56,723 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (<= main_~t~0 main_~tagbuf_len~0) [2020-07-10 20:23:56,723 INFO L264 CegarLoopResult]: At program point L48(lines 48 52) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 2 main_~t~0)) [2020-07-10 20:23:56,723 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (and (<= (+ |main_#t~post3| 1) main_~tagbuf_len~0) (<= 0 |main_#t~post3|) (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-10 20:23:56,723 INFO L264 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: (and (<= (+ |main_#t~post3| 1) main_~tagbuf_len~0) (<= main_~t~0 main_~tagbuf_len~0) (<= 0 |main_#t~post3|) (<= 1 main_~t~0)) [2020-07-10 20:23:56,723 INFO L264 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2020-07-10 20:23:56,723 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-10 20:23:56,723 INFO L264 CegarLoopResult]: At program point L49-1(line 49) the Hoare annotation is: (<= main_~t~0 main_~tagbuf_len~0) [2020-07-10 20:23:56,723 INFO L264 CegarLoopResult]: At program point L58(line 58) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-10 20:23:56,723 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-10 20:23:56,724 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-07-10 20:23:56,724 INFO L271 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-07-10 20:23:56,724 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-10 20:23:56,724 INFO L264 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-10 20:23:56,724 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-10 20:23:56,724 INFO L264 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (<= 1 main_~tagbuf_len~0) [2020-07-10 20:23:56,724 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-10 20:23:56,724 INFO L264 CegarLoopResult]: At program point L43-1(lines 43 57) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-10 20:23:56,725 INFO L264 CegarLoopResult]: At program point L43-2(line 43) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-10 20:23:56,725 INFO L264 CegarLoopResult]: At program point L43-3(line 43) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-10 20:23:56,725 INFO L264 CegarLoopResult]: At program point L43-4(lines 43 57) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-10 20:23:56,725 INFO L264 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-10 20:23:56,725 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-10 20:23:56,725 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:23:56,725 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:23:56,725 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:23:56,725 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:23:56,726 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:23:56,729 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 20:23:56,730 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:23:56,730 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:23:56,731 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-10 20:23:56,731 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-10 20:23:56,779 INFO L163 areAnnotationChecker]: CFG has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 20:23:56,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 08:23:56 BoogieIcfgContainer [2020-07-10 20:23:56,797 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 20:23:56,800 INFO L168 Benchmark]: Toolchain (without parser) took 52076.63 ms. Allocated memory was 138.9 MB in the beginning and 493.9 MB in the end (delta: 354.9 MB). Free memory was 102.8 MB in the beginning and 315.4 MB in the end (delta: -212.6 MB). Peak memory consumption was 142.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:23:56,801 INFO L168 Benchmark]: CDTParser took 0.89 ms. Allocated memory is still 138.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-10 20:23:56,801 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.31 ms. Allocated memory is still 138.9 MB. Free memory was 102.6 MB in the beginning and 92.1 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-10 20:23:56,802 INFO L168 Benchmark]: Boogie Preprocessor took 121.62 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 92.1 MB in the beginning and 181.0 MB in the end (delta: -88.8 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. [2020-07-10 20:23:56,805 INFO L168 Benchmark]: RCFGBuilder took 587.54 ms. Allocated memory is still 201.9 MB. Free memory was 180.6 MB in the beginning and 146.9 MB in the end (delta: 33.7 MB). Peak memory consumption was 33.7 MB. Max. memory is 7.1 GB. [2020-07-10 20:23:56,805 INFO L168 Benchmark]: TraceAbstraction took 51083.14 ms. Allocated memory was 201.9 MB in the beginning and 493.9 MB in the end (delta: 292.0 MB). Free memory was 146.3 MB in the beginning and 315.4 MB in the end (delta: -169.1 MB). Peak memory consumption was 122.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:23:56,807 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.89 ms. Allocated memory is still 138.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 278.31 ms. Allocated memory is still 138.9 MB. Free memory was 102.6 MB in the beginning and 92.1 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.62 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 92.1 MB in the beginning and 181.0 MB in the end (delta: -88.8 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 587.54 ms. Allocated memory is still 201.9 MB. Free memory was 180.6 MB in the beginning and 146.9 MB in the end (delta: 33.7 MB). Peak memory consumption was 33.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 51083.14 ms. Allocated memory was 201.9 MB in the beginning and 493.9 MB in the end (delta: 292.0 MB). Free memory was 146.3 MB in the beginning and 315.4 MB in the end (delta: -169.1 MB). Peak memory consumption was 122.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: t <= tagbuf_len && 0 <= t - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: t <= tagbuf_len && 1 <= t - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 48.9s, OverallIterations: 25, TraceHistogramMax: 10, AutomataDifference: 30.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2053 SDtfs, 871 SDslu, 10785 SDs, 0 SdLazy, 3907 SolverSat, 359 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 673 GetRequests, 331 SyntacticMatches, 33 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 193 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 74 LocationsWithAnnotation, 494 PreInvPairs, 814 NumberOfFragments, 537 HoareAnnotationTreeSize, 494 FomulaSimplifications, 529911 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 74 FomulaSimplificationsInter, 1449 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...