/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-8fc6572 [2020-07-10 20:24:21,372 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:24:21,375 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:24:21,391 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:24:21,391 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:24:21,392 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:24:21,393 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:24:21,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:24:21,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:24:21,398 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:24:21,399 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:24:21,400 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:24:21,400 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:24:21,401 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:24:21,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:24:21,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:24:21,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:24:21,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:24:21,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:24:21,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:24:21,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:24:21,412 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:24:21,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:24:21,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:24:21,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:24:21,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:24:21,417 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:24:21,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:24:21,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:24:21,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:24:21,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:24:21,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:24:21,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:24:21,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:24:21,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:24:21,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:24:21,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:24:21,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:24:21,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:24:21,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:24:21,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:24:21,428 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:24:21,438 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:24:21,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:24:21,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:24:21,442 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:24:21,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:24:21,443 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:24:21,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:24:21,443 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:24:21,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:24:21,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:24:21,444 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:24:21,444 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:24:21,444 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:24:21,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:24:21,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:24:21,445 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:24:21,445 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:24:21,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:24:21,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:24:21,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:24:21,446 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:24:21,446 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:24:21,446 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:24:21,732 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:24:21,743 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:24:21,746 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:24:21,748 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:24:21,749 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:24:21,749 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-10 20:24:21,830 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feefad9f0/d05d18e0ab284f54b7daac8a2443540f/FLAGc544dfafd [2020-07-10 20:24:22,330 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:24:22,331 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2020-07-10 20:24:22,337 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feefad9f0/d05d18e0ab284f54b7daac8a2443540f/FLAGc544dfafd [2020-07-10 20:24:22,687 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feefad9f0/d05d18e0ab284f54b7daac8a2443540f [2020-07-10 20:24:22,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:24:22,699 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:24:22,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:24:22,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:24:22,704 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:24:22,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:24:22" (1/1) ... [2020-07-10 20:24:22,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4767c110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:22, skipping insertion in model container [2020-07-10 20:24:22,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:24:22" (1/1) ... [2020-07-10 20:24:22,716 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:24:22,733 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:24:22,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:24:22,948 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:24:22,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:24:22,982 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:24:22,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:22 WrapperNode [2020-07-10 20:24:22,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:24:22,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:24:22,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:24:22,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:24:23,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:22" (1/1) ... [2020-07-10 20:24:23,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:22" (1/1) ... [2020-07-10 20:24:23,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:22" (1/1) ... [2020-07-10 20:24:23,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:22" (1/1) ... [2020-07-10 20:24:23,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:22" (1/1) ... [2020-07-10 20:24:23,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:22" (1/1) ... [2020-07-10 20:24:23,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:22" (1/1) ... [2020-07-10 20:24:23,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:24:23,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:24:23,110 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:24:23,111 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:24:23,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:24:23,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:24:23,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:24:23,173 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:24:23,173 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:24:23,173 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:24:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:24:23,174 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:24:23,174 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:24:23,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:24:23,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:24:23,174 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:24:23,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:24:23,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:24:23,594 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:24:23,595 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 20:24:23,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:24:23 BoogieIcfgContainer [2020-07-10 20:24:23,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:24:23,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:24:23,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:24:23,604 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:24:23,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:24:22" (1/3) ... [2020-07-10 20:24:23,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c56fa2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:24:23, skipping insertion in model container [2020-07-10 20:24:23,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:22" (2/3) ... [2020-07-10 20:24:23,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c56fa2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:24:23, skipping insertion in model container [2020-07-10 20:24:23,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:24:23" (3/3) ... [2020-07-10 20:24:23,608 INFO L109 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2020-07-10 20:24:23,619 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:24:23,627 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:24:23,642 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:24:23,663 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:24:23,664 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:24:23,664 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:24:23,664 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:24:23,664 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:24:23,664 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:24:23,664 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:24:23,664 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:24:23,679 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2020-07-10 20:24:23,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 20:24:23,690 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:23,691 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-10 20:24:23,692 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:23,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:23,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1122321079, now seen corresponding path program 1 times [2020-07-10 20:24:23,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:23,705 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1077145137] [2020-07-10 20:24:23,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:23,855 INFO L280 TraceCheckUtils]: 0: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-10 20:24:23,855 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {58#true} {58#true} #99#return; {58#true} is VALID [2020-07-10 20:24:23,857 INFO L263 TraceCheckUtils]: 0: Hoare triple {58#true} call ULTIMATE.init(); {58#true} is VALID [2020-07-10 20:24:23,858 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-10 20:24:23,858 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {58#true} {58#true} #99#return; {58#true} is VALID [2020-07-10 20:24:23,859 INFO L263 TraceCheckUtils]: 3: Hoare triple {58#true} call #t~ret7 := main(); {58#true} is VALID [2020-07-10 20:24:23,859 INFO L280 TraceCheckUtils]: 4: Hoare triple {58#true} havoc ~in~0; {58#true} is VALID [2020-07-10 20:24:23,859 INFO L280 TraceCheckUtils]: 5: Hoare triple {58#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {58#true} is VALID [2020-07-10 20:24:23,860 INFO L280 TraceCheckUtils]: 6: Hoare triple {58#true} ~inlen~0 := #t~nondet0; {58#true} is VALID [2020-07-10 20:24:23,860 INFO L280 TraceCheckUtils]: 7: Hoare triple {58#true} havoc #t~nondet0; {58#true} is VALID [2020-07-10 20:24:23,860 INFO L280 TraceCheckUtils]: 8: Hoare triple {58#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {58#true} is VALID [2020-07-10 20:24:23,861 INFO L280 TraceCheckUtils]: 9: Hoare triple {58#true} ~bufferlen~0 := #t~nondet1; {58#true} is VALID [2020-07-10 20:24:23,861 INFO L280 TraceCheckUtils]: 10: Hoare triple {58#true} havoc #t~nondet1; {58#true} is VALID [2020-07-10 20:24:23,861 INFO L280 TraceCheckUtils]: 11: Hoare triple {58#true} havoc ~buf~0; {58#true} is VALID [2020-07-10 20:24:23,862 INFO L280 TraceCheckUtils]: 12: Hoare triple {58#true} havoc ~buflim~0; {58#true} is VALID [2020-07-10 20:24:23,862 INFO L280 TraceCheckUtils]: 13: Hoare triple {58#true} assume ~bufferlen~0 > 1; {58#true} is VALID [2020-07-10 20:24:23,863 INFO L280 TraceCheckUtils]: 14: Hoare triple {58#true} assume ~inlen~0 > 0; {58#true} is VALID [2020-07-10 20:24:23,863 INFO L280 TraceCheckUtils]: 15: Hoare triple {58#true} assume ~bufferlen~0 < ~inlen~0; {58#true} is VALID [2020-07-10 20:24:23,864 INFO L280 TraceCheckUtils]: 16: Hoare triple {58#true} ~buf~0 := 0; {58#true} is VALID [2020-07-10 20:24:23,866 INFO L280 TraceCheckUtils]: 17: Hoare triple {58#true} ~in~0 := 0; {58#true} is VALID [2020-07-10 20:24:23,866 INFO L280 TraceCheckUtils]: 18: Hoare triple {58#true} ~buflim~0 := ~bufferlen~0 - 2; {58#true} is VALID [2020-07-10 20:24:23,873 INFO L280 TraceCheckUtils]: 19: Hoare triple {58#true} assume !true; {59#false} is VALID [2020-07-10 20:24:23,874 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-10 20:24:23,874 INFO L280 TraceCheckUtils]: 21: Hoare triple {59#false} ~cond := #in~cond; {59#false} is VALID [2020-07-10 20:24:23,874 INFO L280 TraceCheckUtils]: 22: Hoare triple {59#false} assume 0 == ~cond; {59#false} is VALID [2020-07-10 20:24:23,875 INFO L280 TraceCheckUtils]: 23: Hoare triple {59#false} assume !false; {59#false} is VALID [2020-07-10 20:24:23,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:23,879 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:23,884 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1077145137] [2020-07-10 20:24:23,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:23,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 20:24:23,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462179585] [2020-07-10 20:24:23,893 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2020-07-10 20:24:23,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:23,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 20:24:23,947 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-10 20:24:23,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 20:24:23,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:23,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 20:24:23,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 20:24:23,959 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2020-07-10 20:24:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:24,150 INFO L93 Difference]: Finished difference Result 91 states and 122 transitions. [2020-07-10 20:24:24,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 20:24:24,150 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2020-07-10 20:24:24,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:24,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 20:24:24,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 122 transitions. [2020-07-10 20:24:24,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 20:24:24,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 122 transitions. [2020-07-10 20:24:24,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 122 transitions. [2020-07-10 20:24:24,375 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-10 20:24:24,390 INFO L225 Difference]: With dead ends: 91 [2020-07-10 20:24:24,390 INFO L226 Difference]: Without dead ends: 47 [2020-07-10 20:24:24,395 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 20:24:24,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-10 20:24:24,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-10 20:24:24,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:24,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2020-07-10 20:24:24,470 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-10 20:24:24,471 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-10 20:24:24,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:24,478 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2020-07-10 20:24:24,479 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-10 20:24:24,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:24,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:24,480 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-10 20:24:24,481 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-10 20:24:24,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:24,487 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2020-07-10 20:24:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-10 20:24:24,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:24,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:24,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:24,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:24,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-10 20:24:24,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2020-07-10 20:24:24,496 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 24 [2020-07-10 20:24:24,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:24,497 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2020-07-10 20:24:24,497 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 20:24:24,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 55 transitions. [2020-07-10 20:24:24,564 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-10 20:24:24,564 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-10 20:24:24,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 20:24:24,566 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:24,566 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-10 20:24:24,566 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:24:24,567 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:24,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:24,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1949391841, now seen corresponding path program 1 times [2020-07-10 20:24:24,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:24,568 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [353101148] [2020-07-10 20:24:24,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:24,724 INFO L280 TraceCheckUtils]: 0: Hoare triple {434#true} assume true; {434#true} is VALID [2020-07-10 20:24:24,726 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {434#true} {434#true} #99#return; {434#true} is VALID [2020-07-10 20:24:24,726 INFO L263 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2020-07-10 20:24:24,727 INFO L280 TraceCheckUtils]: 1: Hoare triple {434#true} assume true; {434#true} is VALID [2020-07-10 20:24:24,727 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {434#true} {434#true} #99#return; {434#true} is VALID [2020-07-10 20:24:24,727 INFO L263 TraceCheckUtils]: 3: Hoare triple {434#true} call #t~ret7 := main(); {434#true} is VALID [2020-07-10 20:24:24,728 INFO L280 TraceCheckUtils]: 4: Hoare triple {434#true} havoc ~in~0; {434#true} is VALID [2020-07-10 20:24:24,728 INFO L280 TraceCheckUtils]: 5: Hoare triple {434#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {434#true} is VALID [2020-07-10 20:24:24,728 INFO L280 TraceCheckUtils]: 6: Hoare triple {434#true} ~inlen~0 := #t~nondet0; {434#true} is VALID [2020-07-10 20:24:24,729 INFO L280 TraceCheckUtils]: 7: Hoare triple {434#true} havoc #t~nondet0; {434#true} is VALID [2020-07-10 20:24:24,730 INFO L280 TraceCheckUtils]: 8: Hoare triple {434#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {434#true} is VALID [2020-07-10 20:24:24,730 INFO L280 TraceCheckUtils]: 9: Hoare triple {434#true} ~bufferlen~0 := #t~nondet1; {434#true} is VALID [2020-07-10 20:24:24,731 INFO L280 TraceCheckUtils]: 10: Hoare triple {434#true} havoc #t~nondet1; {434#true} is VALID [2020-07-10 20:24:24,731 INFO L280 TraceCheckUtils]: 11: Hoare triple {434#true} havoc ~buf~0; {434#true} is VALID [2020-07-10 20:24:24,732 INFO L280 TraceCheckUtils]: 12: Hoare triple {434#true} havoc ~buflim~0; {434#true} is VALID [2020-07-10 20:24:24,732 INFO L280 TraceCheckUtils]: 13: Hoare triple {434#true} assume ~bufferlen~0 > 1; {434#true} is VALID [2020-07-10 20:24:24,733 INFO L280 TraceCheckUtils]: 14: Hoare triple {434#true} assume ~inlen~0 > 0; {434#true} is VALID [2020-07-10 20:24:24,733 INFO L280 TraceCheckUtils]: 15: Hoare triple {434#true} assume ~bufferlen~0 < ~inlen~0; {434#true} is VALID [2020-07-10 20:24:24,735 INFO L280 TraceCheckUtils]: 16: Hoare triple {434#true} ~buf~0 := 0; {438#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:24,736 INFO L280 TraceCheckUtils]: 17: Hoare triple {438#(<= 0 main_~buf~0)} ~in~0 := 0; {438#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:24,738 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-10 20:24:24,739 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-10 20:24:24,740 INFO L280 TraceCheckUtils]: 20: Hoare triple {438#(<= 0 main_~buf~0)} assume !(0 != #t~nondet2); {438#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:24,742 INFO L280 TraceCheckUtils]: 21: Hoare triple {438#(<= 0 main_~buf~0)} havoc #t~nondet2; {438#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:24,744 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-10 20:24:24,750 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-10 20:24:24,751 INFO L280 TraceCheckUtils]: 24: Hoare triple {440#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {435#false} is VALID [2020-07-10 20:24:24,752 INFO L280 TraceCheckUtils]: 25: Hoare triple {435#false} assume !false; {435#false} is VALID [2020-07-10 20:24:24,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:24,756 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:24,757 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [353101148] [2020-07-10 20:24:24,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:24,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:24:24,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969215258] [2020-07-10 20:24:24,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-07-10 20:24:24,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:24,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:24:24,796 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-10 20:24:24,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:24:24,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:24,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:24:24,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:24:24,798 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 5 states. [2020-07-10 20:24:25,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:25,216 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2020-07-10 20:24:25,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:24:25,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-07-10 20:24:25,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:25,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:24:25,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2020-07-10 20:24:25,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:24:25,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2020-07-10 20:24:25,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2020-07-10 20:24:25,342 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-10 20:24:25,348 INFO L225 Difference]: With dead ends: 66 [2020-07-10 20:24:25,349 INFO L226 Difference]: Without dead ends: 64 [2020-07-10 20:24:25,351 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:24:25,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-10 20:24:25,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2020-07-10 20:24:25,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:25,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 58 states. [2020-07-10 20:24:25,423 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 58 states. [2020-07-10 20:24:25,423 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 58 states. [2020-07-10 20:24:25,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:25,433 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2020-07-10 20:24:25,434 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2020-07-10 20:24:25,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:25,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:25,439 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 64 states. [2020-07-10 20:24:25,439 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 64 states. [2020-07-10 20:24:25,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:25,452 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2020-07-10 20:24:25,453 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2020-07-10 20:24:25,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:25,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:25,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:25,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:25,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-10 20:24:25,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2020-07-10 20:24:25,467 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 26 [2020-07-10 20:24:25,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:25,467 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2020-07-10 20:24:25,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:24:25,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states and 69 transitions. [2020-07-10 20:24:25,590 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:25,590 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2020-07-10 20:24:25,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 20:24:25,591 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:25,592 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-10 20:24:25,592 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:24:25,593 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:25,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:25,593 INFO L82 PathProgramCache]: Analyzing trace with hash -873076999, now seen corresponding path program 1 times [2020-07-10 20:24:25,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:25,594 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [944363080] [2020-07-10 20:24:25,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:25,735 INFO L280 TraceCheckUtils]: 0: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-10 20:24:25,736 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {821#true} {821#true} #99#return; {821#true} is VALID [2020-07-10 20:24:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:25,746 INFO L280 TraceCheckUtils]: 0: Hoare triple {821#true} ~cond := #in~cond; {821#true} is VALID [2020-07-10 20:24:25,746 INFO L280 TraceCheckUtils]: 1: Hoare triple {821#true} assume !(0 == ~cond); {821#true} is VALID [2020-07-10 20:24:25,747 INFO L280 TraceCheckUtils]: 2: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-10 20:24:25,748 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-10 20:24:25,749 INFO L263 TraceCheckUtils]: 0: Hoare triple {821#true} call ULTIMATE.init(); {821#true} is VALID [2020-07-10 20:24:25,749 INFO L280 TraceCheckUtils]: 1: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-10 20:24:25,749 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {821#true} {821#true} #99#return; {821#true} is VALID [2020-07-10 20:24:25,750 INFO L263 TraceCheckUtils]: 3: Hoare triple {821#true} call #t~ret7 := main(); {821#true} is VALID [2020-07-10 20:24:25,750 INFO L280 TraceCheckUtils]: 4: Hoare triple {821#true} havoc ~in~0; {821#true} is VALID [2020-07-10 20:24:25,750 INFO L280 TraceCheckUtils]: 5: Hoare triple {821#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {821#true} is VALID [2020-07-10 20:24:25,751 INFO L280 TraceCheckUtils]: 6: Hoare triple {821#true} ~inlen~0 := #t~nondet0; {821#true} is VALID [2020-07-10 20:24:25,751 INFO L280 TraceCheckUtils]: 7: Hoare triple {821#true} havoc #t~nondet0; {821#true} is VALID [2020-07-10 20:24:25,751 INFO L280 TraceCheckUtils]: 8: Hoare triple {821#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {821#true} is VALID [2020-07-10 20:24:25,751 INFO L280 TraceCheckUtils]: 9: Hoare triple {821#true} ~bufferlen~0 := #t~nondet1; {821#true} is VALID [2020-07-10 20:24:25,752 INFO L280 TraceCheckUtils]: 10: Hoare triple {821#true} havoc #t~nondet1; {821#true} is VALID [2020-07-10 20:24:25,752 INFO L280 TraceCheckUtils]: 11: Hoare triple {821#true} havoc ~buf~0; {821#true} is VALID [2020-07-10 20:24:25,752 INFO L280 TraceCheckUtils]: 12: Hoare triple {821#true} havoc ~buflim~0; {821#true} is VALID [2020-07-10 20:24:25,753 INFO L280 TraceCheckUtils]: 13: Hoare triple {821#true} assume ~bufferlen~0 > 1; {825#(<= 2 main_~bufferlen~0)} is VALID [2020-07-10 20:24:25,754 INFO L280 TraceCheckUtils]: 14: Hoare triple {825#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {825#(<= 2 main_~bufferlen~0)} is VALID [2020-07-10 20:24:25,755 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-10 20:24:25,755 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-10 20:24:25,756 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-10 20:24:25,756 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-10 20:24:25,757 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-10 20:24:25,757 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-10 20:24:25,758 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-10 20:24:25,758 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-10 20:24:25,758 INFO L280 TraceCheckUtils]: 23: Hoare triple {821#true} ~cond := #in~cond; {821#true} is VALID [2020-07-10 20:24:25,759 INFO L280 TraceCheckUtils]: 24: Hoare triple {821#true} assume !(0 == ~cond); {821#true} is VALID [2020-07-10 20:24:25,759 INFO L280 TraceCheckUtils]: 25: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-10 20:24:25,760 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-10 20:24:25,762 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-10 20:24:25,764 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-10 20:24:25,766 INFO L280 TraceCheckUtils]: 29: Hoare triple {832#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {822#false} is VALID [2020-07-10 20:24:25,767 INFO L280 TraceCheckUtils]: 30: Hoare triple {822#false} assume !false; {822#false} is VALID [2020-07-10 20:24:25,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:25,769 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:25,769 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [944363080] [2020-07-10 20:24:25,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:25,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 20:24:25,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119842285] [2020-07-10 20:24:25,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-07-10 20:24:25,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:25,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 20:24:25,813 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-10 20:24:25,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 20:24:25,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:25,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 20:24:25,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:24:25,814 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 6 states. [2020-07-10 20:24:26,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:26,325 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2020-07-10 20:24:26,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 20:24:26,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-07-10 20:24:26,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:26,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:24:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2020-07-10 20:24:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:24:26,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2020-07-10 20:24:26,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 79 transitions. [2020-07-10 20:24:26,437 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-10 20:24:26,441 INFO L225 Difference]: With dead ends: 70 [2020-07-10 20:24:26,441 INFO L226 Difference]: Without dead ends: 68 [2020-07-10 20:24:26,442 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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-10 20:24:26,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-10 20:24:26,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2020-07-10 20:24:26,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:26,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 64 states. [2020-07-10 20:24:26,512 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 64 states. [2020-07-10 20:24:26,512 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 64 states. [2020-07-10 20:24:26,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:26,517 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2020-07-10 20:24:26,517 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2020-07-10 20:24:26,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:26,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:26,518 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 68 states. [2020-07-10 20:24:26,519 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 68 states. [2020-07-10 20:24:26,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:26,523 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2020-07-10 20:24:26,523 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2020-07-10 20:24:26,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:26,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:26,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:26,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:26,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-10 20:24:26,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2020-07-10 20:24:26,529 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 31 [2020-07-10 20:24:26,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:26,529 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2020-07-10 20:24:26,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 20:24:26,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states and 76 transitions. [2020-07-10 20:24:26,636 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:26,637 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2020-07-10 20:24:26,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-10 20:24:26,638 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:26,638 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-10 20:24:26,638 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:24:26,638 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:26,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:26,639 INFO L82 PathProgramCache]: Analyzing trace with hash 2057902492, now seen corresponding path program 1 times [2020-07-10 20:24:26,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:26,639 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1214531776] [2020-07-10 20:24:26,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:26,742 INFO L280 TraceCheckUtils]: 0: Hoare triple {1243#true} assume true; {1243#true} is VALID [2020-07-10 20:24:26,743 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1243#true} {1243#true} #99#return; {1243#true} is VALID [2020-07-10 20:24:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:26,750 INFO L280 TraceCheckUtils]: 0: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2020-07-10 20:24:26,750 INFO L280 TraceCheckUtils]: 1: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2020-07-10 20:24:26,751 INFO L280 TraceCheckUtils]: 2: Hoare triple {1243#true} assume true; {1243#true} is VALID [2020-07-10 20:24:26,751 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1243#true} {1247#(<= 0 main_~buf~0)} #111#return; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:26,759 INFO L280 TraceCheckUtils]: 0: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2020-07-10 20:24:26,759 INFO L280 TraceCheckUtils]: 1: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2020-07-10 20:24:26,759 INFO L280 TraceCheckUtils]: 2: Hoare triple {1243#true} assume true; {1243#true} is VALID [2020-07-10 20:24:26,760 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1243#true} {1247#(<= 0 main_~buf~0)} #113#return; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:26,761 INFO L263 TraceCheckUtils]: 0: Hoare triple {1243#true} call ULTIMATE.init(); {1243#true} is VALID [2020-07-10 20:24:26,761 INFO L280 TraceCheckUtils]: 1: Hoare triple {1243#true} assume true; {1243#true} is VALID [2020-07-10 20:24:26,761 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1243#true} {1243#true} #99#return; {1243#true} is VALID [2020-07-10 20:24:26,761 INFO L263 TraceCheckUtils]: 3: Hoare triple {1243#true} call #t~ret7 := main(); {1243#true} is VALID [2020-07-10 20:24:26,762 INFO L280 TraceCheckUtils]: 4: Hoare triple {1243#true} havoc ~in~0; {1243#true} is VALID [2020-07-10 20:24:26,762 INFO L280 TraceCheckUtils]: 5: Hoare triple {1243#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1243#true} is VALID [2020-07-10 20:24:26,762 INFO L280 TraceCheckUtils]: 6: Hoare triple {1243#true} ~inlen~0 := #t~nondet0; {1243#true} is VALID [2020-07-10 20:24:26,763 INFO L280 TraceCheckUtils]: 7: Hoare triple {1243#true} havoc #t~nondet0; {1243#true} is VALID [2020-07-10 20:24:26,763 INFO L280 TraceCheckUtils]: 8: Hoare triple {1243#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1243#true} is VALID [2020-07-10 20:24:26,763 INFO L280 TraceCheckUtils]: 9: Hoare triple {1243#true} ~bufferlen~0 := #t~nondet1; {1243#true} is VALID [2020-07-10 20:24:26,763 INFO L280 TraceCheckUtils]: 10: Hoare triple {1243#true} havoc #t~nondet1; {1243#true} is VALID [2020-07-10 20:24:26,764 INFO L280 TraceCheckUtils]: 11: Hoare triple {1243#true} havoc ~buf~0; {1243#true} is VALID [2020-07-10 20:24:26,764 INFO L280 TraceCheckUtils]: 12: Hoare triple {1243#true} havoc ~buflim~0; {1243#true} is VALID [2020-07-10 20:24:26,764 INFO L280 TraceCheckUtils]: 13: Hoare triple {1243#true} assume ~bufferlen~0 > 1; {1243#true} is VALID [2020-07-10 20:24:26,765 INFO L280 TraceCheckUtils]: 14: Hoare triple {1243#true} assume ~inlen~0 > 0; {1243#true} is VALID [2020-07-10 20:24:26,765 INFO L280 TraceCheckUtils]: 15: Hoare triple {1243#true} assume ~bufferlen~0 < ~inlen~0; {1243#true} is VALID [2020-07-10 20:24:26,766 INFO L280 TraceCheckUtils]: 16: Hoare triple {1243#true} ~buf~0 := 0; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:26,766 INFO L280 TraceCheckUtils]: 17: Hoare triple {1247#(<= 0 main_~buf~0)} ~in~0 := 0; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:26,767 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-10 20:24:26,768 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-10 20:24:26,768 INFO L280 TraceCheckUtils]: 20: Hoare triple {1247#(<= 0 main_~buf~0)} assume !(0 != #t~nondet2); {1247#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:26,769 INFO L280 TraceCheckUtils]: 21: Hoare triple {1247#(<= 0 main_~buf~0)} havoc #t~nondet2; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:26,769 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-10 20:24:26,770 INFO L280 TraceCheckUtils]: 23: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2020-07-10 20:24:26,770 INFO L280 TraceCheckUtils]: 24: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2020-07-10 20:24:26,770 INFO L280 TraceCheckUtils]: 25: Hoare triple {1243#true} assume true; {1243#true} is VALID [2020-07-10 20:24:26,771 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1243#true} {1247#(<= 0 main_~buf~0)} #111#return; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:26,772 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-10 20:24:26,772 INFO L280 TraceCheckUtils]: 28: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2020-07-10 20:24:26,772 INFO L280 TraceCheckUtils]: 29: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2020-07-10 20:24:26,773 INFO L280 TraceCheckUtils]: 30: Hoare triple {1243#true} assume true; {1243#true} is VALID [2020-07-10 20:24:26,773 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1243#true} {1247#(<= 0 main_~buf~0)} #113#return; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:26,774 INFO L280 TraceCheckUtils]: 32: Hoare triple {1247#(<= 0 main_~buf~0)} #t~post5 := ~buf~0; {1256#(<= 0 |main_#t~post5|)} is VALID [2020-07-10 20:24:26,775 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-10 20:24:26,776 INFO L280 TraceCheckUtils]: 34: Hoare triple {1257#(<= 1 main_~buf~0)} havoc #t~post5; {1257#(<= 1 main_~buf~0)} is VALID [2020-07-10 20:24:26,777 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-10 20:24:26,778 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-10 20:24:26,778 INFO L280 TraceCheckUtils]: 37: Hoare triple {1259#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1244#false} is VALID [2020-07-10 20:24:26,779 INFO L280 TraceCheckUtils]: 38: Hoare triple {1244#false} assume !false; {1244#false} is VALID [2020-07-10 20:24:26,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:26,781 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:26,781 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1214531776] [2020-07-10 20:24:26,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:26,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 20:24:26,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812773141] [2020-07-10 20:24:26,783 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2020-07-10 20:24:26,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:26,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 20:24:26,819 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-10 20:24:26,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 20:24:26,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:26,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 20:24:26,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 20:24:26,820 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 7 states. [2020-07-10 20:24:27,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:27,344 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2020-07-10 20:24:27,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 20:24:27,344 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2020-07-10 20:24:27,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:27,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:24:27,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2020-07-10 20:24:27,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:24:27,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2020-07-10 20:24:27,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 83 transitions. [2020-07-10 20:24:27,449 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-10 20:24:27,454 INFO L225 Difference]: With dead ends: 77 [2020-07-10 20:24:27,454 INFO L226 Difference]: Without dead ends: 75 [2020-07-10 20:24:27,455 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-10 20:24:27,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-10 20:24:27,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2020-07-10 20:24:27,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:27,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 72 states. [2020-07-10 20:24:27,577 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 72 states. [2020-07-10 20:24:27,577 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 72 states. [2020-07-10 20:24:27,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:27,583 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2020-07-10 20:24:27,583 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2020-07-10 20:24:27,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:27,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:27,585 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 75 states. [2020-07-10 20:24:27,585 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 75 states. [2020-07-10 20:24:27,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:27,592 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2020-07-10 20:24:27,592 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2020-07-10 20:24:27,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:27,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:27,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:27,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:27,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-10 20:24:27,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2020-07-10 20:24:27,601 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 39 [2020-07-10 20:24:27,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:27,604 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2020-07-10 20:24:27,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 20:24:27,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states and 84 transitions. [2020-07-10 20:24:27,705 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-10 20:24:27,705 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2020-07-10 20:24:27,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-10 20:24:27,706 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:27,708 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-10 20:24:27,708 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 20:24:27,708 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:27,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:27,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1847294180, now seen corresponding path program 1 times [2020-07-10 20:24:27,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:27,710 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [969834146] [2020-07-10 20:24:27,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:27,816 INFO L280 TraceCheckUtils]: 0: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-10 20:24:27,816 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1716#true} {1716#true} #99#return; {1716#true} is VALID [2020-07-10 20:24:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:27,829 INFO L280 TraceCheckUtils]: 0: Hoare triple {1716#true} ~cond := #in~cond; {1716#true} is VALID [2020-07-10 20:24:27,829 INFO L280 TraceCheckUtils]: 1: Hoare triple {1716#true} assume !(0 == ~cond); {1716#true} is VALID [2020-07-10 20:24:27,829 INFO L280 TraceCheckUtils]: 2: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-10 20:24:27,830 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-10 20:24:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:27,841 INFO L280 TraceCheckUtils]: 0: Hoare triple {1716#true} ~cond := #in~cond; {1716#true} is VALID [2020-07-10 20:24:27,842 INFO L280 TraceCheckUtils]: 1: Hoare triple {1716#true} assume !(0 == ~cond); {1716#true} is VALID [2020-07-10 20:24:27,842 INFO L280 TraceCheckUtils]: 2: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-10 20:24:27,843 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-10 20:24:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:27,849 INFO L280 TraceCheckUtils]: 0: Hoare triple {1716#true} ~cond := #in~cond; {1716#true} is VALID [2020-07-10 20:24:27,850 INFO L280 TraceCheckUtils]: 1: Hoare triple {1716#true} assume !(0 == ~cond); {1716#true} is VALID [2020-07-10 20:24:27,850 INFO L280 TraceCheckUtils]: 2: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-10 20:24:27,851 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-10 20:24:27,851 INFO L263 TraceCheckUtils]: 0: Hoare triple {1716#true} call ULTIMATE.init(); {1716#true} is VALID [2020-07-10 20:24:27,852 INFO L280 TraceCheckUtils]: 1: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-10 20:24:27,852 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1716#true} {1716#true} #99#return; {1716#true} is VALID [2020-07-10 20:24:27,852 INFO L263 TraceCheckUtils]: 3: Hoare triple {1716#true} call #t~ret7 := main(); {1716#true} is VALID [2020-07-10 20:24:27,853 INFO L280 TraceCheckUtils]: 4: Hoare triple {1716#true} havoc ~in~0; {1716#true} is VALID [2020-07-10 20:24:27,853 INFO L280 TraceCheckUtils]: 5: Hoare triple {1716#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1716#true} is VALID [2020-07-10 20:24:27,853 INFO L280 TraceCheckUtils]: 6: Hoare triple {1716#true} ~inlen~0 := #t~nondet0; {1716#true} is VALID [2020-07-10 20:24:27,853 INFO L280 TraceCheckUtils]: 7: Hoare triple {1716#true} havoc #t~nondet0; {1716#true} is VALID [2020-07-10 20:24:27,854 INFO L280 TraceCheckUtils]: 8: Hoare triple {1716#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1716#true} is VALID [2020-07-10 20:24:27,854 INFO L280 TraceCheckUtils]: 9: Hoare triple {1716#true} ~bufferlen~0 := #t~nondet1; {1716#true} is VALID [2020-07-10 20:24:27,854 INFO L280 TraceCheckUtils]: 10: Hoare triple {1716#true} havoc #t~nondet1; {1716#true} is VALID [2020-07-10 20:24:27,854 INFO L280 TraceCheckUtils]: 11: Hoare triple {1716#true} havoc ~buf~0; {1716#true} is VALID [2020-07-10 20:24:27,855 INFO L280 TraceCheckUtils]: 12: Hoare triple {1716#true} havoc ~buflim~0; {1716#true} is VALID [2020-07-10 20:24:27,856 INFO L280 TraceCheckUtils]: 13: Hoare triple {1716#true} assume ~bufferlen~0 > 1; {1720#(<= 2 main_~bufferlen~0)} is VALID [2020-07-10 20:24:27,856 INFO L280 TraceCheckUtils]: 14: Hoare triple {1720#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {1720#(<= 2 main_~bufferlen~0)} is VALID [2020-07-10 20:24:27,857 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-10 20:24:27,858 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-10 20:24:27,858 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-10 20:24:27,859 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-10 20:24:27,859 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-10 20:24:27,860 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-10 20:24:27,861 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-10 20:24:27,861 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-10 20:24:27,861 INFO L280 TraceCheckUtils]: 23: Hoare triple {1716#true} ~cond := #in~cond; {1716#true} is VALID [2020-07-10 20:24:27,861 INFO L280 TraceCheckUtils]: 24: Hoare triple {1716#true} assume !(0 == ~cond); {1716#true} is VALID [2020-07-10 20:24:27,862 INFO L280 TraceCheckUtils]: 25: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-10 20:24:27,863 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-10 20:24:27,863 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-10 20:24:27,863 INFO L280 TraceCheckUtils]: 28: Hoare triple {1716#true} ~cond := #in~cond; {1716#true} is VALID [2020-07-10 20:24:27,863 INFO L280 TraceCheckUtils]: 29: Hoare triple {1716#true} assume !(0 == ~cond); {1716#true} is VALID [2020-07-10 20:24:27,864 INFO L280 TraceCheckUtils]: 30: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-10 20:24:27,864 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-10 20:24:27,865 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-10 20:24:27,866 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-10 20:24:27,866 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-10 20:24:27,867 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-10 20:24:27,867 INFO L280 TraceCheckUtils]: 36: Hoare triple {1716#true} ~cond := #in~cond; {1716#true} is VALID [2020-07-10 20:24:27,867 INFO L280 TraceCheckUtils]: 37: Hoare triple {1716#true} assume !(0 == ~cond); {1716#true} is VALID [2020-07-10 20:24:27,867 INFO L280 TraceCheckUtils]: 38: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-10 20:24:27,869 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-10 20:24:27,872 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-10 20:24:27,876 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-10 20:24:27,877 INFO L280 TraceCheckUtils]: 42: Hoare triple {1737#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1717#false} is VALID [2020-07-10 20:24:27,878 INFO L280 TraceCheckUtils]: 43: Hoare triple {1717#false} assume !false; {1717#false} is VALID [2020-07-10 20:24:27,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:27,881 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:27,881 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [969834146] [2020-07-10 20:24:27,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:27,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 20:24:27,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365849966] [2020-07-10 20:24:27,882 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2020-07-10 20:24:27,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:27,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 20:24:27,922 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:27,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 20:24:27,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:27,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 20:24:27,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-10 20:24:27,923 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 8 states. [2020-07-10 20:24:28,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:28,579 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2020-07-10 20:24:28,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 20:24:28,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2020-07-10 20:24:28,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:28,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:24:28,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 83 transitions. [2020-07-10 20:24:28,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:24:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 83 transitions. [2020-07-10 20:24:28,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 83 transitions. [2020-07-10 20:24:28,696 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-10 20:24:28,699 INFO L225 Difference]: With dead ends: 81 [2020-07-10 20:24:28,700 INFO L226 Difference]: Without dead ends: 63 [2020-07-10 20:24:28,701 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 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-10 20:24:28,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-10 20:24:28,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2020-07-10 20:24:28,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:28,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 61 states. [2020-07-10 20:24:28,769 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 61 states. [2020-07-10 20:24:28,769 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 61 states. [2020-07-10 20:24:28,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:28,774 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2020-07-10 20:24:28,774 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2020-07-10 20:24:28,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:28,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:28,775 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 63 states. [2020-07-10 20:24:28,775 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 63 states. [2020-07-10 20:24:28,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:28,778 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2020-07-10 20:24:28,778 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2020-07-10 20:24:28,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:28,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:28,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:28,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:28,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-10 20:24:28,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2020-07-10 20:24:28,782 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 44 [2020-07-10 20:24:28,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:28,783 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2020-07-10 20:24:28,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 20:24:28,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states and 69 transitions. [2020-07-10 20:24:28,858 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:28,858 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2020-07-10 20:24:28,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-10 20:24:28,859 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:28,859 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-10 20:24:28,859 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 20:24:28,860 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:28,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:28,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1076854334, now seen corresponding path program 1 times [2020-07-10 20:24:28,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:28,861 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [61777447] [2020-07-10 20:24:28,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:28,948 INFO L280 TraceCheckUtils]: 0: Hoare triple {2160#true} assume true; {2160#true} is VALID [2020-07-10 20:24:28,949 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2160#true} {2160#true} #99#return; {2160#true} is VALID [2020-07-10 20:24:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:28,954 INFO L280 TraceCheckUtils]: 0: Hoare triple {2160#true} ~cond := #in~cond; {2160#true} is VALID [2020-07-10 20:24:28,955 INFO L280 TraceCheckUtils]: 1: Hoare triple {2160#true} assume !(0 == ~cond); {2160#true} is VALID [2020-07-10 20:24:28,955 INFO L280 TraceCheckUtils]: 2: Hoare triple {2160#true} assume true; {2160#true} is VALID [2020-07-10 20:24:28,956 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2160#true} {2164#(<= 0 main_~in~0)} #103#return; {2164#(<= 0 main_~in~0)} is VALID [2020-07-10 20:24:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:28,962 INFO L280 TraceCheckUtils]: 0: Hoare triple {2160#true} ~cond := #in~cond; {2160#true} is VALID [2020-07-10 20:24:28,963 INFO L280 TraceCheckUtils]: 1: Hoare triple {2160#true} assume !(0 == ~cond); {2160#true} is VALID [2020-07-10 20:24:28,963 INFO L280 TraceCheckUtils]: 2: Hoare triple {2160#true} assume true; {2160#true} is VALID [2020-07-10 20:24:28,964 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2160#true} {2164#(<= 0 main_~in~0)} #105#return; {2164#(<= 0 main_~in~0)} is VALID [2020-07-10 20:24:28,965 INFO L263 TraceCheckUtils]: 0: Hoare triple {2160#true} call ULTIMATE.init(); {2160#true} is VALID [2020-07-10 20:24:28,965 INFO L280 TraceCheckUtils]: 1: Hoare triple {2160#true} assume true; {2160#true} is VALID [2020-07-10 20:24:28,965 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2160#true} {2160#true} #99#return; {2160#true} is VALID [2020-07-10 20:24:28,965 INFO L263 TraceCheckUtils]: 3: Hoare triple {2160#true} call #t~ret7 := main(); {2160#true} is VALID [2020-07-10 20:24:28,966 INFO L280 TraceCheckUtils]: 4: Hoare triple {2160#true} havoc ~in~0; {2160#true} is VALID [2020-07-10 20:24:28,966 INFO L280 TraceCheckUtils]: 5: Hoare triple {2160#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2160#true} is VALID [2020-07-10 20:24:28,966 INFO L280 TraceCheckUtils]: 6: Hoare triple {2160#true} ~inlen~0 := #t~nondet0; {2160#true} is VALID [2020-07-10 20:24:28,966 INFO L280 TraceCheckUtils]: 7: Hoare triple {2160#true} havoc #t~nondet0; {2160#true} is VALID [2020-07-10 20:24:28,967 INFO L280 TraceCheckUtils]: 8: Hoare triple {2160#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2160#true} is VALID [2020-07-10 20:24:28,967 INFO L280 TraceCheckUtils]: 9: Hoare triple {2160#true} ~bufferlen~0 := #t~nondet1; {2160#true} is VALID [2020-07-10 20:24:28,967 INFO L280 TraceCheckUtils]: 10: Hoare triple {2160#true} havoc #t~nondet1; {2160#true} is VALID [2020-07-10 20:24:28,967 INFO L280 TraceCheckUtils]: 11: Hoare triple {2160#true} havoc ~buf~0; {2160#true} is VALID [2020-07-10 20:24:28,968 INFO L280 TraceCheckUtils]: 12: Hoare triple {2160#true} havoc ~buflim~0; {2160#true} is VALID [2020-07-10 20:24:28,968 INFO L280 TraceCheckUtils]: 13: Hoare triple {2160#true} assume ~bufferlen~0 > 1; {2160#true} is VALID [2020-07-10 20:24:28,968 INFO L280 TraceCheckUtils]: 14: Hoare triple {2160#true} assume ~inlen~0 > 0; {2160#true} is VALID [2020-07-10 20:24:28,968 INFO L280 TraceCheckUtils]: 15: Hoare triple {2160#true} assume ~bufferlen~0 < ~inlen~0; {2160#true} is VALID [2020-07-10 20:24:28,969 INFO L280 TraceCheckUtils]: 16: Hoare triple {2160#true} ~buf~0 := 0; {2160#true} is VALID [2020-07-10 20:24:28,969 INFO L280 TraceCheckUtils]: 17: Hoare triple {2160#true} ~in~0 := 0; {2164#(<= 0 main_~in~0)} is VALID [2020-07-10 20:24:28,970 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-10 20:24:28,971 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-10 20:24:28,972 INFO L280 TraceCheckUtils]: 20: Hoare triple {2164#(<= 0 main_~in~0)} assume !!(0 != #t~nondet2); {2164#(<= 0 main_~in~0)} is VALID [2020-07-10 20:24:28,972 INFO L280 TraceCheckUtils]: 21: Hoare triple {2164#(<= 0 main_~in~0)} havoc #t~nondet2; {2164#(<= 0 main_~in~0)} is VALID [2020-07-10 20:24:28,973 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-10 20:24:28,973 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-10 20:24:28,974 INFO L280 TraceCheckUtils]: 24: Hoare triple {2160#true} ~cond := #in~cond; {2160#true} is VALID [2020-07-10 20:24:28,974 INFO L280 TraceCheckUtils]: 25: Hoare triple {2160#true} assume !(0 == ~cond); {2160#true} is VALID [2020-07-10 20:24:28,974 INFO L280 TraceCheckUtils]: 26: Hoare triple {2160#true} assume true; {2160#true} is VALID [2020-07-10 20:24:28,975 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2160#true} {2164#(<= 0 main_~in~0)} #103#return; {2164#(<= 0 main_~in~0)} is VALID [2020-07-10 20:24:28,975 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-10 20:24:28,975 INFO L280 TraceCheckUtils]: 29: Hoare triple {2160#true} ~cond := #in~cond; {2160#true} is VALID [2020-07-10 20:24:28,976 INFO L280 TraceCheckUtils]: 30: Hoare triple {2160#true} assume !(0 == ~cond); {2160#true} is VALID [2020-07-10 20:24:28,976 INFO L280 TraceCheckUtils]: 31: Hoare triple {2160#true} assume true; {2160#true} is VALID [2020-07-10 20:24:28,977 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2160#true} {2164#(<= 0 main_~in~0)} #105#return; {2164#(<= 0 main_~in~0)} is VALID [2020-07-10 20:24:28,978 INFO L280 TraceCheckUtils]: 33: Hoare triple {2164#(<= 0 main_~in~0)} #t~post3 := ~buf~0; {2164#(<= 0 main_~in~0)} is VALID [2020-07-10 20:24:28,978 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-10 20:24:28,979 INFO L280 TraceCheckUtils]: 35: Hoare triple {2164#(<= 0 main_~in~0)} havoc #t~post3; {2164#(<= 0 main_~in~0)} is VALID [2020-07-10 20:24:28,980 INFO L280 TraceCheckUtils]: 36: Hoare triple {2164#(<= 0 main_~in~0)} #t~post4 := ~in~0; {2173#(<= 0 |main_#t~post4|)} is VALID [2020-07-10 20:24:28,981 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-10 20:24:28,981 INFO L280 TraceCheckUtils]: 38: Hoare triple {2174#(<= 1 main_~in~0)} havoc #t~post4; {2174#(<= 1 main_~in~0)} is VALID [2020-07-10 20:24:28,982 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-10 20:24:28,983 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-10 20:24:28,984 INFO L280 TraceCheckUtils]: 41: Hoare triple {2176#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2161#false} is VALID [2020-07-10 20:24:28,984 INFO L280 TraceCheckUtils]: 42: Hoare triple {2161#false} assume !false; {2161#false} is VALID [2020-07-10 20:24:28,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:28,986 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:28,987 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [61777447] [2020-07-10 20:24:28,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:28,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 20:24:28,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289186861] [2020-07-10 20:24:28,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-07-10 20:24:28,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:28,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 20:24:29,029 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-10 20:24:29,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 20:24:29,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:29,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 20:24:29,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 20:24:29,030 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand 7 states. [2020-07-10 20:24:29,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:29,444 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2020-07-10 20:24:29,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 20:24:29,445 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-07-10 20:24:29,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:29,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:24:29,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2020-07-10 20:24:29,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:24:29,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2020-07-10 20:24:29,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 73 transitions. [2020-07-10 20:24:29,529 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-10 20:24:29,531 INFO L225 Difference]: With dead ends: 72 [2020-07-10 20:24:29,531 INFO L226 Difference]: Without dead ends: 70 [2020-07-10 20:24:29,532 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-10 20:24:29,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-10 20:24:29,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2020-07-10 20:24:29,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:29,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 65 states. [2020-07-10 20:24:29,619 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 65 states. [2020-07-10 20:24:29,619 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 65 states. [2020-07-10 20:24:29,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:29,622 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2020-07-10 20:24:29,623 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2020-07-10 20:24:29,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:29,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:29,623 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 70 states. [2020-07-10 20:24:29,624 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 70 states. [2020-07-10 20:24:29,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:29,627 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2020-07-10 20:24:29,627 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2020-07-10 20:24:29,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:29,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:29,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:29,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:29,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-10 20:24:29,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2020-07-10 20:24:29,631 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 43 [2020-07-10 20:24:29,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:29,631 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2020-07-10 20:24:29,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 20:24:29,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 65 states and 72 transitions. [2020-07-10 20:24:29,738 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-10 20:24:29,738 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2020-07-10 20:24:29,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-10 20:24:29,739 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:29,739 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-10 20:24:29,740 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 20:24:29,740 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:29,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:29,740 INFO L82 PathProgramCache]: Analyzing trace with hash 146364602, now seen corresponding path program 1 times [2020-07-10 20:24:29,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:29,741 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1605909233] [2020-07-10 20:24:29,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:29,873 INFO L280 TraceCheckUtils]: 0: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-10 20:24:29,873 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2599#true} {2599#true} #99#return; {2599#true} is VALID [2020-07-10 20:24:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:29,889 INFO L280 TraceCheckUtils]: 0: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2020-07-10 20:24:29,889 INFO L280 TraceCheckUtils]: 1: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2020-07-10 20:24:29,890 INFO L280 TraceCheckUtils]: 2: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-10 20:24:29,895 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-10 20:24:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:29,900 INFO L280 TraceCheckUtils]: 0: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2020-07-10 20:24:29,900 INFO L280 TraceCheckUtils]: 1: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2020-07-10 20:24:29,900 INFO L280 TraceCheckUtils]: 2: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-10 20:24:29,901 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-10 20:24:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:29,906 INFO L280 TraceCheckUtils]: 0: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2020-07-10 20:24:29,907 INFO L280 TraceCheckUtils]: 1: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2020-07-10 20:24:29,907 INFO L280 TraceCheckUtils]: 2: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-10 20:24:29,908 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-10 20:24:29,908 INFO L263 TraceCheckUtils]: 0: Hoare triple {2599#true} call ULTIMATE.init(); {2599#true} is VALID [2020-07-10 20:24:29,908 INFO L280 TraceCheckUtils]: 1: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-10 20:24:29,909 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2599#true} {2599#true} #99#return; {2599#true} is VALID [2020-07-10 20:24:29,909 INFO L263 TraceCheckUtils]: 3: Hoare triple {2599#true} call #t~ret7 := main(); {2599#true} is VALID [2020-07-10 20:24:29,909 INFO L280 TraceCheckUtils]: 4: Hoare triple {2599#true} havoc ~in~0; {2599#true} is VALID [2020-07-10 20:24:29,909 INFO L280 TraceCheckUtils]: 5: Hoare triple {2599#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2599#true} is VALID [2020-07-10 20:24:29,910 INFO L280 TraceCheckUtils]: 6: Hoare triple {2599#true} ~inlen~0 := #t~nondet0; {2599#true} is VALID [2020-07-10 20:24:29,910 INFO L280 TraceCheckUtils]: 7: Hoare triple {2599#true} havoc #t~nondet0; {2599#true} is VALID [2020-07-10 20:24:29,910 INFO L280 TraceCheckUtils]: 8: Hoare triple {2599#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2599#true} is VALID [2020-07-10 20:24:29,910 INFO L280 TraceCheckUtils]: 9: Hoare triple {2599#true} ~bufferlen~0 := #t~nondet1; {2599#true} is VALID [2020-07-10 20:24:29,911 INFO L280 TraceCheckUtils]: 10: Hoare triple {2599#true} havoc #t~nondet1; {2599#true} is VALID [2020-07-10 20:24:29,911 INFO L280 TraceCheckUtils]: 11: Hoare triple {2599#true} havoc ~buf~0; {2599#true} is VALID [2020-07-10 20:24:29,911 INFO L280 TraceCheckUtils]: 12: Hoare triple {2599#true} havoc ~buflim~0; {2599#true} is VALID [2020-07-10 20:24:29,912 INFO L280 TraceCheckUtils]: 13: Hoare triple {2599#true} assume ~bufferlen~0 > 1; {2603#(<= 2 main_~bufferlen~0)} is VALID [2020-07-10 20:24:29,912 INFO L280 TraceCheckUtils]: 14: Hoare triple {2603#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {2603#(<= 2 main_~bufferlen~0)} is VALID [2020-07-10 20:24:29,913 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-10 20:24:29,914 INFO L280 TraceCheckUtils]: 16: Hoare triple {2604#(<= 3 main_~inlen~0)} ~buf~0 := 0; {2604#(<= 3 main_~inlen~0)} is VALID [2020-07-10 20:24:29,914 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-10 20:24:29,915 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-10 20:24:29,915 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-10 20:24:29,916 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-10 20:24:29,916 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-10 20:24:29,917 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-10 20:24:29,917 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-10 20:24:29,918 INFO L280 TraceCheckUtils]: 24: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2020-07-10 20:24:29,918 INFO L280 TraceCheckUtils]: 25: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2020-07-10 20:24:29,918 INFO L280 TraceCheckUtils]: 26: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-10 20:24:29,919 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-10 20:24:29,919 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-10 20:24:29,919 INFO L280 TraceCheckUtils]: 29: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2020-07-10 20:24:29,920 INFO L280 TraceCheckUtils]: 30: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2020-07-10 20:24:29,920 INFO L280 TraceCheckUtils]: 31: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-10 20:24:29,921 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-10 20:24:29,922 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-10 20:24:29,923 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-10 20:24:29,924 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-10 20:24:29,925 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-10 20:24:29,926 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-10 20:24:29,927 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-10 20:24:29,927 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-10 20:24:29,927 INFO L280 TraceCheckUtils]: 40: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2020-07-10 20:24:29,928 INFO L280 TraceCheckUtils]: 41: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2020-07-10 20:24:29,928 INFO L280 TraceCheckUtils]: 42: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-10 20:24:29,930 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-10 20:24:29,936 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-10 20:24:29,938 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-10 20:24:29,939 INFO L280 TraceCheckUtils]: 46: Hoare triple {2621#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2600#false} is VALID [2020-07-10 20:24:29,940 INFO L280 TraceCheckUtils]: 47: Hoare triple {2600#false} assume !false; {2600#false} is VALID [2020-07-10 20:24:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:29,942 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:29,943 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1605909233] [2020-07-10 20:24:29,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:29,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 20:24:29,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593764041] [2020-07-10 20:24:29,944 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-07-10 20:24:29,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:29,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 20:24:29,994 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-10 20:24:29,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 20:24:29,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:29,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 20:24:29,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-10 20:24:29,995 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 9 states. [2020-07-10 20:24:30,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:30,915 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2020-07-10 20:24:30,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 20:24:30,915 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-07-10 20:24:30,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:30,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:24:30,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2020-07-10 20:24:30,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:24:30,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2020-07-10 20:24:30,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 104 transitions. [2020-07-10 20:24:31,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:31,060 INFO L225 Difference]: With dead ends: 98 [2020-07-10 20:24:31,064 INFO L226 Difference]: Without dead ends: 96 [2020-07-10 20:24:31,065 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 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-10 20:24:31,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-10 20:24:31,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 77. [2020-07-10 20:24:31,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:31,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 77 states. [2020-07-10 20:24:31,203 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 77 states. [2020-07-10 20:24:31,204 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 77 states. [2020-07-10 20:24:31,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:31,208 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2020-07-10 20:24:31,208 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2020-07-10 20:24:31,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:31,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:31,209 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 96 states. [2020-07-10 20:24:31,209 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 96 states. [2020-07-10 20:24:31,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:31,213 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2020-07-10 20:24:31,213 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2020-07-10 20:24:31,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:31,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:31,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:31,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:31,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-10 20:24:31,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2020-07-10 20:24:31,217 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 48 [2020-07-10 20:24:31,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:31,218 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2020-07-10 20:24:31,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 20:24:31,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 77 states and 85 transitions. [2020-07-10 20:24:31,341 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-10 20:24:31,342 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2020-07-10 20:24:31,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-10 20:24:31,343 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:31,343 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-10 20:24:31,344 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 20:24:31,344 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:31,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:31,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1943579560, now seen corresponding path program 1 times [2020-07-10 20:24:31,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:31,345 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1201610975] [2020-07-10 20:24:31,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:31,496 INFO L280 TraceCheckUtils]: 0: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-10 20:24:31,496 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3178#true} {3178#true} #99#return; {3178#true} is VALID [2020-07-10 20:24:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:31,501 INFO L280 TraceCheckUtils]: 0: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-10 20:24:31,501 INFO L280 TraceCheckUtils]: 1: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-10 20:24:31,501 INFO L280 TraceCheckUtils]: 2: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-10 20:24:31,502 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3178#true} {3182#(<= 0 main_~buf~0)} #103#return; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:31,507 INFO L280 TraceCheckUtils]: 0: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-10 20:24:31,507 INFO L280 TraceCheckUtils]: 1: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-10 20:24:31,508 INFO L280 TraceCheckUtils]: 2: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-10 20:24:31,509 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3178#true} {3182#(<= 0 main_~buf~0)} #105#return; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:31,516 INFO L280 TraceCheckUtils]: 0: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-10 20:24:31,516 INFO L280 TraceCheckUtils]: 1: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-10 20:24:31,517 INFO L280 TraceCheckUtils]: 2: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-10 20:24:31,518 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3178#true} {3192#(<= 1 main_~buf~0)} #107#return; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-10 20:24:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:31,527 INFO L280 TraceCheckUtils]: 0: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-10 20:24:31,528 INFO L280 TraceCheckUtils]: 1: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-10 20:24:31,528 INFO L280 TraceCheckUtils]: 2: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-10 20:24:31,529 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3178#true} {3192#(<= 1 main_~buf~0)} #109#return; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-10 20:24:31,529 INFO L263 TraceCheckUtils]: 0: Hoare triple {3178#true} call ULTIMATE.init(); {3178#true} is VALID [2020-07-10 20:24:31,529 INFO L280 TraceCheckUtils]: 1: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-10 20:24:31,529 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3178#true} {3178#true} #99#return; {3178#true} is VALID [2020-07-10 20:24:31,531 INFO L263 TraceCheckUtils]: 3: Hoare triple {3178#true} call #t~ret7 := main(); {3178#true} is VALID [2020-07-10 20:24:31,531 INFO L280 TraceCheckUtils]: 4: Hoare triple {3178#true} havoc ~in~0; {3178#true} is VALID [2020-07-10 20:24:31,531 INFO L280 TraceCheckUtils]: 5: Hoare triple {3178#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3178#true} is VALID [2020-07-10 20:24:31,531 INFO L280 TraceCheckUtils]: 6: Hoare triple {3178#true} ~inlen~0 := #t~nondet0; {3178#true} is VALID [2020-07-10 20:24:31,532 INFO L280 TraceCheckUtils]: 7: Hoare triple {3178#true} havoc #t~nondet0; {3178#true} is VALID [2020-07-10 20:24:31,532 INFO L280 TraceCheckUtils]: 8: Hoare triple {3178#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3178#true} is VALID [2020-07-10 20:24:31,532 INFO L280 TraceCheckUtils]: 9: Hoare triple {3178#true} ~bufferlen~0 := #t~nondet1; {3178#true} is VALID [2020-07-10 20:24:31,532 INFO L280 TraceCheckUtils]: 10: Hoare triple {3178#true} havoc #t~nondet1; {3178#true} is VALID [2020-07-10 20:24:31,532 INFO L280 TraceCheckUtils]: 11: Hoare triple {3178#true} havoc ~buf~0; {3178#true} is VALID [2020-07-10 20:24:31,532 INFO L280 TraceCheckUtils]: 12: Hoare triple {3178#true} havoc ~buflim~0; {3178#true} is VALID [2020-07-10 20:24:31,533 INFO L280 TraceCheckUtils]: 13: Hoare triple {3178#true} assume ~bufferlen~0 > 1; {3178#true} is VALID [2020-07-10 20:24:31,533 INFO L280 TraceCheckUtils]: 14: Hoare triple {3178#true} assume ~inlen~0 > 0; {3178#true} is VALID [2020-07-10 20:24:31,533 INFO L280 TraceCheckUtils]: 15: Hoare triple {3178#true} assume ~bufferlen~0 < ~inlen~0; {3178#true} is VALID [2020-07-10 20:24:31,533 INFO L280 TraceCheckUtils]: 16: Hoare triple {3178#true} ~buf~0 := 0; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:31,534 INFO L280 TraceCheckUtils]: 17: Hoare triple {3182#(<= 0 main_~buf~0)} ~in~0 := 0; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:31,534 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-10 20:24:31,535 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-10 20:24:31,535 INFO L280 TraceCheckUtils]: 20: Hoare triple {3182#(<= 0 main_~buf~0)} assume !!(0 != #t~nondet2); {3182#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:31,536 INFO L280 TraceCheckUtils]: 21: Hoare triple {3182#(<= 0 main_~buf~0)} havoc #t~nondet2; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:31,536 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-10 20:24:31,536 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-10 20:24:31,536 INFO L280 TraceCheckUtils]: 24: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-10 20:24:31,536 INFO L280 TraceCheckUtils]: 25: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-10 20:24:31,537 INFO L280 TraceCheckUtils]: 26: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-10 20:24:31,537 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {3178#true} {3182#(<= 0 main_~buf~0)} #103#return; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:31,537 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-10 20:24:31,537 INFO L280 TraceCheckUtils]: 29: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-10 20:24:31,538 INFO L280 TraceCheckUtils]: 30: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-10 20:24:31,538 INFO L280 TraceCheckUtils]: 31: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-10 20:24:31,538 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {3178#true} {3182#(<= 0 main_~buf~0)} #105#return; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:31,539 INFO L280 TraceCheckUtils]: 33: Hoare triple {3182#(<= 0 main_~buf~0)} #t~post3 := ~buf~0; {3191#(<= 0 |main_#t~post3|)} is VALID [2020-07-10 20:24:31,539 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-10 20:24:31,540 INFO L280 TraceCheckUtils]: 35: Hoare triple {3192#(<= 1 main_~buf~0)} havoc #t~post3; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-10 20:24:31,540 INFO L280 TraceCheckUtils]: 36: Hoare triple {3192#(<= 1 main_~buf~0)} #t~post4 := ~in~0; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-10 20:24:31,540 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-10 20:24:31,541 INFO L280 TraceCheckUtils]: 38: Hoare triple {3192#(<= 1 main_~buf~0)} havoc #t~post4; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-10 20:24:31,541 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-10 20:24:31,541 INFO L280 TraceCheckUtils]: 40: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-10 20:24:31,541 INFO L280 TraceCheckUtils]: 41: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-10 20:24:31,541 INFO L280 TraceCheckUtils]: 42: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-10 20:24:31,542 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3178#true} {3192#(<= 1 main_~buf~0)} #107#return; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-10 20:24:31,542 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-10 20:24:31,542 INFO L280 TraceCheckUtils]: 45: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-10 20:24:31,542 INFO L280 TraceCheckUtils]: 46: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-10 20:24:31,543 INFO L280 TraceCheckUtils]: 47: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-10 20:24:31,543 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {3178#true} {3192#(<= 1 main_~buf~0)} #109#return; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-10 20:24:31,543 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-10 20:24:31,545 INFO L280 TraceCheckUtils]: 50: Hoare triple {3192#(<= 1 main_~buf~0)} assume !(0 != #t~nondet2); {3192#(<= 1 main_~buf~0)} is VALID [2020-07-10 20:24:31,547 INFO L280 TraceCheckUtils]: 51: Hoare triple {3192#(<= 1 main_~buf~0)} havoc #t~nondet2; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-10 20:24:31,547 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-10 20:24:31,548 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-10 20:24:31,550 INFO L280 TraceCheckUtils]: 54: Hoare triple {3202#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3179#false} is VALID [2020-07-10 20:24:31,550 INFO L280 TraceCheckUtils]: 55: Hoare triple {3179#false} assume !false; {3179#false} is VALID [2020-07-10 20:24:31,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:31,552 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:31,552 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1201610975] [2020-07-10 20:24:31,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:31,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 20:24:31,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808407178] [2020-07-10 20:24:31,553 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-07-10 20:24:31,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:31,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 20:24:31,603 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-10 20:24:31,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 20:24:31,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:31,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 20:24:31,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 20:24:31,604 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 7 states. [2020-07-10 20:24:32,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:32,119 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2020-07-10 20:24:32,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 20:24:32,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-07-10 20:24:32,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:32,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:24:32,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2020-07-10 20:24:32,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:24:32,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2020-07-10 20:24:32,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 70 transitions. [2020-07-10 20:24:32,189 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-10 20:24:32,191 INFO L225 Difference]: With dead ends: 83 [2020-07-10 20:24:32,192 INFO L226 Difference]: Without dead ends: 81 [2020-07-10 20:24:32,192 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-10 20:24:32,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-10 20:24:32,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-07-10 20:24:32,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:32,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 81 states. [2020-07-10 20:24:32,346 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-10 20:24:32,346 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-10 20:24:32,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:32,351 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2020-07-10 20:24:32,351 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2020-07-10 20:24:32,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:32,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:32,351 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-10 20:24:32,352 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-10 20:24:32,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:32,355 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2020-07-10 20:24:32,355 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2020-07-10 20:24:32,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:32,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:32,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:32,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:32,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-10 20:24:32,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2020-07-10 20:24:32,359 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 56 [2020-07-10 20:24:32,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:32,360 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2020-07-10 20:24:32,360 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 20:24:32,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states and 88 transitions. [2020-07-10 20:24:32,478 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-10 20:24:32,478 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2020-07-10 20:24:32,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-10 20:24:32,479 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:32,480 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-10 20:24:32,480 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 20:24:32,480 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:32,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:32,481 INFO L82 PathProgramCache]: Analyzing trace with hash 903884048, now seen corresponding path program 1 times [2020-07-10 20:24:32,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:32,481 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1325382006] [2020-07-10 20:24:32,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:32,613 INFO L280 TraceCheckUtils]: 0: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-10 20:24:32,613 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3701#true} {3701#true} #99#return; {3701#true} is VALID [2020-07-10 20:24:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:32,618 INFO L280 TraceCheckUtils]: 0: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-10 20:24:32,619 INFO L280 TraceCheckUtils]: 1: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-10 20:24:32,619 INFO L280 TraceCheckUtils]: 2: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-10 20:24:32,620 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-10 20:24:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:32,625 INFO L280 TraceCheckUtils]: 0: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-10 20:24:32,625 INFO L280 TraceCheckUtils]: 1: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-10 20:24:32,626 INFO L280 TraceCheckUtils]: 2: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-10 20:24:32,627 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-10 20:24:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:32,631 INFO L280 TraceCheckUtils]: 0: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-10 20:24:32,632 INFO L280 TraceCheckUtils]: 1: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-10 20:24:32,632 INFO L280 TraceCheckUtils]: 2: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-10 20:24:32,633 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-10 20:24:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:32,638 INFO L280 TraceCheckUtils]: 0: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-10 20:24:32,638 INFO L280 TraceCheckUtils]: 1: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-10 20:24:32,638 INFO L280 TraceCheckUtils]: 2: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-10 20:24:32,639 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-10 20:24:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:32,644 INFO L280 TraceCheckUtils]: 0: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-10 20:24:32,644 INFO L280 TraceCheckUtils]: 1: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-10 20:24:32,645 INFO L280 TraceCheckUtils]: 2: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-10 20:24:32,645 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-10 20:24:32,646 INFO L263 TraceCheckUtils]: 0: Hoare triple {3701#true} call ULTIMATE.init(); {3701#true} is VALID [2020-07-10 20:24:32,646 INFO L280 TraceCheckUtils]: 1: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-10 20:24:32,646 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3701#true} {3701#true} #99#return; {3701#true} is VALID [2020-07-10 20:24:32,646 INFO L263 TraceCheckUtils]: 3: Hoare triple {3701#true} call #t~ret7 := main(); {3701#true} is VALID [2020-07-10 20:24:32,647 INFO L280 TraceCheckUtils]: 4: Hoare triple {3701#true} havoc ~in~0; {3701#true} is VALID [2020-07-10 20:24:32,647 INFO L280 TraceCheckUtils]: 5: Hoare triple {3701#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3701#true} is VALID [2020-07-10 20:24:32,647 INFO L280 TraceCheckUtils]: 6: Hoare triple {3701#true} ~inlen~0 := #t~nondet0; {3701#true} is VALID [2020-07-10 20:24:32,647 INFO L280 TraceCheckUtils]: 7: Hoare triple {3701#true} havoc #t~nondet0; {3701#true} is VALID [2020-07-10 20:24:32,647 INFO L280 TraceCheckUtils]: 8: Hoare triple {3701#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3701#true} is VALID [2020-07-10 20:24:32,648 INFO L280 TraceCheckUtils]: 9: Hoare triple {3701#true} ~bufferlen~0 := #t~nondet1; {3701#true} is VALID [2020-07-10 20:24:32,648 INFO L280 TraceCheckUtils]: 10: Hoare triple {3701#true} havoc #t~nondet1; {3701#true} is VALID [2020-07-10 20:24:32,648 INFO L280 TraceCheckUtils]: 11: Hoare triple {3701#true} havoc ~buf~0; {3701#true} is VALID [2020-07-10 20:24:32,648 INFO L280 TraceCheckUtils]: 12: Hoare triple {3701#true} havoc ~buflim~0; {3701#true} is VALID [2020-07-10 20:24:32,649 INFO L280 TraceCheckUtils]: 13: Hoare triple {3701#true} assume ~bufferlen~0 > 1; {3705#(<= 2 main_~bufferlen~0)} is VALID [2020-07-10 20:24:32,650 INFO L280 TraceCheckUtils]: 14: Hoare triple {3705#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {3705#(<= 2 main_~bufferlen~0)} is VALID [2020-07-10 20:24:32,650 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-10 20:24:32,651 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-10 20:24:32,652 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-10 20:24:32,652 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-10 20:24:32,653 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-10 20:24:32,653 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-10 20:24:32,654 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-10 20:24:32,654 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-10 20:24:32,655 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-10 20:24:32,655 INFO L280 TraceCheckUtils]: 24: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-10 20:24:32,655 INFO L280 TraceCheckUtils]: 25: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-10 20:24:32,655 INFO L280 TraceCheckUtils]: 26: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-10 20:24:32,656 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-10 20:24:32,656 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-10 20:24:32,657 INFO L280 TraceCheckUtils]: 29: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-10 20:24:32,657 INFO L280 TraceCheckUtils]: 30: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-10 20:24:32,657 INFO L280 TraceCheckUtils]: 31: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-10 20:24:32,658 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-10 20:24:32,659 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-10 20:24:32,660 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-10 20:24:32,660 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-10 20:24:32,661 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-10 20:24:32,661 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-10 20:24:32,662 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-10 20:24:32,662 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-10 20:24:32,662 INFO L280 TraceCheckUtils]: 40: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-10 20:24:32,663 INFO L280 TraceCheckUtils]: 41: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-10 20:24:32,663 INFO L280 TraceCheckUtils]: 42: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-10 20:24:32,664 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-10 20:24:32,664 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-10 20:24:32,664 INFO L280 TraceCheckUtils]: 45: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-10 20:24:32,664 INFO L280 TraceCheckUtils]: 46: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-10 20:24:32,665 INFO L280 TraceCheckUtils]: 47: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-10 20:24:32,665 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-10 20:24:32,666 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-10 20:24:32,667 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-10 20:24:32,667 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-10 20:24:32,667 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-10 20:24:32,668 INFO L280 TraceCheckUtils]: 53: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-10 20:24:32,668 INFO L280 TraceCheckUtils]: 54: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-10 20:24:32,668 INFO L280 TraceCheckUtils]: 55: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-10 20:24:32,669 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-10 20:24:32,670 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-10 20:24:32,671 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-10 20:24:32,671 INFO L280 TraceCheckUtils]: 59: Hoare triple {3730#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3702#false} is VALID [2020-07-10 20:24:32,672 INFO L280 TraceCheckUtils]: 60: Hoare triple {3702#false} assume !false; {3702#false} is VALID [2020-07-10 20:24:32,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:32,676 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:32,676 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1325382006] [2020-07-10 20:24:32,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:32,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 20:24:32,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584204628] [2020-07-10 20:24:32,678 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-07-10 20:24:32,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:32,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 20:24:32,729 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:32,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 20:24:32,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:32,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 20:24:32,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-10 20:24:32,730 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 8 states. [2020-07-10 20:24:33,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:33,507 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2020-07-10 20:24:33,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 20:24:33,507 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-07-10 20:24:33,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:33,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:24:33,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2020-07-10 20:24:33,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:24:33,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2020-07-10 20:24:33,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 97 transitions. [2020-07-10 20:24:33,625 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-10 20:24:33,628 INFO L225 Difference]: With dead ends: 100 [2020-07-10 20:24:33,628 INFO L226 Difference]: Without dead ends: 98 [2020-07-10 20:24:33,629 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-07-10 20:24:33,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-10 20:24:33,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2020-07-10 20:24:33,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:33,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 94 states. [2020-07-10 20:24:33,795 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 94 states. [2020-07-10 20:24:33,795 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 94 states. [2020-07-10 20:24:33,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:33,799 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2020-07-10 20:24:33,799 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2020-07-10 20:24:33,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:33,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:33,800 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 98 states. [2020-07-10 20:24:33,800 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 98 states. [2020-07-10 20:24:33,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:33,803 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2020-07-10 20:24:33,804 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2020-07-10 20:24:33,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:33,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:33,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:33,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:33,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-10 20:24:33,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2020-07-10 20:24:33,808 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 61 [2020-07-10 20:24:33,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:33,808 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2020-07-10 20:24:33,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 20:24:33,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 94 states and 106 transitions. [2020-07-10 20:24:33,962 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-10 20:24:33,962 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2020-07-10 20:24:33,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-10 20:24:33,964 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:33,964 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-10 20:24:33,964 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 20:24:33,965 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:33,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:33,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1662212275, now seen corresponding path program 1 times [2020-07-10 20:24:33,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:33,966 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1022580634] [2020-07-10 20:24:33,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:34,086 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-10 20:24:34,086 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4327#true} {4327#true} #99#return; {4327#true} is VALID [2020-07-10 20:24:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:34,096 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-10 20:24:34,096 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-10 20:24:34,097 INFO L280 TraceCheckUtils]: 2: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-10 20:24:34,097 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4327#true} {4331#(<= 0 main_~buf~0)} #103#return; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:34,103 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-10 20:24:34,104 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-10 20:24:34,104 INFO L280 TraceCheckUtils]: 2: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-10 20:24:34,105 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4327#true} {4331#(<= 0 main_~buf~0)} #105#return; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:34,112 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-10 20:24:34,112 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-10 20:24:34,112 INFO L280 TraceCheckUtils]: 2: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-10 20:24:34,113 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #107#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-10 20:24:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:34,124 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-10 20:24:34,124 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-10 20:24:34,124 INFO L280 TraceCheckUtils]: 2: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-10 20:24:34,125 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #109#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-10 20:24:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:34,144 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-10 20:24:34,144 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-10 20:24:34,144 INFO L280 TraceCheckUtils]: 2: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-10 20:24:34,145 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #111#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-10 20:24:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:34,159 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-10 20:24:34,160 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-10 20:24:34,160 INFO L280 TraceCheckUtils]: 2: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-10 20:24:34,161 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #113#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-10 20:24:34,162 INFO L263 TraceCheckUtils]: 0: Hoare triple {4327#true} call ULTIMATE.init(); {4327#true} is VALID [2020-07-10 20:24:34,162 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-10 20:24:34,162 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4327#true} {4327#true} #99#return; {4327#true} is VALID [2020-07-10 20:24:34,163 INFO L263 TraceCheckUtils]: 3: Hoare triple {4327#true} call #t~ret7 := main(); {4327#true} is VALID [2020-07-10 20:24:34,163 INFO L280 TraceCheckUtils]: 4: Hoare triple {4327#true} havoc ~in~0; {4327#true} is VALID [2020-07-10 20:24:34,163 INFO L280 TraceCheckUtils]: 5: Hoare triple {4327#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4327#true} is VALID [2020-07-10 20:24:34,163 INFO L280 TraceCheckUtils]: 6: Hoare triple {4327#true} ~inlen~0 := #t~nondet0; {4327#true} is VALID [2020-07-10 20:24:34,164 INFO L280 TraceCheckUtils]: 7: Hoare triple {4327#true} havoc #t~nondet0; {4327#true} is VALID [2020-07-10 20:24:34,164 INFO L280 TraceCheckUtils]: 8: Hoare triple {4327#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4327#true} is VALID [2020-07-10 20:24:34,164 INFO L280 TraceCheckUtils]: 9: Hoare triple {4327#true} ~bufferlen~0 := #t~nondet1; {4327#true} is VALID [2020-07-10 20:24:34,165 INFO L280 TraceCheckUtils]: 10: Hoare triple {4327#true} havoc #t~nondet1; {4327#true} is VALID [2020-07-10 20:24:34,165 INFO L280 TraceCheckUtils]: 11: Hoare triple {4327#true} havoc ~buf~0; {4327#true} is VALID [2020-07-10 20:24:34,165 INFO L280 TraceCheckUtils]: 12: Hoare triple {4327#true} havoc ~buflim~0; {4327#true} is VALID [2020-07-10 20:24:34,165 INFO L280 TraceCheckUtils]: 13: Hoare triple {4327#true} assume ~bufferlen~0 > 1; {4327#true} is VALID [2020-07-10 20:24:34,165 INFO L280 TraceCheckUtils]: 14: Hoare triple {4327#true} assume ~inlen~0 > 0; {4327#true} is VALID [2020-07-10 20:24:34,167 INFO L280 TraceCheckUtils]: 15: Hoare triple {4327#true} assume ~bufferlen~0 < ~inlen~0; {4327#true} is VALID [2020-07-10 20:24:34,169 INFO L280 TraceCheckUtils]: 16: Hoare triple {4327#true} ~buf~0 := 0; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:34,170 INFO L280 TraceCheckUtils]: 17: Hoare triple {4331#(<= 0 main_~buf~0)} ~in~0 := 0; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:34,170 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-10 20:24:34,171 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-10 20:24:34,172 INFO L280 TraceCheckUtils]: 20: Hoare triple {4331#(<= 0 main_~buf~0)} assume !!(0 != #t~nondet2); {4331#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:34,172 INFO L280 TraceCheckUtils]: 21: Hoare triple {4331#(<= 0 main_~buf~0)} havoc #t~nondet2; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:34,173 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-10 20:24:34,173 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-10 20:24:34,174 INFO L280 TraceCheckUtils]: 24: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-10 20:24:34,174 INFO L280 TraceCheckUtils]: 25: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-10 20:24:34,174 INFO L280 TraceCheckUtils]: 26: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-10 20:24:34,175 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {4327#true} {4331#(<= 0 main_~buf~0)} #103#return; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:34,175 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-10 20:24:34,176 INFO L280 TraceCheckUtils]: 29: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-10 20:24:34,176 INFO L280 TraceCheckUtils]: 30: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-10 20:24:34,176 INFO L280 TraceCheckUtils]: 31: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-10 20:24:34,177 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {4327#true} {4331#(<= 0 main_~buf~0)} #105#return; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-10 20:24:34,177 INFO L280 TraceCheckUtils]: 33: Hoare triple {4331#(<= 0 main_~buf~0)} #t~post3 := ~buf~0; {4340#(<= 0 |main_#t~post3|)} is VALID [2020-07-10 20:24:34,178 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-10 20:24:34,179 INFO L280 TraceCheckUtils]: 35: Hoare triple {4341#(<= 1 main_~buf~0)} havoc #t~post3; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-10 20:24:34,179 INFO L280 TraceCheckUtils]: 36: Hoare triple {4341#(<= 1 main_~buf~0)} #t~post4 := ~in~0; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-10 20:24:34,180 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-10 20:24:34,180 INFO L280 TraceCheckUtils]: 38: Hoare triple {4341#(<= 1 main_~buf~0)} havoc #t~post4; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-10 20:24:34,180 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-10 20:24:34,181 INFO L280 TraceCheckUtils]: 40: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-10 20:24:34,181 INFO L280 TraceCheckUtils]: 41: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-10 20:24:34,181 INFO L280 TraceCheckUtils]: 42: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-10 20:24:34,182 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #107#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-10 20:24:34,182 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-10 20:24:34,183 INFO L280 TraceCheckUtils]: 45: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-10 20:24:34,183 INFO L280 TraceCheckUtils]: 46: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-10 20:24:34,183 INFO L280 TraceCheckUtils]: 47: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-10 20:24:34,184 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #109#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-10 20:24:34,185 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-10 20:24:34,186 INFO L280 TraceCheckUtils]: 50: Hoare triple {4341#(<= 1 main_~buf~0)} assume !(0 != #t~nondet2); {4341#(<= 1 main_~buf~0)} is VALID [2020-07-10 20:24:34,186 INFO L280 TraceCheckUtils]: 51: Hoare triple {4341#(<= 1 main_~buf~0)} havoc #t~nondet2; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-10 20:24:34,187 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-10 20:24:34,187 INFO L280 TraceCheckUtils]: 53: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-10 20:24:34,187 INFO L280 TraceCheckUtils]: 54: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-10 20:24:34,187 INFO L280 TraceCheckUtils]: 55: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-10 20:24:34,188 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #111#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-10 20:24:34,189 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-10 20:24:34,189 INFO L280 TraceCheckUtils]: 58: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-10 20:24:34,189 INFO L280 TraceCheckUtils]: 59: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-10 20:24:34,189 INFO L280 TraceCheckUtils]: 60: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-10 20:24:34,191 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #113#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-10 20:24:34,191 INFO L280 TraceCheckUtils]: 62: Hoare triple {4341#(<= 1 main_~buf~0)} #t~post5 := ~buf~0; {4358#(<= 1 |main_#t~post5|)} is VALID [2020-07-10 20:24:34,193 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-10 20:24:34,194 INFO L280 TraceCheckUtils]: 64: Hoare triple {4359#(<= 2 main_~buf~0)} havoc #t~post5; {4359#(<= 2 main_~buf~0)} is VALID [2020-07-10 20:24:34,195 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-10 20:24:34,196 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-10 20:24:34,196 INFO L280 TraceCheckUtils]: 67: Hoare triple {4361#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4328#false} is VALID [2020-07-10 20:24:34,197 INFO L280 TraceCheckUtils]: 68: Hoare triple {4328#false} assume !false; {4328#false} is VALID [2020-07-10 20:24:34,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:34,202 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:34,202 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1022580634] [2020-07-10 20:24:34,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:34,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 20:24:34,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620560103] [2020-07-10 20:24:34,203 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2020-07-10 20:24:34,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:34,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 20:24:34,263 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-10 20:24:34,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 20:24:34,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:34,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 20:24:34,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-10 20:24:34,264 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 9 states. [2020-07-10 20:24:34,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:34,922 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2020-07-10 20:24:34,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 20:24:34,922 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2020-07-10 20:24:34,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:34,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:24:34,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2020-07-10 20:24:34,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:24:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2020-07-10 20:24:34,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2020-07-10 20:24:35,007 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-10 20:24:35,010 INFO L225 Difference]: With dead ends: 100 [2020-07-10 20:24:35,010 INFO L226 Difference]: Without dead ends: 98 [2020-07-10 20:24:35,011 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-07-10 20:24:35,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-10 20:24:35,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2020-07-10 20:24:35,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:35,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 98 states. [2020-07-10 20:24:35,200 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 98 states. [2020-07-10 20:24:35,200 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 98 states. [2020-07-10 20:24:35,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:35,204 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2020-07-10 20:24:35,204 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2020-07-10 20:24:35,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:35,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:35,205 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 98 states. [2020-07-10 20:24:35,205 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 98 states. [2020-07-10 20:24:35,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:35,208 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2020-07-10 20:24:35,208 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2020-07-10 20:24:35,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:35,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:35,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:35,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:35,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-07-10 20:24:35,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2020-07-10 20:24:35,212 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 69 [2020-07-10 20:24:35,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:35,212 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2020-07-10 20:24:35,213 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 20:24:35,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 98 states and 109 transitions. [2020-07-10 20:24:35,364 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:35,365 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2020-07-10 20:24:35,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-07-10 20:24:35,366 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:35,367 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-10 20:24:35,367 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-10 20:24:35,367 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:35,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:35,368 INFO L82 PathProgramCache]: Analyzing trace with hash 71900773, now seen corresponding path program 1 times [2020-07-10 20:24:35,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:35,368 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [527224967] [2020-07-10 20:24:35,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:35,577 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-10 20:24:35,577 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4966#true} {4966#true} #99#return; {4966#true} is VALID [2020-07-10 20:24:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:35,582 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-10 20:24:35,582 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-10 20:24:35,583 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-10 20:24:35,583 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-10 20:24:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:35,595 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-10 20:24:35,595 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-10 20:24:35,596 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-10 20:24:35,597 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-10 20:24:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:35,602 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-10 20:24:35,603 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-10 20:24:35,603 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-10 20:24:35,604 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-10 20:24:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:35,623 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-10 20:24:35,624 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-10 20:24:35,624 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-10 20:24:35,625 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-10 20:24:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:35,636 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-10 20:24:35,637 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-10 20:24:35,637 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-10 20:24:35,640 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-10 20:24:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:35,645 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-10 20:24:35,645 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-10 20:24:35,645 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-10 20:24:35,646 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-10 20:24:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:35,651 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-10 20:24:35,652 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-10 20:24:35,652 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-10 20:24:35,653 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-10 20:24:35,654 INFO L263 TraceCheckUtils]: 0: Hoare triple {4966#true} call ULTIMATE.init(); {4966#true} is VALID [2020-07-10 20:24:35,654 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-10 20:24:35,655 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4966#true} {4966#true} #99#return; {4966#true} is VALID [2020-07-10 20:24:35,655 INFO L263 TraceCheckUtils]: 3: Hoare triple {4966#true} call #t~ret7 := main(); {4966#true} is VALID [2020-07-10 20:24:35,655 INFO L280 TraceCheckUtils]: 4: Hoare triple {4966#true} havoc ~in~0; {4966#true} is VALID [2020-07-10 20:24:35,656 INFO L280 TraceCheckUtils]: 5: Hoare triple {4966#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4966#true} is VALID [2020-07-10 20:24:35,656 INFO L280 TraceCheckUtils]: 6: Hoare triple {4966#true} ~inlen~0 := #t~nondet0; {4966#true} is VALID [2020-07-10 20:24:35,656 INFO L280 TraceCheckUtils]: 7: Hoare triple {4966#true} havoc #t~nondet0; {4966#true} is VALID [2020-07-10 20:24:35,657 INFO L280 TraceCheckUtils]: 8: Hoare triple {4966#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4966#true} is VALID [2020-07-10 20:24:35,657 INFO L280 TraceCheckUtils]: 9: Hoare triple {4966#true} ~bufferlen~0 := #t~nondet1; {4966#true} is VALID [2020-07-10 20:24:35,657 INFO L280 TraceCheckUtils]: 10: Hoare triple {4966#true} havoc #t~nondet1; {4966#true} is VALID [2020-07-10 20:24:35,658 INFO L280 TraceCheckUtils]: 11: Hoare triple {4966#true} havoc ~buf~0; {4966#true} is VALID [2020-07-10 20:24:35,658 INFO L280 TraceCheckUtils]: 12: Hoare triple {4966#true} havoc ~buflim~0; {4966#true} is VALID [2020-07-10 20:24:35,660 INFO L280 TraceCheckUtils]: 13: Hoare triple {4966#true} assume ~bufferlen~0 > 1; {4970#(<= 2 main_~bufferlen~0)} is VALID [2020-07-10 20:24:35,661 INFO L280 TraceCheckUtils]: 14: Hoare triple {4970#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {4970#(<= 2 main_~bufferlen~0)} is VALID [2020-07-10 20:24:35,661 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-10 20:24:35,662 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-10 20:24:35,663 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-10 20:24:35,664 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-10 20:24:35,665 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-10 20:24:35,666 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-10 20:24:35,667 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-10 20:24:35,668 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-10 20:24:35,668 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-10 20:24:35,668 INFO L280 TraceCheckUtils]: 24: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-10 20:24:35,669 INFO L280 TraceCheckUtils]: 25: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-10 20:24:35,669 INFO L280 TraceCheckUtils]: 26: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-10 20:24:35,670 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-10 20:24:35,671 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-10 20:24:35,671 INFO L280 TraceCheckUtils]: 29: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-10 20:24:35,671 INFO L280 TraceCheckUtils]: 30: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-10 20:24:35,672 INFO L280 TraceCheckUtils]: 31: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-10 20:24:35,673 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-10 20:24:35,676 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-10 20:24:35,677 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-10 20:24:35,678 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-10 20:24:35,678 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-10 20:24:35,679 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-10 20:24:35,680 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-10 20:24:35,680 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-10 20:24:35,680 INFO L280 TraceCheckUtils]: 40: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-10 20:24:35,681 INFO L280 TraceCheckUtils]: 41: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-10 20:24:35,681 INFO L280 TraceCheckUtils]: 42: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-10 20:24:35,682 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-10 20:24:35,682 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-10 20:24:35,683 INFO L280 TraceCheckUtils]: 45: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-10 20:24:35,683 INFO L280 TraceCheckUtils]: 46: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-10 20:24:35,683 INFO L280 TraceCheckUtils]: 47: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-10 20:24:35,703 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-10 20:24:35,705 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-10 20:24:35,705 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-10 20:24:35,706 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-10 20:24:35,707 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-10 20:24:35,707 INFO L280 TraceCheckUtils]: 53: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-10 20:24:35,707 INFO L280 TraceCheckUtils]: 54: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-10 20:24:35,708 INFO L280 TraceCheckUtils]: 55: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-10 20:24:35,711 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-10 20:24:35,712 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-10 20:24:35,712 INFO L280 TraceCheckUtils]: 58: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-10 20:24:35,712 INFO L280 TraceCheckUtils]: 59: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-10 20:24:35,713 INFO L280 TraceCheckUtils]: 60: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-10 20:24:35,714 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-10 20:24:35,715 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-10 20:24:35,716 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-10 20:24:35,717 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-10 20:24:35,717 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-10 20:24:35,717 INFO L280 TraceCheckUtils]: 66: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-10 20:24:35,718 INFO L280 TraceCheckUtils]: 67: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-10 20:24:35,718 INFO L280 TraceCheckUtils]: 68: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-10 20:24:35,719 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-10 20:24:35,720 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-10 20:24:35,721 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-10 20:24:35,721 INFO L280 TraceCheckUtils]: 72: Hoare triple {5006#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4967#false} is VALID [2020-07-10 20:24:35,721 INFO L280 TraceCheckUtils]: 73: Hoare triple {4967#false} assume !false; {4967#false} is VALID [2020-07-10 20:24:35,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:35,736 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:35,737 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [527224967] [2020-07-10 20:24:35,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:35,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-10 20:24:35,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335277186] [2020-07-10 20:24:35,741 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2020-07-10 20:24:35,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:35,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 20:24:35,816 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:35,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 20:24:35,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:35,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 20:24:35,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-10 20:24:35,817 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 11 states. [2020-07-10 20:24:37,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:37,267 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2020-07-10 20:24:37,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-10 20:24:37,268 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2020-07-10 20:24:37,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:37,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 20:24:37,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 113 transitions. [2020-07-10 20:24:37,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 20:24:37,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 113 transitions. [2020-07-10 20:24:37,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 113 transitions. [2020-07-10 20:24:37,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:37,435 INFO L225 Difference]: With dead ends: 119 [2020-07-10 20:24:37,436 INFO L226 Difference]: Without dead ends: 101 [2020-07-10 20:24:37,438 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 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-10 20:24:37,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-10 20:24:37,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2020-07-10 20:24:37,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:37,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 95 states. [2020-07-10 20:24:37,614 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 95 states. [2020-07-10 20:24:37,614 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 95 states. [2020-07-10 20:24:37,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:37,618 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2020-07-10 20:24:37,618 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2020-07-10 20:24:37,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:37,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:37,619 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 101 states. [2020-07-10 20:24:37,619 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 101 states. [2020-07-10 20:24:37,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:37,622 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2020-07-10 20:24:37,622 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2020-07-10 20:24:37,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:37,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:37,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:37,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:37,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-07-10 20:24:37,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2020-07-10 20:24:37,626 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 74 [2020-07-10 20:24:37,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:37,626 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2020-07-10 20:24:37,627 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 20:24:37,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 95 states and 102 transitions. [2020-07-10 20:24:37,770 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:37,771 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2020-07-10 20:24:37,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-10 20:24:37,772 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:37,772 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-10 20:24:37,772 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-10 20:24:37,773 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:37,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:37,773 INFO L82 PathProgramCache]: Analyzing trace with hash -50388093, now seen corresponding path program 1 times [2020-07-10 20:24:37,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:37,773 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [399225487] [2020-07-10 20:24:37,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:37,980 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-10 20:24:37,980 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5661#true} {5661#true} #99#return; {5661#true} is VALID [2020-07-10 20:24:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:37,986 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-10 20:24:37,986 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-10 20:24:37,987 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-10 20:24:37,988 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-10 20:24:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:37,995 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-10 20:24:37,996 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-10 20:24:37,996 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-10 20:24:37,997 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-10 20:24:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:38,001 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-10 20:24:38,001 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-10 20:24:38,001 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-10 20:24:38,002 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-10 20:24:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:38,020 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-10 20:24:38,020 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-10 20:24:38,020 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-10 20:24:38,021 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-10 20:24:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:38,031 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-10 20:24:38,032 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-10 20:24:38,032 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-10 20:24:38,033 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-10 20:24:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:38,038 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-10 20:24:38,038 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-10 20:24:38,038 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-10 20:24:38,039 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-10 20:24:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:38,055 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-10 20:24:38,056 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-10 20:24:38,056 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-10 20:24:38,057 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-10 20:24:38,058 INFO L263 TraceCheckUtils]: 0: Hoare triple {5661#true} call ULTIMATE.init(); {5661#true} is VALID [2020-07-10 20:24:38,058 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-10 20:24:38,058 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5661#true} {5661#true} #99#return; {5661#true} is VALID [2020-07-10 20:24:38,059 INFO L263 TraceCheckUtils]: 3: Hoare triple {5661#true} call #t~ret7 := main(); {5661#true} is VALID [2020-07-10 20:24:38,059 INFO L280 TraceCheckUtils]: 4: Hoare triple {5661#true} havoc ~in~0; {5661#true} is VALID [2020-07-10 20:24:38,059 INFO L280 TraceCheckUtils]: 5: Hoare triple {5661#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {5661#true} is VALID [2020-07-10 20:24:38,060 INFO L280 TraceCheckUtils]: 6: Hoare triple {5661#true} ~inlen~0 := #t~nondet0; {5661#true} is VALID [2020-07-10 20:24:38,060 INFO L280 TraceCheckUtils]: 7: Hoare triple {5661#true} havoc #t~nondet0; {5661#true} is VALID [2020-07-10 20:24:38,060 INFO L280 TraceCheckUtils]: 8: Hoare triple {5661#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5661#true} is VALID [2020-07-10 20:24:38,061 INFO L280 TraceCheckUtils]: 9: Hoare triple {5661#true} ~bufferlen~0 := #t~nondet1; {5661#true} is VALID [2020-07-10 20:24:38,061 INFO L280 TraceCheckUtils]: 10: Hoare triple {5661#true} havoc #t~nondet1; {5661#true} is VALID [2020-07-10 20:24:38,061 INFO L280 TraceCheckUtils]: 11: Hoare triple {5661#true} havoc ~buf~0; {5661#true} is VALID [2020-07-10 20:24:38,062 INFO L280 TraceCheckUtils]: 12: Hoare triple {5661#true} havoc ~buflim~0; {5661#true} is VALID [2020-07-10 20:24:38,063 INFO L280 TraceCheckUtils]: 13: Hoare triple {5661#true} assume ~bufferlen~0 > 1; {5665#(<= 2 main_~bufferlen~0)} is VALID [2020-07-10 20:24:38,063 INFO L280 TraceCheckUtils]: 14: Hoare triple {5665#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {5665#(<= 2 main_~bufferlen~0)} is VALID [2020-07-10 20:24:38,064 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-10 20:24:38,065 INFO L280 TraceCheckUtils]: 16: Hoare triple {5666#(<= 3 main_~inlen~0)} ~buf~0 := 0; {5666#(<= 3 main_~inlen~0)} is VALID [2020-07-10 20:24:38,066 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-10 20:24:38,067 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-10 20:24:38,068 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-10 20:24:38,069 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-10 20:24:38,069 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-10 20:24:38,070 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-10 20:24:38,071 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-10 20:24:38,071 INFO L280 TraceCheckUtils]: 24: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-10 20:24:38,071 INFO L280 TraceCheckUtils]: 25: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-10 20:24:38,072 INFO L280 TraceCheckUtils]: 26: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-10 20:24:38,072 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-10 20:24:38,073 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-10 20:24:38,073 INFO L280 TraceCheckUtils]: 29: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-10 20:24:38,073 INFO L280 TraceCheckUtils]: 30: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-10 20:24:38,073 INFO L280 TraceCheckUtils]: 31: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-10 20:24:38,074 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-10 20:24:38,075 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-10 20:24:38,077 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-10 20:24:38,078 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-10 20:24:38,079 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-10 20:24:38,080 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-10 20:24:38,081 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-10 20:24:38,081 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-10 20:24:38,081 INFO L280 TraceCheckUtils]: 40: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-10 20:24:38,082 INFO L280 TraceCheckUtils]: 41: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-10 20:24:38,082 INFO L280 TraceCheckUtils]: 42: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-10 20:24:38,083 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-10 20:24:38,083 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-10 20:24:38,084 INFO L280 TraceCheckUtils]: 45: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-10 20:24:38,084 INFO L280 TraceCheckUtils]: 46: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-10 20:24:38,084 INFO L280 TraceCheckUtils]: 47: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-10 20:24:38,085 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-10 20:24:38,086 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-10 20:24:38,087 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-10 20:24:38,088 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-10 20:24:38,089 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-10 20:24:38,090 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-10 20:24:38,090 INFO L280 TraceCheckUtils]: 54: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-10 20:24:38,090 INFO L280 TraceCheckUtils]: 55: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-10 20:24:38,090 INFO L280 TraceCheckUtils]: 56: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-10 20:24:38,092 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-10 20:24:38,092 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-10 20:24:38,092 INFO L280 TraceCheckUtils]: 59: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-10 20:24:38,092 INFO L280 TraceCheckUtils]: 60: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-10 20:24:38,093 INFO L280 TraceCheckUtils]: 61: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-10 20:24:38,094 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-10 20:24:38,096 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-10 20:24:38,097 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-10 20:24:38,098 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-10 20:24:38,099 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-10 20:24:38,100 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-10 20:24:38,101 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-10 20:24:38,102 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-10 20:24:38,102 INFO L280 TraceCheckUtils]: 70: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-10 20:24:38,102 INFO L280 TraceCheckUtils]: 71: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-10 20:24:38,103 INFO L280 TraceCheckUtils]: 72: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-10 20:24:38,104 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-10 20:24:38,106 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-10 20:24:38,107 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-10 20:24:38,107 INFO L280 TraceCheckUtils]: 76: Hoare triple {5701#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {5662#false} is VALID [2020-07-10 20:24:38,108 INFO L280 TraceCheckUtils]: 77: Hoare triple {5662#false} assume !false; {5662#false} is VALID [2020-07-10 20:24:38,114 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-10 20:24:38,114 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:38,115 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [399225487] [2020-07-10 20:24:38,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:38,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-10 20:24:38,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286579565] [2020-07-10 20:24:38,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2020-07-10 20:24:38,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:38,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 20:24:38,199 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:38,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 20:24:38,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:38,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 20:24:38,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-10 20:24:38,201 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 11 states. [2020-07-10 20:24:39,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:39,587 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2020-07-10 20:24:39,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-10 20:24:39,587 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2020-07-10 20:24:39,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:39,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 20:24:39,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 122 transitions. [2020-07-10 20:24:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 20:24:39,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 122 transitions. [2020-07-10 20:24:39,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 122 transitions. [2020-07-10 20:24:39,746 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-10 20:24:39,750 INFO L225 Difference]: With dead ends: 128 [2020-07-10 20:24:39,750 INFO L226 Difference]: Without dead ends: 126 [2020-07-10 20:24:39,750 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 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-10 20:24:39,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-07-10 20:24:39,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 107. [2020-07-10 20:24:39,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:39,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 107 states. [2020-07-10 20:24:39,969 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 107 states. [2020-07-10 20:24:39,969 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 107 states. [2020-07-10 20:24:39,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:39,972 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2020-07-10 20:24:39,972 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2020-07-10 20:24:39,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:39,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:39,973 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 126 states. [2020-07-10 20:24:39,973 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 126 states. [2020-07-10 20:24:39,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:39,977 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2020-07-10 20:24:39,977 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2020-07-10 20:24:39,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:39,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:39,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:39,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:39,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-07-10 20:24:39,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2020-07-10 20:24:39,981 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 78 [2020-07-10 20:24:39,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:39,982 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2020-07-10 20:24:39,982 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 20:24:39,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 107 states and 115 transitions. [2020-07-10 20:24:40,165 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:40,165 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2020-07-10 20:24:40,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-10 20:24:40,167 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:40,167 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-10 20:24:40,167 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-10 20:24:40,167 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:40,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:40,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1911943399, now seen corresponding path program 2 times [2020-07-10 20:24:40,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:40,169 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1762433952] [2020-07-10 20:24:40,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:40,404 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-10 20:24:40,404 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {6444#true} {6444#true} #99#return; {6444#true} is VALID [2020-07-10 20:24:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:40,408 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-10 20:24:40,409 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-10 20:24:40,409 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-10 20:24:40,410 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-10 20:24:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:40,413 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-10 20:24:40,414 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-10 20:24:40,414 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-10 20:24:40,415 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-10 20:24:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:40,418 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-10 20:24:40,419 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-10 20:24:40,419 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-10 20:24:40,420 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-10 20:24:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:40,425 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-10 20:24:40,426 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-10 20:24:40,426 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-10 20:24:40,427 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-10 20:24:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:40,432 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-10 20:24:40,432 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-10 20:24:40,432 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-10 20:24:40,433 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-10 20:24:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:40,437 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-10 20:24:40,438 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-10 20:24:40,438 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-10 20:24:40,439 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-10 20:24:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:40,444 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-10 20:24:40,444 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-10 20:24:40,444 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-10 20:24:40,446 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-10 20:24:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:40,458 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-10 20:24:40,459 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-10 20:24:40,459 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-10 20:24:40,460 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-10 20:24:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:40,467 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-10 20:24:40,467 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-10 20:24:40,467 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-10 20:24:40,468 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-10 20:24:40,468 INFO L263 TraceCheckUtils]: 0: Hoare triple {6444#true} call ULTIMATE.init(); {6444#true} is VALID [2020-07-10 20:24:40,469 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-10 20:24:40,469 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6444#true} {6444#true} #99#return; {6444#true} is VALID [2020-07-10 20:24:40,469 INFO L263 TraceCheckUtils]: 3: Hoare triple {6444#true} call #t~ret7 := main(); {6444#true} is VALID [2020-07-10 20:24:40,469 INFO L280 TraceCheckUtils]: 4: Hoare triple {6444#true} havoc ~in~0; {6444#true} is VALID [2020-07-10 20:24:40,469 INFO L280 TraceCheckUtils]: 5: Hoare triple {6444#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {6444#true} is VALID [2020-07-10 20:24:40,470 INFO L280 TraceCheckUtils]: 6: Hoare triple {6444#true} ~inlen~0 := #t~nondet0; {6444#true} is VALID [2020-07-10 20:24:40,470 INFO L280 TraceCheckUtils]: 7: Hoare triple {6444#true} havoc #t~nondet0; {6444#true} is VALID [2020-07-10 20:24:40,470 INFO L280 TraceCheckUtils]: 8: Hoare triple {6444#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {6444#true} is VALID [2020-07-10 20:24:40,470 INFO L280 TraceCheckUtils]: 9: Hoare triple {6444#true} ~bufferlen~0 := #t~nondet1; {6444#true} is VALID [2020-07-10 20:24:40,470 INFO L280 TraceCheckUtils]: 10: Hoare triple {6444#true} havoc #t~nondet1; {6444#true} is VALID [2020-07-10 20:24:40,471 INFO L280 TraceCheckUtils]: 11: Hoare triple {6444#true} havoc ~buf~0; {6444#true} is VALID [2020-07-10 20:24:40,471 INFO L280 TraceCheckUtils]: 12: Hoare triple {6444#true} havoc ~buflim~0; {6444#true} is VALID [2020-07-10 20:24:40,472 INFO L280 TraceCheckUtils]: 13: Hoare triple {6444#true} assume ~bufferlen~0 > 1; {6448#(<= 2 main_~bufferlen~0)} is VALID [2020-07-10 20:24:40,472 INFO L280 TraceCheckUtils]: 14: Hoare triple {6448#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {6448#(<= 2 main_~bufferlen~0)} is VALID [2020-07-10 20:24:40,473 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-10 20:24:40,473 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-10 20:24:40,474 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-10 20:24:40,475 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-10 20:24:40,476 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-10 20:24:40,476 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-10 20:24:40,477 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-10 20:24:40,478 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-10 20:24:40,478 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-10 20:24:40,478 INFO L280 TraceCheckUtils]: 24: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-10 20:24:40,478 INFO L280 TraceCheckUtils]: 25: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-10 20:24:40,479 INFO L280 TraceCheckUtils]: 26: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-10 20:24:40,479 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-10 20:24:40,480 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-10 20:24:40,480 INFO L280 TraceCheckUtils]: 29: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-10 20:24:40,480 INFO L280 TraceCheckUtils]: 30: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-10 20:24:40,480 INFO L280 TraceCheckUtils]: 31: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-10 20:24:40,481 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-10 20:24:40,482 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-10 20:24:40,483 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-10 20:24:40,483 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-10 20:24:40,484 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-10 20:24:40,484 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-10 20:24:40,485 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-10 20:24:40,485 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-10 20:24:40,485 INFO L280 TraceCheckUtils]: 40: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-10 20:24:40,485 INFO L280 TraceCheckUtils]: 41: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-10 20:24:40,485 INFO L280 TraceCheckUtils]: 42: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-10 20:24:40,486 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-10 20:24:40,486 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-10 20:24:40,487 INFO L280 TraceCheckUtils]: 45: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-10 20:24:40,487 INFO L280 TraceCheckUtils]: 46: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-10 20:24:40,487 INFO L280 TraceCheckUtils]: 47: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-10 20:24:40,489 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-10 20:24:40,489 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-10 20:24:40,490 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-10 20:24:40,490 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-10 20:24:40,491 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-10 20:24:40,491 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-10 20:24:40,491 INFO L280 TraceCheckUtils]: 54: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-10 20:24:40,492 INFO L280 TraceCheckUtils]: 55: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-10 20:24:40,492 INFO L280 TraceCheckUtils]: 56: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-10 20:24:40,506 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-10 20:24:40,507 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-10 20:24:40,507 INFO L280 TraceCheckUtils]: 59: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-10 20:24:40,507 INFO L280 TraceCheckUtils]: 60: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-10 20:24:40,507 INFO L280 TraceCheckUtils]: 61: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-10 20:24:40,508 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-10 20:24:40,508 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-10 20:24:40,509 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-10 20:24:40,509 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-10 20:24:40,509 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-10 20:24:40,510 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-10 20:24:40,510 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-10 20:24:40,510 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-10 20:24:40,510 INFO L280 TraceCheckUtils]: 70: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-10 20:24:40,511 INFO L280 TraceCheckUtils]: 71: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-10 20:24:40,511 INFO L280 TraceCheckUtils]: 72: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-10 20:24:40,511 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-10 20:24:40,511 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-10 20:24:40,512 INFO L280 TraceCheckUtils]: 75: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-10 20:24:40,512 INFO L280 TraceCheckUtils]: 76: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-10 20:24:40,512 INFO L280 TraceCheckUtils]: 77: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-10 20:24:40,512 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-10 20:24:40,513 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-10 20:24:40,513 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-10 20:24:40,514 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-10 20:24:40,514 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-10 20:24:40,514 INFO L280 TraceCheckUtils]: 83: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-10 20:24:40,514 INFO L280 TraceCheckUtils]: 84: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-10 20:24:40,514 INFO L280 TraceCheckUtils]: 85: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-10 20:24:40,515 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-10 20:24:40,516 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-10 20:24:40,516 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-10 20:24:40,516 INFO L280 TraceCheckUtils]: 89: Hoare triple {6492#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {6445#false} is VALID [2020-07-10 20:24:40,516 INFO L280 TraceCheckUtils]: 90: Hoare triple {6445#false} assume !false; {6445#false} is VALID [2020-07-10 20:24:40,528 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-10 20:24:40,529 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:40,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1762433952] [2020-07-10 20:24:40,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:40,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-10 20:24:40,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456911788] [2020-07-10 20:24:40,530 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2020-07-10 20:24:40,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:40,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 20:24:40,609 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-10 20:24:40,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 20:24:40,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:40,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 20:24:40,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-10 20:24:40,611 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 11 states. [2020-07-10 20:24:42,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:42,196 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2020-07-10 20:24:42,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-10 20:24:42,196 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2020-07-10 20:24:42,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:42,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 20:24:42,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2020-07-10 20:24:42,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 20:24:42,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2020-07-10 20:24:42,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 127 transitions. [2020-07-10 20:24:42,387 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-10 20:24:42,397 INFO L225 Difference]: With dead ends: 134 [2020-07-10 20:24:42,400 INFO L226 Difference]: Without dead ends: 132 [2020-07-10 20:24:42,401 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 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-10 20:24:42,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-07-10 20:24:42,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 120. [2020-07-10 20:24:42,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:42,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 120 states. [2020-07-10 20:24:42,704 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 120 states. [2020-07-10 20:24:42,705 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 120 states. [2020-07-10 20:24:42,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:42,708 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2020-07-10 20:24:42,708 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2020-07-10 20:24:42,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:42,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:42,709 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 132 states. [2020-07-10 20:24:42,710 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 132 states. [2020-07-10 20:24:42,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:42,714 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2020-07-10 20:24:42,714 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2020-07-10 20:24:42,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:42,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:42,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:42,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:42,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-07-10 20:24:42,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2020-07-10 20:24:42,718 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 91 [2020-07-10 20:24:42,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:42,719 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2020-07-10 20:24:42,719 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 20:24:42,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 120 states and 133 transitions. [2020-07-10 20:24:42,937 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:42,937 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2020-07-10 20:24:42,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-07-10 20:24:42,939 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:42,939 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-10 20:24:42,939 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-10 20:24:42,939 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:42,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:42,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1949077486, now seen corresponding path program 2 times [2020-07-10 20:24:42,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:42,940 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [221285946] [2020-07-10 20:24:42,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:43,234 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-10 20:24:43,235 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {7289#true} {7289#true} #99#return; {7289#true} is VALID [2020-07-10 20:24:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:43,240 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-10 20:24:43,240 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-10 20:24:43,241 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-10 20:24:43,242 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-10 20:24:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:43,246 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-10 20:24:43,247 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-10 20:24:43,247 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-10 20:24:43,248 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-10 20:24:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:43,255 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-10 20:24:43,255 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-10 20:24:43,255 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-10 20:24:43,258 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-10 20:24:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:43,263 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-10 20:24:43,263 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-10 20:24:43,263 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-10 20:24:43,264 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-10 20:24:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:43,270 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-10 20:24:43,271 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-10 20:24:43,271 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-10 20:24:43,272 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-10 20:24:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:43,277 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-10 20:24:43,277 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-10 20:24:43,278 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-10 20:24:43,279 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-10 20:24:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:43,283 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-10 20:24:43,283 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-10 20:24:43,284 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-10 20:24:43,284 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-10 20:24:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:43,289 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-10 20:24:43,289 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-10 20:24:43,289 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-10 20:24:43,290 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-10 20:24:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:43,296 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-10 20:24:43,297 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-10 20:24:43,297 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-10 20:24:43,298 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-10 20:24:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:43,308 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-10 20:24:43,309 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-10 20:24:43,309 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-10 20:24:43,310 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-10 20:24:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:43,314 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-10 20:24:43,314 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-10 20:24:43,314 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-10 20:24:43,315 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-10 20:24:43,315 INFO L263 TraceCheckUtils]: 0: Hoare triple {7289#true} call ULTIMATE.init(); {7289#true} is VALID [2020-07-10 20:24:43,316 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-10 20:24:43,316 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7289#true} {7289#true} #99#return; {7289#true} is VALID [2020-07-10 20:24:43,316 INFO L263 TraceCheckUtils]: 3: Hoare triple {7289#true} call #t~ret7 := main(); {7289#true} is VALID [2020-07-10 20:24:43,316 INFO L280 TraceCheckUtils]: 4: Hoare triple {7289#true} havoc ~in~0; {7289#true} is VALID [2020-07-10 20:24:43,316 INFO L280 TraceCheckUtils]: 5: Hoare triple {7289#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {7289#true} is VALID [2020-07-10 20:24:43,317 INFO L280 TraceCheckUtils]: 6: Hoare triple {7289#true} ~inlen~0 := #t~nondet0; {7289#true} is VALID [2020-07-10 20:24:43,317 INFO L280 TraceCheckUtils]: 7: Hoare triple {7289#true} havoc #t~nondet0; {7289#true} is VALID [2020-07-10 20:24:43,317 INFO L280 TraceCheckUtils]: 8: Hoare triple {7289#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {7289#true} is VALID [2020-07-10 20:24:43,317 INFO L280 TraceCheckUtils]: 9: Hoare triple {7289#true} ~bufferlen~0 := #t~nondet1; {7289#true} is VALID [2020-07-10 20:24:43,318 INFO L280 TraceCheckUtils]: 10: Hoare triple {7289#true} havoc #t~nondet1; {7289#true} is VALID [2020-07-10 20:24:43,318 INFO L280 TraceCheckUtils]: 11: Hoare triple {7289#true} havoc ~buf~0; {7289#true} is VALID [2020-07-10 20:24:43,318 INFO L280 TraceCheckUtils]: 12: Hoare triple {7289#true} havoc ~buflim~0; {7289#true} is VALID [2020-07-10 20:24:43,319 INFO L280 TraceCheckUtils]: 13: Hoare triple {7289#true} assume ~bufferlen~0 > 1; {7293#(<= 2 main_~bufferlen~0)} is VALID [2020-07-10 20:24:43,320 INFO L280 TraceCheckUtils]: 14: Hoare triple {7293#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {7293#(<= 2 main_~bufferlen~0)} is VALID [2020-07-10 20:24:43,320 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-10 20:24:43,321 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-10 20:24:43,322 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-10 20:24:43,323 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-10 20:24:43,324 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-10 20:24:43,324 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-10 20:24:43,325 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-10 20:24:43,326 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-10 20:24:43,327 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-10 20:24:43,327 INFO L280 TraceCheckUtils]: 24: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-10 20:24:43,327 INFO L280 TraceCheckUtils]: 25: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-10 20:24:43,327 INFO L280 TraceCheckUtils]: 26: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-10 20:24:43,328 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-10 20:24:43,328 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-10 20:24:43,329 INFO L280 TraceCheckUtils]: 29: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-10 20:24:43,329 INFO L280 TraceCheckUtils]: 30: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-10 20:24:43,329 INFO L280 TraceCheckUtils]: 31: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-10 20:24:43,330 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-10 20:24:43,331 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-10 20:24:43,332 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-10 20:24:43,333 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-10 20:24:43,334 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-10 20:24:43,334 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-10 20:24:43,335 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-10 20:24:43,336 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-10 20:24:43,336 INFO L280 TraceCheckUtils]: 40: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-10 20:24:43,336 INFO L280 TraceCheckUtils]: 41: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-10 20:24:43,336 INFO L280 TraceCheckUtils]: 42: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-10 20:24:43,337 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-10 20:24:43,338 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-10 20:24:43,338 INFO L280 TraceCheckUtils]: 45: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-10 20:24:43,338 INFO L280 TraceCheckUtils]: 46: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-10 20:24:43,338 INFO L280 TraceCheckUtils]: 47: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-10 20:24:43,339 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-10 20:24:43,340 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-10 20:24:43,341 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-10 20:24:43,342 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-10 20:24:43,343 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-10 20:24:43,343 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-10 20:24:43,343 INFO L280 TraceCheckUtils]: 54: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-10 20:24:43,343 INFO L280 TraceCheckUtils]: 55: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-10 20:24:43,344 INFO L280 TraceCheckUtils]: 56: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-10 20:24:43,345 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-10 20:24:43,345 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-10 20:24:43,345 INFO L280 TraceCheckUtils]: 59: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-10 20:24:43,345 INFO L280 TraceCheckUtils]: 60: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-10 20:24:43,346 INFO L280 TraceCheckUtils]: 61: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-10 20:24:43,346 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-10 20:24:43,347 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-10 20:24:43,348 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-10 20:24:43,349 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-10 20:24:43,350 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-10 20:24:43,350 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-10 20:24:43,351 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-10 20:24:43,351 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-10 20:24:43,352 INFO L280 TraceCheckUtils]: 70: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-10 20:24:43,352 INFO L280 TraceCheckUtils]: 71: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-10 20:24:43,352 INFO L280 TraceCheckUtils]: 72: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-10 20:24:43,353 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-10 20:24:43,353 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-10 20:24:43,354 INFO L280 TraceCheckUtils]: 75: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-10 20:24:43,354 INFO L280 TraceCheckUtils]: 76: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-10 20:24:43,354 INFO L280 TraceCheckUtils]: 77: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-10 20:24:43,355 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-10 20:24:43,356 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-10 20:24:43,356 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-10 20:24:43,357 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-10 20:24:43,357 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-10 20:24:43,357 INFO L280 TraceCheckUtils]: 83: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-10 20:24:43,358 INFO L280 TraceCheckUtils]: 84: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-10 20:24:43,358 INFO L280 TraceCheckUtils]: 85: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-10 20:24:43,359 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-10 20:24:43,359 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-10 20:24:43,359 INFO L280 TraceCheckUtils]: 88: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-10 20:24:43,359 INFO L280 TraceCheckUtils]: 89: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-10 20:24:43,360 INFO L280 TraceCheckUtils]: 90: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-10 20:24:43,360 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-10 20:24:43,361 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-10 20:24:43,362 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-10 20:24:43,363 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-10 20:24:43,363 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-10 20:24:43,363 INFO L280 TraceCheckUtils]: 96: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-10 20:24:43,364 INFO L280 TraceCheckUtils]: 97: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-10 20:24:43,364 INFO L280 TraceCheckUtils]: 98: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-10 20:24:43,365 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-10 20:24:43,366 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-10 20:24:43,366 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-10 20:24:43,367 INFO L280 TraceCheckUtils]: 102: Hoare triple {7347#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {7290#false} is VALID [2020-07-10 20:24:43,367 INFO L280 TraceCheckUtils]: 103: Hoare triple {7290#false} assume !false; {7290#false} is VALID [2020-07-10 20:24:43,385 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-10 20:24:43,385 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:43,385 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [221285946] [2020-07-10 20:24:43,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:43,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-10 20:24:43,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741129027] [2020-07-10 20:24:43,387 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2020-07-10 20:24:43,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:43,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 20:24:43,471 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-10 20:24:43,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 20:24:43,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:43,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 20:24:43,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-07-10 20:24:43,472 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand 13 states. [2020-07-10 20:24:44,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:44,753 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2020-07-10 20:24:44,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-10 20:24:44,753 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2020-07-10 20:24:44,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:44,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 20:24:44,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 60 transitions. [2020-07-10 20:24:44,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 20:24:44,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 60 transitions. [2020-07-10 20:24:44,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 60 transitions. [2020-07-10 20:24:44,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:44,867 INFO L225 Difference]: With dead ends: 126 [2020-07-10 20:24:44,867 INFO L226 Difference]: Without dead ends: 109 [2020-07-10 20:24:44,871 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 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-10 20:24:44,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-07-10 20:24:45,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2020-07-10 20:24:45,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:45,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 99 states. [2020-07-10 20:24:45,123 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 99 states. [2020-07-10 20:24:45,123 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 99 states. [2020-07-10 20:24:45,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:45,127 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2020-07-10 20:24:45,127 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2020-07-10 20:24:45,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:45,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:45,128 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 109 states. [2020-07-10 20:24:45,128 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 109 states. [2020-07-10 20:24:45,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:45,131 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2020-07-10 20:24:45,131 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2020-07-10 20:24:45,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:45,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:45,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:45,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:45,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-07-10 20:24:45,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2020-07-10 20:24:45,135 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 104 [2020-07-10 20:24:45,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:45,135 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2020-07-10 20:24:45,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 20:24:45,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 99 states and 102 transitions. [2020-07-10 20:24:45,366 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:45,367 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2020-07-10 20:24:45,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-07-10 20:24:45,368 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:45,368 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-10 20:24:45,369 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-10 20:24:45,369 INFO L427 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:45,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:45,369 INFO L82 PathProgramCache]: Analyzing trace with hash 55355532, now seen corresponding path program 2 times [2020-07-10 20:24:45,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:45,370 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1884017367] [2020-07-10 20:24:45,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:45,689 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:24:45,689 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8036#true} {8036#true} #99#return; {8036#true} is VALID [2020-07-10 20:24:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:45,693 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-10 20:24:45,693 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-10 20:24:45,693 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:24:45,694 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-10 20:24:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:45,698 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-10 20:24:45,698 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-10 20:24:45,698 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:24:45,699 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-10 20:24:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:45,703 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-10 20:24:45,703 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-10 20:24:45,703 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:24:45,704 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-10 20:24:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:45,708 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-10 20:24:45,708 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-10 20:24:45,708 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:24:45,709 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-10 20:24:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:45,713 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-10 20:24:45,714 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-10 20:24:45,714 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:24:45,715 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-10 20:24:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:45,719 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-10 20:24:45,720 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-10 20:24:45,720 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:24:45,721 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-10 20:24:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:45,725 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-10 20:24:45,725 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-10 20:24:45,725 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:24:45,726 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-10 20:24:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:45,730 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-10 20:24:45,731 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-10 20:24:45,731 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:24:45,732 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-10 20:24:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:45,736 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-10 20:24:45,736 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-10 20:24:45,736 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:24:45,737 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-10 20:24:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:45,743 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-10 20:24:45,744 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-10 20:24:45,744 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:24:45,746 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-10 20:24:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:45,751 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-10 20:24:45,752 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-10 20:24:45,752 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:24:45,753 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-10 20:24:45,753 INFO L263 TraceCheckUtils]: 0: Hoare triple {8036#true} call ULTIMATE.init(); {8036#true} is VALID [2020-07-10 20:24:45,754 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:24:45,754 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8036#true} {8036#true} #99#return; {8036#true} is VALID [2020-07-10 20:24:45,754 INFO L263 TraceCheckUtils]: 3: Hoare triple {8036#true} call #t~ret7 := main(); {8036#true} is VALID [2020-07-10 20:24:45,754 INFO L280 TraceCheckUtils]: 4: Hoare triple {8036#true} havoc ~in~0; {8036#true} is VALID [2020-07-10 20:24:45,755 INFO L280 TraceCheckUtils]: 5: Hoare triple {8036#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {8036#true} is VALID [2020-07-10 20:24:45,755 INFO L280 TraceCheckUtils]: 6: Hoare triple {8036#true} ~inlen~0 := #t~nondet0; {8036#true} is VALID [2020-07-10 20:24:45,755 INFO L280 TraceCheckUtils]: 7: Hoare triple {8036#true} havoc #t~nondet0; {8036#true} is VALID [2020-07-10 20:24:45,755 INFO L280 TraceCheckUtils]: 8: Hoare triple {8036#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {8036#true} is VALID [2020-07-10 20:24:45,756 INFO L280 TraceCheckUtils]: 9: Hoare triple {8036#true} ~bufferlen~0 := #t~nondet1; {8036#true} is VALID [2020-07-10 20:24:45,756 INFO L280 TraceCheckUtils]: 10: Hoare triple {8036#true} havoc #t~nondet1; {8036#true} is VALID [2020-07-10 20:24:45,756 INFO L280 TraceCheckUtils]: 11: Hoare triple {8036#true} havoc ~buf~0; {8036#true} is VALID [2020-07-10 20:24:45,756 INFO L280 TraceCheckUtils]: 12: Hoare triple {8036#true} havoc ~buflim~0; {8036#true} is VALID [2020-07-10 20:24:45,757 INFO L280 TraceCheckUtils]: 13: Hoare triple {8036#true} assume ~bufferlen~0 > 1; {8040#(<= 2 main_~bufferlen~0)} is VALID [2020-07-10 20:24:45,758 INFO L280 TraceCheckUtils]: 14: Hoare triple {8040#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {8040#(<= 2 main_~bufferlen~0)} is VALID [2020-07-10 20:24:45,759 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-10 20:24:45,760 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-10 20:24:45,761 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-10 20:24:45,762 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-10 20:24:45,763 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-10 20:24:45,764 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-10 20:24:45,764 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-10 20:24:45,765 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-10 20:24:45,765 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-10 20:24:45,766 INFO L280 TraceCheckUtils]: 24: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-10 20:24:45,766 INFO L280 TraceCheckUtils]: 25: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-10 20:24:45,766 INFO L280 TraceCheckUtils]: 26: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:24:45,767 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-10 20:24:45,767 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-10 20:24:45,767 INFO L280 TraceCheckUtils]: 29: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-10 20:24:45,767 INFO L280 TraceCheckUtils]: 30: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-10 20:24:45,768 INFO L280 TraceCheckUtils]: 31: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:24:45,768 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-10 20:24:45,769 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-10 20:24:45,769 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-10 20:24:45,770 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-10 20:24:45,770 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-10 20:24:45,771 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-10 20:24:45,772 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-10 20:24:45,772 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-10 20:24:45,772 INFO L280 TraceCheckUtils]: 40: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-10 20:24:45,772 INFO L280 TraceCheckUtils]: 41: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-10 20:24:45,773 INFO L280 TraceCheckUtils]: 42: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:24:45,774 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-10 20:24:45,774 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-10 20:24:45,774 INFO L280 TraceCheckUtils]: 45: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-10 20:24:45,774 INFO L280 TraceCheckUtils]: 46: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-10 20:24:45,775 INFO L280 TraceCheckUtils]: 47: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:24:45,775 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-10 20:24:45,776 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-10 20:24:45,776 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-10 20:24:45,777 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-10 20:24:45,778 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-10 20:24:45,778 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-10 20:24:45,778 INFO L280 TraceCheckUtils]: 54: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-10 20:24:45,778 INFO L280 TraceCheckUtils]: 55: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-10 20:24:45,778 INFO L280 TraceCheckUtils]: 56: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:24:45,779 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-10 20:24:45,779 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-10 20:24:45,780 INFO L280 TraceCheckUtils]: 59: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-10 20:24:45,780 INFO L280 TraceCheckUtils]: 60: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-10 20:24:45,780 INFO L280 TraceCheckUtils]: 61: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:24:45,781 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-10 20:24:45,781 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-10 20:24:45,792 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-10 20:24:45,792 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-10 20:24:45,793 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-10 20:24:45,793 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-10 20:24:45,794 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-10 20:24:45,795 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-10 20:24:45,795 INFO L280 TraceCheckUtils]: 70: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-10 20:24:45,795 INFO L280 TraceCheckUtils]: 71: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-10 20:24:45,796 INFO L280 TraceCheckUtils]: 72: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:24:45,799 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-10 20:24:45,800 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-10 20:24:45,800 INFO L280 TraceCheckUtils]: 75: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-10 20:24:45,800 INFO L280 TraceCheckUtils]: 76: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-10 20:24:45,800 INFO L280 TraceCheckUtils]: 77: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:24:45,801 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-10 20:24:45,804 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-10 20:24:45,805 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-10 20:24:45,805 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-10 20:24:45,806 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-10 20:24:45,806 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-10 20:24:45,806 INFO L280 TraceCheckUtils]: 84: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-10 20:24:45,807 INFO L280 TraceCheckUtils]: 85: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-10 20:24:45,807 INFO L280 TraceCheckUtils]: 86: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:24:45,807 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-10 20:24:45,808 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-10 20:24:45,808 INFO L280 TraceCheckUtils]: 89: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-10 20:24:45,808 INFO L280 TraceCheckUtils]: 90: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-10 20:24:45,808 INFO L280 TraceCheckUtils]: 91: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:24:45,809 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-10 20:24:45,809 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-10 20:24:45,810 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-10 20:24:45,811 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-10 20:24:45,811 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-10 20:24:45,812 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-10 20:24:45,813 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-10 20:24:45,813 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-10 20:24:45,813 INFO L280 TraceCheckUtils]: 100: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-10 20:24:45,813 INFO L280 TraceCheckUtils]: 101: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-10 20:24:45,813 INFO L280 TraceCheckUtils]: 102: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-10 20:24:45,814 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-10 20:24:45,815 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-10 20:24:45,816 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-10 20:24:45,816 INFO L280 TraceCheckUtils]: 106: Hoare triple {8097#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {8037#false} is VALID [2020-07-10 20:24:45,817 INFO L280 TraceCheckUtils]: 107: Hoare triple {8037#false} assume !false; {8037#false} is VALID [2020-07-10 20:24:45,830 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-10 20:24:45,830 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:45,830 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1884017367] [2020-07-10 20:24:45,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:45,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-07-10 20:24:45,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558463573] [2020-07-10 20:24:45,831 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2020-07-10 20:24:45,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:45,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-10 20:24:45,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:45,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-10 20:24:45,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:45,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-10 20:24:45,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-07-10 20:24:45,926 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand 16 states. [2020-07-10 20:24:47,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:47,914 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2020-07-10 20:24:47,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-10 20:24:47,914 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2020-07-10 20:24:47,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:47,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-10 20:24:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 114 transitions. [2020-07-10 20:24:47,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-10 20:24:47,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 114 transitions. [2020-07-10 20:24:47,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 114 transitions. [2020-07-10 20:24:48,066 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-10 20:24:48,068 INFO L225 Difference]: With dead ends: 130 [2020-07-10 20:24:48,069 INFO L226 Difference]: Without dead ends: 128 [2020-07-10 20:24:48,071 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2020-07-10 20:24:48,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-07-10 20:24:48,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 117. [2020-07-10 20:24:48,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:48,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 117 states. [2020-07-10 20:24:48,410 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 117 states. [2020-07-10 20:24:48,410 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 117 states. [2020-07-10 20:24:48,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:48,413 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2020-07-10 20:24:48,414 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2020-07-10 20:24:48,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:48,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:48,414 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 128 states. [2020-07-10 20:24:48,415 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 128 states. [2020-07-10 20:24:48,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:48,418 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2020-07-10 20:24:48,418 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2020-07-10 20:24:48,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:48,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:48,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:48,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:48,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-10 20:24:48,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2020-07-10 20:24:48,423 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 108 [2020-07-10 20:24:48,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:48,423 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2020-07-10 20:24:48,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-10 20:24:48,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 117 states and 123 transitions. [2020-07-10 20:24:48,670 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-10 20:24:48,670 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2020-07-10 20:24:48,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-07-10 20:24:48,674 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:48,674 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-10 20:24:48,674 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-10 20:24:48,674 INFO L427 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:48,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:48,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1897035733, now seen corresponding path program 3 times [2020-07-10 20:24:48,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:48,675 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [892577843] [2020-07-10 20:24:48,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:49,276 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,277 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8880#true} {8880#true} #99#return; {8880#true} is VALID [2020-07-10 20:24:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:49,283 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,284 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,284 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,285 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-10 20:24:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:49,289 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,290 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,290 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,291 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-10 20:24:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:49,296 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,296 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,296 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,297 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-10 20:24:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:49,302 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,303 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,303 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,304 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-10 20:24:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:49,308 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,309 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,309 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,310 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-10 20:24:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:49,314 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,315 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,315 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,316 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-10 20:24:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:49,320 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,320 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,320 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,321 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-10 20:24:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:49,325 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,325 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,326 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,326 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-10 20:24:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:49,332 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,332 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,333 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,333 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-10 20:24:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:49,338 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,339 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,339 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,340 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-10 20:24:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:49,348 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,348 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,348 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,349 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-10 20:24:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:49,353 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,353 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,354 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,354 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-10 20:24:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:49,360 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,360 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,361 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,362 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-10 20:24:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:49,372 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,372 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,372 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,373 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-10 20:24:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:49,377 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,378 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,378 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,379 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-10 20:24:49,379 INFO L263 TraceCheckUtils]: 0: Hoare triple {8880#true} call ULTIMATE.init(); {8880#true} is VALID [2020-07-10 20:24:49,379 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,380 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8880#true} {8880#true} #99#return; {8880#true} is VALID [2020-07-10 20:24:49,380 INFO L263 TraceCheckUtils]: 3: Hoare triple {8880#true} call #t~ret7 := main(); {8880#true} is VALID [2020-07-10 20:24:49,380 INFO L280 TraceCheckUtils]: 4: Hoare triple {8880#true} havoc ~in~0; {8880#true} is VALID [2020-07-10 20:24:49,380 INFO L280 TraceCheckUtils]: 5: Hoare triple {8880#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {8880#true} is VALID [2020-07-10 20:24:49,380 INFO L280 TraceCheckUtils]: 6: Hoare triple {8880#true} ~inlen~0 := #t~nondet0; {8880#true} is VALID [2020-07-10 20:24:49,381 INFO L280 TraceCheckUtils]: 7: Hoare triple {8880#true} havoc #t~nondet0; {8880#true} is VALID [2020-07-10 20:24:49,381 INFO L280 TraceCheckUtils]: 8: Hoare triple {8880#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {8880#true} is VALID [2020-07-10 20:24:49,381 INFO L280 TraceCheckUtils]: 9: Hoare triple {8880#true} ~bufferlen~0 := #t~nondet1; {8880#true} is VALID [2020-07-10 20:24:49,381 INFO L280 TraceCheckUtils]: 10: Hoare triple {8880#true} havoc #t~nondet1; {8880#true} is VALID [2020-07-10 20:24:49,381 INFO L280 TraceCheckUtils]: 11: Hoare triple {8880#true} havoc ~buf~0; {8880#true} is VALID [2020-07-10 20:24:49,381 INFO L280 TraceCheckUtils]: 12: Hoare triple {8880#true} havoc ~buflim~0; {8880#true} is VALID [2020-07-10 20:24:49,382 INFO L280 TraceCheckUtils]: 13: Hoare triple {8880#true} assume ~bufferlen~0 > 1; {8884#(<= 2 main_~bufferlen~0)} is VALID [2020-07-10 20:24:49,383 INFO L280 TraceCheckUtils]: 14: Hoare triple {8884#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {8884#(<= 2 main_~bufferlen~0)} is VALID [2020-07-10 20:24:49,384 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-10 20:24:49,385 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-10 20:24:49,386 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-10 20:24:49,387 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-10 20:24:49,388 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-10 20:24:49,389 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-10 20:24:49,389 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-10 20:24:49,390 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-10 20:24:49,391 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-10 20:24:49,391 INFO L280 TraceCheckUtils]: 24: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,391 INFO L280 TraceCheckUtils]: 25: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,391 INFO L280 TraceCheckUtils]: 26: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,392 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-10 20:24:49,392 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-10 20:24:49,393 INFO L280 TraceCheckUtils]: 29: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,393 INFO L280 TraceCheckUtils]: 30: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,393 INFO L280 TraceCheckUtils]: 31: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,394 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-10 20:24:49,395 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-10 20:24:49,396 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-10 20:24:49,397 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-10 20:24:49,398 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-10 20:24:49,399 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-10 20:24:49,400 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-10 20:24:49,400 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-10 20:24:49,400 INFO L280 TraceCheckUtils]: 40: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,400 INFO L280 TraceCheckUtils]: 41: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,400 INFO L280 TraceCheckUtils]: 42: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,401 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-10 20:24:49,402 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-10 20:24:49,402 INFO L280 TraceCheckUtils]: 45: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,402 INFO L280 TraceCheckUtils]: 46: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,402 INFO L280 TraceCheckUtils]: 47: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,403 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-10 20:24:49,404 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-10 20:24:49,405 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-10 20:24:49,406 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-10 20:24:49,407 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-10 20:24:49,407 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-10 20:24:49,407 INFO L280 TraceCheckUtils]: 54: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,407 INFO L280 TraceCheckUtils]: 55: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,407 INFO L280 TraceCheckUtils]: 56: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,408 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-10 20:24:49,409 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-10 20:24:49,409 INFO L280 TraceCheckUtils]: 59: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,409 INFO L280 TraceCheckUtils]: 60: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,409 INFO L280 TraceCheckUtils]: 61: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,410 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-10 20:24:49,411 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-10 20:24:49,411 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-10 20:24:49,412 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-10 20:24:49,412 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-10 20:24:49,413 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-10 20:24:49,414 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-10 20:24:49,414 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-10 20:24:49,414 INFO L280 TraceCheckUtils]: 70: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,414 INFO L280 TraceCheckUtils]: 71: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,414 INFO L280 TraceCheckUtils]: 72: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,415 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-10 20:24:49,415 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-10 20:24:49,416 INFO L280 TraceCheckUtils]: 75: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,416 INFO L280 TraceCheckUtils]: 76: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,416 INFO L280 TraceCheckUtils]: 77: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,417 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-10 20:24:49,417 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-10 20:24:49,418 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-10 20:24:49,418 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-10 20:24:49,419 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-10 20:24:49,419 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-10 20:24:49,419 INFO L280 TraceCheckUtils]: 84: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,419 INFO L280 TraceCheckUtils]: 85: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,420 INFO L280 TraceCheckUtils]: 86: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,420 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-10 20:24:49,421 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-10 20:24:49,421 INFO L280 TraceCheckUtils]: 89: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,421 INFO L280 TraceCheckUtils]: 90: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,421 INFO L280 TraceCheckUtils]: 91: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,422 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-10 20:24:49,423 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-10 20:24:49,423 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-10 20:24:49,424 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-10 20:24:49,425 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-10 20:24:49,426 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-10 20:24:49,426 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-10 20:24:49,426 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-10 20:24:49,426 INFO L280 TraceCheckUtils]: 100: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,427 INFO L280 TraceCheckUtils]: 101: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,427 INFO L280 TraceCheckUtils]: 102: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,428 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-10 20:24:49,428 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-10 20:24:49,428 INFO L280 TraceCheckUtils]: 105: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,428 INFO L280 TraceCheckUtils]: 106: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,428 INFO L280 TraceCheckUtils]: 107: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,429 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-10 20:24:49,430 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-10 20:24:49,431 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-10 20:24:49,431 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-10 20:24:49,432 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-10 20:24:49,432 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-10 20:24:49,432 INFO L280 TraceCheckUtils]: 114: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,433 INFO L280 TraceCheckUtils]: 115: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,433 INFO L280 TraceCheckUtils]: 116: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,434 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-10 20:24:49,434 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-10 20:24:49,435 INFO L280 TraceCheckUtils]: 119: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,435 INFO L280 TraceCheckUtils]: 120: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,435 INFO L280 TraceCheckUtils]: 121: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,436 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-10 20:24:49,437 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-10 20:24:49,437 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-10 20:24:49,437 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-10 20:24:49,438 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-10 20:24:49,439 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-10 20:24:49,439 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-10 20:24:49,439 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-10 20:24:49,440 INFO L280 TraceCheckUtils]: 130: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-10 20:24:49,440 INFO L280 TraceCheckUtils]: 131: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-10 20:24:49,440 INFO L280 TraceCheckUtils]: 132: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-10 20:24:49,441 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-10 20:24:49,442 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-10 20:24:49,442 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-10 20:24:49,443 INFO L280 TraceCheckUtils]: 136: Hoare triple {8962#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {8881#false} is VALID [2020-07-10 20:24:49,443 INFO L280 TraceCheckUtils]: 137: Hoare triple {8881#false} assume !false; {8881#false} is VALID [2020-07-10 20:24:49,474 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-10 20:24:49,474 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:49,474 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [892577843] [2020-07-10 20:24:49,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:49,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-07-10 20:24:49,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854830563] [2020-07-10 20:24:49,475 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 138 [2020-07-10 20:24:49,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:49,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2020-07-10 20:24:49,609 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:49,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-10 20:24:49,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:49,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-10 20:24:49,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2020-07-10 20:24:49,610 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 21 states. [2020-07-10 20:24:51,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:51,756 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2020-07-10 20:24:51,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-10 20:24:51,756 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 138 [2020-07-10 20:24:51,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:51,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 20:24:51,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 55 transitions. [2020-07-10 20:24:51,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 20:24:51,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 55 transitions. [2020-07-10 20:24:51,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 55 transitions. [2020-07-10 20:24:51,850 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-10 20:24:51,851 INFO L225 Difference]: With dead ends: 117 [2020-07-10 20:24:51,851 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 20:24:51,852 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=232, Invalid=890, Unknown=0, NotChecked=0, Total=1122 [2020-07-10 20:24:51,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 20:24:51,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 20:24:51,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:51,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:51,853 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:51,853 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:51,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:51,854 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:24:51,854 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:24:51,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:51,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:51,854 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:51,854 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:51,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:51,855 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:24:51,855 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:24:51,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:51,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:51,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:51,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 20:24:51,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 20:24:51,856 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2020-07-10 20:24:51,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:51,856 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 20:24:51,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-10 20:24:51,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 20:24:51,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:51,857 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:24:51,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:51,857 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-10 20:24:51,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 20:24:52,896 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2020-07-10 20:24:53,146 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2020-07-10 20:24:53,274 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 27 [2020-07-10 20:24:53,402 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 27 [2020-07-10 20:24:53,696 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 26 [2020-07-10 20:24:53,951 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 29 [2020-07-10 20:24:54,531 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 36 [2020-07-10 20:24:54,541 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:24:54,541 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:24:54,541 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:24:54,541 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 20:24:54,541 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 20:24:54,541 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:24:54,542 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:24:54,542 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:24:54,542 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 20:24:54,542 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-10 20:24:54,542 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:24:54,542 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-10 20:24:54,542 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 45) the Hoare annotation is: true [2020-07-10 20:24:54,543 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-10 20:24:54,543 INFO L271 CegarLoopResult]: At program point L44(lines 14 45) the Hoare annotation is: true [2020-07-10 20:24:54,543 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-10 20:24:54,543 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-10 20:24:54,543 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-10 20:24:54,544 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-10 20:24:54,544 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-10 20:24:54,544 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-10 20:24:54,544 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-10 20:24:54,544 INFO L271 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-07-10 20:24:54,544 INFO L264 CegarLoopResult]: At program point L20-1(lines 14 45) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2020-07-10 20:24:54,545 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-10 20:24:54,545 INFO L271 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: true [2020-07-10 20:24:54,545 INFO L271 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: true [2020-07-10 20:24:54,545 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-10 20:24:54,545 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-10 20:24:54,545 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-10 20:24:54,546 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-10 20:24:54,546 INFO L264 CegarLoopResult]: At program point L21(lines 14 45) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2020-07-10 20:24:54,546 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-10 20:24:54,546 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-07-10 20:24:54,546 INFO L271 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-07-10 20:24:54,546 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 45) the Hoare annotation is: true [2020-07-10 20:24:54,546 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-07-10 20:24:54,546 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-10 20:24:54,547 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-10 20:24:54,547 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-10 20:24:54,547 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-10 20:24:54,547 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 45) the Hoare annotation is: true [2020-07-10 20:24:54,547 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-10 20:24:54,548 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-10 20:24:54,548 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-10 20:24:54,548 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-10 20:24:54,548 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-10 20:24:54,548 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-10 20:24:54,548 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-10 20:24:54,549 INFO L271 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: true [2020-07-10 20:24:54,549 INFO L271 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: true [2020-07-10 20:24:54,549 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-10 20:24:54,549 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-10 20:24:54,549 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-10 20:24:54,549 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-10 20:24:54,549 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:24:54,550 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:24:54,550 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:24:54,550 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:24:54,550 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:24:54,555 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 20:24:54,556 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:24:54,556 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:24:54,557 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-10 20:24:54,558 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-10 20:24:54,602 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-10 20:24:54,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 08:24:54 BoogieIcfgContainer [2020-07-10 20:24:54,631 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 20:24:54,633 INFO L168 Benchmark]: Toolchain (without parser) took 31935.20 ms. Allocated memory was 143.1 MB in the beginning and 465.6 MB in the end (delta: 322.4 MB). Free memory was 100.1 MB in the beginning and 355.6 MB in the end (delta: -255.5 MB). Peak memory consumption was 66.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:24:54,635 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 143.1 MB. Free memory was 118.5 MB in the beginning and 118.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 20:24:54,636 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.27 ms. Allocated memory is still 143.1 MB. Free memory was 99.8 MB in the beginning and 89.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-10 20:24:54,636 INFO L168 Benchmark]: Boogie Preprocessor took 126.15 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 89.2 MB in the beginning and 179.4 MB in the end (delta: -90.2 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:24:54,637 INFO L168 Benchmark]: RCFGBuilder took 489.16 ms. Allocated memory is still 200.8 MB. Free memory was 179.4 MB in the beginning and 153.0 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:24:54,642 INFO L168 Benchmark]: TraceAbstraction took 31030.69 ms. Allocated memory was 200.8 MB in the beginning and 465.6 MB in the end (delta: 264.8 MB). Free memory was 152.4 MB in the beginning and 355.6 MB in the end (delta: -203.2 MB). Peak memory consumption was 61.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:24:54,647 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.26 ms. Allocated memory is still 143.1 MB. Free memory was 118.5 MB in the beginning and 118.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 283.27 ms. Allocated memory is still 143.1 MB. Free memory was 99.8 MB in the beginning and 89.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 126.15 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 89.2 MB in the beginning and 179.4 MB in the end (delta: -90.2 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 489.16 ms. Allocated memory is still 200.8 MB. Free memory was 179.4 MB in the beginning and 153.0 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31030.69 ms. Allocated memory was 200.8 MB in the beginning and 465.6 MB in the end (delta: 264.8 MB). Free memory was 152.4 MB in the beginning and 355.6 MB in the end (delta: -203.2 MB). Peak memory consumption was 61.6 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: 28.1s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 17.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 861 SDtfs, 913 SDslu, 3779 SDs, 0 SdLazy, 1782 SolverSat, 404 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 460 GetRequests, 239 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.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 101 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 55 LocationsWithAnnotation, 289 PreInvPairs, 460 NumberOfFragments, 917 HoareAnnotationTreeSize, 289 FomulaSimplifications, 48443 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 55 FomulaSimplificationsInter, 3846 FormulaSimplificationTreeSizeReductionInter, 1.7s 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...