/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/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:48:50,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:48:50,621 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:48:50,640 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:48:50,640 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:48:50,642 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:48:50,644 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:48:50,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:48:50,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:48:50,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:48:50,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:48:50,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:48:50,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:48:50,666 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:48:50,668 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:48:50,669 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:48:50,670 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:48:50,672 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:48:50,674 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:48:50,678 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:48:50,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:48:50,685 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:48:50,686 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:48:50,688 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:48:50,690 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:48:50,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:48:50,690 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:48:50,692 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:48:50,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:48:50,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:48:50,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:48:50,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:48:50,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:48:50,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:48:50,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:48:50,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:48:50,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:48:50,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:48:50,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:48:50,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:48:50,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:48:50,702 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:48:50,716 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:48:50,717 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:48:50,718 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:48:50,719 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:48:50,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:48:50,720 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:48:50,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:48:50,720 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:48:50,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:48:50,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:48:50,721 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:48:50,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:48:50,723 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:48:50,723 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:48:50,724 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:48:50,724 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:48:50,724 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:48:50,724 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:48:50,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:48:50,724 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:48:50,724 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:48:50,725 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:48:50,725 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:48:50,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:48:51,006 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:48:51,009 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:48:51,011 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:48:51,011 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:48:51,012 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2020-07-18 00:48:51,084 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0035456fa/d19d125fab654794b2416aaf89e1d175/FLAG215694c4b [2020-07-18 00:48:51,502 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:48:51,503 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2020-07-18 00:48:51,509 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0035456fa/d19d125fab654794b2416aaf89e1d175/FLAG215694c4b [2020-07-18 00:48:51,932 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0035456fa/d19d125fab654794b2416aaf89e1d175 [2020-07-18 00:48:51,939 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:48:51,942 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:48:51,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:48:51,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:48:51,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:48:51,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:48:51" (1/1) ... [2020-07-18 00:48:51,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a8111c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:51, skipping insertion in model container [2020-07-18 00:48:51,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:48:51" (1/1) ... [2020-07-18 00:48:51,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:48:51,984 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:48:52,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:48:52,157 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:48:52,191 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:48:52,207 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:48:52,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:52 WrapperNode [2020-07-18 00:48:52,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:48:52,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:48:52,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:48:52,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:48:52,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:52" (1/1) ... [2020-07-18 00:48:52,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:52" (1/1) ... [2020-07-18 00:48:52,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:52" (1/1) ... [2020-07-18 00:48:52,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:52" (1/1) ... [2020-07-18 00:48:52,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:52" (1/1) ... [2020-07-18 00:48:52,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:52" (1/1) ... [2020-07-18 00:48:52,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:52" (1/1) ... [2020-07-18 00:48:52,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:48:52,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:48:52,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:48:52,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:48:52,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:48:52,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:48:52,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:48:52,448 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 00:48:52,448 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:48:52,449 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:48:52,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:48:52,449 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:48:52,449 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 00:48:52,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:48:52,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:48:52,450 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:48:52,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:48:52,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:48:52,830 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:48:52,831 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-18 00:48:52,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:48:52 BoogieIcfgContainer [2020-07-18 00:48:52,835 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:48:52,836 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:48:52,836 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:48:52,839 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:48:52,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:48:51" (1/3) ... [2020-07-18 00:48:52,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50852ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:48:52, skipping insertion in model container [2020-07-18 00:48:52,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:52" (2/3) ... [2020-07-18 00:48:52,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50852ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:48:52, skipping insertion in model container [2020-07-18 00:48:52,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:48:52" (3/3) ... [2020-07-18 00:48:52,842 INFO L109 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2020-07-18 00:48:52,853 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:48:52,861 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:48:52,880 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:48:52,905 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:48:52,905 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:48:52,906 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:48:52,906 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:48:52,906 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:48:52,906 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:48:52,906 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:48:52,906 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:48:52,921 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2020-07-18 00:48:52,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-18 00:48:52,931 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:52,932 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, 1, 1, 1, 1] [2020-07-18 00:48:52,932 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:52,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:52,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1122321079, now seen corresponding path program 1 times [2020-07-18 00:48:52,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:52,943 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1728481283] [2020-07-18 00:48:52,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:53,094 INFO L280 TraceCheckUtils]: 0: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-18 00:48:53,095 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {58#true} {58#true} #99#return; {58#true} is VALID [2020-07-18 00:48:53,097 INFO L263 TraceCheckUtils]: 0: Hoare triple {58#true} call ULTIMATE.init(); {58#true} is VALID [2020-07-18 00:48:53,097 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-18 00:48:53,098 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {58#true} {58#true} #99#return; {58#true} is VALID [2020-07-18 00:48:53,098 INFO L263 TraceCheckUtils]: 3: Hoare triple {58#true} call #t~ret7 := main(); {58#true} is VALID [2020-07-18 00:48:53,099 INFO L280 TraceCheckUtils]: 4: Hoare triple {58#true} havoc ~in~0; {58#true} is VALID [2020-07-18 00:48:53,099 INFO L280 TraceCheckUtils]: 5: Hoare triple {58#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {58#true} is VALID [2020-07-18 00:48:53,100 INFO L280 TraceCheckUtils]: 6: Hoare triple {58#true} ~inlen~0 := #t~nondet0; {58#true} is VALID [2020-07-18 00:48:53,100 INFO L280 TraceCheckUtils]: 7: Hoare triple {58#true} havoc #t~nondet0; {58#true} is VALID [2020-07-18 00:48:53,101 INFO L280 TraceCheckUtils]: 8: Hoare triple {58#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {58#true} is VALID [2020-07-18 00:48:53,103 INFO L280 TraceCheckUtils]: 9: Hoare triple {58#true} ~bufferlen~0 := #t~nondet1; {58#true} is VALID [2020-07-18 00:48:53,104 INFO L280 TraceCheckUtils]: 10: Hoare triple {58#true} havoc #t~nondet1; {58#true} is VALID [2020-07-18 00:48:53,104 INFO L280 TraceCheckUtils]: 11: Hoare triple {58#true} havoc ~buf~0; {58#true} is VALID [2020-07-18 00:48:53,104 INFO L280 TraceCheckUtils]: 12: Hoare triple {58#true} havoc ~buflim~0; {58#true} is VALID [2020-07-18 00:48:53,105 INFO L280 TraceCheckUtils]: 13: Hoare triple {58#true} assume ~bufferlen~0 > 1; {58#true} is VALID [2020-07-18 00:48:53,105 INFO L280 TraceCheckUtils]: 14: Hoare triple {58#true} assume ~inlen~0 > 0; {58#true} is VALID [2020-07-18 00:48:53,106 INFO L280 TraceCheckUtils]: 15: Hoare triple {58#true} assume ~bufferlen~0 < ~inlen~0; {58#true} is VALID [2020-07-18 00:48:53,109 INFO L280 TraceCheckUtils]: 16: Hoare triple {58#true} ~buf~0 := 0; {58#true} is VALID [2020-07-18 00:48:53,112 INFO L280 TraceCheckUtils]: 17: Hoare triple {58#true} ~in~0 := 0; {58#true} is VALID [2020-07-18 00:48:53,113 INFO L280 TraceCheckUtils]: 18: Hoare triple {58#true} ~buflim~0 := ~bufferlen~0 - 2; {58#true} is VALID [2020-07-18 00:48:53,114 INFO L280 TraceCheckUtils]: 19: Hoare triple {58#true} assume !true; {59#false} is VALID [2020-07-18 00:48:53,115 INFO L263 TraceCheckUtils]: 20: Hoare triple {59#false} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {59#false} is VALID [2020-07-18 00:48:53,115 INFO L280 TraceCheckUtils]: 21: Hoare triple {59#false} ~cond := #in~cond; {59#false} is VALID [2020-07-18 00:48:53,116 INFO L280 TraceCheckUtils]: 22: Hoare triple {59#false} assume 0 == ~cond; {59#false} is VALID [2020-07-18 00:48:53,116 INFO L280 TraceCheckUtils]: 23: Hoare triple {59#false} assume !false; {59#false} is VALID [2020-07-18 00:48:53,120 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-18 00:48:53,122 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:53,124 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1728481283] [2020-07-18 00:48:53,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:53,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-18 00:48:53,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979951180] [2020-07-18 00:48:53,133 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2020-07-18 00:48:53,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:53,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-18 00:48:53,210 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:53,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-18 00:48:53,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:53,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-18 00:48:53,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-18 00:48:53,224 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2020-07-18 00:48:53,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:53,409 INFO L93 Difference]: Finished difference Result 91 states and 122 transitions. [2020-07-18 00:48:53,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-18 00:48:53,409 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2020-07-18 00:48:53,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:53,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 00:48:53,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 122 transitions. [2020-07-18 00:48:53,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 00:48:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 122 transitions. [2020-07-18 00:48:53,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 122 transitions. [2020-07-18 00:48:53,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:53,652 INFO L225 Difference]: With dead ends: 91 [2020-07-18 00:48:53,652 INFO L226 Difference]: Without dead ends: 47 [2020-07-18 00:48:53,657 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-18 00:48:53,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-18 00:48:53,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-18 00:48:53,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:53,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2020-07-18 00:48:53,720 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-18 00:48:53,720 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-18 00:48:53,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:53,728 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2020-07-18 00:48:53,728 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-18 00:48:53,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:53,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:53,730 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-18 00:48:53,730 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-18 00:48:53,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:53,737 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2020-07-18 00:48:53,737 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-18 00:48:53,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:53,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:53,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:53,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:53,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-18 00:48:53,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2020-07-18 00:48:53,745 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 24 [2020-07-18 00:48:53,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:53,746 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2020-07-18 00:48:53,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-18 00:48:53,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 55 transitions. [2020-07-18 00:48:53,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:53,813 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-18 00:48:53,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-18 00:48:53,815 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:53,816 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, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:53,816 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:48:53,816 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:53,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:53,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1949391841, now seen corresponding path program 1 times [2020-07-18 00:48:53,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:53,818 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [7486436] [2020-07-18 00:48:53,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:53,940 INFO L280 TraceCheckUtils]: 0: Hoare triple {434#true} assume true; {434#true} is VALID [2020-07-18 00:48:53,941 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {434#true} {434#true} #99#return; {434#true} is VALID [2020-07-18 00:48:53,942 INFO L263 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2020-07-18 00:48:53,942 INFO L280 TraceCheckUtils]: 1: Hoare triple {434#true} assume true; {434#true} is VALID [2020-07-18 00:48:53,942 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {434#true} {434#true} #99#return; {434#true} is VALID [2020-07-18 00:48:53,943 INFO L263 TraceCheckUtils]: 3: Hoare triple {434#true} call #t~ret7 := main(); {434#true} is VALID [2020-07-18 00:48:53,943 INFO L280 TraceCheckUtils]: 4: Hoare triple {434#true} havoc ~in~0; {434#true} is VALID [2020-07-18 00:48:53,943 INFO L280 TraceCheckUtils]: 5: Hoare triple {434#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {434#true} is VALID [2020-07-18 00:48:53,944 INFO L280 TraceCheckUtils]: 6: Hoare triple {434#true} ~inlen~0 := #t~nondet0; {434#true} is VALID [2020-07-18 00:48:53,944 INFO L280 TraceCheckUtils]: 7: Hoare triple {434#true} havoc #t~nondet0; {434#true} is VALID [2020-07-18 00:48:53,944 INFO L280 TraceCheckUtils]: 8: Hoare triple {434#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {434#true} is VALID [2020-07-18 00:48:53,945 INFO L280 TraceCheckUtils]: 9: Hoare triple {434#true} ~bufferlen~0 := #t~nondet1; {434#true} is VALID [2020-07-18 00:48:53,945 INFO L280 TraceCheckUtils]: 10: Hoare triple {434#true} havoc #t~nondet1; {434#true} is VALID [2020-07-18 00:48:53,945 INFO L280 TraceCheckUtils]: 11: Hoare triple {434#true} havoc ~buf~0; {434#true} is VALID [2020-07-18 00:48:53,946 INFO L280 TraceCheckUtils]: 12: Hoare triple {434#true} havoc ~buflim~0; {434#true} is VALID [2020-07-18 00:48:53,946 INFO L280 TraceCheckUtils]: 13: Hoare triple {434#true} assume ~bufferlen~0 > 1; {434#true} is VALID [2020-07-18 00:48:53,946 INFO L280 TraceCheckUtils]: 14: Hoare triple {434#true} assume ~inlen~0 > 0; {434#true} is VALID [2020-07-18 00:48:53,947 INFO L280 TraceCheckUtils]: 15: Hoare triple {434#true} assume ~bufferlen~0 < ~inlen~0; {434#true} is VALID [2020-07-18 00:48:53,948 INFO L280 TraceCheckUtils]: 16: Hoare triple {434#true} ~buf~0 := 0; {438#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:48:53,948 INFO L280 TraceCheckUtils]: 17: Hoare triple {438#(<= 0 main_~buf~0)} ~in~0 := 0; {438#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:48:53,949 INFO L280 TraceCheckUtils]: 18: Hoare triple {438#(<= 0 main_~buf~0)} ~buflim~0 := ~bufferlen~0 - 2; {438#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:48:53,950 INFO L280 TraceCheckUtils]: 19: Hoare triple {438#(<= 0 main_~buf~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {438#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:48:53,951 INFO L280 TraceCheckUtils]: 20: Hoare triple {438#(<= 0 main_~buf~0)} assume !(0 != #t~nondet2); {438#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:48:53,951 INFO L280 TraceCheckUtils]: 21: Hoare triple {438#(<= 0 main_~buf~0)} havoc #t~nondet2; {438#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:48:53,953 INFO L263 TraceCheckUtils]: 22: Hoare triple {438#(<= 0 main_~buf~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {439#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:53,954 INFO L280 TraceCheckUtils]: 23: Hoare triple {439#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {440#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:53,954 INFO L280 TraceCheckUtils]: 24: Hoare triple {440#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {435#false} is VALID [2020-07-18 00:48:53,955 INFO L280 TraceCheckUtils]: 25: Hoare triple {435#false} assume !false; {435#false} is VALID [2020-07-18 00:48:53,956 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-18 00:48:53,957 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:53,957 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [7486436] [2020-07-18 00:48:53,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:53,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:48:53,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735424647] [2020-07-18 00:48:53,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-07-18 00:48:53,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:53,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:48:53,990 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:53,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:48:53,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:53,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:48:53,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:48:53,992 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 5 states. [2020-07-18 00:48:54,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:54,311 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2020-07-18 00:48:54,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:48:54,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-07-18 00:48:54,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:54,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:48:54,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2020-07-18 00:48:54,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:48:54,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2020-07-18 00:48:54,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2020-07-18 00:48:54,422 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:54,425 INFO L225 Difference]: With dead ends: 66 [2020-07-18 00:48:54,426 INFO L226 Difference]: Without dead ends: 64 [2020-07-18 00:48:54,427 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-18 00:48:54,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-18 00:48:54,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2020-07-18 00:48:54,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:54,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 58 states. [2020-07-18 00:48:54,472 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 58 states. [2020-07-18 00:48:54,473 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 58 states. [2020-07-18 00:48:54,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:54,479 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2020-07-18 00:48:54,479 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2020-07-18 00:48:54,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:54,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:54,482 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 64 states. [2020-07-18 00:48:54,482 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 64 states. [2020-07-18 00:48:54,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:54,488 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2020-07-18 00:48:54,488 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2020-07-18 00:48:54,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:54,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:54,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:54,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:54,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-18 00:48:54,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2020-07-18 00:48:54,495 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 26 [2020-07-18 00:48:54,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:54,495 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2020-07-18 00:48:54,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:48:54,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states and 69 transitions. [2020-07-18 00:48:54,588 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-18 00:48:54,588 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2020-07-18 00:48:54,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-18 00:48:54,589 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:54,590 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, 1, 1, 1] [2020-07-18 00:48:54,590 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:48:54,590 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:54,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:54,591 INFO L82 PathProgramCache]: Analyzing trace with hash -873076999, now seen corresponding path program 1 times [2020-07-18 00:48:54,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:54,591 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1155146970] [2020-07-18 00:48:54,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:54,726 INFO L280 TraceCheckUtils]: 0: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-18 00:48:54,726 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {821#true} {821#true} #99#return; {821#true} is VALID [2020-07-18 00:48:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:54,734 INFO L280 TraceCheckUtils]: 0: Hoare triple {821#true} ~cond := #in~cond; {821#true} is VALID [2020-07-18 00:48:54,735 INFO L280 TraceCheckUtils]: 1: Hoare triple {821#true} assume !(0 == ~cond); {821#true} is VALID [2020-07-18 00:48:54,735 INFO L280 TraceCheckUtils]: 2: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-18 00:48:54,736 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {821#true} {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #111#return; {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:48:54,736 INFO L263 TraceCheckUtils]: 0: Hoare triple {821#true} call ULTIMATE.init(); {821#true} is VALID [2020-07-18 00:48:54,737 INFO L280 TraceCheckUtils]: 1: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-18 00:48:54,737 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {821#true} {821#true} #99#return; {821#true} is VALID [2020-07-18 00:48:54,737 INFO L263 TraceCheckUtils]: 3: Hoare triple {821#true} call #t~ret7 := main(); {821#true} is VALID [2020-07-18 00:48:54,738 INFO L280 TraceCheckUtils]: 4: Hoare triple {821#true} havoc ~in~0; {821#true} is VALID [2020-07-18 00:48:54,738 INFO L280 TraceCheckUtils]: 5: Hoare triple {821#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {821#true} is VALID [2020-07-18 00:48:54,738 INFO L280 TraceCheckUtils]: 6: Hoare triple {821#true} ~inlen~0 := #t~nondet0; {821#true} is VALID [2020-07-18 00:48:54,739 INFO L280 TraceCheckUtils]: 7: Hoare triple {821#true} havoc #t~nondet0; {821#true} is VALID [2020-07-18 00:48:54,739 INFO L280 TraceCheckUtils]: 8: Hoare triple {821#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {821#true} is VALID [2020-07-18 00:48:54,739 INFO L280 TraceCheckUtils]: 9: Hoare triple {821#true} ~bufferlen~0 := #t~nondet1; {821#true} is VALID [2020-07-18 00:48:54,740 INFO L280 TraceCheckUtils]: 10: Hoare triple {821#true} havoc #t~nondet1; {821#true} is VALID [2020-07-18 00:48:54,740 INFO L280 TraceCheckUtils]: 11: Hoare triple {821#true} havoc ~buf~0; {821#true} is VALID [2020-07-18 00:48:54,740 INFO L280 TraceCheckUtils]: 12: Hoare triple {821#true} havoc ~buflim~0; {821#true} is VALID [2020-07-18 00:48:54,741 INFO L280 TraceCheckUtils]: 13: Hoare triple {821#true} assume ~bufferlen~0 > 1; {825#(<= 2 main_~bufferlen~0)} is VALID [2020-07-18 00:48:54,742 INFO L280 TraceCheckUtils]: 14: Hoare triple {825#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {825#(<= 2 main_~bufferlen~0)} is VALID [2020-07-18 00:48:54,742 INFO L280 TraceCheckUtils]: 15: Hoare triple {825#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {825#(<= 2 main_~bufferlen~0)} is VALID [2020-07-18 00:48:54,743 INFO L280 TraceCheckUtils]: 16: Hoare triple {825#(<= 2 main_~bufferlen~0)} ~buf~0 := 0; {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:48:54,744 INFO L280 TraceCheckUtils]: 17: Hoare triple {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~in~0 := 0; {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:48:54,744 INFO L280 TraceCheckUtils]: 18: Hoare triple {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~buflim~0 := ~bufferlen~0 - 2; {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:48:54,745 INFO L280 TraceCheckUtils]: 19: Hoare triple {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:48:54,746 INFO L280 TraceCheckUtils]: 20: Hoare triple {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume !(0 != #t~nondet2); {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:48:54,746 INFO L280 TraceCheckUtils]: 21: Hoare triple {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} havoc #t~nondet2; {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:48:54,747 INFO L263 TraceCheckUtils]: 22: Hoare triple {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {821#true} is VALID [2020-07-18 00:48:54,747 INFO L280 TraceCheckUtils]: 23: Hoare triple {821#true} ~cond := #in~cond; {821#true} is VALID [2020-07-18 00:48:54,747 INFO L280 TraceCheckUtils]: 24: Hoare triple {821#true} assume !(0 == ~cond); {821#true} is VALID [2020-07-18 00:48:54,748 INFO L280 TraceCheckUtils]: 25: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-18 00:48:54,749 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {821#true} {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #111#return; {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:48:54,750 INFO L263 TraceCheckUtils]: 27: Hoare triple {826#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {831#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:54,751 INFO L280 TraceCheckUtils]: 28: Hoare triple {831#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {832#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:54,751 INFO L280 TraceCheckUtils]: 29: Hoare triple {832#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {822#false} is VALID [2020-07-18 00:48:54,752 INFO L280 TraceCheckUtils]: 30: Hoare triple {822#false} assume !false; {822#false} is VALID [2020-07-18 00:48:54,753 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-18 00:48:54,754 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:54,754 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1155146970] [2020-07-18 00:48:54,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:54,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:48:54,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384652154] [2020-07-18 00:48:54,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-07-18 00:48:54,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:54,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:48:54,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:54,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 00:48:54,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:54,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 00:48:54,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:48:54,789 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 6 states. [2020-07-18 00:48:55,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:55,204 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2020-07-18 00:48:55,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 00:48:55,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-07-18 00:48:55,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:55,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:48:55,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2020-07-18 00:48:55,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:48:55,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2020-07-18 00:48:55,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 79 transitions. [2020-07-18 00:48:55,328 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:55,331 INFO L225 Difference]: With dead ends: 70 [2020-07-18 00:48:55,332 INFO L226 Difference]: Without dead ends: 68 [2020-07-18 00:48:55,332 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:48:55,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-18 00:48:55,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2020-07-18 00:48:55,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:55,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 64 states. [2020-07-18 00:48:55,420 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 64 states. [2020-07-18 00:48:55,420 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 64 states. [2020-07-18 00:48:55,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:55,424 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2020-07-18 00:48:55,425 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2020-07-18 00:48:55,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:55,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:55,426 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 68 states. [2020-07-18 00:48:55,426 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 68 states. [2020-07-18 00:48:55,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:55,430 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2020-07-18 00:48:55,431 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2020-07-18 00:48:55,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:55,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:55,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:55,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:55,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-18 00:48:55,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2020-07-18 00:48:55,436 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 31 [2020-07-18 00:48:55,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:55,436 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2020-07-18 00:48:55,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 00:48:55,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states and 76 transitions. [2020-07-18 00:48:55,525 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-18 00:48:55,525 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2020-07-18 00:48:55,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-18 00:48:55,526 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:55,527 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] [2020-07-18 00:48:55,527 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:48:55,527 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:55,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:55,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2057902492, now seen corresponding path program 1 times [2020-07-18 00:48:55,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:55,528 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [396278285] [2020-07-18 00:48:55,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:55,620 INFO L280 TraceCheckUtils]: 0: Hoare triple {1243#true} assume true; {1243#true} is VALID [2020-07-18 00:48:55,620 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1243#true} {1243#true} #99#return; {1243#true} is VALID [2020-07-18 00:48:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:55,628 INFO L280 TraceCheckUtils]: 0: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2020-07-18 00:48:55,629 INFO L280 TraceCheckUtils]: 1: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2020-07-18 00:48:55,629 INFO L280 TraceCheckUtils]: 2: Hoare triple {1243#true} assume true; {1243#true} is VALID [2020-07-18 00:48:55,630 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1243#true} {1247#(<= 0 main_~buf~0)} #111#return; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:48:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:55,651 INFO L280 TraceCheckUtils]: 0: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2020-07-18 00:48:55,652 INFO L280 TraceCheckUtils]: 1: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2020-07-18 00:48:55,652 INFO L280 TraceCheckUtils]: 2: Hoare triple {1243#true} assume true; {1243#true} is VALID [2020-07-18 00:48:55,653 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1243#true} {1247#(<= 0 main_~buf~0)} #113#return; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:48:55,654 INFO L263 TraceCheckUtils]: 0: Hoare triple {1243#true} call ULTIMATE.init(); {1243#true} is VALID [2020-07-18 00:48:55,654 INFO L280 TraceCheckUtils]: 1: Hoare triple {1243#true} assume true; {1243#true} is VALID [2020-07-18 00:48:55,654 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1243#true} {1243#true} #99#return; {1243#true} is VALID [2020-07-18 00:48:55,655 INFO L263 TraceCheckUtils]: 3: Hoare triple {1243#true} call #t~ret7 := main(); {1243#true} is VALID [2020-07-18 00:48:55,655 INFO L280 TraceCheckUtils]: 4: Hoare triple {1243#true} havoc ~in~0; {1243#true} is VALID [2020-07-18 00:48:55,656 INFO L280 TraceCheckUtils]: 5: Hoare triple {1243#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1243#true} is VALID [2020-07-18 00:48:55,656 INFO L280 TraceCheckUtils]: 6: Hoare triple {1243#true} ~inlen~0 := #t~nondet0; {1243#true} is VALID [2020-07-18 00:48:55,657 INFO L280 TraceCheckUtils]: 7: Hoare triple {1243#true} havoc #t~nondet0; {1243#true} is VALID [2020-07-18 00:48:55,657 INFO L280 TraceCheckUtils]: 8: Hoare triple {1243#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1243#true} is VALID [2020-07-18 00:48:55,657 INFO L280 TraceCheckUtils]: 9: Hoare triple {1243#true} ~bufferlen~0 := #t~nondet1; {1243#true} is VALID [2020-07-18 00:48:55,658 INFO L280 TraceCheckUtils]: 10: Hoare triple {1243#true} havoc #t~nondet1; {1243#true} is VALID [2020-07-18 00:48:55,658 INFO L280 TraceCheckUtils]: 11: Hoare triple {1243#true} havoc ~buf~0; {1243#true} is VALID [2020-07-18 00:48:55,658 INFO L280 TraceCheckUtils]: 12: Hoare triple {1243#true} havoc ~buflim~0; {1243#true} is VALID [2020-07-18 00:48:55,659 INFO L280 TraceCheckUtils]: 13: Hoare triple {1243#true} assume ~bufferlen~0 > 1; {1243#true} is VALID [2020-07-18 00:48:55,659 INFO L280 TraceCheckUtils]: 14: Hoare triple {1243#true} assume ~inlen~0 > 0; {1243#true} is VALID [2020-07-18 00:48:55,659 INFO L280 TraceCheckUtils]: 15: Hoare triple {1243#true} assume ~bufferlen~0 < ~inlen~0; {1243#true} is VALID [2020-07-18 00:48:55,660 INFO L280 TraceCheckUtils]: 16: Hoare triple {1243#true} ~buf~0 := 0; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:48:55,661 INFO L280 TraceCheckUtils]: 17: Hoare triple {1247#(<= 0 main_~buf~0)} ~in~0 := 0; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:48:55,661 INFO L280 TraceCheckUtils]: 18: Hoare triple {1247#(<= 0 main_~buf~0)} ~buflim~0 := ~bufferlen~0 - 2; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:48:55,662 INFO L280 TraceCheckUtils]: 19: Hoare triple {1247#(<= 0 main_~buf~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:48:55,664 INFO L280 TraceCheckUtils]: 20: Hoare triple {1247#(<= 0 main_~buf~0)} assume !(0 != #t~nondet2); {1247#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:48:55,667 INFO L280 TraceCheckUtils]: 21: Hoare triple {1247#(<= 0 main_~buf~0)} havoc #t~nondet2; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:48:55,668 INFO L263 TraceCheckUtils]: 22: Hoare triple {1247#(<= 0 main_~buf~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {1243#true} is VALID [2020-07-18 00:48:55,668 INFO L280 TraceCheckUtils]: 23: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2020-07-18 00:48:55,668 INFO L280 TraceCheckUtils]: 24: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2020-07-18 00:48:55,668 INFO L280 TraceCheckUtils]: 25: Hoare triple {1243#true} assume true; {1243#true} is VALID [2020-07-18 00:48:55,669 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1243#true} {1247#(<= 0 main_~buf~0)} #111#return; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:48:55,670 INFO L263 TraceCheckUtils]: 27: Hoare triple {1247#(<= 0 main_~buf~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {1243#true} is VALID [2020-07-18 00:48:55,670 INFO L280 TraceCheckUtils]: 28: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2020-07-18 00:48:55,670 INFO L280 TraceCheckUtils]: 29: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2020-07-18 00:48:55,671 INFO L280 TraceCheckUtils]: 30: Hoare triple {1243#true} assume true; {1243#true} is VALID [2020-07-18 00:48:55,671 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1243#true} {1247#(<= 0 main_~buf~0)} #113#return; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:48:55,672 INFO L280 TraceCheckUtils]: 32: Hoare triple {1247#(<= 0 main_~buf~0)} #t~post5 := ~buf~0; {1256#(<= 0 |main_#t~post5|)} is VALID [2020-07-18 00:48:55,673 INFO L280 TraceCheckUtils]: 33: Hoare triple {1256#(<= 0 |main_#t~post5|)} ~buf~0 := 1 + #t~post5; {1257#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:48:55,674 INFO L280 TraceCheckUtils]: 34: Hoare triple {1257#(<= 1 main_~buf~0)} havoc #t~post5; {1257#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:48:55,675 INFO L263 TraceCheckUtils]: 35: Hoare triple {1257#(<= 1 main_~buf~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {1258#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:55,675 INFO L280 TraceCheckUtils]: 36: Hoare triple {1258#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1259#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:55,676 INFO L280 TraceCheckUtils]: 37: Hoare triple {1259#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1244#false} is VALID [2020-07-18 00:48:55,676 INFO L280 TraceCheckUtils]: 38: Hoare triple {1244#false} assume !false; {1244#false} is VALID [2020-07-18 00:48:55,678 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-18 00:48:55,679 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:55,679 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [396278285] [2020-07-18 00:48:55,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:55,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-18 00:48:55,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644411114] [2020-07-18 00:48:55,680 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2020-07-18 00:48:55,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:55,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 00:48:55,719 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:55,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 00:48:55,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:55,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 00:48:55,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:48:55,721 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 7 states. [2020-07-18 00:48:56,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:56,216 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2020-07-18 00:48:56,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-18 00:48:56,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2020-07-18 00:48:56,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:56,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:48:56,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2020-07-18 00:48:56,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:48:56,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2020-07-18 00:48:56,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 83 transitions. [2020-07-18 00:48:56,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:56,338 INFO L225 Difference]: With dead ends: 77 [2020-07-18 00:48:56,339 INFO L226 Difference]: Without dead ends: 75 [2020-07-18 00:48:56,339 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 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-18 00:48:56,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-18 00:48:56,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2020-07-18 00:48:56,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:56,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 72 states. [2020-07-18 00:48:56,440 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 72 states. [2020-07-18 00:48:56,441 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 72 states. [2020-07-18 00:48:56,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:56,447 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2020-07-18 00:48:56,447 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2020-07-18 00:48:56,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:56,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:56,449 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 75 states. [2020-07-18 00:48:56,449 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 75 states. [2020-07-18 00:48:56,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:56,454 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2020-07-18 00:48:56,454 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2020-07-18 00:48:56,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:56,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:56,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:56,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:56,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-18 00:48:56,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2020-07-18 00:48:56,459 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 39 [2020-07-18 00:48:56,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:56,462 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2020-07-18 00:48:56,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 00:48:56,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states and 84 transitions. [2020-07-18 00:48:56,574 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:56,574 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2020-07-18 00:48:56,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-18 00:48:56,576 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:56,576 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] [2020-07-18 00:48:56,576 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:48:56,577 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:56,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:56,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1847294180, now seen corresponding path program 1 times [2020-07-18 00:48:56,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:56,577 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [701948341] [2020-07-18 00:48:56,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:56,688 INFO L280 TraceCheckUtils]: 0: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-18 00:48:56,688 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1716#true} {1716#true} #99#return; {1716#true} is VALID [2020-07-18 00:48:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:56,698 INFO L280 TraceCheckUtils]: 0: Hoare triple {1716#true} ~cond := #in~cond; {1716#true} is VALID [2020-07-18 00:48:56,698 INFO L280 TraceCheckUtils]: 1: Hoare triple {1716#true} assume !(0 == ~cond); {1716#true} is VALID [2020-07-18 00:48:56,698 INFO L280 TraceCheckUtils]: 2: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-18 00:48:56,699 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1716#true} {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #111#return; {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:48:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:56,707 INFO L280 TraceCheckUtils]: 0: Hoare triple {1716#true} ~cond := #in~cond; {1716#true} is VALID [2020-07-18 00:48:56,708 INFO L280 TraceCheckUtils]: 1: Hoare triple {1716#true} assume !(0 == ~cond); {1716#true} is VALID [2020-07-18 00:48:56,708 INFO L280 TraceCheckUtils]: 2: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-18 00:48:56,708 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1716#true} {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #113#return; {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:48:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:56,720 INFO L280 TraceCheckUtils]: 0: Hoare triple {1716#true} ~cond := #in~cond; {1716#true} is VALID [2020-07-18 00:48:56,721 INFO L280 TraceCheckUtils]: 1: Hoare triple {1716#true} assume !(0 == ~cond); {1716#true} is VALID [2020-07-18 00:48:56,721 INFO L280 TraceCheckUtils]: 2: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-18 00:48:56,722 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1716#true} {1731#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #115#return; {1731#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:48:56,722 INFO L263 TraceCheckUtils]: 0: Hoare triple {1716#true} call ULTIMATE.init(); {1716#true} is VALID [2020-07-18 00:48:56,722 INFO L280 TraceCheckUtils]: 1: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-18 00:48:56,723 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1716#true} {1716#true} #99#return; {1716#true} is VALID [2020-07-18 00:48:56,723 INFO L263 TraceCheckUtils]: 3: Hoare triple {1716#true} call #t~ret7 := main(); {1716#true} is VALID [2020-07-18 00:48:56,723 INFO L280 TraceCheckUtils]: 4: Hoare triple {1716#true} havoc ~in~0; {1716#true} is VALID [2020-07-18 00:48:56,723 INFO L280 TraceCheckUtils]: 5: Hoare triple {1716#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1716#true} is VALID [2020-07-18 00:48:56,724 INFO L280 TraceCheckUtils]: 6: Hoare triple {1716#true} ~inlen~0 := #t~nondet0; {1716#true} is VALID [2020-07-18 00:48:56,724 INFO L280 TraceCheckUtils]: 7: Hoare triple {1716#true} havoc #t~nondet0; {1716#true} is VALID [2020-07-18 00:48:56,724 INFO L280 TraceCheckUtils]: 8: Hoare triple {1716#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1716#true} is VALID [2020-07-18 00:48:56,724 INFO L280 TraceCheckUtils]: 9: Hoare triple {1716#true} ~bufferlen~0 := #t~nondet1; {1716#true} is VALID [2020-07-18 00:48:56,725 INFO L280 TraceCheckUtils]: 10: Hoare triple {1716#true} havoc #t~nondet1; {1716#true} is VALID [2020-07-18 00:48:56,725 INFO L280 TraceCheckUtils]: 11: Hoare triple {1716#true} havoc ~buf~0; {1716#true} is VALID [2020-07-18 00:48:56,725 INFO L280 TraceCheckUtils]: 12: Hoare triple {1716#true} havoc ~buflim~0; {1716#true} is VALID [2020-07-18 00:48:56,726 INFO L280 TraceCheckUtils]: 13: Hoare triple {1716#true} assume ~bufferlen~0 > 1; {1720#(<= 2 main_~bufferlen~0)} is VALID [2020-07-18 00:48:56,726 INFO L280 TraceCheckUtils]: 14: Hoare triple {1720#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {1720#(<= 2 main_~bufferlen~0)} is VALID [2020-07-18 00:48:56,727 INFO L280 TraceCheckUtils]: 15: Hoare triple {1720#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {1720#(<= 2 main_~bufferlen~0)} is VALID [2020-07-18 00:48:56,728 INFO L280 TraceCheckUtils]: 16: Hoare triple {1720#(<= 2 main_~bufferlen~0)} ~buf~0 := 0; {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:48:56,728 INFO L280 TraceCheckUtils]: 17: Hoare triple {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~in~0 := 0; {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:48:56,729 INFO L280 TraceCheckUtils]: 18: Hoare triple {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~buflim~0 := ~bufferlen~0 - 2; {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:48:56,729 INFO L280 TraceCheckUtils]: 19: Hoare triple {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:48:56,730 INFO L280 TraceCheckUtils]: 20: Hoare triple {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume !(0 != #t~nondet2); {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:48:56,730 INFO L280 TraceCheckUtils]: 21: Hoare triple {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} havoc #t~nondet2; {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:48:56,731 INFO L263 TraceCheckUtils]: 22: Hoare triple {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {1716#true} is VALID [2020-07-18 00:48:56,731 INFO L280 TraceCheckUtils]: 23: Hoare triple {1716#true} ~cond := #in~cond; {1716#true} is VALID [2020-07-18 00:48:56,731 INFO L280 TraceCheckUtils]: 24: Hoare triple {1716#true} assume !(0 == ~cond); {1716#true} is VALID [2020-07-18 00:48:56,731 INFO L280 TraceCheckUtils]: 25: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-18 00:48:56,732 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1716#true} {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #111#return; {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:48:56,733 INFO L263 TraceCheckUtils]: 27: Hoare triple {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {1716#true} is VALID [2020-07-18 00:48:56,733 INFO L280 TraceCheckUtils]: 28: Hoare triple {1716#true} ~cond := #in~cond; {1716#true} is VALID [2020-07-18 00:48:56,733 INFO L280 TraceCheckUtils]: 29: Hoare triple {1716#true} assume !(0 == ~cond); {1716#true} is VALID [2020-07-18 00:48:56,733 INFO L280 TraceCheckUtils]: 30: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-18 00:48:56,734 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1716#true} {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #113#return; {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:48:56,735 INFO L280 TraceCheckUtils]: 32: Hoare triple {1721#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #t~post5 := ~buf~0; {1730#(<= (+ |main_#t~post5| 2) main_~bufferlen~0)} is VALID [2020-07-18 00:48:56,736 INFO L280 TraceCheckUtils]: 33: Hoare triple {1730#(<= (+ |main_#t~post5| 2) main_~bufferlen~0)} ~buf~0 := 1 + #t~post5; {1731#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:48:56,736 INFO L280 TraceCheckUtils]: 34: Hoare triple {1731#(<= (+ main_~buf~0 1) main_~bufferlen~0)} havoc #t~post5; {1731#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:48:56,736 INFO L263 TraceCheckUtils]: 35: Hoare triple {1731#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {1716#true} is VALID [2020-07-18 00:48:56,737 INFO L280 TraceCheckUtils]: 36: Hoare triple {1716#true} ~cond := #in~cond; {1716#true} is VALID [2020-07-18 00:48:56,737 INFO L280 TraceCheckUtils]: 37: Hoare triple {1716#true} assume !(0 == ~cond); {1716#true} is VALID [2020-07-18 00:48:56,737 INFO L280 TraceCheckUtils]: 38: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-18 00:48:56,740 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1716#true} {1731#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #115#return; {1731#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:48:56,742 INFO L263 TraceCheckUtils]: 40: Hoare triple {1731#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {1736#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:56,743 INFO L280 TraceCheckUtils]: 41: Hoare triple {1736#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1737#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:56,744 INFO L280 TraceCheckUtils]: 42: Hoare triple {1737#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1717#false} is VALID [2020-07-18 00:48:56,745 INFO L280 TraceCheckUtils]: 43: Hoare triple {1717#false} assume !false; {1717#false} is VALID [2020-07-18 00:48:56,747 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-18 00:48:56,747 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:56,748 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [701948341] [2020-07-18 00:48:56,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:56,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-18 00:48:56,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967645689] [2020-07-18 00:48:56,749 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2020-07-18 00:48:56,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:56,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 00:48:56,794 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-18 00:48:56,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 00:48:56,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:56,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 00:48:56,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:48:56,796 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 8 states. [2020-07-18 00:48:57,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:57,383 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2020-07-18 00:48:57,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-18 00:48:57,383 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2020-07-18 00:48:57,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:57,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:48:57,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 83 transitions. [2020-07-18 00:48:57,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:48:57,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 83 transitions. [2020-07-18 00:48:57,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 83 transitions. [2020-07-18 00:48:57,471 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:57,473 INFO L225 Difference]: With dead ends: 81 [2020-07-18 00:48:57,473 INFO L226 Difference]: Without dead ends: 63 [2020-07-18 00:48:57,474 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-07-18 00:48:57,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-18 00:48:57,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2020-07-18 00:48:57,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:57,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 61 states. [2020-07-18 00:48:57,528 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 61 states. [2020-07-18 00:48:57,528 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 61 states. [2020-07-18 00:48:57,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:57,532 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2020-07-18 00:48:57,532 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2020-07-18 00:48:57,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:57,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:57,533 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 63 states. [2020-07-18 00:48:57,533 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 63 states. [2020-07-18 00:48:57,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:57,536 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2020-07-18 00:48:57,537 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2020-07-18 00:48:57,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:57,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:57,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:57,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:57,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-18 00:48:57,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2020-07-18 00:48:57,540 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 44 [2020-07-18 00:48:57,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:57,541 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2020-07-18 00:48:57,541 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 00:48:57,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states and 69 transitions. [2020-07-18 00:48:57,622 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-18 00:48:57,622 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2020-07-18 00:48:57,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-18 00:48:57,623 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:57,623 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] [2020-07-18 00:48:57,624 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:48:57,624 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:57,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:57,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1076854334, now seen corresponding path program 1 times [2020-07-18 00:48:57,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:57,625 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1652902655] [2020-07-18 00:48:57,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:57,708 INFO L280 TraceCheckUtils]: 0: Hoare triple {2160#true} assume true; {2160#true} is VALID [2020-07-18 00:48:57,708 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2160#true} {2160#true} #99#return; {2160#true} is VALID [2020-07-18 00:48:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:57,718 INFO L280 TraceCheckUtils]: 0: Hoare triple {2160#true} ~cond := #in~cond; {2160#true} is VALID [2020-07-18 00:48:57,718 INFO L280 TraceCheckUtils]: 1: Hoare triple {2160#true} assume !(0 == ~cond); {2160#true} is VALID [2020-07-18 00:48:57,721 INFO L280 TraceCheckUtils]: 2: Hoare triple {2160#true} assume true; {2160#true} is VALID [2020-07-18 00:48:57,730 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2160#true} {2164#(<= 0 main_~in~0)} #103#return; {2164#(<= 0 main_~in~0)} is VALID [2020-07-18 00:48:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:57,741 INFO L280 TraceCheckUtils]: 0: Hoare triple {2160#true} ~cond := #in~cond; {2160#true} is VALID [2020-07-18 00:48:57,741 INFO L280 TraceCheckUtils]: 1: Hoare triple {2160#true} assume !(0 == ~cond); {2160#true} is VALID [2020-07-18 00:48:57,742 INFO L280 TraceCheckUtils]: 2: Hoare triple {2160#true} assume true; {2160#true} is VALID [2020-07-18 00:48:57,743 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2160#true} {2164#(<= 0 main_~in~0)} #105#return; {2164#(<= 0 main_~in~0)} is VALID [2020-07-18 00:48:57,743 INFO L263 TraceCheckUtils]: 0: Hoare triple {2160#true} call ULTIMATE.init(); {2160#true} is VALID [2020-07-18 00:48:57,743 INFO L280 TraceCheckUtils]: 1: Hoare triple {2160#true} assume true; {2160#true} is VALID [2020-07-18 00:48:57,743 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2160#true} {2160#true} #99#return; {2160#true} is VALID [2020-07-18 00:48:57,744 INFO L263 TraceCheckUtils]: 3: Hoare triple {2160#true} call #t~ret7 := main(); {2160#true} is VALID [2020-07-18 00:48:57,744 INFO L280 TraceCheckUtils]: 4: Hoare triple {2160#true} havoc ~in~0; {2160#true} is VALID [2020-07-18 00:48:57,744 INFO L280 TraceCheckUtils]: 5: Hoare triple {2160#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2160#true} is VALID [2020-07-18 00:48:57,744 INFO L280 TraceCheckUtils]: 6: Hoare triple {2160#true} ~inlen~0 := #t~nondet0; {2160#true} is VALID [2020-07-18 00:48:57,745 INFO L280 TraceCheckUtils]: 7: Hoare triple {2160#true} havoc #t~nondet0; {2160#true} is VALID [2020-07-18 00:48:57,745 INFO L280 TraceCheckUtils]: 8: Hoare triple {2160#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2160#true} is VALID [2020-07-18 00:48:57,745 INFO L280 TraceCheckUtils]: 9: Hoare triple {2160#true} ~bufferlen~0 := #t~nondet1; {2160#true} is VALID [2020-07-18 00:48:57,746 INFO L280 TraceCheckUtils]: 10: Hoare triple {2160#true} havoc #t~nondet1; {2160#true} is VALID [2020-07-18 00:48:57,746 INFO L280 TraceCheckUtils]: 11: Hoare triple {2160#true} havoc ~buf~0; {2160#true} is VALID [2020-07-18 00:48:57,746 INFO L280 TraceCheckUtils]: 12: Hoare triple {2160#true} havoc ~buflim~0; {2160#true} is VALID [2020-07-18 00:48:57,746 INFO L280 TraceCheckUtils]: 13: Hoare triple {2160#true} assume ~bufferlen~0 > 1; {2160#true} is VALID [2020-07-18 00:48:57,747 INFO L280 TraceCheckUtils]: 14: Hoare triple {2160#true} assume ~inlen~0 > 0; {2160#true} is VALID [2020-07-18 00:48:57,747 INFO L280 TraceCheckUtils]: 15: Hoare triple {2160#true} assume ~bufferlen~0 < ~inlen~0; {2160#true} is VALID [2020-07-18 00:48:57,747 INFO L280 TraceCheckUtils]: 16: Hoare triple {2160#true} ~buf~0 := 0; {2160#true} is VALID [2020-07-18 00:48:57,748 INFO L280 TraceCheckUtils]: 17: Hoare triple {2160#true} ~in~0 := 0; {2164#(<= 0 main_~in~0)} is VALID [2020-07-18 00:48:57,749 INFO L280 TraceCheckUtils]: 18: Hoare triple {2164#(<= 0 main_~in~0)} ~buflim~0 := ~bufferlen~0 - 2; {2164#(<= 0 main_~in~0)} is VALID [2020-07-18 00:48:57,749 INFO L280 TraceCheckUtils]: 19: Hoare triple {2164#(<= 0 main_~in~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2164#(<= 0 main_~in~0)} is VALID [2020-07-18 00:48:57,750 INFO L280 TraceCheckUtils]: 20: Hoare triple {2164#(<= 0 main_~in~0)} assume !!(0 != #t~nondet2); {2164#(<= 0 main_~in~0)} is VALID [2020-07-18 00:48:57,751 INFO L280 TraceCheckUtils]: 21: Hoare triple {2164#(<= 0 main_~in~0)} havoc #t~nondet2; {2164#(<= 0 main_~in~0)} is VALID [2020-07-18 00:48:57,751 INFO L280 TraceCheckUtils]: 22: Hoare triple {2164#(<= 0 main_~in~0)} assume !(~buf~0 == ~buflim~0); {2164#(<= 0 main_~in~0)} is VALID [2020-07-18 00:48:57,751 INFO L263 TraceCheckUtils]: 23: Hoare triple {2164#(<= 0 main_~in~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {2160#true} is VALID [2020-07-18 00:48:57,752 INFO L280 TraceCheckUtils]: 24: Hoare triple {2160#true} ~cond := #in~cond; {2160#true} is VALID [2020-07-18 00:48:57,752 INFO L280 TraceCheckUtils]: 25: Hoare triple {2160#true} assume !(0 == ~cond); {2160#true} is VALID [2020-07-18 00:48:57,752 INFO L280 TraceCheckUtils]: 26: Hoare triple {2160#true} assume true; {2160#true} is VALID [2020-07-18 00:48:57,753 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2160#true} {2164#(<= 0 main_~in~0)} #103#return; {2164#(<= 0 main_~in~0)} is VALID [2020-07-18 00:48:57,753 INFO L263 TraceCheckUtils]: 28: Hoare triple {2164#(<= 0 main_~in~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {2160#true} is VALID [2020-07-18 00:48:57,754 INFO L280 TraceCheckUtils]: 29: Hoare triple {2160#true} ~cond := #in~cond; {2160#true} is VALID [2020-07-18 00:48:57,754 INFO L280 TraceCheckUtils]: 30: Hoare triple {2160#true} assume !(0 == ~cond); {2160#true} is VALID [2020-07-18 00:48:57,754 INFO L280 TraceCheckUtils]: 31: Hoare triple {2160#true} assume true; {2160#true} is VALID [2020-07-18 00:48:57,755 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2160#true} {2164#(<= 0 main_~in~0)} #105#return; {2164#(<= 0 main_~in~0)} is VALID [2020-07-18 00:48:57,755 INFO L280 TraceCheckUtils]: 33: Hoare triple {2164#(<= 0 main_~in~0)} #t~post3 := ~buf~0; {2164#(<= 0 main_~in~0)} is VALID [2020-07-18 00:48:57,756 INFO L280 TraceCheckUtils]: 34: Hoare triple {2164#(<= 0 main_~in~0)} ~buf~0 := 1 + #t~post3; {2164#(<= 0 main_~in~0)} is VALID [2020-07-18 00:48:57,757 INFO L280 TraceCheckUtils]: 35: Hoare triple {2164#(<= 0 main_~in~0)} havoc #t~post3; {2164#(<= 0 main_~in~0)} is VALID [2020-07-18 00:48:57,757 INFO L280 TraceCheckUtils]: 36: Hoare triple {2164#(<= 0 main_~in~0)} #t~post4 := ~in~0; {2173#(<= 0 |main_#t~post4|)} is VALID [2020-07-18 00:48:57,758 INFO L280 TraceCheckUtils]: 37: Hoare triple {2173#(<= 0 |main_#t~post4|)} ~in~0 := 1 + #t~post4; {2174#(<= 1 main_~in~0)} is VALID [2020-07-18 00:48:57,759 INFO L280 TraceCheckUtils]: 38: Hoare triple {2174#(<= 1 main_~in~0)} havoc #t~post4; {2174#(<= 1 main_~in~0)} is VALID [2020-07-18 00:48:57,760 INFO L263 TraceCheckUtils]: 39: Hoare triple {2174#(<= 1 main_~in~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {2175#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:57,761 INFO L280 TraceCheckUtils]: 40: Hoare triple {2175#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2176#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:57,762 INFO L280 TraceCheckUtils]: 41: Hoare triple {2176#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2161#false} is VALID [2020-07-18 00:48:57,762 INFO L280 TraceCheckUtils]: 42: Hoare triple {2161#false} assume !false; {2161#false} is VALID [2020-07-18 00:48:57,764 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-18 00:48:57,765 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:57,765 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1652902655] [2020-07-18 00:48:57,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:57,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-18 00:48:57,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643991944] [2020-07-18 00:48:57,767 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-07-18 00:48:57,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:57,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 00:48:57,803 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:57,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 00:48:57,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:57,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 00:48:57,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:48:57,804 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand 7 states. [2020-07-18 00:48:58,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:58,210 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2020-07-18 00:48:58,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-18 00:48:58,210 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-07-18 00:48:58,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:58,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:48:58,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2020-07-18 00:48:58,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:48:58,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2020-07-18 00:48:58,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 73 transitions. [2020-07-18 00:48:58,293 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:58,297 INFO L225 Difference]: With dead ends: 72 [2020-07-18 00:48:58,297 INFO L226 Difference]: Without dead ends: 70 [2020-07-18 00:48:58,298 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 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-18 00:48:58,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-18 00:48:58,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2020-07-18 00:48:58,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:58,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 65 states. [2020-07-18 00:48:58,376 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 65 states. [2020-07-18 00:48:58,376 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 65 states. [2020-07-18 00:48:58,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:58,379 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2020-07-18 00:48:58,380 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2020-07-18 00:48:58,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:58,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:58,380 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 70 states. [2020-07-18 00:48:58,381 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 70 states. [2020-07-18 00:48:58,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:58,383 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2020-07-18 00:48:58,384 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2020-07-18 00:48:58,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:58,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:58,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:58,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:58,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-18 00:48:58,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2020-07-18 00:48:58,387 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 43 [2020-07-18 00:48:58,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:58,388 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2020-07-18 00:48:58,388 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 00:48:58,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 65 states and 72 transitions. [2020-07-18 00:48:58,479 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:58,479 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2020-07-18 00:48:58,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-18 00:48:58,480 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:58,480 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] [2020-07-18 00:48:58,480 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 00:48:58,481 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:58,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:58,481 INFO L82 PathProgramCache]: Analyzing trace with hash 146364602, now seen corresponding path program 1 times [2020-07-18 00:48:58,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:58,481 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1213002948] [2020-07-18 00:48:58,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:58,598 INFO L280 TraceCheckUtils]: 0: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-18 00:48:58,598 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2599#true} {2599#true} #99#return; {2599#true} is VALID [2020-07-18 00:48:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:58,608 INFO L280 TraceCheckUtils]: 0: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2020-07-18 00:48:58,609 INFO L280 TraceCheckUtils]: 1: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2020-07-18 00:48:58,609 INFO L280 TraceCheckUtils]: 2: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-18 00:48:58,610 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2599#true} {2605#(<= (+ main_~in~0 3) main_~inlen~0)} #103#return; {2605#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:48:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:58,615 INFO L280 TraceCheckUtils]: 0: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2020-07-18 00:48:58,616 INFO L280 TraceCheckUtils]: 1: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2020-07-18 00:48:58,616 INFO L280 TraceCheckUtils]: 2: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-18 00:48:58,617 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2599#true} {2605#(<= (+ main_~in~0 3) main_~inlen~0)} #105#return; {2605#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:48:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:58,622 INFO L280 TraceCheckUtils]: 0: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2020-07-18 00:48:58,622 INFO L280 TraceCheckUtils]: 1: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2020-07-18 00:48:58,623 INFO L280 TraceCheckUtils]: 2: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-18 00:48:58,623 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2599#true} {2615#(<= (+ main_~in~0 2) main_~inlen~0)} #107#return; {2615#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:48:58,624 INFO L263 TraceCheckUtils]: 0: Hoare triple {2599#true} call ULTIMATE.init(); {2599#true} is VALID [2020-07-18 00:48:58,624 INFO L280 TraceCheckUtils]: 1: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-18 00:48:58,624 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2599#true} {2599#true} #99#return; {2599#true} is VALID [2020-07-18 00:48:58,624 INFO L263 TraceCheckUtils]: 3: Hoare triple {2599#true} call #t~ret7 := main(); {2599#true} is VALID [2020-07-18 00:48:58,625 INFO L280 TraceCheckUtils]: 4: Hoare triple {2599#true} havoc ~in~0; {2599#true} is VALID [2020-07-18 00:48:58,625 INFO L280 TraceCheckUtils]: 5: Hoare triple {2599#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2599#true} is VALID [2020-07-18 00:48:58,625 INFO L280 TraceCheckUtils]: 6: Hoare triple {2599#true} ~inlen~0 := #t~nondet0; {2599#true} is VALID [2020-07-18 00:48:58,625 INFO L280 TraceCheckUtils]: 7: Hoare triple {2599#true} havoc #t~nondet0; {2599#true} is VALID [2020-07-18 00:48:58,626 INFO L280 TraceCheckUtils]: 8: Hoare triple {2599#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2599#true} is VALID [2020-07-18 00:48:58,626 INFO L280 TraceCheckUtils]: 9: Hoare triple {2599#true} ~bufferlen~0 := #t~nondet1; {2599#true} is VALID [2020-07-18 00:48:58,626 INFO L280 TraceCheckUtils]: 10: Hoare triple {2599#true} havoc #t~nondet1; {2599#true} is VALID [2020-07-18 00:48:58,626 INFO L280 TraceCheckUtils]: 11: Hoare triple {2599#true} havoc ~buf~0; {2599#true} is VALID [2020-07-18 00:48:58,627 INFO L280 TraceCheckUtils]: 12: Hoare triple {2599#true} havoc ~buflim~0; {2599#true} is VALID [2020-07-18 00:48:58,627 INFO L280 TraceCheckUtils]: 13: Hoare triple {2599#true} assume ~bufferlen~0 > 1; {2603#(<= 2 main_~bufferlen~0)} is VALID [2020-07-18 00:48:58,628 INFO L280 TraceCheckUtils]: 14: Hoare triple {2603#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {2603#(<= 2 main_~bufferlen~0)} is VALID [2020-07-18 00:48:58,629 INFO L280 TraceCheckUtils]: 15: Hoare triple {2603#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {2604#(<= 3 main_~inlen~0)} is VALID [2020-07-18 00:48:58,630 INFO L280 TraceCheckUtils]: 16: Hoare triple {2604#(<= 3 main_~inlen~0)} ~buf~0 := 0; {2604#(<= 3 main_~inlen~0)} is VALID [2020-07-18 00:48:58,631 INFO L280 TraceCheckUtils]: 17: Hoare triple {2604#(<= 3 main_~inlen~0)} ~in~0 := 0; {2605#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:48:58,631 INFO L280 TraceCheckUtils]: 18: Hoare triple {2605#(<= (+ main_~in~0 3) main_~inlen~0)} ~buflim~0 := ~bufferlen~0 - 2; {2605#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:48:58,632 INFO L280 TraceCheckUtils]: 19: Hoare triple {2605#(<= (+ main_~in~0 3) main_~inlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2605#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:48:58,632 INFO L280 TraceCheckUtils]: 20: Hoare triple {2605#(<= (+ main_~in~0 3) main_~inlen~0)} assume !!(0 != #t~nondet2); {2605#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:48:58,633 INFO L280 TraceCheckUtils]: 21: Hoare triple {2605#(<= (+ main_~in~0 3) main_~inlen~0)} havoc #t~nondet2; {2605#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:48:58,633 INFO L280 TraceCheckUtils]: 22: Hoare triple {2605#(<= (+ main_~in~0 3) main_~inlen~0)} assume !(~buf~0 == ~buflim~0); {2605#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:48:58,633 INFO L263 TraceCheckUtils]: 23: Hoare triple {2605#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {2599#true} is VALID [2020-07-18 00:48:58,634 INFO L280 TraceCheckUtils]: 24: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2020-07-18 00:48:58,634 INFO L280 TraceCheckUtils]: 25: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2020-07-18 00:48:58,634 INFO L280 TraceCheckUtils]: 26: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-18 00:48:58,635 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2599#true} {2605#(<= (+ main_~in~0 3) main_~inlen~0)} #103#return; {2605#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:48:58,635 INFO L263 TraceCheckUtils]: 28: Hoare triple {2605#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {2599#true} is VALID [2020-07-18 00:48:58,635 INFO L280 TraceCheckUtils]: 29: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2020-07-18 00:48:58,636 INFO L280 TraceCheckUtils]: 30: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2020-07-18 00:48:58,636 INFO L280 TraceCheckUtils]: 31: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-18 00:48:58,637 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2599#true} {2605#(<= (+ main_~in~0 3) main_~inlen~0)} #105#return; {2605#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:48:58,637 INFO L280 TraceCheckUtils]: 33: Hoare triple {2605#(<= (+ main_~in~0 3) main_~inlen~0)} #t~post3 := ~buf~0; {2605#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:48:58,638 INFO L280 TraceCheckUtils]: 34: Hoare triple {2605#(<= (+ main_~in~0 3) main_~inlen~0)} ~buf~0 := 1 + #t~post3; {2605#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:48:58,638 INFO L280 TraceCheckUtils]: 35: Hoare triple {2605#(<= (+ main_~in~0 3) main_~inlen~0)} havoc #t~post3; {2605#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:48:58,639 INFO L280 TraceCheckUtils]: 36: Hoare triple {2605#(<= (+ main_~in~0 3) main_~inlen~0)} #t~post4 := ~in~0; {2614#(<= (+ |main_#t~post4| 3) main_~inlen~0)} is VALID [2020-07-18 00:48:58,640 INFO L280 TraceCheckUtils]: 37: Hoare triple {2614#(<= (+ |main_#t~post4| 3) main_~inlen~0)} ~in~0 := 1 + #t~post4; {2615#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:48:58,640 INFO L280 TraceCheckUtils]: 38: Hoare triple {2615#(<= (+ main_~in~0 2) main_~inlen~0)} havoc #t~post4; {2615#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:48:58,641 INFO L263 TraceCheckUtils]: 39: Hoare triple {2615#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {2599#true} is VALID [2020-07-18 00:48:58,641 INFO L280 TraceCheckUtils]: 40: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2020-07-18 00:48:58,641 INFO L280 TraceCheckUtils]: 41: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2020-07-18 00:48:58,641 INFO L280 TraceCheckUtils]: 42: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-18 00:48:58,642 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {2599#true} {2615#(<= (+ main_~in~0 2) main_~inlen~0)} #107#return; {2615#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:48:58,643 INFO L263 TraceCheckUtils]: 44: Hoare triple {2615#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {2620#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:58,644 INFO L280 TraceCheckUtils]: 45: Hoare triple {2620#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2621#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:58,644 INFO L280 TraceCheckUtils]: 46: Hoare triple {2621#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2600#false} is VALID [2020-07-18 00:48:58,645 INFO L280 TraceCheckUtils]: 47: Hoare triple {2600#false} assume !false; {2600#false} is VALID [2020-07-18 00:48:58,647 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-18 00:48:58,647 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:58,648 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1213002948] [2020-07-18 00:48:58,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:58,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-18 00:48:58,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457578105] [2020-07-18 00:48:58,649 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-07-18 00:48:58,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:58,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-18 00:48:58,704 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:58,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-18 00:48:58,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:58,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-18 00:48:58,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-18 00:48:58,706 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 9 states. [2020-07-18 00:48:59,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:59,577 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2020-07-18 00:48:59,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-18 00:48:59,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-07-18 00:48:59,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:59,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 00:48:59,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2020-07-18 00:48:59,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 00:48:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2020-07-18 00:48:59,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 104 transitions. [2020-07-18 00:48:59,705 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-18 00:48:59,707 INFO L225 Difference]: With dead ends: 98 [2020-07-18 00:48:59,708 INFO L226 Difference]: Without dead ends: 96 [2020-07-18 00:48:59,708 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-07-18 00:48:59,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-18 00:48:59,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 77. [2020-07-18 00:48:59,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:59,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 77 states. [2020-07-18 00:48:59,853 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 77 states. [2020-07-18 00:48:59,853 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 77 states. [2020-07-18 00:48:59,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:59,858 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2020-07-18 00:48:59,858 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2020-07-18 00:48:59,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:59,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:59,859 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 96 states. [2020-07-18 00:48:59,859 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 96 states. [2020-07-18 00:48:59,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:59,863 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2020-07-18 00:48:59,863 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2020-07-18 00:48:59,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:59,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:59,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:59,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-18 00:48:59,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2020-07-18 00:48:59,868 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 48 [2020-07-18 00:48:59,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:59,868 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2020-07-18 00:48:59,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-18 00:48:59,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 77 states and 85 transitions. [2020-07-18 00:48:59,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:59,986 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2020-07-18 00:48:59,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-18 00:48:59,987 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:59,987 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 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] [2020-07-18 00:48:59,987 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 00:48:59,988 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:59,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:59,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1943579560, now seen corresponding path program 1 times [2020-07-18 00:48:59,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:59,989 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1200591420] [2020-07-18 00:48:59,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:00,173 INFO L280 TraceCheckUtils]: 0: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-18 00:49:00,174 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3178#true} {3178#true} #99#return; {3178#true} is VALID [2020-07-18 00:49:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:00,180 INFO L280 TraceCheckUtils]: 0: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-18 00:49:00,180 INFO L280 TraceCheckUtils]: 1: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-18 00:49:00,181 INFO L280 TraceCheckUtils]: 2: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-18 00:49:00,181 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3178#true} {3182#(<= 0 main_~buf~0)} #103#return; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:49:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:00,191 INFO L280 TraceCheckUtils]: 0: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-18 00:49:00,191 INFO L280 TraceCheckUtils]: 1: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-18 00:49:00,191 INFO L280 TraceCheckUtils]: 2: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-18 00:49:00,192 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3178#true} {3182#(<= 0 main_~buf~0)} #105#return; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:49:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:00,199 INFO L280 TraceCheckUtils]: 0: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-18 00:49:00,199 INFO L280 TraceCheckUtils]: 1: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-18 00:49:00,200 INFO L280 TraceCheckUtils]: 2: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-18 00:49:00,200 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3178#true} {3192#(<= 1 main_~buf~0)} #107#return; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:00,205 INFO L280 TraceCheckUtils]: 0: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-18 00:49:00,206 INFO L280 TraceCheckUtils]: 1: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-18 00:49:00,206 INFO L280 TraceCheckUtils]: 2: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-18 00:49:00,207 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3178#true} {3192#(<= 1 main_~buf~0)} #109#return; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:00,207 INFO L263 TraceCheckUtils]: 0: Hoare triple {3178#true} call ULTIMATE.init(); {3178#true} is VALID [2020-07-18 00:49:00,207 INFO L280 TraceCheckUtils]: 1: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-18 00:49:00,208 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3178#true} {3178#true} #99#return; {3178#true} is VALID [2020-07-18 00:49:00,208 INFO L263 TraceCheckUtils]: 3: Hoare triple {3178#true} call #t~ret7 := main(); {3178#true} is VALID [2020-07-18 00:49:00,208 INFO L280 TraceCheckUtils]: 4: Hoare triple {3178#true} havoc ~in~0; {3178#true} is VALID [2020-07-18 00:49:00,208 INFO L280 TraceCheckUtils]: 5: Hoare triple {3178#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3178#true} is VALID [2020-07-18 00:49:00,208 INFO L280 TraceCheckUtils]: 6: Hoare triple {3178#true} ~inlen~0 := #t~nondet0; {3178#true} is VALID [2020-07-18 00:49:00,209 INFO L280 TraceCheckUtils]: 7: Hoare triple {3178#true} havoc #t~nondet0; {3178#true} is VALID [2020-07-18 00:49:00,209 INFO L280 TraceCheckUtils]: 8: Hoare triple {3178#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3178#true} is VALID [2020-07-18 00:49:00,209 INFO L280 TraceCheckUtils]: 9: Hoare triple {3178#true} ~bufferlen~0 := #t~nondet1; {3178#true} is VALID [2020-07-18 00:49:00,209 INFO L280 TraceCheckUtils]: 10: Hoare triple {3178#true} havoc #t~nondet1; {3178#true} is VALID [2020-07-18 00:49:00,209 INFO L280 TraceCheckUtils]: 11: Hoare triple {3178#true} havoc ~buf~0; {3178#true} is VALID [2020-07-18 00:49:00,210 INFO L280 TraceCheckUtils]: 12: Hoare triple {3178#true} havoc ~buflim~0; {3178#true} is VALID [2020-07-18 00:49:00,210 INFO L280 TraceCheckUtils]: 13: Hoare triple {3178#true} assume ~bufferlen~0 > 1; {3178#true} is VALID [2020-07-18 00:49:00,210 INFO L280 TraceCheckUtils]: 14: Hoare triple {3178#true} assume ~inlen~0 > 0; {3178#true} is VALID [2020-07-18 00:49:00,210 INFO L280 TraceCheckUtils]: 15: Hoare triple {3178#true} assume ~bufferlen~0 < ~inlen~0; {3178#true} is VALID [2020-07-18 00:49:00,211 INFO L280 TraceCheckUtils]: 16: Hoare triple {3178#true} ~buf~0 := 0; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:49:00,212 INFO L280 TraceCheckUtils]: 17: Hoare triple {3182#(<= 0 main_~buf~0)} ~in~0 := 0; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:49:00,212 INFO L280 TraceCheckUtils]: 18: Hoare triple {3182#(<= 0 main_~buf~0)} ~buflim~0 := ~bufferlen~0 - 2; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:49:00,213 INFO L280 TraceCheckUtils]: 19: Hoare triple {3182#(<= 0 main_~buf~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:49:00,214 INFO L280 TraceCheckUtils]: 20: Hoare triple {3182#(<= 0 main_~buf~0)} assume !!(0 != #t~nondet2); {3182#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:49:00,215 INFO L280 TraceCheckUtils]: 21: Hoare triple {3182#(<= 0 main_~buf~0)} havoc #t~nondet2; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:49:00,216 INFO L280 TraceCheckUtils]: 22: Hoare triple {3182#(<= 0 main_~buf~0)} assume !(~buf~0 == ~buflim~0); {3182#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:49:00,216 INFO L263 TraceCheckUtils]: 23: Hoare triple {3182#(<= 0 main_~buf~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {3178#true} is VALID [2020-07-18 00:49:00,216 INFO L280 TraceCheckUtils]: 24: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-18 00:49:00,216 INFO L280 TraceCheckUtils]: 25: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-18 00:49:00,217 INFO L280 TraceCheckUtils]: 26: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-18 00:49:00,218 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {3178#true} {3182#(<= 0 main_~buf~0)} #103#return; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:49:00,219 INFO L263 TraceCheckUtils]: 28: Hoare triple {3182#(<= 0 main_~buf~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {3178#true} is VALID [2020-07-18 00:49:00,219 INFO L280 TraceCheckUtils]: 29: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-18 00:49:00,219 INFO L280 TraceCheckUtils]: 30: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-18 00:49:00,219 INFO L280 TraceCheckUtils]: 31: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-18 00:49:00,220 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {3178#true} {3182#(<= 0 main_~buf~0)} #105#return; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:49:00,222 INFO L280 TraceCheckUtils]: 33: Hoare triple {3182#(<= 0 main_~buf~0)} #t~post3 := ~buf~0; {3191#(<= 0 |main_#t~post3|)} is VALID [2020-07-18 00:49:00,223 INFO L280 TraceCheckUtils]: 34: Hoare triple {3191#(<= 0 |main_#t~post3|)} ~buf~0 := 1 + #t~post3; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:00,224 INFO L280 TraceCheckUtils]: 35: Hoare triple {3192#(<= 1 main_~buf~0)} havoc #t~post3; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:00,224 INFO L280 TraceCheckUtils]: 36: Hoare triple {3192#(<= 1 main_~buf~0)} #t~post4 := ~in~0; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:00,225 INFO L280 TraceCheckUtils]: 37: Hoare triple {3192#(<= 1 main_~buf~0)} ~in~0 := 1 + #t~post4; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:00,226 INFO L280 TraceCheckUtils]: 38: Hoare triple {3192#(<= 1 main_~buf~0)} havoc #t~post4; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:00,226 INFO L263 TraceCheckUtils]: 39: Hoare triple {3192#(<= 1 main_~buf~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {3178#true} is VALID [2020-07-18 00:49:00,226 INFO L280 TraceCheckUtils]: 40: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-18 00:49:00,226 INFO L280 TraceCheckUtils]: 41: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-18 00:49:00,227 INFO L280 TraceCheckUtils]: 42: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-18 00:49:00,228 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3178#true} {3192#(<= 1 main_~buf~0)} #107#return; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:00,228 INFO L263 TraceCheckUtils]: 44: Hoare triple {3192#(<= 1 main_~buf~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {3178#true} is VALID [2020-07-18 00:49:00,229 INFO L280 TraceCheckUtils]: 45: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-18 00:49:00,229 INFO L280 TraceCheckUtils]: 46: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-18 00:49:00,229 INFO L280 TraceCheckUtils]: 47: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-18 00:49:00,230 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {3178#true} {3192#(<= 1 main_~buf~0)} #109#return; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:00,231 INFO L280 TraceCheckUtils]: 49: Hoare triple {3192#(<= 1 main_~buf~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:00,232 INFO L280 TraceCheckUtils]: 50: Hoare triple {3192#(<= 1 main_~buf~0)} assume !(0 != #t~nondet2); {3192#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:00,233 INFO L280 TraceCheckUtils]: 51: Hoare triple {3192#(<= 1 main_~buf~0)} havoc #t~nondet2; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:00,234 INFO L263 TraceCheckUtils]: 52: Hoare triple {3192#(<= 1 main_~buf~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {3201#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:49:00,234 INFO L280 TraceCheckUtils]: 53: Hoare triple {3201#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3202#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:49:00,235 INFO L280 TraceCheckUtils]: 54: Hoare triple {3202#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3179#false} is VALID [2020-07-18 00:49:00,235 INFO L280 TraceCheckUtils]: 55: Hoare triple {3179#false} assume !false; {3179#false} is VALID [2020-07-18 00:49:00,238 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-18 00:49:00,238 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:00,238 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1200591420] [2020-07-18 00:49:00,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:00,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-18 00:49:00,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462213553] [2020-07-18 00:49:00,240 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-07-18 00:49:00,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:00,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 00:49:00,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:00,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 00:49:00,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:00,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 00:49:00,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:49:00,287 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 7 states. [2020-07-18 00:49:00,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:00,771 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2020-07-18 00:49:00,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-18 00:49:00,771 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-07-18 00:49:00,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:00,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:49:00,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2020-07-18 00:49:00,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:49:00,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2020-07-18 00:49:00,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 70 transitions. [2020-07-18 00:49:00,845 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:00,848 INFO L225 Difference]: With dead ends: 83 [2020-07-18 00:49:00,848 INFO L226 Difference]: Without dead ends: 81 [2020-07-18 00:49:00,848 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 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-18 00:49:00,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-18 00:49:00,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-07-18 00:49:00,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:00,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 81 states. [2020-07-18 00:49:00,997 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-18 00:49:00,997 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-18 00:49:01,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:01,002 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2020-07-18 00:49:01,002 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2020-07-18 00:49:01,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:01,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:01,003 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-18 00:49:01,003 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-18 00:49:01,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:01,006 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2020-07-18 00:49:01,006 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2020-07-18 00:49:01,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:01,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:01,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:01,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:01,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-18 00:49:01,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2020-07-18 00:49:01,011 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 56 [2020-07-18 00:49:01,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:01,011 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2020-07-18 00:49:01,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 00:49:01,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states and 88 transitions. [2020-07-18 00:49:01,155 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:01,156 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2020-07-18 00:49:01,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-18 00:49:01,157 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:01,157 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 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-18 00:49:01,157 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 00:49:01,158 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:01,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:01,158 INFO L82 PathProgramCache]: Analyzing trace with hash 903884048, now seen corresponding path program 1 times [2020-07-18 00:49:01,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:01,159 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1278124902] [2020-07-18 00:49:01,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:01,319 INFO L280 TraceCheckUtils]: 0: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-18 00:49:01,319 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3701#true} {3701#true} #99#return; {3701#true} is VALID [2020-07-18 00:49:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:01,325 INFO L280 TraceCheckUtils]: 0: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-18 00:49:01,325 INFO L280 TraceCheckUtils]: 1: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-18 00:49:01,326 INFO L280 TraceCheckUtils]: 2: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-18 00:49:01,327 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3701#true} {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #103#return; {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:01,339 INFO L280 TraceCheckUtils]: 0: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-18 00:49:01,339 INFO L280 TraceCheckUtils]: 1: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-18 00:49:01,340 INFO L280 TraceCheckUtils]: 2: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-18 00:49:01,340 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3701#true} {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #105#return; {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:01,347 INFO L280 TraceCheckUtils]: 0: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-18 00:49:01,347 INFO L280 TraceCheckUtils]: 1: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-18 00:49:01,347 INFO L280 TraceCheckUtils]: 2: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-18 00:49:01,348 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3701#true} {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #107#return; {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:01,356 INFO L280 TraceCheckUtils]: 0: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-18 00:49:01,357 INFO L280 TraceCheckUtils]: 1: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-18 00:49:01,357 INFO L280 TraceCheckUtils]: 2: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-18 00:49:01,358 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3701#true} {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #109#return; {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:01,364 INFO L280 TraceCheckUtils]: 0: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-18 00:49:01,364 INFO L280 TraceCheckUtils]: 1: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-18 00:49:01,365 INFO L280 TraceCheckUtils]: 2: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-18 00:49:01,365 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3701#true} {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #111#return; {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,366 INFO L263 TraceCheckUtils]: 0: Hoare triple {3701#true} call ULTIMATE.init(); {3701#true} is VALID [2020-07-18 00:49:01,366 INFO L280 TraceCheckUtils]: 1: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-18 00:49:01,366 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3701#true} {3701#true} #99#return; {3701#true} is VALID [2020-07-18 00:49:01,366 INFO L263 TraceCheckUtils]: 3: Hoare triple {3701#true} call #t~ret7 := main(); {3701#true} is VALID [2020-07-18 00:49:01,367 INFO L280 TraceCheckUtils]: 4: Hoare triple {3701#true} havoc ~in~0; {3701#true} is VALID [2020-07-18 00:49:01,367 INFO L280 TraceCheckUtils]: 5: Hoare triple {3701#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3701#true} is VALID [2020-07-18 00:49:01,367 INFO L280 TraceCheckUtils]: 6: Hoare triple {3701#true} ~inlen~0 := #t~nondet0; {3701#true} is VALID [2020-07-18 00:49:01,367 INFO L280 TraceCheckUtils]: 7: Hoare triple {3701#true} havoc #t~nondet0; {3701#true} is VALID [2020-07-18 00:49:01,367 INFO L280 TraceCheckUtils]: 8: Hoare triple {3701#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3701#true} is VALID [2020-07-18 00:49:01,368 INFO L280 TraceCheckUtils]: 9: Hoare triple {3701#true} ~bufferlen~0 := #t~nondet1; {3701#true} is VALID [2020-07-18 00:49:01,368 INFO L280 TraceCheckUtils]: 10: Hoare triple {3701#true} havoc #t~nondet1; {3701#true} is VALID [2020-07-18 00:49:01,368 INFO L280 TraceCheckUtils]: 11: Hoare triple {3701#true} havoc ~buf~0; {3701#true} is VALID [2020-07-18 00:49:01,370 INFO L280 TraceCheckUtils]: 12: Hoare triple {3701#true} havoc ~buflim~0; {3701#true} is VALID [2020-07-18 00:49:01,371 INFO L280 TraceCheckUtils]: 13: Hoare triple {3701#true} assume ~bufferlen~0 > 1; {3705#(<= 2 main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,371 INFO L280 TraceCheckUtils]: 14: Hoare triple {3705#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {3705#(<= 2 main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,372 INFO L280 TraceCheckUtils]: 15: Hoare triple {3705#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {3705#(<= 2 main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,372 INFO L280 TraceCheckUtils]: 16: Hoare triple {3705#(<= 2 main_~bufferlen~0)} ~buf~0 := 0; {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,373 INFO L280 TraceCheckUtils]: 17: Hoare triple {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~in~0 := 0; {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,373 INFO L280 TraceCheckUtils]: 18: Hoare triple {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~buflim~0 := ~bufferlen~0 - 2; {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,374 INFO L280 TraceCheckUtils]: 19: Hoare triple {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,374 INFO L280 TraceCheckUtils]: 20: Hoare triple {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume !!(0 != #t~nondet2); {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,375 INFO L280 TraceCheckUtils]: 21: Hoare triple {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} havoc #t~nondet2; {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,375 INFO L280 TraceCheckUtils]: 22: Hoare triple {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume !(~buf~0 == ~buflim~0); {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,375 INFO L263 TraceCheckUtils]: 23: Hoare triple {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {3701#true} is VALID [2020-07-18 00:49:01,375 INFO L280 TraceCheckUtils]: 24: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-18 00:49:01,376 INFO L280 TraceCheckUtils]: 25: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-18 00:49:01,376 INFO L280 TraceCheckUtils]: 26: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-18 00:49:01,379 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {3701#true} {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #103#return; {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,379 INFO L263 TraceCheckUtils]: 28: Hoare triple {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {3701#true} is VALID [2020-07-18 00:49:01,379 INFO L280 TraceCheckUtils]: 29: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-18 00:49:01,379 INFO L280 TraceCheckUtils]: 30: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-18 00:49:01,380 INFO L280 TraceCheckUtils]: 31: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-18 00:49:01,381 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {3701#true} {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #105#return; {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,381 INFO L280 TraceCheckUtils]: 33: Hoare triple {3706#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #t~post3 := ~buf~0; {3715#(<= (+ |main_#t~post3| 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,382 INFO L280 TraceCheckUtils]: 34: Hoare triple {3715#(<= (+ |main_#t~post3| 2) main_~bufferlen~0)} ~buf~0 := 1 + #t~post3; {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,383 INFO L280 TraceCheckUtils]: 35: Hoare triple {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} havoc #t~post3; {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,383 INFO L280 TraceCheckUtils]: 36: Hoare triple {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #t~post4 := ~in~0; {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,384 INFO L280 TraceCheckUtils]: 37: Hoare triple {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} ~in~0 := 1 + #t~post4; {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,384 INFO L280 TraceCheckUtils]: 38: Hoare triple {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} havoc #t~post4; {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,384 INFO L263 TraceCheckUtils]: 39: Hoare triple {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {3701#true} is VALID [2020-07-18 00:49:01,385 INFO L280 TraceCheckUtils]: 40: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-18 00:49:01,385 INFO L280 TraceCheckUtils]: 41: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-18 00:49:01,385 INFO L280 TraceCheckUtils]: 42: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-18 00:49:01,386 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3701#true} {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #107#return; {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,386 INFO L263 TraceCheckUtils]: 44: Hoare triple {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {3701#true} is VALID [2020-07-18 00:49:01,386 INFO L280 TraceCheckUtils]: 45: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-18 00:49:01,386 INFO L280 TraceCheckUtils]: 46: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-18 00:49:01,387 INFO L280 TraceCheckUtils]: 47: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-18 00:49:01,387 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {3701#true} {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #109#return; {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,388 INFO L280 TraceCheckUtils]: 49: Hoare triple {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,388 INFO L280 TraceCheckUtils]: 50: Hoare triple {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} assume !(0 != #t~nondet2); {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,389 INFO L280 TraceCheckUtils]: 51: Hoare triple {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} havoc #t~nondet2; {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,389 INFO L263 TraceCheckUtils]: 52: Hoare triple {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {3701#true} is VALID [2020-07-18 00:49:01,389 INFO L280 TraceCheckUtils]: 53: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-18 00:49:01,389 INFO L280 TraceCheckUtils]: 54: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-18 00:49:01,390 INFO L280 TraceCheckUtils]: 55: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-18 00:49:01,390 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3701#true} {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #111#return; {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:01,391 INFO L263 TraceCheckUtils]: 57: Hoare triple {3716#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {3729#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:49:01,392 INFO L280 TraceCheckUtils]: 58: Hoare triple {3729#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3730#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:49:01,393 INFO L280 TraceCheckUtils]: 59: Hoare triple {3730#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3702#false} is VALID [2020-07-18 00:49:01,393 INFO L280 TraceCheckUtils]: 60: Hoare triple {3702#false} assume !false; {3702#false} is VALID [2020-07-18 00:49:01,396 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-18 00:49:01,397 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:01,397 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1278124902] [2020-07-18 00:49:01,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:01,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-18 00:49:01,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163299015] [2020-07-18 00:49:01,400 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-07-18 00:49:01,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:01,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 00:49:01,454 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-18 00:49:01,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 00:49:01,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:01,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 00:49:01,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:49:01,456 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 8 states. [2020-07-18 00:49:02,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:02,206 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2020-07-18 00:49:02,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-18 00:49:02,206 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-07-18 00:49:02,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:02,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:49:02,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2020-07-18 00:49:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:49:02,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2020-07-18 00:49:02,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 97 transitions. [2020-07-18 00:49:02,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:02,336 INFO L225 Difference]: With dead ends: 100 [2020-07-18 00:49:02,336 INFO L226 Difference]: Without dead ends: 98 [2020-07-18 00:49:02,337 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-07-18 00:49:02,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-18 00:49:02,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2020-07-18 00:49:02,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:02,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 94 states. [2020-07-18 00:49:02,508 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 94 states. [2020-07-18 00:49:02,508 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 94 states. [2020-07-18 00:49:02,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:02,511 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2020-07-18 00:49:02,512 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2020-07-18 00:49:02,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:02,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:02,512 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 98 states. [2020-07-18 00:49:02,513 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 98 states. [2020-07-18 00:49:02,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:02,515 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2020-07-18 00:49:02,516 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2020-07-18 00:49:02,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:02,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:02,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:02,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:02,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-18 00:49:02,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2020-07-18 00:49:02,519 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 61 [2020-07-18 00:49:02,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:02,520 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2020-07-18 00:49:02,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 00:49:02,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 94 states and 106 transitions. [2020-07-18 00:49:02,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:02,681 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2020-07-18 00:49:02,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-18 00:49:02,682 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:02,682 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 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] [2020-07-18 00:49:02,683 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-18 00:49:02,683 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:02,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:02,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1662212275, now seen corresponding path program 1 times [2020-07-18 00:49:02,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:02,684 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1082924954] [2020-07-18 00:49:02,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:02,810 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-18 00:49:02,810 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4327#true} {4327#true} #99#return; {4327#true} is VALID [2020-07-18 00:49:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:02,822 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-18 00:49:02,822 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-18 00:49:02,823 INFO L280 TraceCheckUtils]: 2: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-18 00:49:02,823 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4327#true} {4331#(<= 0 main_~buf~0)} #103#return; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:49:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:02,832 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-18 00:49:02,833 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-18 00:49:02,833 INFO L280 TraceCheckUtils]: 2: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-18 00:49:02,834 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4327#true} {4331#(<= 0 main_~buf~0)} #105#return; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:49:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:02,845 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-18 00:49:02,845 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-18 00:49:02,846 INFO L280 TraceCheckUtils]: 2: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-18 00:49:02,846 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #107#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:02,850 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-18 00:49:02,851 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-18 00:49:02,851 INFO L280 TraceCheckUtils]: 2: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-18 00:49:02,852 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #109#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:02,856 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-18 00:49:02,857 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-18 00:49:02,857 INFO L280 TraceCheckUtils]: 2: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-18 00:49:02,857 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #111#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:02,864 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-18 00:49:02,865 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-18 00:49:02,865 INFO L280 TraceCheckUtils]: 2: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-18 00:49:02,869 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #113#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:02,869 INFO L263 TraceCheckUtils]: 0: Hoare triple {4327#true} call ULTIMATE.init(); {4327#true} is VALID [2020-07-18 00:49:02,869 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-18 00:49:02,869 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4327#true} {4327#true} #99#return; {4327#true} is VALID [2020-07-18 00:49:02,870 INFO L263 TraceCheckUtils]: 3: Hoare triple {4327#true} call #t~ret7 := main(); {4327#true} is VALID [2020-07-18 00:49:02,870 INFO L280 TraceCheckUtils]: 4: Hoare triple {4327#true} havoc ~in~0; {4327#true} is VALID [2020-07-18 00:49:02,870 INFO L280 TraceCheckUtils]: 5: Hoare triple {4327#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4327#true} is VALID [2020-07-18 00:49:02,870 INFO L280 TraceCheckUtils]: 6: Hoare triple {4327#true} ~inlen~0 := #t~nondet0; {4327#true} is VALID [2020-07-18 00:49:02,871 INFO L280 TraceCheckUtils]: 7: Hoare triple {4327#true} havoc #t~nondet0; {4327#true} is VALID [2020-07-18 00:49:02,871 INFO L280 TraceCheckUtils]: 8: Hoare triple {4327#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4327#true} is VALID [2020-07-18 00:49:02,871 INFO L280 TraceCheckUtils]: 9: Hoare triple {4327#true} ~bufferlen~0 := #t~nondet1; {4327#true} is VALID [2020-07-18 00:49:02,871 INFO L280 TraceCheckUtils]: 10: Hoare triple {4327#true} havoc #t~nondet1; {4327#true} is VALID [2020-07-18 00:49:02,871 INFO L280 TraceCheckUtils]: 11: Hoare triple {4327#true} havoc ~buf~0; {4327#true} is VALID [2020-07-18 00:49:02,871 INFO L280 TraceCheckUtils]: 12: Hoare triple {4327#true} havoc ~buflim~0; {4327#true} is VALID [2020-07-18 00:49:02,872 INFO L280 TraceCheckUtils]: 13: Hoare triple {4327#true} assume ~bufferlen~0 > 1; {4327#true} is VALID [2020-07-18 00:49:02,872 INFO L280 TraceCheckUtils]: 14: Hoare triple {4327#true} assume ~inlen~0 > 0; {4327#true} is VALID [2020-07-18 00:49:02,872 INFO L280 TraceCheckUtils]: 15: Hoare triple {4327#true} assume ~bufferlen~0 < ~inlen~0; {4327#true} is VALID [2020-07-18 00:49:02,891 INFO L280 TraceCheckUtils]: 16: Hoare triple {4327#true} ~buf~0 := 0; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:49:02,892 INFO L280 TraceCheckUtils]: 17: Hoare triple {4331#(<= 0 main_~buf~0)} ~in~0 := 0; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:49:02,893 INFO L280 TraceCheckUtils]: 18: Hoare triple {4331#(<= 0 main_~buf~0)} ~buflim~0 := ~bufferlen~0 - 2; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:49:02,894 INFO L280 TraceCheckUtils]: 19: Hoare triple {4331#(<= 0 main_~buf~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:49:02,895 INFO L280 TraceCheckUtils]: 20: Hoare triple {4331#(<= 0 main_~buf~0)} assume !!(0 != #t~nondet2); {4331#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:49:02,896 INFO L280 TraceCheckUtils]: 21: Hoare triple {4331#(<= 0 main_~buf~0)} havoc #t~nondet2; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:49:02,896 INFO L280 TraceCheckUtils]: 22: Hoare triple {4331#(<= 0 main_~buf~0)} assume !(~buf~0 == ~buflim~0); {4331#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:49:02,896 INFO L263 TraceCheckUtils]: 23: Hoare triple {4331#(<= 0 main_~buf~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {4327#true} is VALID [2020-07-18 00:49:02,896 INFO L280 TraceCheckUtils]: 24: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-18 00:49:02,897 INFO L280 TraceCheckUtils]: 25: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-18 00:49:02,897 INFO L280 TraceCheckUtils]: 26: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-18 00:49:02,897 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {4327#true} {4331#(<= 0 main_~buf~0)} #103#return; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:49:02,898 INFO L263 TraceCheckUtils]: 28: Hoare triple {4331#(<= 0 main_~buf~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {4327#true} is VALID [2020-07-18 00:49:02,898 INFO L280 TraceCheckUtils]: 29: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-18 00:49:02,898 INFO L280 TraceCheckUtils]: 30: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-18 00:49:02,898 INFO L280 TraceCheckUtils]: 31: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-18 00:49:02,899 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {4327#true} {4331#(<= 0 main_~buf~0)} #105#return; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-18 00:49:02,900 INFO L280 TraceCheckUtils]: 33: Hoare triple {4331#(<= 0 main_~buf~0)} #t~post3 := ~buf~0; {4340#(<= 0 |main_#t~post3|)} is VALID [2020-07-18 00:49:02,900 INFO L280 TraceCheckUtils]: 34: Hoare triple {4340#(<= 0 |main_#t~post3|)} ~buf~0 := 1 + #t~post3; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:02,901 INFO L280 TraceCheckUtils]: 35: Hoare triple {4341#(<= 1 main_~buf~0)} havoc #t~post3; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:02,901 INFO L280 TraceCheckUtils]: 36: Hoare triple {4341#(<= 1 main_~buf~0)} #t~post4 := ~in~0; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:02,902 INFO L280 TraceCheckUtils]: 37: Hoare triple {4341#(<= 1 main_~buf~0)} ~in~0 := 1 + #t~post4; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:02,902 INFO L280 TraceCheckUtils]: 38: Hoare triple {4341#(<= 1 main_~buf~0)} havoc #t~post4; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:02,903 INFO L263 TraceCheckUtils]: 39: Hoare triple {4341#(<= 1 main_~buf~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {4327#true} is VALID [2020-07-18 00:49:02,903 INFO L280 TraceCheckUtils]: 40: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-18 00:49:02,903 INFO L280 TraceCheckUtils]: 41: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-18 00:49:02,903 INFO L280 TraceCheckUtils]: 42: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-18 00:49:02,904 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #107#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:02,904 INFO L263 TraceCheckUtils]: 44: Hoare triple {4341#(<= 1 main_~buf~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {4327#true} is VALID [2020-07-18 00:49:02,904 INFO L280 TraceCheckUtils]: 45: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-18 00:49:02,904 INFO L280 TraceCheckUtils]: 46: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-18 00:49:02,905 INFO L280 TraceCheckUtils]: 47: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-18 00:49:02,905 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #109#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:02,906 INFO L280 TraceCheckUtils]: 49: Hoare triple {4341#(<= 1 main_~buf~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:02,906 INFO L280 TraceCheckUtils]: 50: Hoare triple {4341#(<= 1 main_~buf~0)} assume !(0 != #t~nondet2); {4341#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:02,907 INFO L280 TraceCheckUtils]: 51: Hoare triple {4341#(<= 1 main_~buf~0)} havoc #t~nondet2; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:02,907 INFO L263 TraceCheckUtils]: 52: Hoare triple {4341#(<= 1 main_~buf~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {4327#true} is VALID [2020-07-18 00:49:02,907 INFO L280 TraceCheckUtils]: 53: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-18 00:49:02,907 INFO L280 TraceCheckUtils]: 54: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-18 00:49:02,907 INFO L280 TraceCheckUtils]: 55: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-18 00:49:02,908 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #111#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:02,908 INFO L263 TraceCheckUtils]: 57: Hoare triple {4341#(<= 1 main_~buf~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {4327#true} is VALID [2020-07-18 00:49:02,908 INFO L280 TraceCheckUtils]: 58: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-18 00:49:02,908 INFO L280 TraceCheckUtils]: 59: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-18 00:49:02,909 INFO L280 TraceCheckUtils]: 60: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-18 00:49:02,909 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #113#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-18 00:49:02,910 INFO L280 TraceCheckUtils]: 62: Hoare triple {4341#(<= 1 main_~buf~0)} #t~post5 := ~buf~0; {4358#(<= 1 |main_#t~post5|)} is VALID [2020-07-18 00:49:02,911 INFO L280 TraceCheckUtils]: 63: Hoare triple {4358#(<= 1 |main_#t~post5|)} ~buf~0 := 1 + #t~post5; {4359#(<= 2 main_~buf~0)} is VALID [2020-07-18 00:49:02,911 INFO L280 TraceCheckUtils]: 64: Hoare triple {4359#(<= 2 main_~buf~0)} havoc #t~post5; {4359#(<= 2 main_~buf~0)} is VALID [2020-07-18 00:49:02,912 INFO L263 TraceCheckUtils]: 65: Hoare triple {4359#(<= 2 main_~buf~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {4360#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:49:02,913 INFO L280 TraceCheckUtils]: 66: Hoare triple {4360#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {4361#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:49:02,913 INFO L280 TraceCheckUtils]: 67: Hoare triple {4361#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4328#false} is VALID [2020-07-18 00:49:02,913 INFO L280 TraceCheckUtils]: 68: Hoare triple {4328#false} assume !false; {4328#false} is VALID [2020-07-18 00:49:02,917 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-18 00:49:02,918 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:02,918 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1082924954] [2020-07-18 00:49:02,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:02,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-18 00:49:02,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940326554] [2020-07-18 00:49:02,919 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2020-07-18 00:49:02,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:02,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-18 00:49:02,968 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:02,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-18 00:49:02,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:02,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-18 00:49:02,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-18 00:49:02,970 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 9 states. [2020-07-18 00:49:03,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:03,611 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2020-07-18 00:49:03,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-18 00:49:03,611 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2020-07-18 00:49:03,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:03,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 00:49:03,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2020-07-18 00:49:03,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 00:49:03,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2020-07-18 00:49:03,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2020-07-18 00:49:03,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:03,698 INFO L225 Difference]: With dead ends: 100 [2020-07-18 00:49:03,698 INFO L226 Difference]: Without dead ends: 98 [2020-07-18 00:49:03,699 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 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-18 00:49:03,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-18 00:49:03,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2020-07-18 00:49:03,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:03,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 98 states. [2020-07-18 00:49:03,880 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 98 states. [2020-07-18 00:49:03,880 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 98 states. [2020-07-18 00:49:03,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:03,884 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2020-07-18 00:49:03,885 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2020-07-18 00:49:03,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:03,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:03,885 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 98 states. [2020-07-18 00:49:03,885 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 98 states. [2020-07-18 00:49:03,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:03,888 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2020-07-18 00:49:03,889 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2020-07-18 00:49:03,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:03,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:03,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:03,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-07-18 00:49:03,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2020-07-18 00:49:03,892 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 69 [2020-07-18 00:49:03,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:03,892 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2020-07-18 00:49:03,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-18 00:49:03,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 98 states and 109 transitions. [2020-07-18 00:49:04,050 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-18 00:49:04,051 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2020-07-18 00:49:04,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-07-18 00:49:04,052 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:04,052 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 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-18 00:49:04,052 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-18 00:49:04,053 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:04,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:04,053 INFO L82 PathProgramCache]: Analyzing trace with hash 71900773, now seen corresponding path program 1 times [2020-07-18 00:49:04,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:04,053 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1141767551] [2020-07-18 00:49:04,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:04,264 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-18 00:49:04,264 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4966#true} {4966#true} #99#return; {4966#true} is VALID [2020-07-18 00:49:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:04,271 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-18 00:49:04,272 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-18 00:49:04,272 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-18 00:49:04,272 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4966#true} {4973#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #103#return; {4973#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:04,281 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-18 00:49:04,281 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-18 00:49:04,282 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-18 00:49:04,282 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4966#true} {4973#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #105#return; {4973#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:04,286 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-18 00:49:04,287 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-18 00:49:04,287 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-18 00:49:04,288 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4966#true} {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #107#return; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:04,292 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-18 00:49:04,292 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-18 00:49:04,292 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-18 00:49:04,293 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4966#true} {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #109#return; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:04,301 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-18 00:49:04,301 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-18 00:49:04,301 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-18 00:49:04,302 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4966#true} {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #111#return; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:04,306 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-18 00:49:04,307 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-18 00:49:04,307 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-18 00:49:04,308 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4966#true} {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #113#return; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:04,313 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-18 00:49:04,313 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-18 00:49:04,314 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-18 00:49:04,314 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4966#true} {5000#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #115#return; {5000#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,315 INFO L263 TraceCheckUtils]: 0: Hoare triple {4966#true} call ULTIMATE.init(); {4966#true} is VALID [2020-07-18 00:49:04,315 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-18 00:49:04,315 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4966#true} {4966#true} #99#return; {4966#true} is VALID [2020-07-18 00:49:04,315 INFO L263 TraceCheckUtils]: 3: Hoare triple {4966#true} call #t~ret7 := main(); {4966#true} is VALID [2020-07-18 00:49:04,316 INFO L280 TraceCheckUtils]: 4: Hoare triple {4966#true} havoc ~in~0; {4966#true} is VALID [2020-07-18 00:49:04,316 INFO L280 TraceCheckUtils]: 5: Hoare triple {4966#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4966#true} is VALID [2020-07-18 00:49:04,316 INFO L280 TraceCheckUtils]: 6: Hoare triple {4966#true} ~inlen~0 := #t~nondet0; {4966#true} is VALID [2020-07-18 00:49:04,316 INFO L280 TraceCheckUtils]: 7: Hoare triple {4966#true} havoc #t~nondet0; {4966#true} is VALID [2020-07-18 00:49:04,316 INFO L280 TraceCheckUtils]: 8: Hoare triple {4966#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4966#true} is VALID [2020-07-18 00:49:04,317 INFO L280 TraceCheckUtils]: 9: Hoare triple {4966#true} ~bufferlen~0 := #t~nondet1; {4966#true} is VALID [2020-07-18 00:49:04,317 INFO L280 TraceCheckUtils]: 10: Hoare triple {4966#true} havoc #t~nondet1; {4966#true} is VALID [2020-07-18 00:49:04,317 INFO L280 TraceCheckUtils]: 11: Hoare triple {4966#true} havoc ~buf~0; {4966#true} is VALID [2020-07-18 00:49:04,317 INFO L280 TraceCheckUtils]: 12: Hoare triple {4966#true} havoc ~buflim~0; {4966#true} is VALID [2020-07-18 00:49:04,318 INFO L280 TraceCheckUtils]: 13: Hoare triple {4966#true} assume ~bufferlen~0 > 1; {4970#(<= 2 main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,318 INFO L280 TraceCheckUtils]: 14: Hoare triple {4970#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {4970#(<= 2 main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,319 INFO L280 TraceCheckUtils]: 15: Hoare triple {4970#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {4970#(<= 2 main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,320 INFO L280 TraceCheckUtils]: 16: Hoare triple {4970#(<= 2 main_~bufferlen~0)} ~buf~0 := 0; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,320 INFO L280 TraceCheckUtils]: 17: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~in~0 := 0; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,321 INFO L280 TraceCheckUtils]: 18: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~buflim~0 := ~bufferlen~0 - 2; {4972#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:04,322 INFO L280 TraceCheckUtils]: 19: Hoare triple {4972#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4972#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:04,322 INFO L280 TraceCheckUtils]: 20: Hoare triple {4972#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} assume !!(0 != #t~nondet2); {4972#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:04,323 INFO L280 TraceCheckUtils]: 21: Hoare triple {4972#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} havoc #t~nondet2; {4972#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:04,324 INFO L280 TraceCheckUtils]: 22: Hoare triple {4972#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} assume !(~buf~0 == ~buflim~0); {4973#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,324 INFO L263 TraceCheckUtils]: 23: Hoare triple {4973#(<= (+ main_~buf~0 3) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {4966#true} is VALID [2020-07-18 00:49:04,324 INFO L280 TraceCheckUtils]: 24: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-18 00:49:04,324 INFO L280 TraceCheckUtils]: 25: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-18 00:49:04,325 INFO L280 TraceCheckUtils]: 26: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-18 00:49:04,325 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {4966#true} {4973#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #103#return; {4973#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,326 INFO L263 TraceCheckUtils]: 28: Hoare triple {4973#(<= (+ main_~buf~0 3) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {4966#true} is VALID [2020-07-18 00:49:04,326 INFO L280 TraceCheckUtils]: 29: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-18 00:49:04,326 INFO L280 TraceCheckUtils]: 30: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-18 00:49:04,326 INFO L280 TraceCheckUtils]: 31: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-18 00:49:04,331 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {4966#true} {4973#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #105#return; {4973#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,331 INFO L280 TraceCheckUtils]: 33: Hoare triple {4973#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #t~post3 := ~buf~0; {4982#(<= (+ |main_#t~post3| 3) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,332 INFO L280 TraceCheckUtils]: 34: Hoare triple {4982#(<= (+ |main_#t~post3| 3) main_~bufferlen~0)} ~buf~0 := 1 + #t~post3; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,333 INFO L280 TraceCheckUtils]: 35: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} havoc #t~post3; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,334 INFO L280 TraceCheckUtils]: 36: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #t~post4 := ~in~0; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,334 INFO L280 TraceCheckUtils]: 37: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~in~0 := 1 + #t~post4; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,335 INFO L280 TraceCheckUtils]: 38: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} havoc #t~post4; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,335 INFO L263 TraceCheckUtils]: 39: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {4966#true} is VALID [2020-07-18 00:49:04,335 INFO L280 TraceCheckUtils]: 40: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-18 00:49:04,336 INFO L280 TraceCheckUtils]: 41: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-18 00:49:04,336 INFO L280 TraceCheckUtils]: 42: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-18 00:49:04,337 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {4966#true} {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #107#return; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,337 INFO L263 TraceCheckUtils]: 44: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {4966#true} is VALID [2020-07-18 00:49:04,337 INFO L280 TraceCheckUtils]: 45: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-18 00:49:04,337 INFO L280 TraceCheckUtils]: 46: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-18 00:49:04,337 INFO L280 TraceCheckUtils]: 47: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-18 00:49:04,338 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {4966#true} {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #109#return; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,339 INFO L280 TraceCheckUtils]: 49: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,339 INFO L280 TraceCheckUtils]: 50: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume !(0 != #t~nondet2); {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,340 INFO L280 TraceCheckUtils]: 51: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} havoc #t~nondet2; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,340 INFO L263 TraceCheckUtils]: 52: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {4966#true} is VALID [2020-07-18 00:49:04,340 INFO L280 TraceCheckUtils]: 53: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-18 00:49:04,340 INFO L280 TraceCheckUtils]: 54: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-18 00:49:04,340 INFO L280 TraceCheckUtils]: 55: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-18 00:49:04,341 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {4966#true} {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #111#return; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,342 INFO L263 TraceCheckUtils]: 57: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {4966#true} is VALID [2020-07-18 00:49:04,342 INFO L280 TraceCheckUtils]: 58: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-18 00:49:04,342 INFO L280 TraceCheckUtils]: 59: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-18 00:49:04,342 INFO L280 TraceCheckUtils]: 60: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-18 00:49:04,343 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {4966#true} {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #113#return; {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,343 INFO L280 TraceCheckUtils]: 62: Hoare triple {4971#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #t~post5 := ~buf~0; {4999#(<= (+ |main_#t~post5| 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,344 INFO L280 TraceCheckUtils]: 63: Hoare triple {4999#(<= (+ |main_#t~post5| 2) main_~bufferlen~0)} ~buf~0 := 1 + #t~post5; {5000#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,345 INFO L280 TraceCheckUtils]: 64: Hoare triple {5000#(<= (+ main_~buf~0 1) main_~bufferlen~0)} havoc #t~post5; {5000#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,345 INFO L263 TraceCheckUtils]: 65: Hoare triple {5000#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {4966#true} is VALID [2020-07-18 00:49:04,345 INFO L280 TraceCheckUtils]: 66: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-18 00:49:04,345 INFO L280 TraceCheckUtils]: 67: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-18 00:49:04,346 INFO L280 TraceCheckUtils]: 68: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-18 00:49:04,346 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {4966#true} {5000#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #115#return; {5000#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:04,347 INFO L263 TraceCheckUtils]: 70: Hoare triple {5000#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {5005#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:49:04,348 INFO L280 TraceCheckUtils]: 71: Hoare triple {5005#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {5006#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:49:04,348 INFO L280 TraceCheckUtils]: 72: Hoare triple {5006#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4967#false} is VALID [2020-07-18 00:49:04,348 INFO L280 TraceCheckUtils]: 73: Hoare triple {4967#false} assume !false; {4967#false} is VALID [2020-07-18 00:49:04,368 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-18 00:49:04,368 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:04,369 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1141767551] [2020-07-18 00:49:04,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:04,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-18 00:49:04,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062097536] [2020-07-18 00:49:04,371 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2020-07-18 00:49:04,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:04,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-18 00:49:04,428 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-18 00:49:04,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-18 00:49:04,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:04,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-18 00:49:04,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-18 00:49:04,429 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 11 states. [2020-07-18 00:49:05,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:05,812 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2020-07-18 00:49:05,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-18 00:49:05,812 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2020-07-18 00:49:05,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:05,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 00:49:05,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 113 transitions. [2020-07-18 00:49:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 00:49:05,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 113 transitions. [2020-07-18 00:49:05,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 113 transitions. [2020-07-18 00:49:05,954 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-18 00:49:05,958 INFO L225 Difference]: With dead ends: 119 [2020-07-18 00:49:05,958 INFO L226 Difference]: Without dead ends: 101 [2020-07-18 00:49:05,959 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2020-07-18 00:49:05,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-18 00:49:06,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2020-07-18 00:49:06,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:06,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 95 states. [2020-07-18 00:49:06,141 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 95 states. [2020-07-18 00:49:06,141 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 95 states. [2020-07-18 00:49:06,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:06,144 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2020-07-18 00:49:06,144 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2020-07-18 00:49:06,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:06,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:06,145 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 101 states. [2020-07-18 00:49:06,145 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 101 states. [2020-07-18 00:49:06,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:06,148 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2020-07-18 00:49:06,148 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2020-07-18 00:49:06,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:06,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:06,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:06,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:06,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-07-18 00:49:06,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2020-07-18 00:49:06,152 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 74 [2020-07-18 00:49:06,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:06,152 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2020-07-18 00:49:06,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-18 00:49:06,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 95 states and 102 transitions. [2020-07-18 00:49:06,294 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-18 00:49:06,295 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2020-07-18 00:49:06,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-18 00:49:06,296 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:06,296 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 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] [2020-07-18 00:49:06,296 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-18 00:49:06,296 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:06,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:06,297 INFO L82 PathProgramCache]: Analyzing trace with hash -50388093, now seen corresponding path program 1 times [2020-07-18 00:49:06,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:06,298 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [448340444] [2020-07-18 00:49:06,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:06,459 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-18 00:49:06,459 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5661#true} {5661#true} #99#return; {5661#true} is VALID [2020-07-18 00:49:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:06,465 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-18 00:49:06,465 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-18 00:49:06,466 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-18 00:49:06,466 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5661#true} {5667#(<= (+ main_~in~0 3) main_~inlen~0)} #103#return; {5667#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:06,474 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-18 00:49:06,474 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-18 00:49:06,474 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-18 00:49:06,475 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5661#true} {5667#(<= (+ main_~in~0 3) main_~inlen~0)} #105#return; {5667#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:06,486 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-18 00:49:06,486 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-18 00:49:06,486 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-18 00:49:06,487 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5661#true} {5677#(<= (+ main_~in~0 2) main_~inlen~0)} #107#return; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:06,493 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-18 00:49:06,493 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-18 00:49:06,493 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-18 00:49:06,494 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5661#true} {5677#(<= (+ main_~in~0 2) main_~inlen~0)} #109#return; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:06,501 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-18 00:49:06,501 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-18 00:49:06,501 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-18 00:49:06,502 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5661#true} {5677#(<= (+ main_~in~0 2) main_~inlen~0)} #103#return; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:06,506 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-18 00:49:06,506 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-18 00:49:06,506 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-18 00:49:06,507 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5661#true} {5677#(<= (+ main_~in~0 2) main_~inlen~0)} #105#return; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:06,513 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-18 00:49:06,513 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-18 00:49:06,514 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-18 00:49:06,515 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5661#true} {5695#(<= (+ main_~in~0 1) main_~inlen~0)} #107#return; {5695#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-18 00:49:06,515 INFO L263 TraceCheckUtils]: 0: Hoare triple {5661#true} call ULTIMATE.init(); {5661#true} is VALID [2020-07-18 00:49:06,515 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-18 00:49:06,515 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5661#true} {5661#true} #99#return; {5661#true} is VALID [2020-07-18 00:49:06,515 INFO L263 TraceCheckUtils]: 3: Hoare triple {5661#true} call #t~ret7 := main(); {5661#true} is VALID [2020-07-18 00:49:06,516 INFO L280 TraceCheckUtils]: 4: Hoare triple {5661#true} havoc ~in~0; {5661#true} is VALID [2020-07-18 00:49:06,516 INFO L280 TraceCheckUtils]: 5: Hoare triple {5661#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {5661#true} is VALID [2020-07-18 00:49:06,516 INFO L280 TraceCheckUtils]: 6: Hoare triple {5661#true} ~inlen~0 := #t~nondet0; {5661#true} is VALID [2020-07-18 00:49:06,516 INFO L280 TraceCheckUtils]: 7: Hoare triple {5661#true} havoc #t~nondet0; {5661#true} is VALID [2020-07-18 00:49:06,516 INFO L280 TraceCheckUtils]: 8: Hoare triple {5661#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5661#true} is VALID [2020-07-18 00:49:06,516 INFO L280 TraceCheckUtils]: 9: Hoare triple {5661#true} ~bufferlen~0 := #t~nondet1; {5661#true} is VALID [2020-07-18 00:49:06,517 INFO L280 TraceCheckUtils]: 10: Hoare triple {5661#true} havoc #t~nondet1; {5661#true} is VALID [2020-07-18 00:49:06,517 INFO L280 TraceCheckUtils]: 11: Hoare triple {5661#true} havoc ~buf~0; {5661#true} is VALID [2020-07-18 00:49:06,517 INFO L280 TraceCheckUtils]: 12: Hoare triple {5661#true} havoc ~buflim~0; {5661#true} is VALID [2020-07-18 00:49:06,523 INFO L280 TraceCheckUtils]: 13: Hoare triple {5661#true} assume ~bufferlen~0 > 1; {5665#(<= 2 main_~bufferlen~0)} is VALID [2020-07-18 00:49:06,523 INFO L280 TraceCheckUtils]: 14: Hoare triple {5665#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {5665#(<= 2 main_~bufferlen~0)} is VALID [2020-07-18 00:49:06,524 INFO L280 TraceCheckUtils]: 15: Hoare triple {5665#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {5666#(<= 3 main_~inlen~0)} is VALID [2020-07-18 00:49:06,524 INFO L280 TraceCheckUtils]: 16: Hoare triple {5666#(<= 3 main_~inlen~0)} ~buf~0 := 0; {5666#(<= 3 main_~inlen~0)} is VALID [2020-07-18 00:49:06,525 INFO L280 TraceCheckUtils]: 17: Hoare triple {5666#(<= 3 main_~inlen~0)} ~in~0 := 0; {5667#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:06,525 INFO L280 TraceCheckUtils]: 18: Hoare triple {5667#(<= (+ main_~in~0 3) main_~inlen~0)} ~buflim~0 := ~bufferlen~0 - 2; {5667#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:06,526 INFO L280 TraceCheckUtils]: 19: Hoare triple {5667#(<= (+ main_~in~0 3) main_~inlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {5667#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:06,526 INFO L280 TraceCheckUtils]: 20: Hoare triple {5667#(<= (+ main_~in~0 3) main_~inlen~0)} assume !!(0 != #t~nondet2); {5667#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:06,527 INFO L280 TraceCheckUtils]: 21: Hoare triple {5667#(<= (+ main_~in~0 3) main_~inlen~0)} havoc #t~nondet2; {5667#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:06,527 INFO L280 TraceCheckUtils]: 22: Hoare triple {5667#(<= (+ main_~in~0 3) main_~inlen~0)} assume !(~buf~0 == ~buflim~0); {5667#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:06,528 INFO L263 TraceCheckUtils]: 23: Hoare triple {5667#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {5661#true} is VALID [2020-07-18 00:49:06,528 INFO L280 TraceCheckUtils]: 24: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-18 00:49:06,528 INFO L280 TraceCheckUtils]: 25: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-18 00:49:06,528 INFO L280 TraceCheckUtils]: 26: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-18 00:49:06,529 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {5661#true} {5667#(<= (+ main_~in~0 3) main_~inlen~0)} #103#return; {5667#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:06,529 INFO L263 TraceCheckUtils]: 28: Hoare triple {5667#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {5661#true} is VALID [2020-07-18 00:49:06,529 INFO L280 TraceCheckUtils]: 29: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-18 00:49:06,529 INFO L280 TraceCheckUtils]: 30: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-18 00:49:06,530 INFO L280 TraceCheckUtils]: 31: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-18 00:49:06,530 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {5661#true} {5667#(<= (+ main_~in~0 3) main_~inlen~0)} #105#return; {5667#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:06,531 INFO L280 TraceCheckUtils]: 33: Hoare triple {5667#(<= (+ main_~in~0 3) main_~inlen~0)} #t~post3 := ~buf~0; {5667#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:06,531 INFO L280 TraceCheckUtils]: 34: Hoare triple {5667#(<= (+ main_~in~0 3) main_~inlen~0)} ~buf~0 := 1 + #t~post3; {5667#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:06,532 INFO L280 TraceCheckUtils]: 35: Hoare triple {5667#(<= (+ main_~in~0 3) main_~inlen~0)} havoc #t~post3; {5667#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:06,532 INFO L280 TraceCheckUtils]: 36: Hoare triple {5667#(<= (+ main_~in~0 3) main_~inlen~0)} #t~post4 := ~in~0; {5676#(<= (+ |main_#t~post4| 3) main_~inlen~0)} is VALID [2020-07-18 00:49:06,533 INFO L280 TraceCheckUtils]: 37: Hoare triple {5676#(<= (+ |main_#t~post4| 3) main_~inlen~0)} ~in~0 := 1 + #t~post4; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:06,534 INFO L280 TraceCheckUtils]: 38: Hoare triple {5677#(<= (+ main_~in~0 2) main_~inlen~0)} havoc #t~post4; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:06,534 INFO L263 TraceCheckUtils]: 39: Hoare triple {5677#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {5661#true} is VALID [2020-07-18 00:49:06,534 INFO L280 TraceCheckUtils]: 40: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-18 00:49:06,534 INFO L280 TraceCheckUtils]: 41: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-18 00:49:06,534 INFO L280 TraceCheckUtils]: 42: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-18 00:49:06,535 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {5661#true} {5677#(<= (+ main_~in~0 2) main_~inlen~0)} #107#return; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:06,535 INFO L263 TraceCheckUtils]: 44: Hoare triple {5677#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {5661#true} is VALID [2020-07-18 00:49:06,535 INFO L280 TraceCheckUtils]: 45: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-18 00:49:06,536 INFO L280 TraceCheckUtils]: 46: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-18 00:49:06,536 INFO L280 TraceCheckUtils]: 47: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-18 00:49:06,536 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {5661#true} {5677#(<= (+ main_~in~0 2) main_~inlen~0)} #109#return; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:06,537 INFO L280 TraceCheckUtils]: 49: Hoare triple {5677#(<= (+ main_~in~0 2) main_~inlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:06,537 INFO L280 TraceCheckUtils]: 50: Hoare triple {5677#(<= (+ main_~in~0 2) main_~inlen~0)} assume !!(0 != #t~nondet2); {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:06,538 INFO L280 TraceCheckUtils]: 51: Hoare triple {5677#(<= (+ main_~in~0 2) main_~inlen~0)} havoc #t~nondet2; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:06,538 INFO L280 TraceCheckUtils]: 52: Hoare triple {5677#(<= (+ main_~in~0 2) main_~inlen~0)} assume !(~buf~0 == ~buflim~0); {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:06,538 INFO L263 TraceCheckUtils]: 53: Hoare triple {5677#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {5661#true} is VALID [2020-07-18 00:49:06,539 INFO L280 TraceCheckUtils]: 54: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-18 00:49:06,539 INFO L280 TraceCheckUtils]: 55: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-18 00:49:06,539 INFO L280 TraceCheckUtils]: 56: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-18 00:49:06,540 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {5661#true} {5677#(<= (+ main_~in~0 2) main_~inlen~0)} #103#return; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:06,540 INFO L263 TraceCheckUtils]: 58: Hoare triple {5677#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {5661#true} is VALID [2020-07-18 00:49:06,540 INFO L280 TraceCheckUtils]: 59: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-18 00:49:06,540 INFO L280 TraceCheckUtils]: 60: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-18 00:49:06,540 INFO L280 TraceCheckUtils]: 61: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-18 00:49:06,541 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {5661#true} {5677#(<= (+ main_~in~0 2) main_~inlen~0)} #105#return; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:06,542 INFO L280 TraceCheckUtils]: 63: Hoare triple {5677#(<= (+ main_~in~0 2) main_~inlen~0)} #t~post3 := ~buf~0; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:06,542 INFO L280 TraceCheckUtils]: 64: Hoare triple {5677#(<= (+ main_~in~0 2) main_~inlen~0)} ~buf~0 := 1 + #t~post3; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:06,543 INFO L280 TraceCheckUtils]: 65: Hoare triple {5677#(<= (+ main_~in~0 2) main_~inlen~0)} havoc #t~post3; {5677#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:06,543 INFO L280 TraceCheckUtils]: 66: Hoare triple {5677#(<= (+ main_~in~0 2) main_~inlen~0)} #t~post4 := ~in~0; {5694#(<= (+ |main_#t~post4| 2) main_~inlen~0)} is VALID [2020-07-18 00:49:06,544 INFO L280 TraceCheckUtils]: 67: Hoare triple {5694#(<= (+ |main_#t~post4| 2) main_~inlen~0)} ~in~0 := 1 + #t~post4; {5695#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-18 00:49:06,544 INFO L280 TraceCheckUtils]: 68: Hoare triple {5695#(<= (+ main_~in~0 1) main_~inlen~0)} havoc #t~post4; {5695#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-18 00:49:06,545 INFO L263 TraceCheckUtils]: 69: Hoare triple {5695#(<= (+ main_~in~0 1) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {5661#true} is VALID [2020-07-18 00:49:06,545 INFO L280 TraceCheckUtils]: 70: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-18 00:49:06,545 INFO L280 TraceCheckUtils]: 71: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-18 00:49:06,545 INFO L280 TraceCheckUtils]: 72: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-18 00:49:06,546 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {5661#true} {5695#(<= (+ main_~in~0 1) main_~inlen~0)} #107#return; {5695#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-18 00:49:06,547 INFO L263 TraceCheckUtils]: 74: Hoare triple {5695#(<= (+ main_~in~0 1) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {5700#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:49:06,547 INFO L280 TraceCheckUtils]: 75: Hoare triple {5700#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {5701#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:49:06,548 INFO L280 TraceCheckUtils]: 76: Hoare triple {5701#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {5662#false} is VALID [2020-07-18 00:49:06,548 INFO L280 TraceCheckUtils]: 77: Hoare triple {5662#false} assume !false; {5662#false} is VALID [2020-07-18 00:49:06,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-18 00:49:06,554 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:06,555 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [448340444] [2020-07-18 00:49:06,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:06,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-18 00:49:06,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450862757] [2020-07-18 00:49:06,556 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2020-07-18 00:49:06,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:06,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-18 00:49:06,616 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-18 00:49:06,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-18 00:49:06,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:06,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-18 00:49:06,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-18 00:49:06,617 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 11 states. [2020-07-18 00:49:08,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:08,103 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2020-07-18 00:49:08,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-18 00:49:08,103 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2020-07-18 00:49:08,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:08,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 00:49:08,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 122 transitions. [2020-07-18 00:49:08,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 00:49:08,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 122 transitions. [2020-07-18 00:49:08,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 122 transitions. [2020-07-18 00:49:08,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:08,287 INFO L225 Difference]: With dead ends: 128 [2020-07-18 00:49:08,288 INFO L226 Difference]: Without dead ends: 126 [2020-07-18 00:49:08,288 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2020-07-18 00:49:08,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-07-18 00:49:08,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 107. [2020-07-18 00:49:08,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:08,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 107 states. [2020-07-18 00:49:08,496 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 107 states. [2020-07-18 00:49:08,496 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 107 states. [2020-07-18 00:49:08,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:08,500 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2020-07-18 00:49:08,501 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2020-07-18 00:49:08,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:08,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:08,502 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 126 states. [2020-07-18 00:49:08,502 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 126 states. [2020-07-18 00:49:08,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:08,505 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2020-07-18 00:49:08,506 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2020-07-18 00:49:08,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:08,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:08,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:08,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:08,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-07-18 00:49:08,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2020-07-18 00:49:08,509 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 78 [2020-07-18 00:49:08,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:08,510 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2020-07-18 00:49:08,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-18 00:49:08,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 107 states and 115 transitions. [2020-07-18 00:49:08,671 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-18 00:49:08,671 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2020-07-18 00:49:08,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-18 00:49:08,673 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:08,673 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 3, 2, 2, 2, 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] [2020-07-18 00:49:08,673 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-18 00:49:08,673 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:08,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:08,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1911943399, now seen corresponding path program 2 times [2020-07-18 00:49:08,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:08,674 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1250073615] [2020-07-18 00:49:08,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:08,951 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-18 00:49:08,951 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {6444#true} {6444#true} #99#return; {6444#true} is VALID [2020-07-18 00:49:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:08,956 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-18 00:49:08,957 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-18 00:49:08,957 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-18 00:49:08,958 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6444#true} {6451#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #103#return; {6451#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-18 00:49:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:08,965 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-18 00:49:08,966 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-18 00:49:08,966 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-18 00:49:08,967 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6444#true} {6451#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #105#return; {6451#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-18 00:49:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:08,970 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-18 00:49:08,971 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-18 00:49:08,971 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-18 00:49:08,973 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6444#true} {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #107#return; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:08,985 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-18 00:49:08,986 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-18 00:49:08,986 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-18 00:49:08,987 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6444#true} {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #109#return; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:08,998 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-18 00:49:08,999 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-18 00:49:08,999 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-18 00:49:09,000 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6444#true} {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #103#return; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:09,005 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-18 00:49:09,006 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-18 00:49:09,006 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-18 00:49:09,007 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6444#true} {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #105#return; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:09,016 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-18 00:49:09,017 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-18 00:49:09,017 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-18 00:49:09,018 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6444#true} {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #107#return; {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:09,024 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-18 00:49:09,024 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-18 00:49:09,024 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-18 00:49:09,026 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6444#true} {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #109#return; {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:09,032 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-18 00:49:09,033 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-18 00:49:09,033 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-18 00:49:09,034 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6444#true} {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #111#return; {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,035 INFO L263 TraceCheckUtils]: 0: Hoare triple {6444#true} call ULTIMATE.init(); {6444#true} is VALID [2020-07-18 00:49:09,035 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-18 00:49:09,035 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6444#true} {6444#true} #99#return; {6444#true} is VALID [2020-07-18 00:49:09,036 INFO L263 TraceCheckUtils]: 3: Hoare triple {6444#true} call #t~ret7 := main(); {6444#true} is VALID [2020-07-18 00:49:09,036 INFO L280 TraceCheckUtils]: 4: Hoare triple {6444#true} havoc ~in~0; {6444#true} is VALID [2020-07-18 00:49:09,036 INFO L280 TraceCheckUtils]: 5: Hoare triple {6444#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {6444#true} is VALID [2020-07-18 00:49:09,037 INFO L280 TraceCheckUtils]: 6: Hoare triple {6444#true} ~inlen~0 := #t~nondet0; {6444#true} is VALID [2020-07-18 00:49:09,037 INFO L280 TraceCheckUtils]: 7: Hoare triple {6444#true} havoc #t~nondet0; {6444#true} is VALID [2020-07-18 00:49:09,037 INFO L280 TraceCheckUtils]: 8: Hoare triple {6444#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {6444#true} is VALID [2020-07-18 00:49:09,038 INFO L280 TraceCheckUtils]: 9: Hoare triple {6444#true} ~bufferlen~0 := #t~nondet1; {6444#true} is VALID [2020-07-18 00:49:09,038 INFO L280 TraceCheckUtils]: 10: Hoare triple {6444#true} havoc #t~nondet1; {6444#true} is VALID [2020-07-18 00:49:09,038 INFO L280 TraceCheckUtils]: 11: Hoare triple {6444#true} havoc ~buf~0; {6444#true} is VALID [2020-07-18 00:49:09,039 INFO L280 TraceCheckUtils]: 12: Hoare triple {6444#true} havoc ~buflim~0; {6444#true} is VALID [2020-07-18 00:49:09,040 INFO L280 TraceCheckUtils]: 13: Hoare triple {6444#true} assume ~bufferlen~0 > 1; {6448#(<= 2 main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,041 INFO L280 TraceCheckUtils]: 14: Hoare triple {6448#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {6448#(<= 2 main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,041 INFO L280 TraceCheckUtils]: 15: Hoare triple {6448#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {6448#(<= 2 main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,042 INFO L280 TraceCheckUtils]: 16: Hoare triple {6448#(<= 2 main_~bufferlen~0)} ~buf~0 := 0; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,044 INFO L280 TraceCheckUtils]: 17: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~in~0 := 0; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,045 INFO L280 TraceCheckUtils]: 18: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~buflim~0 := ~bufferlen~0 - 2; {6450#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:09,046 INFO L280 TraceCheckUtils]: 19: Hoare triple {6450#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {6450#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:09,047 INFO L280 TraceCheckUtils]: 20: Hoare triple {6450#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} assume !!(0 != #t~nondet2); {6450#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:09,048 INFO L280 TraceCheckUtils]: 21: Hoare triple {6450#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} havoc #t~nondet2; {6450#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:09,050 INFO L280 TraceCheckUtils]: 22: Hoare triple {6450#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} assume !(~buf~0 == ~buflim~0); {6451#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,050 INFO L263 TraceCheckUtils]: 23: Hoare triple {6451#(<= (+ main_~buf~0 3) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {6444#true} is VALID [2020-07-18 00:49:09,050 INFO L280 TraceCheckUtils]: 24: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-18 00:49:09,051 INFO L280 TraceCheckUtils]: 25: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-18 00:49:09,051 INFO L280 TraceCheckUtils]: 26: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-18 00:49:09,052 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {6444#true} {6451#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #103#return; {6451#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,052 INFO L263 TraceCheckUtils]: 28: Hoare triple {6451#(<= (+ main_~buf~0 3) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {6444#true} is VALID [2020-07-18 00:49:09,053 INFO L280 TraceCheckUtils]: 29: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-18 00:49:09,053 INFO L280 TraceCheckUtils]: 30: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-18 00:49:09,053 INFO L280 TraceCheckUtils]: 31: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-18 00:49:09,054 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {6444#true} {6451#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #105#return; {6451#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,055 INFO L280 TraceCheckUtils]: 33: Hoare triple {6451#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #t~post3 := ~buf~0; {6460#(<= (+ |main_#t~post3| 3) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,057 INFO L280 TraceCheckUtils]: 34: Hoare triple {6460#(<= (+ |main_#t~post3| 3) main_~bufferlen~0)} ~buf~0 := 1 + #t~post3; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,057 INFO L280 TraceCheckUtils]: 35: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} havoc #t~post3; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,058 INFO L280 TraceCheckUtils]: 36: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #t~post4 := ~in~0; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,059 INFO L280 TraceCheckUtils]: 37: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~in~0 := 1 + #t~post4; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,060 INFO L280 TraceCheckUtils]: 38: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} havoc #t~post4; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,060 INFO L263 TraceCheckUtils]: 39: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {6444#true} is VALID [2020-07-18 00:49:09,060 INFO L280 TraceCheckUtils]: 40: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-18 00:49:09,060 INFO L280 TraceCheckUtils]: 41: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-18 00:49:09,061 INFO L280 TraceCheckUtils]: 42: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-18 00:49:09,061 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {6444#true} {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #107#return; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,062 INFO L263 TraceCheckUtils]: 44: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {6444#true} is VALID [2020-07-18 00:49:09,062 INFO L280 TraceCheckUtils]: 45: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-18 00:49:09,062 INFO L280 TraceCheckUtils]: 46: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-18 00:49:09,062 INFO L280 TraceCheckUtils]: 47: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-18 00:49:09,063 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {6444#true} {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #109#return; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,064 INFO L280 TraceCheckUtils]: 49: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,065 INFO L280 TraceCheckUtils]: 50: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume !!(0 != #t~nondet2); {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,065 INFO L280 TraceCheckUtils]: 51: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} havoc #t~nondet2; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,066 INFO L280 TraceCheckUtils]: 52: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume !(~buf~0 == ~buflim~0); {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,066 INFO L263 TraceCheckUtils]: 53: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {6444#true} is VALID [2020-07-18 00:49:09,067 INFO L280 TraceCheckUtils]: 54: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-18 00:49:09,067 INFO L280 TraceCheckUtils]: 55: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-18 00:49:09,067 INFO L280 TraceCheckUtils]: 56: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-18 00:49:09,069 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {6444#true} {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #103#return; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,069 INFO L263 TraceCheckUtils]: 58: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {6444#true} is VALID [2020-07-18 00:49:09,069 INFO L280 TraceCheckUtils]: 59: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-18 00:49:09,069 INFO L280 TraceCheckUtils]: 60: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-18 00:49:09,069 INFO L280 TraceCheckUtils]: 61: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-18 00:49:09,070 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {6444#true} {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #105#return; {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,071 INFO L280 TraceCheckUtils]: 63: Hoare triple {6449#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #t~post3 := ~buf~0; {6477#(<= (+ |main_#t~post3| 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,072 INFO L280 TraceCheckUtils]: 64: Hoare triple {6477#(<= (+ |main_#t~post3| 2) main_~bufferlen~0)} ~buf~0 := 1 + #t~post3; {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,072 INFO L280 TraceCheckUtils]: 65: Hoare triple {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} havoc #t~post3; {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,073 INFO L280 TraceCheckUtils]: 66: Hoare triple {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #t~post4 := ~in~0; {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,073 INFO L280 TraceCheckUtils]: 67: Hoare triple {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} ~in~0 := 1 + #t~post4; {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,074 INFO L280 TraceCheckUtils]: 68: Hoare triple {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} havoc #t~post4; {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,074 INFO L263 TraceCheckUtils]: 69: Hoare triple {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {6444#true} is VALID [2020-07-18 00:49:09,074 INFO L280 TraceCheckUtils]: 70: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-18 00:49:09,074 INFO L280 TraceCheckUtils]: 71: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-18 00:49:09,075 INFO L280 TraceCheckUtils]: 72: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-18 00:49:09,075 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {6444#true} {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #107#return; {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,076 INFO L263 TraceCheckUtils]: 74: Hoare triple {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {6444#true} is VALID [2020-07-18 00:49:09,076 INFO L280 TraceCheckUtils]: 75: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-18 00:49:09,076 INFO L280 TraceCheckUtils]: 76: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-18 00:49:09,076 INFO L280 TraceCheckUtils]: 77: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-18 00:49:09,077 INFO L275 TraceCheckUtils]: 78: Hoare quadruple {6444#true} {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #109#return; {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,077 INFO L280 TraceCheckUtils]: 79: Hoare triple {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,078 INFO L280 TraceCheckUtils]: 80: Hoare triple {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} assume !(0 != #t~nondet2); {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,079 INFO L280 TraceCheckUtils]: 81: Hoare triple {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} havoc #t~nondet2; {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,079 INFO L263 TraceCheckUtils]: 82: Hoare triple {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {6444#true} is VALID [2020-07-18 00:49:09,080 INFO L280 TraceCheckUtils]: 83: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-18 00:49:09,080 INFO L280 TraceCheckUtils]: 84: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-18 00:49:09,080 INFO L280 TraceCheckUtils]: 85: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-18 00:49:09,081 INFO L275 TraceCheckUtils]: 86: Hoare quadruple {6444#true} {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #111#return; {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:09,083 INFO L263 TraceCheckUtils]: 87: Hoare triple {6478#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {6491#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:49:09,084 INFO L280 TraceCheckUtils]: 88: Hoare triple {6491#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {6492#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:49:09,086 INFO L280 TraceCheckUtils]: 89: Hoare triple {6492#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {6445#false} is VALID [2020-07-18 00:49:09,086 INFO L280 TraceCheckUtils]: 90: Hoare triple {6445#false} assume !false; {6445#false} is VALID [2020-07-18 00:49:09,105 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-18 00:49:09,105 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:09,105 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1250073615] [2020-07-18 00:49:09,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:09,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-18 00:49:09,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940664520] [2020-07-18 00:49:09,107 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2020-07-18 00:49:09,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:09,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-18 00:49:09,209 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:09,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-18 00:49:09,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:09,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-18 00:49:09,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-18 00:49:09,210 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 11 states. [2020-07-18 00:49:10,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:10,689 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2020-07-18 00:49:10,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-18 00:49:10,689 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2020-07-18 00:49:10,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:10,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 00:49:10,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2020-07-18 00:49:10,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 00:49:10,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2020-07-18 00:49:10,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 127 transitions. [2020-07-18 00:49:10,894 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:10,902 INFO L225 Difference]: With dead ends: 134 [2020-07-18 00:49:10,902 INFO L226 Difference]: Without dead ends: 132 [2020-07-18 00:49:10,903 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2020-07-18 00:49:10,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-07-18 00:49:11,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 120. [2020-07-18 00:49:11,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:11,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 120 states. [2020-07-18 00:49:11,172 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 120 states. [2020-07-18 00:49:11,172 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 120 states. [2020-07-18 00:49:11,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:11,177 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2020-07-18 00:49:11,177 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2020-07-18 00:49:11,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:11,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:11,178 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 132 states. [2020-07-18 00:49:11,178 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 132 states. [2020-07-18 00:49:11,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:11,182 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2020-07-18 00:49:11,182 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2020-07-18 00:49:11,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:11,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:11,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:11,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:11,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-07-18 00:49:11,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2020-07-18 00:49:11,186 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 91 [2020-07-18 00:49:11,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:11,186 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2020-07-18 00:49:11,186 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-18 00:49:11,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 120 states and 133 transitions. [2020-07-18 00:49:11,384 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-18 00:49:11,384 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2020-07-18 00:49:11,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-07-18 00:49:11,386 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:11,386 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 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] [2020-07-18 00:49:11,386 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-18 00:49:11,387 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:11,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:11,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1949077486, now seen corresponding path program 2 times [2020-07-18 00:49:11,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:11,387 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1596447002] [2020-07-18 00:49:11,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:11,640 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-18 00:49:11,640 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {7289#true} {7289#true} #99#return; {7289#true} is VALID [2020-07-18 00:49:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:11,645 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-18 00:49:11,645 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-18 00:49:11,645 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-18 00:49:11,646 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7289#true} {7296#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #103#return; {7296#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-18 00:49:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:11,649 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-18 00:49:11,650 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-18 00:49:11,650 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-18 00:49:11,651 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7289#true} {7296#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #105#return; {7296#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-18 00:49:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:11,655 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-18 00:49:11,655 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-18 00:49:11,656 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-18 00:49:11,656 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7289#true} {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} #107#return; {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:11,661 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-18 00:49:11,661 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-18 00:49:11,661 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-18 00:49:11,662 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7289#true} {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} #109#return; {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:11,666 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-18 00:49:11,666 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-18 00:49:11,667 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-18 00:49:11,673 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7289#true} {7314#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #103#return; {7314#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:11,677 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-18 00:49:11,678 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-18 00:49:11,678 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-18 00:49:11,678 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7289#true} {7314#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #105#return; {7314#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:11,682 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-18 00:49:11,682 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-18 00:49:11,682 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-18 00:49:11,683 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7289#true} {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #107#return; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:11,686 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-18 00:49:11,687 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-18 00:49:11,687 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-18 00:49:11,688 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7289#true} {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #109#return; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:11,691 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-18 00:49:11,692 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-18 00:49:11,692 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-18 00:49:11,692 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7289#true} {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #111#return; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:11,697 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-18 00:49:11,697 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-18 00:49:11,697 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-18 00:49:11,698 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7289#true} {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #113#return; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:11,702 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-18 00:49:11,703 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-18 00:49:11,703 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-18 00:49:11,704 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7289#true} {7341#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #115#return; {7341#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,704 INFO L263 TraceCheckUtils]: 0: Hoare triple {7289#true} call ULTIMATE.init(); {7289#true} is VALID [2020-07-18 00:49:11,704 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-18 00:49:11,705 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7289#true} {7289#true} #99#return; {7289#true} is VALID [2020-07-18 00:49:11,705 INFO L263 TraceCheckUtils]: 3: Hoare triple {7289#true} call #t~ret7 := main(); {7289#true} is VALID [2020-07-18 00:49:11,705 INFO L280 TraceCheckUtils]: 4: Hoare triple {7289#true} havoc ~in~0; {7289#true} is VALID [2020-07-18 00:49:11,705 INFO L280 TraceCheckUtils]: 5: Hoare triple {7289#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {7289#true} is VALID [2020-07-18 00:49:11,705 INFO L280 TraceCheckUtils]: 6: Hoare triple {7289#true} ~inlen~0 := #t~nondet0; {7289#true} is VALID [2020-07-18 00:49:11,705 INFO L280 TraceCheckUtils]: 7: Hoare triple {7289#true} havoc #t~nondet0; {7289#true} is VALID [2020-07-18 00:49:11,706 INFO L280 TraceCheckUtils]: 8: Hoare triple {7289#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {7289#true} is VALID [2020-07-18 00:49:11,706 INFO L280 TraceCheckUtils]: 9: Hoare triple {7289#true} ~bufferlen~0 := #t~nondet1; {7289#true} is VALID [2020-07-18 00:49:11,706 INFO L280 TraceCheckUtils]: 10: Hoare triple {7289#true} havoc #t~nondet1; {7289#true} is VALID [2020-07-18 00:49:11,706 INFO L280 TraceCheckUtils]: 11: Hoare triple {7289#true} havoc ~buf~0; {7289#true} is VALID [2020-07-18 00:49:11,706 INFO L280 TraceCheckUtils]: 12: Hoare triple {7289#true} havoc ~buflim~0; {7289#true} is VALID [2020-07-18 00:49:11,707 INFO L280 TraceCheckUtils]: 13: Hoare triple {7289#true} assume ~bufferlen~0 > 1; {7293#(<= 2 main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,708 INFO L280 TraceCheckUtils]: 14: Hoare triple {7293#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {7293#(<= 2 main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,709 INFO L280 TraceCheckUtils]: 15: Hoare triple {7293#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {7293#(<= 2 main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,709 INFO L280 TraceCheckUtils]: 16: Hoare triple {7293#(<= 2 main_~bufferlen~0)} ~buf~0 := 0; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,710 INFO L280 TraceCheckUtils]: 17: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~in~0 := 0; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,711 INFO L280 TraceCheckUtils]: 18: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~buflim~0 := ~bufferlen~0 - 2; {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:11,712 INFO L280 TraceCheckUtils]: 19: Hoare triple {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:11,712 INFO L280 TraceCheckUtils]: 20: Hoare triple {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} assume !!(0 != #t~nondet2); {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:11,713 INFO L280 TraceCheckUtils]: 21: Hoare triple {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} havoc #t~nondet2; {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:11,714 INFO L280 TraceCheckUtils]: 22: Hoare triple {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} assume !(~buf~0 == ~buflim~0); {7296#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-18 00:49:11,714 INFO L263 TraceCheckUtils]: 23: Hoare triple {7296#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {7289#true} is VALID [2020-07-18 00:49:11,714 INFO L280 TraceCheckUtils]: 24: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-18 00:49:11,715 INFO L280 TraceCheckUtils]: 25: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-18 00:49:11,715 INFO L280 TraceCheckUtils]: 26: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-18 00:49:11,716 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {7289#true} {7296#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #103#return; {7296#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-18 00:49:11,716 INFO L263 TraceCheckUtils]: 28: Hoare triple {7296#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {7289#true} is VALID [2020-07-18 00:49:11,716 INFO L280 TraceCheckUtils]: 29: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-18 00:49:11,716 INFO L280 TraceCheckUtils]: 30: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-18 00:49:11,716 INFO L280 TraceCheckUtils]: 31: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-18 00:49:11,717 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {7289#true} {7296#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #105#return; {7296#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-18 00:49:11,718 INFO L280 TraceCheckUtils]: 33: Hoare triple {7296#(and (<= (+ main_~buf~0 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} #t~post3 := ~buf~0; {7305#(and (<= (+ |main_#t~post3| 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} is VALID [2020-07-18 00:49:11,719 INFO L280 TraceCheckUtils]: 34: Hoare triple {7305#(and (<= (+ |main_#t~post3| 1) main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0))} ~buf~0 := 1 + #t~post3; {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:11,719 INFO L280 TraceCheckUtils]: 35: Hoare triple {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} havoc #t~post3; {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:11,720 INFO L280 TraceCheckUtils]: 36: Hoare triple {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} #t~post4 := ~in~0; {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:11,721 INFO L280 TraceCheckUtils]: 37: Hoare triple {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} ~in~0 := 1 + #t~post4; {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:11,722 INFO L280 TraceCheckUtils]: 38: Hoare triple {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} havoc #t~post4; {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:11,722 INFO L263 TraceCheckUtils]: 39: Hoare triple {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {7289#true} is VALID [2020-07-18 00:49:11,722 INFO L280 TraceCheckUtils]: 40: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-18 00:49:11,722 INFO L280 TraceCheckUtils]: 41: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-18 00:49:11,722 INFO L280 TraceCheckUtils]: 42: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-18 00:49:11,723 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {7289#true} {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} #107#return; {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:11,723 INFO L263 TraceCheckUtils]: 44: Hoare triple {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {7289#true} is VALID [2020-07-18 00:49:11,723 INFO L280 TraceCheckUtils]: 45: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-18 00:49:11,724 INFO L280 TraceCheckUtils]: 46: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-18 00:49:11,724 INFO L280 TraceCheckUtils]: 47: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-18 00:49:11,725 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {7289#true} {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} #109#return; {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:11,726 INFO L280 TraceCheckUtils]: 49: Hoare triple {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:11,726 INFO L280 TraceCheckUtils]: 50: Hoare triple {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} assume !!(0 != #t~nondet2); {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:11,727 INFO L280 TraceCheckUtils]: 51: Hoare triple {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} havoc #t~nondet2; {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:11,728 INFO L280 TraceCheckUtils]: 52: Hoare triple {7295#(and (or (< main_~buflim~0 (+ main_~buf~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (<= main_~buf~0 main_~buflim~0))} assume !(~buf~0 == ~buflim~0); {7314#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,728 INFO L263 TraceCheckUtils]: 53: Hoare triple {7314#(<= (+ main_~buf~0 3) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {7289#true} is VALID [2020-07-18 00:49:11,728 INFO L280 TraceCheckUtils]: 54: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-18 00:49:11,728 INFO L280 TraceCheckUtils]: 55: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-18 00:49:11,729 INFO L280 TraceCheckUtils]: 56: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-18 00:49:11,729 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {7289#true} {7314#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #103#return; {7314#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,730 INFO L263 TraceCheckUtils]: 58: Hoare triple {7314#(<= (+ main_~buf~0 3) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {7289#true} is VALID [2020-07-18 00:49:11,730 INFO L280 TraceCheckUtils]: 59: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-18 00:49:11,730 INFO L280 TraceCheckUtils]: 60: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-18 00:49:11,730 INFO L280 TraceCheckUtils]: 61: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-18 00:49:11,731 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {7289#true} {7314#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #105#return; {7314#(<= (+ main_~buf~0 3) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,731 INFO L280 TraceCheckUtils]: 63: Hoare triple {7314#(<= (+ main_~buf~0 3) main_~bufferlen~0)} #t~post3 := ~buf~0; {7323#(<= (+ |main_#t~post3| 3) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,732 INFO L280 TraceCheckUtils]: 64: Hoare triple {7323#(<= (+ |main_#t~post3| 3) main_~bufferlen~0)} ~buf~0 := 1 + #t~post3; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,733 INFO L280 TraceCheckUtils]: 65: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} havoc #t~post3; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,733 INFO L280 TraceCheckUtils]: 66: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #t~post4 := ~in~0; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,734 INFO L280 TraceCheckUtils]: 67: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} ~in~0 := 1 + #t~post4; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,734 INFO L280 TraceCheckUtils]: 68: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} havoc #t~post4; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,735 INFO L263 TraceCheckUtils]: 69: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {7289#true} is VALID [2020-07-18 00:49:11,735 INFO L280 TraceCheckUtils]: 70: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-18 00:49:11,735 INFO L280 TraceCheckUtils]: 71: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-18 00:49:11,735 INFO L280 TraceCheckUtils]: 72: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-18 00:49:11,736 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {7289#true} {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #107#return; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,736 INFO L263 TraceCheckUtils]: 74: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {7289#true} is VALID [2020-07-18 00:49:11,736 INFO L280 TraceCheckUtils]: 75: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-18 00:49:11,736 INFO L280 TraceCheckUtils]: 76: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-18 00:49:11,737 INFO L280 TraceCheckUtils]: 77: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-18 00:49:11,737 INFO L275 TraceCheckUtils]: 78: Hoare quadruple {7289#true} {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #109#return; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,738 INFO L280 TraceCheckUtils]: 79: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,739 INFO L280 TraceCheckUtils]: 80: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} assume !(0 != #t~nondet2); {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,740 INFO L280 TraceCheckUtils]: 81: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} havoc #t~nondet2; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,740 INFO L263 TraceCheckUtils]: 82: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {7289#true} is VALID [2020-07-18 00:49:11,740 INFO L280 TraceCheckUtils]: 83: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-18 00:49:11,740 INFO L280 TraceCheckUtils]: 84: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-18 00:49:11,740 INFO L280 TraceCheckUtils]: 85: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-18 00:49:11,741 INFO L275 TraceCheckUtils]: 86: Hoare quadruple {7289#true} {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #111#return; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,741 INFO L263 TraceCheckUtils]: 87: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {7289#true} is VALID [2020-07-18 00:49:11,741 INFO L280 TraceCheckUtils]: 88: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-18 00:49:11,742 INFO L280 TraceCheckUtils]: 89: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-18 00:49:11,742 INFO L280 TraceCheckUtils]: 90: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-18 00:49:11,742 INFO L275 TraceCheckUtils]: 91: Hoare quadruple {7289#true} {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #113#return; {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,743 INFO L280 TraceCheckUtils]: 92: Hoare triple {7294#(<= (+ main_~buf~0 2) main_~bufferlen~0)} #t~post5 := ~buf~0; {7340#(<= (+ |main_#t~post5| 2) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,744 INFO L280 TraceCheckUtils]: 93: Hoare triple {7340#(<= (+ |main_#t~post5| 2) main_~bufferlen~0)} ~buf~0 := 1 + #t~post5; {7341#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,745 INFO L280 TraceCheckUtils]: 94: Hoare triple {7341#(<= (+ main_~buf~0 1) main_~bufferlen~0)} havoc #t~post5; {7341#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,745 INFO L263 TraceCheckUtils]: 95: Hoare triple {7341#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {7289#true} is VALID [2020-07-18 00:49:11,745 INFO L280 TraceCheckUtils]: 96: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-18 00:49:11,745 INFO L280 TraceCheckUtils]: 97: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-18 00:49:11,745 INFO L280 TraceCheckUtils]: 98: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-18 00:49:11,746 INFO L275 TraceCheckUtils]: 99: Hoare quadruple {7289#true} {7341#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #115#return; {7341#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2020-07-18 00:49:11,747 INFO L263 TraceCheckUtils]: 100: Hoare triple {7341#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {7346#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:49:11,748 INFO L280 TraceCheckUtils]: 101: Hoare triple {7346#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {7347#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:49:11,748 INFO L280 TraceCheckUtils]: 102: Hoare triple {7347#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {7290#false} is VALID [2020-07-18 00:49:11,749 INFO L280 TraceCheckUtils]: 103: Hoare triple {7290#false} assume !false; {7290#false} is VALID [2020-07-18 00:49:11,765 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-18 00:49:11,766 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:11,766 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1596447002] [2020-07-18 00:49:11,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:11,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-18 00:49:11,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621675525] [2020-07-18 00:49:11,767 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2020-07-18 00:49:11,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:11,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-18 00:49:11,850 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:11,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-18 00:49:11,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:11,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-18 00:49:11,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-07-18 00:49:11,851 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand 13 states. [2020-07-18 00:49:13,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:13,000 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2020-07-18 00:49:13,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-18 00:49:13,000 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2020-07-18 00:49:13,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:13,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 00:49:13,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 60 transitions. [2020-07-18 00:49:13,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 00:49:13,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 60 transitions. [2020-07-18 00:49:13,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 60 transitions. [2020-07-18 00:49:13,076 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-18 00:49:13,079 INFO L225 Difference]: With dead ends: 126 [2020-07-18 00:49:13,079 INFO L226 Difference]: Without dead ends: 109 [2020-07-18 00:49:13,081 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2020-07-18 00:49:13,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-07-18 00:49:13,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2020-07-18 00:49:13,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:13,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 99 states. [2020-07-18 00:49:13,311 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 99 states. [2020-07-18 00:49:13,312 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 99 states. [2020-07-18 00:49:13,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:13,316 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2020-07-18 00:49:13,316 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2020-07-18 00:49:13,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:13,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:13,317 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 109 states. [2020-07-18 00:49:13,317 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 109 states. [2020-07-18 00:49:13,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:13,320 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2020-07-18 00:49:13,320 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2020-07-18 00:49:13,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:13,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:13,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:13,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:13,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-07-18 00:49:13,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2020-07-18 00:49:13,324 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 104 [2020-07-18 00:49:13,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:13,324 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2020-07-18 00:49:13,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-18 00:49:13,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 99 states and 102 transitions. [2020-07-18 00:49:13,485 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-18 00:49:13,486 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2020-07-18 00:49:13,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-07-18 00:49:13,487 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:13,487 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:13,488 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-18 00:49:13,488 INFO L427 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:13,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:13,488 INFO L82 PathProgramCache]: Analyzing trace with hash 55355532, now seen corresponding path program 2 times [2020-07-18 00:49:13,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:13,488 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1179989663] [2020-07-18 00:49:13,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:13,780 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-18 00:49:13,781 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8036#true} {8036#true} #99#return; {8036#true} is VALID [2020-07-18 00:49:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:13,788 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-18 00:49:13,789 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-18 00:49:13,789 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-18 00:49:13,791 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8045#(<= (+ main_~in~0 4) main_~inlen~0)} #103#return; {8045#(<= (+ main_~in~0 4) main_~inlen~0)} is VALID [2020-07-18 00:49:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:13,794 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-18 00:49:13,794 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-18 00:49:13,795 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-18 00:49:13,795 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8045#(<= (+ main_~in~0 4) main_~inlen~0)} #105#return; {8045#(<= (+ main_~in~0 4) main_~inlen~0)} is VALID [2020-07-18 00:49:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:13,799 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-18 00:49:13,800 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-18 00:49:13,800 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-18 00:49:13,800 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8055#(<= (+ main_~in~0 3) main_~inlen~0)} #107#return; {8055#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:13,804 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-18 00:49:13,804 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-18 00:49:13,804 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-18 00:49:13,805 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8055#(<= (+ main_~in~0 3) main_~inlen~0)} #109#return; {8055#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:13,809 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-18 00:49:13,809 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-18 00:49:13,810 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-18 00:49:13,810 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8055#(<= (+ main_~in~0 3) main_~inlen~0)} #103#return; {8055#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:13,814 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-18 00:49:13,815 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-18 00:49:13,815 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-18 00:49:13,816 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8055#(<= (+ main_~in~0 3) main_~inlen~0)} #105#return; {8055#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:13,820 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-18 00:49:13,820 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-18 00:49:13,821 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-18 00:49:13,821 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8073#(<= (+ main_~in~0 2) main_~inlen~0)} #107#return; {8073#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:13,824 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-18 00:49:13,825 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-18 00:49:13,825 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-18 00:49:13,826 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8073#(<= (+ main_~in~0 2) main_~inlen~0)} #109#return; {8073#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:13,829 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-18 00:49:13,829 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-18 00:49:13,829 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-18 00:49:13,830 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8073#(<= (+ main_~in~0 2) main_~inlen~0)} #103#return; {8073#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:13,839 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-18 00:49:13,839 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-18 00:49:13,839 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-18 00:49:13,840 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8073#(<= (+ main_~in~0 2) main_~inlen~0)} #105#return; {8073#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:13,844 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-18 00:49:13,844 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-18 00:49:13,844 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-18 00:49:13,845 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8091#(<= (+ main_~in~0 1) main_~inlen~0)} #107#return; {8091#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-18 00:49:13,845 INFO L263 TraceCheckUtils]: 0: Hoare triple {8036#true} call ULTIMATE.init(); {8036#true} is VALID [2020-07-18 00:49:13,846 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-18 00:49:13,846 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8036#true} {8036#true} #99#return; {8036#true} is VALID [2020-07-18 00:49:13,846 INFO L263 TraceCheckUtils]: 3: Hoare triple {8036#true} call #t~ret7 := main(); {8036#true} is VALID [2020-07-18 00:49:13,846 INFO L280 TraceCheckUtils]: 4: Hoare triple {8036#true} havoc ~in~0; {8036#true} is VALID [2020-07-18 00:49:13,846 INFO L280 TraceCheckUtils]: 5: Hoare triple {8036#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {8036#true} is VALID [2020-07-18 00:49:13,846 INFO L280 TraceCheckUtils]: 6: Hoare triple {8036#true} ~inlen~0 := #t~nondet0; {8036#true} is VALID [2020-07-18 00:49:13,847 INFO L280 TraceCheckUtils]: 7: Hoare triple {8036#true} havoc #t~nondet0; {8036#true} is VALID [2020-07-18 00:49:13,847 INFO L280 TraceCheckUtils]: 8: Hoare triple {8036#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {8036#true} is VALID [2020-07-18 00:49:13,847 INFO L280 TraceCheckUtils]: 9: Hoare triple {8036#true} ~bufferlen~0 := #t~nondet1; {8036#true} is VALID [2020-07-18 00:49:13,847 INFO L280 TraceCheckUtils]: 10: Hoare triple {8036#true} havoc #t~nondet1; {8036#true} is VALID [2020-07-18 00:49:13,847 INFO L280 TraceCheckUtils]: 11: Hoare triple {8036#true} havoc ~buf~0; {8036#true} is VALID [2020-07-18 00:49:13,848 INFO L280 TraceCheckUtils]: 12: Hoare triple {8036#true} havoc ~buflim~0; {8036#true} is VALID [2020-07-18 00:49:13,848 INFO L280 TraceCheckUtils]: 13: Hoare triple {8036#true} assume ~bufferlen~0 > 1; {8040#(<= 2 main_~bufferlen~0)} is VALID [2020-07-18 00:49:13,849 INFO L280 TraceCheckUtils]: 14: Hoare triple {8040#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {8040#(<= 2 main_~bufferlen~0)} is VALID [2020-07-18 00:49:13,850 INFO L280 TraceCheckUtils]: 15: Hoare triple {8040#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {8041#(and (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))} is VALID [2020-07-18 00:49:13,850 INFO L280 TraceCheckUtils]: 16: Hoare triple {8041#(and (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))} ~buf~0 := 0; {8042#(and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)))} is VALID [2020-07-18 00:49:13,851 INFO L280 TraceCheckUtils]: 17: Hoare triple {8042#(and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)))} ~in~0 := 0; {8043#(and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 2) main_~bufferlen~0))} is VALID [2020-07-18 00:49:13,852 INFO L280 TraceCheckUtils]: 18: Hoare triple {8043#(and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 2) main_~bufferlen~0))} ~buflim~0 := ~bufferlen~0 - 2; {8044#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:13,853 INFO L280 TraceCheckUtils]: 19: Hoare triple {8044#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {8044#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:13,853 INFO L280 TraceCheckUtils]: 20: Hoare triple {8044#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} assume !!(0 != #t~nondet2); {8044#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:13,854 INFO L280 TraceCheckUtils]: 21: Hoare triple {8044#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} havoc #t~nondet2; {8044#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:13,855 INFO L280 TraceCheckUtils]: 22: Hoare triple {8044#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buflim~0 (+ main_~buf~0 1))) (<= main_~buf~0 main_~buflim~0))} assume !(~buf~0 == ~buflim~0); {8045#(<= (+ main_~in~0 4) main_~inlen~0)} is VALID [2020-07-18 00:49:13,855 INFO L263 TraceCheckUtils]: 23: Hoare triple {8045#(<= (+ main_~in~0 4) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {8036#true} is VALID [2020-07-18 00:49:13,855 INFO L280 TraceCheckUtils]: 24: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-18 00:49:13,856 INFO L280 TraceCheckUtils]: 25: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-18 00:49:13,856 INFO L280 TraceCheckUtils]: 26: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-18 00:49:13,857 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {8036#true} {8045#(<= (+ main_~in~0 4) main_~inlen~0)} #103#return; {8045#(<= (+ main_~in~0 4) main_~inlen~0)} is VALID [2020-07-18 00:49:13,857 INFO L263 TraceCheckUtils]: 28: Hoare triple {8045#(<= (+ main_~in~0 4) main_~inlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {8036#true} is VALID [2020-07-18 00:49:13,857 INFO L280 TraceCheckUtils]: 29: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-18 00:49:13,857 INFO L280 TraceCheckUtils]: 30: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-18 00:49:13,857 INFO L280 TraceCheckUtils]: 31: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-18 00:49:13,858 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {8036#true} {8045#(<= (+ main_~in~0 4) main_~inlen~0)} #105#return; {8045#(<= (+ main_~in~0 4) main_~inlen~0)} is VALID [2020-07-18 00:49:13,859 INFO L280 TraceCheckUtils]: 33: Hoare triple {8045#(<= (+ main_~in~0 4) main_~inlen~0)} #t~post3 := ~buf~0; {8045#(<= (+ main_~in~0 4) main_~inlen~0)} is VALID [2020-07-18 00:49:13,859 INFO L280 TraceCheckUtils]: 34: Hoare triple {8045#(<= (+ main_~in~0 4) main_~inlen~0)} ~buf~0 := 1 + #t~post3; {8045#(<= (+ main_~in~0 4) main_~inlen~0)} is VALID [2020-07-18 00:49:13,860 INFO L280 TraceCheckUtils]: 35: Hoare triple {8045#(<= (+ main_~in~0 4) main_~inlen~0)} havoc #t~post3; {8045#(<= (+ main_~in~0 4) main_~inlen~0)} is VALID [2020-07-18 00:49:13,860 INFO L280 TraceCheckUtils]: 36: Hoare triple {8045#(<= (+ main_~in~0 4) main_~inlen~0)} #t~post4 := ~in~0; {8054#(<= (+ |main_#t~post4| 4) main_~inlen~0)} is VALID [2020-07-18 00:49:13,861 INFO L280 TraceCheckUtils]: 37: Hoare triple {8054#(<= (+ |main_#t~post4| 4) main_~inlen~0)} ~in~0 := 1 + #t~post4; {8055#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:13,862 INFO L280 TraceCheckUtils]: 38: Hoare triple {8055#(<= (+ main_~in~0 3) main_~inlen~0)} havoc #t~post4; {8055#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:13,862 INFO L263 TraceCheckUtils]: 39: Hoare triple {8055#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {8036#true} is VALID [2020-07-18 00:49:13,862 INFO L280 TraceCheckUtils]: 40: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-18 00:49:13,862 INFO L280 TraceCheckUtils]: 41: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-18 00:49:13,862 INFO L280 TraceCheckUtils]: 42: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-18 00:49:13,863 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {8036#true} {8055#(<= (+ main_~in~0 3) main_~inlen~0)} #107#return; {8055#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:13,863 INFO L263 TraceCheckUtils]: 44: Hoare triple {8055#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {8036#true} is VALID [2020-07-18 00:49:13,863 INFO L280 TraceCheckUtils]: 45: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-18 00:49:13,863 INFO L280 TraceCheckUtils]: 46: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-18 00:49:13,864 INFO L280 TraceCheckUtils]: 47: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-18 00:49:13,864 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {8036#true} {8055#(<= (+ main_~in~0 3) main_~inlen~0)} #109#return; {8055#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:13,865 INFO L280 TraceCheckUtils]: 49: Hoare triple {8055#(<= (+ main_~in~0 3) main_~inlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {8055#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:13,865 INFO L280 TraceCheckUtils]: 50: Hoare triple {8055#(<= (+ main_~in~0 3) main_~inlen~0)} assume !!(0 != #t~nondet2); {8055#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:13,866 INFO L280 TraceCheckUtils]: 51: Hoare triple {8055#(<= (+ main_~in~0 3) main_~inlen~0)} havoc #t~nondet2; {8055#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:13,866 INFO L280 TraceCheckUtils]: 52: Hoare triple {8055#(<= (+ main_~in~0 3) main_~inlen~0)} assume !(~buf~0 == ~buflim~0); {8055#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:13,867 INFO L263 TraceCheckUtils]: 53: Hoare triple {8055#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {8036#true} is VALID [2020-07-18 00:49:13,867 INFO L280 TraceCheckUtils]: 54: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-18 00:49:13,867 INFO L280 TraceCheckUtils]: 55: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-18 00:49:13,867 INFO L280 TraceCheckUtils]: 56: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-18 00:49:13,868 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {8036#true} {8055#(<= (+ main_~in~0 3) main_~inlen~0)} #103#return; {8055#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:13,868 INFO L263 TraceCheckUtils]: 58: Hoare triple {8055#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {8036#true} is VALID [2020-07-18 00:49:13,868 INFO L280 TraceCheckUtils]: 59: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-18 00:49:13,869 INFO L280 TraceCheckUtils]: 60: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-18 00:49:13,869 INFO L280 TraceCheckUtils]: 61: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-18 00:49:13,869 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {8036#true} {8055#(<= (+ main_~in~0 3) main_~inlen~0)} #105#return; {8055#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:13,870 INFO L280 TraceCheckUtils]: 63: Hoare triple {8055#(<= (+ main_~in~0 3) main_~inlen~0)} #t~post3 := ~buf~0; {8055#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:13,871 INFO L280 TraceCheckUtils]: 64: Hoare triple {8055#(<= (+ main_~in~0 3) main_~inlen~0)} ~buf~0 := 1 + #t~post3; {8055#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:13,871 INFO L280 TraceCheckUtils]: 65: Hoare triple {8055#(<= (+ main_~in~0 3) main_~inlen~0)} havoc #t~post3; {8055#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:13,872 INFO L280 TraceCheckUtils]: 66: Hoare triple {8055#(<= (+ main_~in~0 3) main_~inlen~0)} #t~post4 := ~in~0; {8072#(<= (+ |main_#t~post4| 3) main_~inlen~0)} is VALID [2020-07-18 00:49:13,873 INFO L280 TraceCheckUtils]: 67: Hoare triple {8072#(<= (+ |main_#t~post4| 3) main_~inlen~0)} ~in~0 := 1 + #t~post4; {8073#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:13,873 INFO L280 TraceCheckUtils]: 68: Hoare triple {8073#(<= (+ main_~in~0 2) main_~inlen~0)} havoc #t~post4; {8073#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:13,873 INFO L263 TraceCheckUtils]: 69: Hoare triple {8073#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {8036#true} is VALID [2020-07-18 00:49:13,874 INFO L280 TraceCheckUtils]: 70: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-18 00:49:13,874 INFO L280 TraceCheckUtils]: 71: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-18 00:49:13,874 INFO L280 TraceCheckUtils]: 72: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-18 00:49:13,875 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {8036#true} {8073#(<= (+ main_~in~0 2) main_~inlen~0)} #107#return; {8073#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:13,875 INFO L263 TraceCheckUtils]: 74: Hoare triple {8073#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {8036#true} is VALID [2020-07-18 00:49:13,875 INFO L280 TraceCheckUtils]: 75: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-18 00:49:13,875 INFO L280 TraceCheckUtils]: 76: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-18 00:49:13,875 INFO L280 TraceCheckUtils]: 77: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-18 00:49:13,876 INFO L275 TraceCheckUtils]: 78: Hoare quadruple {8036#true} {8073#(<= (+ main_~in~0 2) main_~inlen~0)} #109#return; {8073#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:13,877 INFO L280 TraceCheckUtils]: 79: Hoare triple {8073#(<= (+ main_~in~0 2) main_~inlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {8073#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:13,877 INFO L280 TraceCheckUtils]: 80: Hoare triple {8073#(<= (+ main_~in~0 2) main_~inlen~0)} assume !!(0 != #t~nondet2); {8073#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:13,878 INFO L280 TraceCheckUtils]: 81: Hoare triple {8073#(<= (+ main_~in~0 2) main_~inlen~0)} havoc #t~nondet2; {8073#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:13,878 INFO L280 TraceCheckUtils]: 82: Hoare triple {8073#(<= (+ main_~in~0 2) main_~inlen~0)} assume !(~buf~0 == ~buflim~0); {8073#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:13,879 INFO L263 TraceCheckUtils]: 83: Hoare triple {8073#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {8036#true} is VALID [2020-07-18 00:49:13,879 INFO L280 TraceCheckUtils]: 84: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-18 00:49:13,879 INFO L280 TraceCheckUtils]: 85: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-18 00:49:13,879 INFO L280 TraceCheckUtils]: 86: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-18 00:49:13,880 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {8036#true} {8073#(<= (+ main_~in~0 2) main_~inlen~0)} #103#return; {8073#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:13,880 INFO L263 TraceCheckUtils]: 88: Hoare triple {8073#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {8036#true} is VALID [2020-07-18 00:49:13,880 INFO L280 TraceCheckUtils]: 89: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-18 00:49:13,881 INFO L280 TraceCheckUtils]: 90: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-18 00:49:13,881 INFO L280 TraceCheckUtils]: 91: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-18 00:49:13,882 INFO L275 TraceCheckUtils]: 92: Hoare quadruple {8036#true} {8073#(<= (+ main_~in~0 2) main_~inlen~0)} #105#return; {8073#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:13,882 INFO L280 TraceCheckUtils]: 93: Hoare triple {8073#(<= (+ main_~in~0 2) main_~inlen~0)} #t~post3 := ~buf~0; {8073#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:13,883 INFO L280 TraceCheckUtils]: 94: Hoare triple {8073#(<= (+ main_~in~0 2) main_~inlen~0)} ~buf~0 := 1 + #t~post3; {8073#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:13,883 INFO L280 TraceCheckUtils]: 95: Hoare triple {8073#(<= (+ main_~in~0 2) main_~inlen~0)} havoc #t~post3; {8073#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:13,884 INFO L280 TraceCheckUtils]: 96: Hoare triple {8073#(<= (+ main_~in~0 2) main_~inlen~0)} #t~post4 := ~in~0; {8090#(<= (+ |main_#t~post4| 2) main_~inlen~0)} is VALID [2020-07-18 00:49:13,885 INFO L280 TraceCheckUtils]: 97: Hoare triple {8090#(<= (+ |main_#t~post4| 2) main_~inlen~0)} ~in~0 := 1 + #t~post4; {8091#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-18 00:49:13,885 INFO L280 TraceCheckUtils]: 98: Hoare triple {8091#(<= (+ main_~in~0 1) main_~inlen~0)} havoc #t~post4; {8091#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-18 00:49:13,885 INFO L263 TraceCheckUtils]: 99: Hoare triple {8091#(<= (+ main_~in~0 1) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {8036#true} is VALID [2020-07-18 00:49:13,886 INFO L280 TraceCheckUtils]: 100: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-18 00:49:13,886 INFO L280 TraceCheckUtils]: 101: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-18 00:49:13,886 INFO L280 TraceCheckUtils]: 102: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-18 00:49:13,887 INFO L275 TraceCheckUtils]: 103: Hoare quadruple {8036#true} {8091#(<= (+ main_~in~0 1) main_~inlen~0)} #107#return; {8091#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-18 00:49:13,888 INFO L263 TraceCheckUtils]: 104: Hoare triple {8091#(<= (+ main_~in~0 1) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {8096#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:49:13,888 INFO L280 TraceCheckUtils]: 105: Hoare triple {8096#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {8097#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:49:13,889 INFO L280 TraceCheckUtils]: 106: Hoare triple {8097#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {8037#false} is VALID [2020-07-18 00:49:13,889 INFO L280 TraceCheckUtils]: 107: Hoare triple {8037#false} assume !false; {8037#false} is VALID [2020-07-18 00:49:13,901 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-18 00:49:13,902 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:13,902 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1179989663] [2020-07-18 00:49:13,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:13,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-07-18 00:49:13,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72065511] [2020-07-18 00:49:13,903 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2020-07-18 00:49:13,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:13,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-18 00:49:13,989 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-18 00:49:13,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-18 00:49:13,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:13,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-18 00:49:13,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-07-18 00:49:13,990 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand 16 states. [2020-07-18 00:49:15,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:15,839 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2020-07-18 00:49:15,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-18 00:49:15,839 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2020-07-18 00:49:15,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:15,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-18 00:49:15,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 114 transitions. [2020-07-18 00:49:15,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-18 00:49:15,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 114 transitions. [2020-07-18 00:49:15,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 114 transitions. [2020-07-18 00:49:16,019 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:16,025 INFO L225 Difference]: With dead ends: 130 [2020-07-18 00:49:16,025 INFO L226 Difference]: Without dead ends: 128 [2020-07-18 00:49:16,029 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2020-07-18 00:49:16,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-07-18 00:49:16,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 117. [2020-07-18 00:49:16,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:16,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 117 states. [2020-07-18 00:49:16,358 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 117 states. [2020-07-18 00:49:16,359 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 117 states. [2020-07-18 00:49:16,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:16,363 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2020-07-18 00:49:16,364 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2020-07-18 00:49:16,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:16,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:16,364 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 128 states. [2020-07-18 00:49:16,365 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 128 states. [2020-07-18 00:49:16,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:16,369 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2020-07-18 00:49:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2020-07-18 00:49:16,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:16,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:16,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:16,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:16,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-18 00:49:16,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2020-07-18 00:49:16,376 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 108 [2020-07-18 00:49:16,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:16,376 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2020-07-18 00:49:16,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-18 00:49:16,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 117 states and 123 transitions. [2020-07-18 00:49:16,566 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:16,566 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2020-07-18 00:49:16,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-07-18 00:49:16,568 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:16,568 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:16,568 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-18 00:49:16,568 INFO L427 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:16,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:16,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1897035733, now seen corresponding path program 3 times [2020-07-18 00:49:16,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:16,569 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1528759638] [2020-07-18 00:49:16,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:17,126 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,126 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8880#true} {8880#true} #99#return; {8880#true} is VALID [2020-07-18 00:49:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:17,139 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,140 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,140 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,146 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8880#true} {8889#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #103#return; {8889#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} is VALID [2020-07-18 00:49:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:17,149 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,150 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,150 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,151 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8880#true} {8889#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #105#return; {8889#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} is VALID [2020-07-18 00:49:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:17,154 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,155 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,155 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,155 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8880#true} {8901#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} #107#return; {8901#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:17,160 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,160 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,160 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,161 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8880#true} {8901#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} #109#return; {8901#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:17,165 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,165 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,166 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,166 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8880#true} {8910#(<= (+ main_~in~0 4) main_~inlen~0)} #103#return; {8910#(<= (+ main_~in~0 4) main_~inlen~0)} is VALID [2020-07-18 00:49:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:17,170 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,170 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,170 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,172 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8880#true} {8910#(<= (+ main_~in~0 4) main_~inlen~0)} #105#return; {8910#(<= (+ main_~in~0 4) main_~inlen~0)} is VALID [2020-07-18 00:49:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:17,175 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,175 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,175 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,176 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8880#true} {8920#(<= (+ main_~in~0 3) main_~inlen~0)} #107#return; {8920#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:17,179 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,179 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,180 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,186 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8880#true} {8920#(<= (+ main_~in~0 3) main_~inlen~0)} #109#return; {8920#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:17,190 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,190 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,190 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,191 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8880#true} {8920#(<= (+ main_~in~0 3) main_~inlen~0)} #103#return; {8920#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:17,196 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,197 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,197 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,197 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8880#true} {8920#(<= (+ main_~in~0 3) main_~inlen~0)} #105#return; {8920#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:17,205 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,205 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,205 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,206 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8880#true} {8938#(<= (+ main_~in~0 2) main_~inlen~0)} #107#return; {8938#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:17,209 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,210 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,210 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,211 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8880#true} {8938#(<= (+ main_~in~0 2) main_~inlen~0)} #109#return; {8938#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:17,214 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,215 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,215 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,217 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8880#true} {8938#(<= (+ main_~in~0 2) main_~inlen~0)} #103#return; {8938#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:17,231 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,231 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,231 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,232 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8880#true} {8938#(<= (+ main_~in~0 2) main_~inlen~0)} #105#return; {8938#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:17,236 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,236 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,236 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,237 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8880#true} {8956#(<= (+ main_~in~0 1) main_~inlen~0)} #107#return; {8956#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-18 00:49:17,237 INFO L263 TraceCheckUtils]: 0: Hoare triple {8880#true} call ULTIMATE.init(); {8880#true} is VALID [2020-07-18 00:49:17,238 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,238 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8880#true} {8880#true} #99#return; {8880#true} is VALID [2020-07-18 00:49:17,238 INFO L263 TraceCheckUtils]: 3: Hoare triple {8880#true} call #t~ret7 := main(); {8880#true} is VALID [2020-07-18 00:49:17,238 INFO L280 TraceCheckUtils]: 4: Hoare triple {8880#true} havoc ~in~0; {8880#true} is VALID [2020-07-18 00:49:17,238 INFO L280 TraceCheckUtils]: 5: Hoare triple {8880#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {8880#true} is VALID [2020-07-18 00:49:17,239 INFO L280 TraceCheckUtils]: 6: Hoare triple {8880#true} ~inlen~0 := #t~nondet0; {8880#true} is VALID [2020-07-18 00:49:17,239 INFO L280 TraceCheckUtils]: 7: Hoare triple {8880#true} havoc #t~nondet0; {8880#true} is VALID [2020-07-18 00:49:17,239 INFO L280 TraceCheckUtils]: 8: Hoare triple {8880#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {8880#true} is VALID [2020-07-18 00:49:17,239 INFO L280 TraceCheckUtils]: 9: Hoare triple {8880#true} ~bufferlen~0 := #t~nondet1; {8880#true} is VALID [2020-07-18 00:49:17,239 INFO L280 TraceCheckUtils]: 10: Hoare triple {8880#true} havoc #t~nondet1; {8880#true} is VALID [2020-07-18 00:49:17,239 INFO L280 TraceCheckUtils]: 11: Hoare triple {8880#true} havoc ~buf~0; {8880#true} is VALID [2020-07-18 00:49:17,240 INFO L280 TraceCheckUtils]: 12: Hoare triple {8880#true} havoc ~buflim~0; {8880#true} is VALID [2020-07-18 00:49:17,240 INFO L280 TraceCheckUtils]: 13: Hoare triple {8880#true} assume ~bufferlen~0 > 1; {8884#(<= 2 main_~bufferlen~0)} is VALID [2020-07-18 00:49:17,241 INFO L280 TraceCheckUtils]: 14: Hoare triple {8884#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {8884#(<= 2 main_~bufferlen~0)} is VALID [2020-07-18 00:49:17,242 INFO L280 TraceCheckUtils]: 15: Hoare triple {8884#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {8885#(and (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))} is VALID [2020-07-18 00:49:17,242 INFO L280 TraceCheckUtils]: 16: Hoare triple {8885#(and (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))} ~buf~0 := 0; {8886#(and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)))} is VALID [2020-07-18 00:49:17,243 INFO L280 TraceCheckUtils]: 17: Hoare triple {8886#(and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)))} ~in~0 := 0; {8887#(and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 2) main_~bufferlen~0))} is VALID [2020-07-18 00:49:17,244 INFO L280 TraceCheckUtils]: 18: Hoare triple {8887#(and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 2) main_~bufferlen~0))} ~buflim~0 := ~bufferlen~0 - 2; {8888#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:17,245 INFO L280 TraceCheckUtils]: 19: Hoare triple {8888#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buf~0 main_~buflim~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {8888#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:17,245 INFO L280 TraceCheckUtils]: 20: Hoare triple {8888#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buf~0 main_~buflim~0))} assume !!(0 != #t~nondet2); {8888#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:17,246 INFO L280 TraceCheckUtils]: 21: Hoare triple {8888#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buf~0 main_~buflim~0))} havoc #t~nondet2; {8888#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:17,247 INFO L280 TraceCheckUtils]: 22: Hoare triple {8888#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buf~0 main_~buflim~0))} assume !(~buf~0 == ~buflim~0); {8889#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} is VALID [2020-07-18 00:49:17,247 INFO L263 TraceCheckUtils]: 23: Hoare triple {8889#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {8880#true} is VALID [2020-07-18 00:49:17,247 INFO L280 TraceCheckUtils]: 24: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,247 INFO L280 TraceCheckUtils]: 25: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,247 INFO L280 TraceCheckUtils]: 26: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,248 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {8880#true} {8889#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #103#return; {8889#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} is VALID [2020-07-18 00:49:17,248 INFO L263 TraceCheckUtils]: 28: Hoare triple {8889#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {8880#true} is VALID [2020-07-18 00:49:17,249 INFO L280 TraceCheckUtils]: 29: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,249 INFO L280 TraceCheckUtils]: 30: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,249 INFO L280 TraceCheckUtils]: 31: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,250 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {8880#true} {8889#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #105#return; {8889#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} is VALID [2020-07-18 00:49:17,251 INFO L280 TraceCheckUtils]: 33: Hoare triple {8889#(and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 1) main_~buflim~0))} #t~post3 := ~buf~0; {8898#(and (<= (+ |main_#t~post3| 1) main_~buflim~0) (<= (+ main_~in~0 main_~buflim~0 3) (+ |main_#t~post3| main_~inlen~0)))} is VALID [2020-07-18 00:49:17,251 INFO L280 TraceCheckUtils]: 34: Hoare triple {8898#(and (<= (+ |main_#t~post3| 1) main_~buflim~0) (<= (+ main_~in~0 main_~buflim~0 3) (+ |main_#t~post3| main_~inlen~0)))} ~buf~0 := 1 + #t~post3; {8899#(and (<= main_~buf~0 main_~buflim~0) (or (<= (+ main_~in~0 main_~buflim~0 4) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)))} is VALID [2020-07-18 00:49:17,252 INFO L280 TraceCheckUtils]: 35: Hoare triple {8899#(and (<= main_~buf~0 main_~buflim~0) (or (<= (+ main_~in~0 main_~buflim~0 4) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)))} havoc #t~post3; {8899#(and (<= main_~buf~0 main_~buflim~0) (or (<= (+ main_~in~0 main_~buflim~0 4) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)))} is VALID [2020-07-18 00:49:17,253 INFO L280 TraceCheckUtils]: 36: Hoare triple {8899#(and (<= main_~buf~0 main_~buflim~0) (or (<= (+ main_~in~0 main_~buflim~0 4) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)))} #t~post4 := ~in~0; {8900#(and (or (<= (+ |main_#t~post4| main_~buflim~0 4) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:17,254 INFO L280 TraceCheckUtils]: 37: Hoare triple {8900#(and (or (<= (+ |main_#t~post4| main_~buflim~0 4) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} ~in~0 := 1 + #t~post4; {8901#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:17,255 INFO L280 TraceCheckUtils]: 38: Hoare triple {8901#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} havoc #t~post4; {8901#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:17,255 INFO L263 TraceCheckUtils]: 39: Hoare triple {8901#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {8880#true} is VALID [2020-07-18 00:49:17,255 INFO L280 TraceCheckUtils]: 40: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,255 INFO L280 TraceCheckUtils]: 41: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,255 INFO L280 TraceCheckUtils]: 42: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,256 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {8880#true} {8901#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} #107#return; {8901#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:17,256 INFO L263 TraceCheckUtils]: 44: Hoare triple {8901#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {8880#true} is VALID [2020-07-18 00:49:17,256 INFO L280 TraceCheckUtils]: 45: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,257 INFO L280 TraceCheckUtils]: 46: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,257 INFO L280 TraceCheckUtils]: 47: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,258 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {8880#true} {8901#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} #109#return; {8901#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:17,258 INFO L280 TraceCheckUtils]: 49: Hoare triple {8901#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {8901#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:17,259 INFO L280 TraceCheckUtils]: 50: Hoare triple {8901#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} assume !!(0 != #t~nondet2); {8901#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:17,260 INFO L280 TraceCheckUtils]: 51: Hoare triple {8901#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} havoc #t~nondet2; {8901#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} is VALID [2020-07-18 00:49:17,260 INFO L280 TraceCheckUtils]: 52: Hoare triple {8901#(and (or (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buflim~0 main_~buf~0)) (<= main_~buf~0 main_~buflim~0))} assume !(~buf~0 == ~buflim~0); {8910#(<= (+ main_~in~0 4) main_~inlen~0)} is VALID [2020-07-18 00:49:17,261 INFO L263 TraceCheckUtils]: 53: Hoare triple {8910#(<= (+ main_~in~0 4) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {8880#true} is VALID [2020-07-18 00:49:17,261 INFO L280 TraceCheckUtils]: 54: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,261 INFO L280 TraceCheckUtils]: 55: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,261 INFO L280 TraceCheckUtils]: 56: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,262 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {8880#true} {8910#(<= (+ main_~in~0 4) main_~inlen~0)} #103#return; {8910#(<= (+ main_~in~0 4) main_~inlen~0)} is VALID [2020-07-18 00:49:17,262 INFO L263 TraceCheckUtils]: 58: Hoare triple {8910#(<= (+ main_~in~0 4) main_~inlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {8880#true} is VALID [2020-07-18 00:49:17,262 INFO L280 TraceCheckUtils]: 59: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,263 INFO L280 TraceCheckUtils]: 60: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,263 INFO L280 TraceCheckUtils]: 61: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,264 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {8880#true} {8910#(<= (+ main_~in~0 4) main_~inlen~0)} #105#return; {8910#(<= (+ main_~in~0 4) main_~inlen~0)} is VALID [2020-07-18 00:49:17,264 INFO L280 TraceCheckUtils]: 63: Hoare triple {8910#(<= (+ main_~in~0 4) main_~inlen~0)} #t~post3 := ~buf~0; {8910#(<= (+ main_~in~0 4) main_~inlen~0)} is VALID [2020-07-18 00:49:17,265 INFO L280 TraceCheckUtils]: 64: Hoare triple {8910#(<= (+ main_~in~0 4) main_~inlen~0)} ~buf~0 := 1 + #t~post3; {8910#(<= (+ main_~in~0 4) main_~inlen~0)} is VALID [2020-07-18 00:49:17,265 INFO L280 TraceCheckUtils]: 65: Hoare triple {8910#(<= (+ main_~in~0 4) main_~inlen~0)} havoc #t~post3; {8910#(<= (+ main_~in~0 4) main_~inlen~0)} is VALID [2020-07-18 00:49:17,266 INFO L280 TraceCheckUtils]: 66: Hoare triple {8910#(<= (+ main_~in~0 4) main_~inlen~0)} #t~post4 := ~in~0; {8919#(<= (+ |main_#t~post4| 4) main_~inlen~0)} is VALID [2020-07-18 00:49:17,267 INFO L280 TraceCheckUtils]: 67: Hoare triple {8919#(<= (+ |main_#t~post4| 4) main_~inlen~0)} ~in~0 := 1 + #t~post4; {8920#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:17,267 INFO L280 TraceCheckUtils]: 68: Hoare triple {8920#(<= (+ main_~in~0 3) main_~inlen~0)} havoc #t~post4; {8920#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:17,267 INFO L263 TraceCheckUtils]: 69: Hoare triple {8920#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {8880#true} is VALID [2020-07-18 00:49:17,267 INFO L280 TraceCheckUtils]: 70: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,268 INFO L280 TraceCheckUtils]: 71: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,268 INFO L280 TraceCheckUtils]: 72: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,268 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {8880#true} {8920#(<= (+ main_~in~0 3) main_~inlen~0)} #107#return; {8920#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:17,269 INFO L263 TraceCheckUtils]: 74: Hoare triple {8920#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {8880#true} is VALID [2020-07-18 00:49:17,269 INFO L280 TraceCheckUtils]: 75: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,269 INFO L280 TraceCheckUtils]: 76: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,269 INFO L280 TraceCheckUtils]: 77: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,270 INFO L275 TraceCheckUtils]: 78: Hoare quadruple {8880#true} {8920#(<= (+ main_~in~0 3) main_~inlen~0)} #109#return; {8920#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:17,270 INFO L280 TraceCheckUtils]: 79: Hoare triple {8920#(<= (+ main_~in~0 3) main_~inlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {8920#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:17,271 INFO L280 TraceCheckUtils]: 80: Hoare triple {8920#(<= (+ main_~in~0 3) main_~inlen~0)} assume !!(0 != #t~nondet2); {8920#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:17,271 INFO L280 TraceCheckUtils]: 81: Hoare triple {8920#(<= (+ main_~in~0 3) main_~inlen~0)} havoc #t~nondet2; {8920#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:17,272 INFO L280 TraceCheckUtils]: 82: Hoare triple {8920#(<= (+ main_~in~0 3) main_~inlen~0)} assume !(~buf~0 == ~buflim~0); {8920#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:17,272 INFO L263 TraceCheckUtils]: 83: Hoare triple {8920#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {8880#true} is VALID [2020-07-18 00:49:17,272 INFO L280 TraceCheckUtils]: 84: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,272 INFO L280 TraceCheckUtils]: 85: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,273 INFO L280 TraceCheckUtils]: 86: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,273 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {8880#true} {8920#(<= (+ main_~in~0 3) main_~inlen~0)} #103#return; {8920#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:17,273 INFO L263 TraceCheckUtils]: 88: Hoare triple {8920#(<= (+ main_~in~0 3) main_~inlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {8880#true} is VALID [2020-07-18 00:49:17,274 INFO L280 TraceCheckUtils]: 89: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,274 INFO L280 TraceCheckUtils]: 90: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,274 INFO L280 TraceCheckUtils]: 91: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,275 INFO L275 TraceCheckUtils]: 92: Hoare quadruple {8880#true} {8920#(<= (+ main_~in~0 3) main_~inlen~0)} #105#return; {8920#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:17,275 INFO L280 TraceCheckUtils]: 93: Hoare triple {8920#(<= (+ main_~in~0 3) main_~inlen~0)} #t~post3 := ~buf~0; {8920#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:17,276 INFO L280 TraceCheckUtils]: 94: Hoare triple {8920#(<= (+ main_~in~0 3) main_~inlen~0)} ~buf~0 := 1 + #t~post3; {8920#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:17,276 INFO L280 TraceCheckUtils]: 95: Hoare triple {8920#(<= (+ main_~in~0 3) main_~inlen~0)} havoc #t~post3; {8920#(<= (+ main_~in~0 3) main_~inlen~0)} is VALID [2020-07-18 00:49:17,277 INFO L280 TraceCheckUtils]: 96: Hoare triple {8920#(<= (+ main_~in~0 3) main_~inlen~0)} #t~post4 := ~in~0; {8937#(<= (+ |main_#t~post4| 3) main_~inlen~0)} is VALID [2020-07-18 00:49:17,278 INFO L280 TraceCheckUtils]: 97: Hoare triple {8937#(<= (+ |main_#t~post4| 3) main_~inlen~0)} ~in~0 := 1 + #t~post4; {8938#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:17,278 INFO L280 TraceCheckUtils]: 98: Hoare triple {8938#(<= (+ main_~in~0 2) main_~inlen~0)} havoc #t~post4; {8938#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:17,278 INFO L263 TraceCheckUtils]: 99: Hoare triple {8938#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {8880#true} is VALID [2020-07-18 00:49:17,279 INFO L280 TraceCheckUtils]: 100: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,279 INFO L280 TraceCheckUtils]: 101: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,279 INFO L280 TraceCheckUtils]: 102: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,281 INFO L275 TraceCheckUtils]: 103: Hoare quadruple {8880#true} {8938#(<= (+ main_~in~0 2) main_~inlen~0)} #107#return; {8938#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:17,281 INFO L263 TraceCheckUtils]: 104: Hoare triple {8938#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {8880#true} is VALID [2020-07-18 00:49:17,281 INFO L280 TraceCheckUtils]: 105: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,281 INFO L280 TraceCheckUtils]: 106: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,281 INFO L280 TraceCheckUtils]: 107: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,283 INFO L275 TraceCheckUtils]: 108: Hoare quadruple {8880#true} {8938#(<= (+ main_~in~0 2) main_~inlen~0)} #109#return; {8938#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:17,283 INFO L280 TraceCheckUtils]: 109: Hoare triple {8938#(<= (+ main_~in~0 2) main_~inlen~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {8938#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:17,284 INFO L280 TraceCheckUtils]: 110: Hoare triple {8938#(<= (+ main_~in~0 2) main_~inlen~0)} assume !!(0 != #t~nondet2); {8938#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:17,284 INFO L280 TraceCheckUtils]: 111: Hoare triple {8938#(<= (+ main_~in~0 2) main_~inlen~0)} havoc #t~nondet2; {8938#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:17,285 INFO L280 TraceCheckUtils]: 112: Hoare triple {8938#(<= (+ main_~in~0 2) main_~inlen~0)} assume !(~buf~0 == ~buflim~0); {8938#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:17,285 INFO L263 TraceCheckUtils]: 113: Hoare triple {8938#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {8880#true} is VALID [2020-07-18 00:49:17,285 INFO L280 TraceCheckUtils]: 114: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,285 INFO L280 TraceCheckUtils]: 115: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,285 INFO L280 TraceCheckUtils]: 116: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,286 INFO L275 TraceCheckUtils]: 117: Hoare quadruple {8880#true} {8938#(<= (+ main_~in~0 2) main_~inlen~0)} #103#return; {8938#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:17,286 INFO L263 TraceCheckUtils]: 118: Hoare triple {8938#(<= (+ main_~in~0 2) main_~inlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {8880#true} is VALID [2020-07-18 00:49:17,286 INFO L280 TraceCheckUtils]: 119: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,287 INFO L280 TraceCheckUtils]: 120: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,287 INFO L280 TraceCheckUtils]: 121: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,288 INFO L275 TraceCheckUtils]: 122: Hoare quadruple {8880#true} {8938#(<= (+ main_~in~0 2) main_~inlen~0)} #105#return; {8938#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:17,288 INFO L280 TraceCheckUtils]: 123: Hoare triple {8938#(<= (+ main_~in~0 2) main_~inlen~0)} #t~post3 := ~buf~0; {8938#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:17,289 INFO L280 TraceCheckUtils]: 124: Hoare triple {8938#(<= (+ main_~in~0 2) main_~inlen~0)} ~buf~0 := 1 + #t~post3; {8938#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:17,289 INFO L280 TraceCheckUtils]: 125: Hoare triple {8938#(<= (+ main_~in~0 2) main_~inlen~0)} havoc #t~post3; {8938#(<= (+ main_~in~0 2) main_~inlen~0)} is VALID [2020-07-18 00:49:17,290 INFO L280 TraceCheckUtils]: 126: Hoare triple {8938#(<= (+ main_~in~0 2) main_~inlen~0)} #t~post4 := ~in~0; {8955#(<= (+ |main_#t~post4| 2) main_~inlen~0)} is VALID [2020-07-18 00:49:17,290 INFO L280 TraceCheckUtils]: 127: Hoare triple {8955#(<= (+ |main_#t~post4| 2) main_~inlen~0)} ~in~0 := 1 + #t~post4; {8956#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-18 00:49:17,291 INFO L280 TraceCheckUtils]: 128: Hoare triple {8956#(<= (+ main_~in~0 1) main_~inlen~0)} havoc #t~post4; {8956#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-18 00:49:17,291 INFO L263 TraceCheckUtils]: 129: Hoare triple {8956#(<= (+ main_~in~0 1) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {8880#true} is VALID [2020-07-18 00:49:17,291 INFO L280 TraceCheckUtils]: 130: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-18 00:49:17,291 INFO L280 TraceCheckUtils]: 131: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-18 00:49:17,292 INFO L280 TraceCheckUtils]: 132: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-18 00:49:17,293 INFO L275 TraceCheckUtils]: 133: Hoare quadruple {8880#true} {8956#(<= (+ main_~in~0 1) main_~inlen~0)} #107#return; {8956#(<= (+ main_~in~0 1) main_~inlen~0)} is VALID [2020-07-18 00:49:17,293 INFO L263 TraceCheckUtils]: 134: Hoare triple {8956#(<= (+ main_~in~0 1) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {8961#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:49:17,294 INFO L280 TraceCheckUtils]: 135: Hoare triple {8961#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {8962#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:49:17,295 INFO L280 TraceCheckUtils]: 136: Hoare triple {8962#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {8881#false} is VALID [2020-07-18 00:49:17,295 INFO L280 TraceCheckUtils]: 137: Hoare triple {8881#false} assume !false; {8881#false} is VALID [2020-07-18 00:49:17,318 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-18 00:49:17,318 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:17,319 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1528759638] [2020-07-18 00:49:17,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:17,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-07-18 00:49:17,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455191825] [2020-07-18 00:49:17,322 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 138 [2020-07-18 00:49:17,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:17,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2020-07-18 00:49:17,449 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-18 00:49:17,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-18 00:49:17,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:17,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-18 00:49:17,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2020-07-18 00:49:17,450 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 21 states. [2020-07-18 00:49:19,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:19,798 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2020-07-18 00:49:19,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-18 00:49:19,798 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 138 [2020-07-18 00:49:19,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-18 00:49:19,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 55 transitions. [2020-07-18 00:49:19,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-18 00:49:19,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 55 transitions. [2020-07-18 00:49:19,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 55 transitions. [2020-07-18 00:49:19,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:19,889 INFO L225 Difference]: With dead ends: 117 [2020-07-18 00:49:19,890 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 00:49:19,891 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=232, Invalid=890, Unknown=0, NotChecked=0, Total=1122 [2020-07-18 00:49:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 00:49:19,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 00:49:19,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:19,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:19,892 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:19,892 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:19,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:19,892 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:49:19,893 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:49:19,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:19,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:19,893 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:19,893 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:19,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:19,894 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:49:19,894 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:49:19,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:19,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:19,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:19,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:19,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 00:49:19,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 00:49:19,895 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2020-07-18 00:49:19,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:19,895 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 00:49:19,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-18 00:49:19,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 00:49:19,896 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-18 00:49:19,896 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:49:19,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:19,896 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-18 00:49:19,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 00:49:21,366 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 26 [2020-07-18 00:49:21,620 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 29 [2020-07-18 00:49:22,157 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 36 [2020-07-18 00:49:22,165 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:49:22,165 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:49:22,165 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:49:22,165 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 00:49:22,166 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 00:49:22,166 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:49:22,166 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-18 00:49:22,166 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-18 00:49:22,166 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-18 00:49:22,166 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-18 00:49:22,166 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-18 00:49:22,167 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (let ((.cse0 (<= 2 main_~bufferlen~0)) (.cse1 (+ main_~buf~0 main_~inlen~0)) (.cse2 (<= 0 main_~in~0)) (.cse3 (<= (+ main_~buf~0 1) main_~buflim~0)) (.cse4 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse5 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (<= (+ main_~in~0 main_~buflim~0 3) .cse1) .cse2 .cse3 .cse4 (<= 1 main_~buf~0) .cse5) (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) .cse1) .cse2 .cse3 .cse4 (<= 0 main_~buf~0) .cse5))) [2020-07-18 00:49:22,167 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 45) the Hoare annotation is: true [2020-07-18 00:49:22,167 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-18 00:49:22,167 INFO L271 CegarLoopResult]: At program point L44(lines 14 45) the Hoare annotation is: true [2020-07-18 00:49:22,167 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 0 |main_#t~post5|) (<= (+ |main_#t~post5| 2) main_~bufferlen~0) (<= 0 main_~buf~0)) [2020-07-18 00:49:22,167 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 0 |main_#t~post5|) (<= (+ |main_#t~post5| 2) main_~bufferlen~0) (<= 1 main_~buf~0)) [2020-07-18 00:49:22,168 INFO L264 CegarLoopResult]: At program point L36(lines 26 37) the Hoare annotation is: (let ((.cse1 (+ main_~buf~0 main_~inlen~0)) (.cse0 (<= main_~buf~0 main_~buflim~0)) (.cse2 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (<= (+ main_~in~0 main_~buflim~0 3) .cse1) (<= 1 main_~in~0) .cse2 (<= 1 main_~buf~0) .cse3) (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse1) .cse0 (<= 0 main_~in~0) .cse2 .cse3 (<= 0 main_~buf~0)))) [2020-07-18 00:49:22,168 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (let ((.cse9 (+ main_~in~0 main_~buflim~0 3))) (let ((.cse0 (<= 2 main_~bufferlen~0)) (.cse2 (<= (+ |main_#t~post3| 1) main_~buflim~0)) (.cse3 (<= .cse9 (+ |main_#t~post3| main_~inlen~0))) (.cse1 (+ main_~buf~0 main_~inlen~0)) (.cse4 (<= 0 |main_#t~post3|)) (.cse6 (<= (+ main_~buf~0 1) main_~buflim~0)) (.cse5 (<= 0 main_~in~0)) (.cse7 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse8 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 main_~buf~0) .cse8) (and .cse0 .cse2 .cse3 (<= .cse9 .cse1) .cse4 .cse6 .cse5 .cse7 (<= 1 main_~buf~0) .cse8)))) [2020-07-18 00:49:22,168 INFO L264 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: (and (<= (+ main_~in~0 main_~buflim~0 4) (+ main_~buf~0 main_~inlen~0)) (<= (+ |main_#t~post3| 1) main_~buflim~0) (<= (+ main_~in~0 main_~buflim~0 3) (+ |main_#t~post3| main_~inlen~0)) (<= main_~buf~0 main_~buflim~0) (<= 0 |main_#t~post3|) (<= 0 main_~in~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~buf~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-07-18 00:49:22,168 INFO L264 CegarLoopResult]: At program point L28(lines 28 29) the Hoare annotation is: (let ((.cse1 (+ main_~buf~0 main_~inlen~0)) (.cse0 (<= main_~buf~0 main_~buflim~0)) (.cse2 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (<= (+ main_~in~0 main_~buflim~0 3) .cse1) (<= 1 main_~in~0) .cse2 (<= 1 main_~buf~0) .cse3) (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse1) .cse0 (<= 0 main_~in~0) .cse2 .cse3 (<= 0 main_~buf~0)))) [2020-07-18 00:49:22,168 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= 0 main_~buf~0)) [2020-07-18 00:49:22,168 INFO L271 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-07-18 00:49:22,169 INFO L264 CegarLoopResult]: At program point L20-1(lines 14 45) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2020-07-18 00:49:22,169 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-18 00:49:22,169 INFO L271 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: true [2020-07-18 00:49:22,169 INFO L271 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: true [2020-07-18 00:49:22,169 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 1 main_~buf~0)) [2020-07-18 00:49:22,169 INFO L264 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 1) main_~bufferlen~0)) [2020-07-18 00:49:22,169 INFO L264 CegarLoopResult]: At program point L33(lines 33 34) the Hoare annotation is: (and (<= (+ main_~in~0 main_~buflim~0 4) (+ main_~buf~0 main_~inlen~0)) (<= main_~buf~0 main_~buflim~0) (<= 0 main_~in~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~buf~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-07-18 00:49:22,169 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 0 main_~in~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= 0 main_~buf~0)) [2020-07-18 00:49:22,169 INFO L264 CegarLoopResult]: At program point L21(lines 14 45) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2020-07-18 00:49:22,170 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-18 00:49:22,170 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-07-18 00:49:22,170 INFO L271 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-07-18 00:49:22,170 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 45) the Hoare annotation is: true [2020-07-18 00:49:22,170 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-07-18 00:49:22,170 INFO L264 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 0 main_~buf~0)) [2020-07-18 00:49:22,170 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (let ((.cse0 (+ main_~buf~0 main_~inlen~0))) (and (<= 0 |main_#t~post4|) (<= (+ main_~in~0 main_~buflim~0 4) .cse0) (<= main_~buf~0 main_~buflim~0) (<= (+ |main_#t~post4| main_~buflim~0 4) .cse0) (<= 0 main_~in~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~buf~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))) [2020-07-18 00:49:22,171 INFO L264 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse0 (+ main_~buf~0 main_~inlen~0))) (and (<= 0 |main_#t~post4|) (<= (+ main_~in~0 main_~buflim~0 3) .cse0) (<= main_~buf~0 main_~buflim~0) (<= (+ |main_#t~post4| main_~buflim~0 4) .cse0) (<= 1 main_~in~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~buf~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))) [2020-07-18 00:49:22,171 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (let ((.cse0 (+ main_~buf~0 main_~inlen~0)) (.cse1 (<= (+ main_~buf~0 1) main_~buflim~0)) (.cse2 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse0) (<= 0 main_~in~0) .cse1 .cse2 (<= 0 main_~buf~0) .cse3) (and (<= (+ main_~in~0 main_~buflim~0 3) .cse0) .cse1 (<= 1 main_~in~0) .cse2 (<= 1 main_~buf~0) .cse3))) [2020-07-18 00:49:22,171 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 45) the Hoare annotation is: true [2020-07-18 00:49:22,171 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (let ((.cse0 (+ main_~buf~0 main_~inlen~0)) (.cse1 (<= (+ main_~buf~0 1) main_~buflim~0)) (.cse2 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse0) (<= 0 main_~in~0) .cse1 .cse2 (<= 0 main_~buf~0) .cse3) (and (<= (+ main_~in~0 main_~buflim~0 3) .cse0) .cse1 (<= 1 main_~in~0) .cse2 (<= 1 main_~buf~0) .cse3))) [2020-07-18 00:49:22,171 INFO L264 CegarLoopResult]: At program point L26-1(lines 26 37) the Hoare annotation is: (let ((.cse1 (+ main_~buf~0 main_~inlen~0)) (.cse0 (<= main_~buf~0 main_~buflim~0)) (.cse2 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (<= (+ main_~in~0 main_~buflim~0 3) .cse1) (<= 1 main_~in~0) .cse2 (<= 1 main_~buf~0) .cse3) (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse1) .cse0 (<= 0 main_~in~0) .cse2 .cse3 (<= 0 main_~buf~0)))) [2020-07-18 00:49:22,171 INFO L264 CegarLoopResult]: At program point L26-2(line 26) the Hoare annotation is: (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 0 main_~buf~0)) [2020-07-18 00:49:22,171 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-07-18 00:49:22,171 INFO L264 CegarLoopResult]: At program point L26-4(line 26) the Hoare annotation is: (let ((.cse1 (+ main_~buf~0 main_~inlen~0)) (.cse0 (<= main_~buf~0 main_~buflim~0)) (.cse2 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (<= (+ main_~in~0 main_~buflim~0 3) .cse1) (<= 1 main_~in~0) .cse2 (<= 1 main_~buf~0) .cse3) (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse1) .cse0 (<= 0 main_~in~0) .cse2 .cse3 (<= 0 main_~buf~0)))) [2020-07-18 00:49:22,172 INFO L264 CegarLoopResult]: At program point L26-5(lines 26 37) the Hoare annotation is: (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 0 main_~buf~0)) [2020-07-18 00:49:22,172 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-18 00:49:22,172 INFO L271 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: true [2020-07-18 00:49:22,172 INFO L271 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: true [2020-07-18 00:49:22,172 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 0 main_~buf~0)) [2020-07-18 00:49:22,172 INFO L264 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buf~0 main_~buflim~0) (<= 1 main_~in~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~buf~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-07-18 00:49:22,172 INFO L264 CegarLoopResult]: At program point L35-1(line 35) the Hoare annotation is: (and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buf~0 main_~buflim~0) (<= 1 main_~in~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~buf~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-07-18 00:49:22,172 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-18 00:49:22,172 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-18 00:49:22,172 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 00:49:22,172 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-18 00:49:22,173 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-18 00:49:22,173 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 00:49:22,177 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-18 00:49:22,178 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 00:49:22,178 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 00:49:22,179 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-18 00:49:22,180 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-18 00:49:22,204 INFO L163 areAnnotationChecker]: CFG has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 00:49:22,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 12:49:22 BoogieIcfgContainer [2020-07-18 00:49:22,217 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 00:49:22,220 INFO L168 Benchmark]: Toolchain (without parser) took 30278.82 ms. Allocated memory was 144.2 MB in the beginning and 404.2 MB in the end (delta: 260.0 MB). Free memory was 102.5 MB in the beginning and 210.8 MB in the end (delta: -108.2 MB). Peak memory consumption was 151.8 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:22,220 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 144.2 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 00:49:22,221 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.35 ms. Allocated memory is still 144.2 MB. Free memory was 102.3 MB in the beginning and 92.1 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:22,221 INFO L168 Benchmark]: Boogie Preprocessor took 165.01 ms. Allocated memory was 144.2 MB in the beginning and 203.4 MB in the end (delta: 59.2 MB). Free memory was 92.1 MB in the beginning and 181.5 MB in the end (delta: -89.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:22,222 INFO L168 Benchmark]: RCFGBuilder took 461.34 ms. Allocated memory is still 203.4 MB. Free memory was 181.5 MB in the beginning and 155.1 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:22,222 INFO L168 Benchmark]: TraceAbstraction took 29381.67 ms. Allocated memory was 203.4 MB in the beginning and 404.2 MB in the end (delta: 200.8 MB). Free memory was 155.1 MB in the beginning and 210.8 MB in the end (delta: -55.7 MB). Peak memory consumption was 145.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:22,225 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.19 ms. Allocated memory is still 144.2 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 264.35 ms. Allocated memory is still 144.2 MB. Free memory was 102.3 MB in the beginning and 92.1 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 165.01 ms. Allocated memory was 144.2 MB in the beginning and 203.4 MB in the end (delta: 59.2 MB). Free memory was 92.1 MB in the beginning and 181.5 MB in the end (delta: -89.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 461.34 ms. Allocated memory is still 203.4 MB. Free memory was 181.5 MB in the beginning and 155.1 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29381.67 ms. Allocated memory was 203.4 MB in the beginning and 404.2 MB in the end (delta: 200.8 MB). Free memory was 155.1 MB in the beginning and 210.8 MB in the end (delta: -55.7 MB). Peak memory consumption was 145.1 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: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((((buf <= buflim && in + buflim + 3 <= buf + inlen) && 1 <= in) && buflim + 2 <= bufferlen) && 1 <= buf) && bufferlen + 1 <= inlen) || (((((in + bufferlen + 1 <= buf + inlen && buf <= buflim) && 0 <= in) && buflim + 2 <= bufferlen) && bufferlen + 1 <= inlen) && 0 <= buf) - 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, 60 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 26.9s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 16.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 861 SDtfs, 913 SDslu, 3779 SDs, 0 SdLazy, 1782 SolverSat, 404 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 479 GetRequests, 258 SyntacticMatches, 1 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 101 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 55 LocationsWithAnnotation, 289 PreInvPairs, 460 NumberOfFragments, 917 HoareAnnotationTreeSize, 289 FomulaSimplifications, 48443 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 55 FomulaSimplificationsInter, 3846 FormulaSimplificationTreeSizeReductionInter, 1.5s 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...