/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -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-11 02:31:39,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:31:39,924 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:31:39,937 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:31:39,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:31:39,939 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:31:39,940 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:31:39,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:31:39,945 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:31:39,946 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:31:39,947 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:31:39,948 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:31:39,949 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:31:39,950 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:31:39,951 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:31:39,953 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:31:39,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:31:39,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:31:39,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:31:39,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:31:39,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:31:39,962 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:31:39,964 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:31:39,965 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:31:39,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:31:39,968 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:31:39,968 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:31:39,969 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:31:39,970 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:31:39,971 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:31:39,971 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:31:39,972 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:31:39,973 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:31:39,974 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:31:39,975 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:31:39,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:31:39,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:31:39,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:31:39,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:31:39,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:31:39,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:31:39,980 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:31:39,999 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:31:39,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:31:40,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:31:40,001 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:31:40,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:31:40,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:31:40,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:31:40,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:31:40,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:31:40,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:31:40,003 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:31:40,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:31:40,003 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:31:40,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:31:40,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:31:40,004 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:31:40,004 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:31:40,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:31:40,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:31:40,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:31:40,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:31:40,007 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:31:40,007 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 02:31:40,392 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:31:40,421 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:31:40,425 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:31:40,427 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:31:40,428 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:31:40,429 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-11 02:31:40,520 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03cfc599c/57d357d78ff040208551c1d1f9bfc7f7/FLAG2cb1087d8 [2020-07-11 02:31:41,051 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:31:41,052 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2020-07-11 02:31:41,059 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03cfc599c/57d357d78ff040208551c1d1f9bfc7f7/FLAG2cb1087d8 [2020-07-11 02:31:41,408 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03cfc599c/57d357d78ff040208551c1d1f9bfc7f7 [2020-07-11 02:31:41,424 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:31:41,427 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:31:41,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:31:41,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:31:41,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:31:41,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:31:41" (1/1) ... [2020-07-11 02:31:41,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c3e449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:41, skipping insertion in model container [2020-07-11 02:31:41,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:31:41" (1/1) ... [2020-07-11 02:31:41,451 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:31:41,471 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:31:41,719 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:31:41,725 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:31:41,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:31:41,759 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:31:41,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:41 WrapperNode [2020-07-11 02:31:41,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:31:41,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:31:41,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:31:41,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:31:41,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:41" (1/1) ... [2020-07-11 02:31:41,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:41" (1/1) ... [2020-07-11 02:31:41,778 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:41" (1/1) ... [2020-07-11 02:31:41,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:41" (1/1) ... [2020-07-11 02:31:41,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:41" (1/1) ... [2020-07-11 02:31:41,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:41" (1/1) ... [2020-07-11 02:31:41,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:41" (1/1) ... [2020-07-11 02:31:41,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:31:41,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:31:41,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:31:41,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:31:41,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:41" (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-11 02:31:41,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:31:41,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:31:41,959 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-11 02:31:41,959 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:31:41,959 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:31:41,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:31:41,959 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 02:31:41,959 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-11 02:31:41,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:31:41,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 02:31:41,960 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:31:41,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:31:41,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:31:42,467 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:31:42,467 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-11 02:31:42,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:31:42 BoogieIcfgContainer [2020-07-11 02:31:42,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:31:42,474 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:31:42,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:31:42,478 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:31:42,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:31:41" (1/3) ... [2020-07-11 02:31:42,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec2032d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:31:42, skipping insertion in model container [2020-07-11 02:31:42,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:41" (2/3) ... [2020-07-11 02:31:42,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec2032d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:31:42, skipping insertion in model container [2020-07-11 02:31:42,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:31:42" (3/3) ... [2020-07-11 02:31:42,483 INFO L109 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2020-07-11 02:31:42,496 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:31:42,506 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:31:42,523 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:31:42,550 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:31:42,551 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:31:42,551 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:31:42,551 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:31:42,552 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:31:42,552 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:31:42,552 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:31:42,552 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:31:42,570 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2020-07-11 02:31:42,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-11 02:31:42,584 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:42,585 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-11 02:31:42,586 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:42,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:42,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1122321079, now seen corresponding path program 1 times [2020-07-11 02:31:42,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:42,607 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1595279793] [2020-07-11 02:31:42,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:42,793 INFO L280 TraceCheckUtils]: 0: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-11 02:31:42,794 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {58#true} {58#true} #99#return; {58#true} is VALID [2020-07-11 02:31:42,797 INFO L263 TraceCheckUtils]: 0: Hoare triple {58#true} call ULTIMATE.init(); {58#true} is VALID [2020-07-11 02:31:42,797 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-11 02:31:42,798 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {58#true} {58#true} #99#return; {58#true} is VALID [2020-07-11 02:31:42,800 INFO L263 TraceCheckUtils]: 3: Hoare triple {58#true} call #t~ret7 := main(); {58#true} is VALID [2020-07-11 02:31:42,801 INFO L280 TraceCheckUtils]: 4: Hoare triple {58#true} havoc ~in~0; {58#true} is VALID [2020-07-11 02:31:42,801 INFO L280 TraceCheckUtils]: 5: Hoare triple {58#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {58#true} is VALID [2020-07-11 02:31:42,802 INFO L280 TraceCheckUtils]: 6: Hoare triple {58#true} ~inlen~0 := #t~nondet0; {58#true} is VALID [2020-07-11 02:31:42,802 INFO L280 TraceCheckUtils]: 7: Hoare triple {58#true} havoc #t~nondet0; {58#true} is VALID [2020-07-11 02:31:42,803 INFO L280 TraceCheckUtils]: 8: Hoare triple {58#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {58#true} is VALID [2020-07-11 02:31:42,803 INFO L280 TraceCheckUtils]: 9: Hoare triple {58#true} ~bufferlen~0 := #t~nondet1; {58#true} is VALID [2020-07-11 02:31:42,804 INFO L280 TraceCheckUtils]: 10: Hoare triple {58#true} havoc #t~nondet1; {58#true} is VALID [2020-07-11 02:31:42,804 INFO L280 TraceCheckUtils]: 11: Hoare triple {58#true} havoc ~buf~0; {58#true} is VALID [2020-07-11 02:31:42,804 INFO L280 TraceCheckUtils]: 12: Hoare triple {58#true} havoc ~buflim~0; {58#true} is VALID [2020-07-11 02:31:42,805 INFO L280 TraceCheckUtils]: 13: Hoare triple {58#true} assume ~bufferlen~0 > 1; {58#true} is VALID [2020-07-11 02:31:42,805 INFO L280 TraceCheckUtils]: 14: Hoare triple {58#true} assume ~inlen~0 > 0; {58#true} is VALID [2020-07-11 02:31:42,806 INFO L280 TraceCheckUtils]: 15: Hoare triple {58#true} assume ~bufferlen~0 < ~inlen~0; {58#true} is VALID [2020-07-11 02:31:42,806 INFO L280 TraceCheckUtils]: 16: Hoare triple {58#true} ~buf~0 := 0; {58#true} is VALID [2020-07-11 02:31:42,806 INFO L280 TraceCheckUtils]: 17: Hoare triple {58#true} ~in~0 := 0; {58#true} is VALID [2020-07-11 02:31:42,807 INFO L280 TraceCheckUtils]: 18: Hoare triple {58#true} ~buflim~0 := ~bufferlen~0 - 2; {58#true} is VALID [2020-07-11 02:31:42,809 INFO L280 TraceCheckUtils]: 19: Hoare triple {58#true} assume !true; {59#false} is VALID [2020-07-11 02:31:42,809 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-11 02:31:42,810 INFO L280 TraceCheckUtils]: 21: Hoare triple {59#false} ~cond := #in~cond; {59#false} is VALID [2020-07-11 02:31:42,810 INFO L280 TraceCheckUtils]: 22: Hoare triple {59#false} assume 0 == ~cond; {59#false} is VALID [2020-07-11 02:31:42,810 INFO L280 TraceCheckUtils]: 23: Hoare triple {59#false} assume !false; {59#false} is VALID [2020-07-11 02:31:42,813 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-11 02:31:42,815 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1595279793] [2020-07-11 02:31:42,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:31:42,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-11 02:31:42,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382504346] [2020-07-11 02:31:42,826 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2020-07-11 02:31:42,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:42,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-11 02:31:42,891 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-11 02:31:42,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-11 02:31:42,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:42,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-11 02:31:42,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-11 02:31:42,903 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2020-07-11 02:31:43,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:43,144 INFO L93 Difference]: Finished difference Result 91 states and 122 transitions. [2020-07-11 02:31:43,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-11 02:31:43,145 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2020-07-11 02:31:43,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:43,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-11 02:31:43,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 122 transitions. [2020-07-11 02:31:43,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-11 02:31:43,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 122 transitions. [2020-07-11 02:31:43,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 122 transitions. [2020-07-11 02:31:43,383 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-11 02:31:43,399 INFO L225 Difference]: With dead ends: 91 [2020-07-11 02:31:43,400 INFO L226 Difference]: Without dead ends: 47 [2020-07-11 02:31:43,405 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-11 02:31:43,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-11 02:31:43,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-11 02:31:43,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:43,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2020-07-11 02:31:43,502 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-11 02:31:43,502 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-11 02:31:43,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:43,510 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2020-07-11 02:31:43,511 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-11 02:31:43,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:43,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:43,513 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-11 02:31:43,513 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-11 02:31:43,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:43,520 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2020-07-11 02:31:43,520 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-11 02:31:43,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:43,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:43,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:43,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-11 02:31:43,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2020-07-11 02:31:43,529 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 24 [2020-07-11 02:31:43,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:43,529 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2020-07-11 02:31:43,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-11 02:31:43,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 55 transitions. [2020-07-11 02:31:43,610 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-11 02:31:43,610 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-11 02:31:43,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-11 02:31:43,612 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:43,612 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-11 02:31:43,612 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:31:43,613 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:43,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:43,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1949391841, now seen corresponding path program 1 times [2020-07-11 02:31:43,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:43,614 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [120323096] [2020-07-11 02:31:43,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:43,823 INFO L280 TraceCheckUtils]: 0: Hoare triple {434#true} assume true; {434#true} is VALID [2020-07-11 02:31:43,824 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {434#true} {434#true} #99#return; {434#true} is VALID [2020-07-11 02:31:43,824 INFO L263 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2020-07-11 02:31:43,825 INFO L280 TraceCheckUtils]: 1: Hoare triple {434#true} assume true; {434#true} is VALID [2020-07-11 02:31:43,825 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {434#true} {434#true} #99#return; {434#true} is VALID [2020-07-11 02:31:43,826 INFO L263 TraceCheckUtils]: 3: Hoare triple {434#true} call #t~ret7 := main(); {434#true} is VALID [2020-07-11 02:31:43,826 INFO L280 TraceCheckUtils]: 4: Hoare triple {434#true} havoc ~in~0; {434#true} is VALID [2020-07-11 02:31:43,827 INFO L280 TraceCheckUtils]: 5: Hoare triple {434#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {434#true} is VALID [2020-07-11 02:31:43,827 INFO L280 TraceCheckUtils]: 6: Hoare triple {434#true} ~inlen~0 := #t~nondet0; {434#true} is VALID [2020-07-11 02:31:43,828 INFO L280 TraceCheckUtils]: 7: Hoare triple {434#true} havoc #t~nondet0; {434#true} is VALID [2020-07-11 02:31:43,829 INFO L280 TraceCheckUtils]: 8: Hoare triple {434#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {434#true} is VALID [2020-07-11 02:31:43,829 INFO L280 TraceCheckUtils]: 9: Hoare triple {434#true} ~bufferlen~0 := #t~nondet1; {434#true} is VALID [2020-07-11 02:31:43,829 INFO L280 TraceCheckUtils]: 10: Hoare triple {434#true} havoc #t~nondet1; {434#true} is VALID [2020-07-11 02:31:43,830 INFO L280 TraceCheckUtils]: 11: Hoare triple {434#true} havoc ~buf~0; {434#true} is VALID [2020-07-11 02:31:43,830 INFO L280 TraceCheckUtils]: 12: Hoare triple {434#true} havoc ~buflim~0; {434#true} is VALID [2020-07-11 02:31:43,831 INFO L280 TraceCheckUtils]: 13: Hoare triple {434#true} assume ~bufferlen~0 > 1; {434#true} is VALID [2020-07-11 02:31:43,831 INFO L280 TraceCheckUtils]: 14: Hoare triple {434#true} assume ~inlen~0 > 0; {434#true} is VALID [2020-07-11 02:31:43,832 INFO L280 TraceCheckUtils]: 15: Hoare triple {434#true} assume ~bufferlen~0 < ~inlen~0; {434#true} is VALID [2020-07-11 02:31:43,833 INFO L280 TraceCheckUtils]: 16: Hoare triple {434#true} ~buf~0 := 0; {438#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:43,834 INFO L280 TraceCheckUtils]: 17: Hoare triple {438#(<= 0 main_~buf~0)} ~in~0 := 0; {438#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:43,836 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-11 02:31:43,837 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-11 02:31:43,838 INFO L280 TraceCheckUtils]: 20: Hoare triple {438#(<= 0 main_~buf~0)} assume !(0 != #t~nondet2); {438#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:43,840 INFO L280 TraceCheckUtils]: 21: Hoare triple {438#(<= 0 main_~buf~0)} havoc #t~nondet2; {438#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:43,841 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-11 02:31:43,846 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-11 02:31:43,847 INFO L280 TraceCheckUtils]: 24: Hoare triple {440#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {435#false} is VALID [2020-07-11 02:31:43,847 INFO L280 TraceCheckUtils]: 25: Hoare triple {435#false} assume !false; {435#false} is VALID [2020-07-11 02:31:43,849 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-11 02:31:43,850 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [120323096] [2020-07-11 02:31:43,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:31:43,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 02:31:43,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305840992] [2020-07-11 02:31:43,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-07-11 02:31:43,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:43,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 02:31:43,891 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-11 02:31:43,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 02:31:43,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:43,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 02:31:43,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 02:31:43,893 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 5 states. [2020-07-11 02:31:44,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:44,306 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2020-07-11 02:31:44,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 02:31:44,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-07-11 02:31:44,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:31:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2020-07-11 02:31:44,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:31:44,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2020-07-11 02:31:44,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2020-07-11 02:31:44,432 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-11 02:31:44,435 INFO L225 Difference]: With dead ends: 66 [2020-07-11 02:31:44,436 INFO L226 Difference]: Without dead ends: 64 [2020-07-11 02:31:44,437 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-11 02:31:44,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-11 02:31:44,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2020-07-11 02:31:44,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:44,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 58 states. [2020-07-11 02:31:44,513 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 58 states. [2020-07-11 02:31:44,514 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 58 states. [2020-07-11 02:31:44,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:44,521 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2020-07-11 02:31:44,521 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2020-07-11 02:31:44,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:44,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:44,523 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 64 states. [2020-07-11 02:31:44,524 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 64 states. [2020-07-11 02:31:44,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:44,530 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2020-07-11 02:31:44,531 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2020-07-11 02:31:44,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:44,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:44,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:44,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:44,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-11 02:31:44,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2020-07-11 02:31:44,539 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 26 [2020-07-11 02:31:44,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:44,539 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2020-07-11 02:31:44,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 02:31:44,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states and 69 transitions. [2020-07-11 02:31:44,668 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-11 02:31:44,668 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2020-07-11 02:31:44,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-11 02:31:44,670 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:44,670 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-11 02:31:44,671 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:31:44,671 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:44,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:44,676 INFO L82 PathProgramCache]: Analyzing trace with hash -873076999, now seen corresponding path program 1 times [2020-07-11 02:31:44,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:44,676 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1000072800] [2020-07-11 02:31:44,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:44,816 INFO L280 TraceCheckUtils]: 0: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-11 02:31:44,817 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {821#true} {821#true} #99#return; {821#true} is VALID [2020-07-11 02:31:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:44,826 INFO L280 TraceCheckUtils]: 0: Hoare triple {821#true} ~cond := #in~cond; {821#true} is VALID [2020-07-11 02:31:44,826 INFO L280 TraceCheckUtils]: 1: Hoare triple {821#true} assume !(0 == ~cond); {821#true} is VALID [2020-07-11 02:31:44,827 INFO L280 TraceCheckUtils]: 2: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-11 02:31:44,828 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-11 02:31:44,828 INFO L263 TraceCheckUtils]: 0: Hoare triple {821#true} call ULTIMATE.init(); {821#true} is VALID [2020-07-11 02:31:44,829 INFO L280 TraceCheckUtils]: 1: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-11 02:31:44,829 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {821#true} {821#true} #99#return; {821#true} is VALID [2020-07-11 02:31:44,830 INFO L263 TraceCheckUtils]: 3: Hoare triple {821#true} call #t~ret7 := main(); {821#true} is VALID [2020-07-11 02:31:44,830 INFO L280 TraceCheckUtils]: 4: Hoare triple {821#true} havoc ~in~0; {821#true} is VALID [2020-07-11 02:31:44,830 INFO L280 TraceCheckUtils]: 5: Hoare triple {821#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {821#true} is VALID [2020-07-11 02:31:44,830 INFO L280 TraceCheckUtils]: 6: Hoare triple {821#true} ~inlen~0 := #t~nondet0; {821#true} is VALID [2020-07-11 02:31:44,831 INFO L280 TraceCheckUtils]: 7: Hoare triple {821#true} havoc #t~nondet0; {821#true} is VALID [2020-07-11 02:31:44,831 INFO L280 TraceCheckUtils]: 8: Hoare triple {821#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {821#true} is VALID [2020-07-11 02:31:44,831 INFO L280 TraceCheckUtils]: 9: Hoare triple {821#true} ~bufferlen~0 := #t~nondet1; {821#true} is VALID [2020-07-11 02:31:44,832 INFO L280 TraceCheckUtils]: 10: Hoare triple {821#true} havoc #t~nondet1; {821#true} is VALID [2020-07-11 02:31:44,832 INFO L280 TraceCheckUtils]: 11: Hoare triple {821#true} havoc ~buf~0; {821#true} is VALID [2020-07-11 02:31:44,832 INFO L280 TraceCheckUtils]: 12: Hoare triple {821#true} havoc ~buflim~0; {821#true} is VALID [2020-07-11 02:31:44,833 INFO L280 TraceCheckUtils]: 13: Hoare triple {821#true} assume ~bufferlen~0 > 1; {825#(<= 2 main_~bufferlen~0)} is VALID [2020-07-11 02:31:44,834 INFO L280 TraceCheckUtils]: 14: Hoare triple {825#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {825#(<= 2 main_~bufferlen~0)} is VALID [2020-07-11 02:31:44,835 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-11 02:31:44,836 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-11 02:31:44,837 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-11 02:31:44,838 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-11 02:31:44,839 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-11 02:31:44,840 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-11 02:31:44,840 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-11 02:31:44,841 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-11 02:31:44,841 INFO L280 TraceCheckUtils]: 23: Hoare triple {821#true} ~cond := #in~cond; {821#true} is VALID [2020-07-11 02:31:44,842 INFO L280 TraceCheckUtils]: 24: Hoare triple {821#true} assume !(0 == ~cond); {821#true} is VALID [2020-07-11 02:31:44,842 INFO L280 TraceCheckUtils]: 25: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-11 02:31:44,843 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-11 02:31:44,845 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-11 02:31:44,846 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-11 02:31:44,846 INFO L280 TraceCheckUtils]: 29: Hoare triple {832#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {822#false} is VALID [2020-07-11 02:31:44,847 INFO L280 TraceCheckUtils]: 30: Hoare triple {822#false} assume !false; {822#false} is VALID [2020-07-11 02:31:44,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:31:44,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1000072800] [2020-07-11 02:31:44,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:31:44,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 02:31:44,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149433915] [2020-07-11 02:31:44,851 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-07-11 02:31:44,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:44,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 02:31:44,886 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-11 02:31:44,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 02:31:44,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:44,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 02:31:44,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 02:31:44,887 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 6 states. [2020-07-11 02:31:45,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:45,438 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2020-07-11 02:31:45,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 02:31:45,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-07-11 02:31:45,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:45,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:31:45,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2020-07-11 02:31:45,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:31:45,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2020-07-11 02:31:45,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 79 transitions. [2020-07-11 02:31:45,566 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-11 02:31:45,570 INFO L225 Difference]: With dead ends: 70 [2020-07-11 02:31:45,570 INFO L226 Difference]: Without dead ends: 68 [2020-07-11 02:31:45,571 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-11 02:31:45,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-11 02:31:45,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2020-07-11 02:31:45,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:45,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 64 states. [2020-07-11 02:31:45,662 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 64 states. [2020-07-11 02:31:45,662 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 64 states. [2020-07-11 02:31:45,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:45,669 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2020-07-11 02:31:45,669 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2020-07-11 02:31:45,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:45,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:45,672 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 68 states. [2020-07-11 02:31:45,672 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 68 states. [2020-07-11 02:31:45,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:45,680 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2020-07-11 02:31:45,680 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2020-07-11 02:31:45,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:45,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:45,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:45,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:45,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-11 02:31:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2020-07-11 02:31:45,693 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 31 [2020-07-11 02:31:45,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:45,694 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2020-07-11 02:31:45,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 02:31:45,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states and 76 transitions. [2020-07-11 02:31:45,806 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-11 02:31:45,806 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2020-07-11 02:31:45,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-11 02:31:45,809 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:45,809 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-11 02:31:45,809 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:31:45,810 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:45,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:45,810 INFO L82 PathProgramCache]: Analyzing trace with hash 2057902492, now seen corresponding path program 1 times [2020-07-11 02:31:45,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:45,811 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1095807629] [2020-07-11 02:31:45,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:45,929 INFO L280 TraceCheckUtils]: 0: Hoare triple {1243#true} assume true; {1243#true} is VALID [2020-07-11 02:31:45,929 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1243#true} {1243#true} #99#return; {1243#true} is VALID [2020-07-11 02:31:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:45,937 INFO L280 TraceCheckUtils]: 0: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2020-07-11 02:31:45,938 INFO L280 TraceCheckUtils]: 1: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2020-07-11 02:31:45,938 INFO L280 TraceCheckUtils]: 2: Hoare triple {1243#true} assume true; {1243#true} is VALID [2020-07-11 02:31:45,938 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1243#true} {1247#(<= 0 main_~buf~0)} #111#return; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:45,946 INFO L280 TraceCheckUtils]: 0: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2020-07-11 02:31:45,946 INFO L280 TraceCheckUtils]: 1: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2020-07-11 02:31:45,946 INFO L280 TraceCheckUtils]: 2: Hoare triple {1243#true} assume true; {1243#true} is VALID [2020-07-11 02:31:45,947 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1243#true} {1247#(<= 0 main_~buf~0)} #113#return; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:45,947 INFO L263 TraceCheckUtils]: 0: Hoare triple {1243#true} call ULTIMATE.init(); {1243#true} is VALID [2020-07-11 02:31:45,948 INFO L280 TraceCheckUtils]: 1: Hoare triple {1243#true} assume true; {1243#true} is VALID [2020-07-11 02:31:45,948 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1243#true} {1243#true} #99#return; {1243#true} is VALID [2020-07-11 02:31:45,948 INFO L263 TraceCheckUtils]: 3: Hoare triple {1243#true} call #t~ret7 := main(); {1243#true} is VALID [2020-07-11 02:31:45,948 INFO L280 TraceCheckUtils]: 4: Hoare triple {1243#true} havoc ~in~0; {1243#true} is VALID [2020-07-11 02:31:45,949 INFO L280 TraceCheckUtils]: 5: Hoare triple {1243#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1243#true} is VALID [2020-07-11 02:31:45,949 INFO L280 TraceCheckUtils]: 6: Hoare triple {1243#true} ~inlen~0 := #t~nondet0; {1243#true} is VALID [2020-07-11 02:31:45,949 INFO L280 TraceCheckUtils]: 7: Hoare triple {1243#true} havoc #t~nondet0; {1243#true} is VALID [2020-07-11 02:31:45,949 INFO L280 TraceCheckUtils]: 8: Hoare triple {1243#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1243#true} is VALID [2020-07-11 02:31:45,950 INFO L280 TraceCheckUtils]: 9: Hoare triple {1243#true} ~bufferlen~0 := #t~nondet1; {1243#true} is VALID [2020-07-11 02:31:45,950 INFO L280 TraceCheckUtils]: 10: Hoare triple {1243#true} havoc #t~nondet1; {1243#true} is VALID [2020-07-11 02:31:45,950 INFO L280 TraceCheckUtils]: 11: Hoare triple {1243#true} havoc ~buf~0; {1243#true} is VALID [2020-07-11 02:31:45,950 INFO L280 TraceCheckUtils]: 12: Hoare triple {1243#true} havoc ~buflim~0; {1243#true} is VALID [2020-07-11 02:31:45,951 INFO L280 TraceCheckUtils]: 13: Hoare triple {1243#true} assume ~bufferlen~0 > 1; {1243#true} is VALID [2020-07-11 02:31:45,951 INFO L280 TraceCheckUtils]: 14: Hoare triple {1243#true} assume ~inlen~0 > 0; {1243#true} is VALID [2020-07-11 02:31:45,951 INFO L280 TraceCheckUtils]: 15: Hoare triple {1243#true} assume ~bufferlen~0 < ~inlen~0; {1243#true} is VALID [2020-07-11 02:31:45,952 INFO L280 TraceCheckUtils]: 16: Hoare triple {1243#true} ~buf~0 := 0; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:45,953 INFO L280 TraceCheckUtils]: 17: Hoare triple {1247#(<= 0 main_~buf~0)} ~in~0 := 0; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:45,953 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-11 02:31:45,954 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-11 02:31:45,954 INFO L280 TraceCheckUtils]: 20: Hoare triple {1247#(<= 0 main_~buf~0)} assume !(0 != #t~nondet2); {1247#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:45,955 INFO L280 TraceCheckUtils]: 21: Hoare triple {1247#(<= 0 main_~buf~0)} havoc #t~nondet2; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:45,955 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-11 02:31:45,955 INFO L280 TraceCheckUtils]: 23: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2020-07-11 02:31:45,956 INFO L280 TraceCheckUtils]: 24: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2020-07-11 02:31:45,956 INFO L280 TraceCheckUtils]: 25: Hoare triple {1243#true} assume true; {1243#true} is VALID [2020-07-11 02:31:45,957 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1243#true} {1247#(<= 0 main_~buf~0)} #111#return; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:45,957 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-11 02:31:45,958 INFO L280 TraceCheckUtils]: 28: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2020-07-11 02:31:45,958 INFO L280 TraceCheckUtils]: 29: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2020-07-11 02:31:45,958 INFO L280 TraceCheckUtils]: 30: Hoare triple {1243#true} assume true; {1243#true} is VALID [2020-07-11 02:31:45,959 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1243#true} {1247#(<= 0 main_~buf~0)} #113#return; {1247#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:45,960 INFO L280 TraceCheckUtils]: 32: Hoare triple {1247#(<= 0 main_~buf~0)} #t~post5 := ~buf~0; {1256#(<= 0 |main_#t~post5|)} is VALID [2020-07-11 02:31:45,961 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-11 02:31:45,962 INFO L280 TraceCheckUtils]: 34: Hoare triple {1257#(<= 1 main_~buf~0)} havoc #t~post5; {1257#(<= 1 main_~buf~0)} is VALID [2020-07-11 02:31:45,963 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-11 02:31:45,964 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-11 02:31:45,964 INFO L280 TraceCheckUtils]: 37: Hoare triple {1259#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1244#false} is VALID [2020-07-11 02:31:45,965 INFO L280 TraceCheckUtils]: 38: Hoare triple {1244#false} assume !false; {1244#false} is VALID [2020-07-11 02:31:45,967 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-11 02:31:45,967 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1095807629] [2020-07-11 02:31:45,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:31:45,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 02:31:45,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369596262] [2020-07-11 02:31:45,969 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2020-07-11 02:31:45,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:45,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 02:31:46,004 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-11 02:31:46,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 02:31:46,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:46,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 02:31:46,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-11 02:31:46,005 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 7 states. [2020-07-11 02:31:46,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:46,538 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2020-07-11 02:31:46,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 02:31:46,539 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2020-07-11 02:31:46,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:46,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:31:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2020-07-11 02:31:46,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:31:46,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2020-07-11 02:31:46,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 83 transitions. [2020-07-11 02:31:46,658 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-11 02:31:46,664 INFO L225 Difference]: With dead ends: 77 [2020-07-11 02:31:46,664 INFO L226 Difference]: Without dead ends: 75 [2020-07-11 02:31:46,665 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-11 02:31:46,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-11 02:31:46,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2020-07-11 02:31:46,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:46,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 72 states. [2020-07-11 02:31:46,763 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 72 states. [2020-07-11 02:31:46,763 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 72 states. [2020-07-11 02:31:46,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:46,769 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2020-07-11 02:31:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2020-07-11 02:31:46,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:46,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:46,772 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 75 states. [2020-07-11 02:31:46,772 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 75 states. [2020-07-11 02:31:46,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:46,777 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2020-07-11 02:31:46,777 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2020-07-11 02:31:46,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:46,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:46,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:46,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:46,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-11 02:31:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2020-07-11 02:31:46,783 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 39 [2020-07-11 02:31:46,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:46,786 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2020-07-11 02:31:46,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 02:31:46,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states and 84 transitions. [2020-07-11 02:31:46,908 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-11 02:31:46,908 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2020-07-11 02:31:46,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-11 02:31:46,909 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:46,909 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-11 02:31:46,910 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 02:31:46,910 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:46,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:46,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1847294180, now seen corresponding path program 1 times [2020-07-11 02:31:46,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:46,912 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1809268600] [2020-07-11 02:31:46,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:47,028 INFO L280 TraceCheckUtils]: 0: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-11 02:31:47,029 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1716#true} {1716#true} #99#return; {1716#true} is VALID [2020-07-11 02:31:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:47,036 INFO L280 TraceCheckUtils]: 0: Hoare triple {1716#true} ~cond := #in~cond; {1716#true} is VALID [2020-07-11 02:31:47,036 INFO L280 TraceCheckUtils]: 1: Hoare triple {1716#true} assume !(0 == ~cond); {1716#true} is VALID [2020-07-11 02:31:47,036 INFO L280 TraceCheckUtils]: 2: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-11 02:31:47,037 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-11 02:31:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:47,044 INFO L280 TraceCheckUtils]: 0: Hoare triple {1716#true} ~cond := #in~cond; {1716#true} is VALID [2020-07-11 02:31:47,045 INFO L280 TraceCheckUtils]: 1: Hoare triple {1716#true} assume !(0 == ~cond); {1716#true} is VALID [2020-07-11 02:31:47,045 INFO L280 TraceCheckUtils]: 2: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-11 02:31:47,046 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-11 02:31:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:47,054 INFO L280 TraceCheckUtils]: 0: Hoare triple {1716#true} ~cond := #in~cond; {1716#true} is VALID [2020-07-11 02:31:47,054 INFO L280 TraceCheckUtils]: 1: Hoare triple {1716#true} assume !(0 == ~cond); {1716#true} is VALID [2020-07-11 02:31:47,054 INFO L280 TraceCheckUtils]: 2: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-11 02:31:47,056 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-11 02:31:47,056 INFO L263 TraceCheckUtils]: 0: Hoare triple {1716#true} call ULTIMATE.init(); {1716#true} is VALID [2020-07-11 02:31:47,056 INFO L280 TraceCheckUtils]: 1: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-11 02:31:47,057 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1716#true} {1716#true} #99#return; {1716#true} is VALID [2020-07-11 02:31:47,057 INFO L263 TraceCheckUtils]: 3: Hoare triple {1716#true} call #t~ret7 := main(); {1716#true} is VALID [2020-07-11 02:31:47,057 INFO L280 TraceCheckUtils]: 4: Hoare triple {1716#true} havoc ~in~0; {1716#true} is VALID [2020-07-11 02:31:47,058 INFO L280 TraceCheckUtils]: 5: Hoare triple {1716#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1716#true} is VALID [2020-07-11 02:31:47,058 INFO L280 TraceCheckUtils]: 6: Hoare triple {1716#true} ~inlen~0 := #t~nondet0; {1716#true} is VALID [2020-07-11 02:31:47,058 INFO L280 TraceCheckUtils]: 7: Hoare triple {1716#true} havoc #t~nondet0; {1716#true} is VALID [2020-07-11 02:31:47,058 INFO L280 TraceCheckUtils]: 8: Hoare triple {1716#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1716#true} is VALID [2020-07-11 02:31:47,059 INFO L280 TraceCheckUtils]: 9: Hoare triple {1716#true} ~bufferlen~0 := #t~nondet1; {1716#true} is VALID [2020-07-11 02:31:47,059 INFO L280 TraceCheckUtils]: 10: Hoare triple {1716#true} havoc #t~nondet1; {1716#true} is VALID [2020-07-11 02:31:47,059 INFO L280 TraceCheckUtils]: 11: Hoare triple {1716#true} havoc ~buf~0; {1716#true} is VALID [2020-07-11 02:31:47,060 INFO L280 TraceCheckUtils]: 12: Hoare triple {1716#true} havoc ~buflim~0; {1716#true} is VALID [2020-07-11 02:31:47,061 INFO L280 TraceCheckUtils]: 13: Hoare triple {1716#true} assume ~bufferlen~0 > 1; {1720#(<= 2 main_~bufferlen~0)} is VALID [2020-07-11 02:31:47,061 INFO L280 TraceCheckUtils]: 14: Hoare triple {1720#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {1720#(<= 2 main_~bufferlen~0)} is VALID [2020-07-11 02:31:47,062 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-11 02:31:47,063 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-11 02:31:47,064 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-11 02:31:47,064 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-11 02:31:47,065 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-11 02:31:47,066 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-11 02:31:47,066 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-11 02:31:47,067 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-11 02:31:47,067 INFO L280 TraceCheckUtils]: 23: Hoare triple {1716#true} ~cond := #in~cond; {1716#true} is VALID [2020-07-11 02:31:47,067 INFO L280 TraceCheckUtils]: 24: Hoare triple {1716#true} assume !(0 == ~cond); {1716#true} is VALID [2020-07-11 02:31:47,068 INFO L280 TraceCheckUtils]: 25: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-11 02:31:47,069 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-11 02:31:47,069 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-11 02:31:47,069 INFO L280 TraceCheckUtils]: 28: Hoare triple {1716#true} ~cond := #in~cond; {1716#true} is VALID [2020-07-11 02:31:47,070 INFO L280 TraceCheckUtils]: 29: Hoare triple {1716#true} assume !(0 == ~cond); {1716#true} is VALID [2020-07-11 02:31:47,070 INFO L280 TraceCheckUtils]: 30: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-11 02:31:47,071 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-11 02:31:47,072 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-11 02:31:47,073 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-11 02:31:47,073 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-11 02:31:47,074 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-11 02:31:47,074 INFO L280 TraceCheckUtils]: 36: Hoare triple {1716#true} ~cond := #in~cond; {1716#true} is VALID [2020-07-11 02:31:47,074 INFO L280 TraceCheckUtils]: 37: Hoare triple {1716#true} assume !(0 == ~cond); {1716#true} is VALID [2020-07-11 02:31:47,075 INFO L280 TraceCheckUtils]: 38: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-11 02:31:47,076 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-11 02:31:47,077 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-11 02:31:47,078 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-11 02:31:47,079 INFO L280 TraceCheckUtils]: 42: Hoare triple {1737#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1717#false} is VALID [2020-07-11 02:31:47,079 INFO L280 TraceCheckUtils]: 43: Hoare triple {1717#false} assume !false; {1717#false} is VALID [2020-07-11 02:31:47,085 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-11 02:31:47,085 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1809268600] [2020-07-11 02:31:47,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:31:47,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-11 02:31:47,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859283133] [2020-07-11 02:31:47,086 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2020-07-11 02:31:47,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:47,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 02:31:47,125 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-11 02:31:47,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 02:31:47,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:47,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 02:31:47,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-11 02:31:47,127 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 8 states. [2020-07-11 02:31:47,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:47,790 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2020-07-11 02:31:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 02:31:47,791 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2020-07-11 02:31:47,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:47,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:31:47,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 83 transitions. [2020-07-11 02:31:47,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:31:47,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 83 transitions. [2020-07-11 02:31:47,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 83 transitions. [2020-07-11 02:31:47,906 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-11 02:31:47,909 INFO L225 Difference]: With dead ends: 81 [2020-07-11 02:31:47,909 INFO L226 Difference]: Without dead ends: 63 [2020-07-11 02:31:47,910 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-11 02:31:47,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-11 02:31:47,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2020-07-11 02:31:47,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:47,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 61 states. [2020-07-11 02:31:47,997 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 61 states. [2020-07-11 02:31:47,997 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 61 states. [2020-07-11 02:31:48,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:48,001 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2020-07-11 02:31:48,001 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2020-07-11 02:31:48,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:48,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:48,003 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 63 states. [2020-07-11 02:31:48,003 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 63 states. [2020-07-11 02:31:48,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:48,006 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2020-07-11 02:31:48,007 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2020-07-11 02:31:48,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:48,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:48,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:48,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:48,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-11 02:31:48,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2020-07-11 02:31:48,012 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 44 [2020-07-11 02:31:48,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:48,012 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2020-07-11 02:31:48,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 02:31:48,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states and 69 transitions. [2020-07-11 02:31:48,113 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-11 02:31:48,113 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2020-07-11 02:31:48,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-11 02:31:48,114 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:48,115 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-11 02:31:48,115 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 02:31:48,115 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:48,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:48,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1076854334, now seen corresponding path program 1 times [2020-07-11 02:31:48,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:48,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1435720596] [2020-07-11 02:31:48,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:48,205 INFO L280 TraceCheckUtils]: 0: Hoare triple {2160#true} assume true; {2160#true} is VALID [2020-07-11 02:31:48,205 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2160#true} {2160#true} #99#return; {2160#true} is VALID [2020-07-11 02:31:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:48,211 INFO L280 TraceCheckUtils]: 0: Hoare triple {2160#true} ~cond := #in~cond; {2160#true} is VALID [2020-07-11 02:31:48,211 INFO L280 TraceCheckUtils]: 1: Hoare triple {2160#true} assume !(0 == ~cond); {2160#true} is VALID [2020-07-11 02:31:48,212 INFO L280 TraceCheckUtils]: 2: Hoare triple {2160#true} assume true; {2160#true} is VALID [2020-07-11 02:31:48,218 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2160#true} {2164#(<= 0 main_~in~0)} #103#return; {2164#(<= 0 main_~in~0)} is VALID [2020-07-11 02:31:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:48,224 INFO L280 TraceCheckUtils]: 0: Hoare triple {2160#true} ~cond := #in~cond; {2160#true} is VALID [2020-07-11 02:31:48,224 INFO L280 TraceCheckUtils]: 1: Hoare triple {2160#true} assume !(0 == ~cond); {2160#true} is VALID [2020-07-11 02:31:48,225 INFO L280 TraceCheckUtils]: 2: Hoare triple {2160#true} assume true; {2160#true} is VALID [2020-07-11 02:31:48,226 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2160#true} {2164#(<= 0 main_~in~0)} #105#return; {2164#(<= 0 main_~in~0)} is VALID [2020-07-11 02:31:48,226 INFO L263 TraceCheckUtils]: 0: Hoare triple {2160#true} call ULTIMATE.init(); {2160#true} is VALID [2020-07-11 02:31:48,227 INFO L280 TraceCheckUtils]: 1: Hoare triple {2160#true} assume true; {2160#true} is VALID [2020-07-11 02:31:48,227 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2160#true} {2160#true} #99#return; {2160#true} is VALID [2020-07-11 02:31:48,227 INFO L263 TraceCheckUtils]: 3: Hoare triple {2160#true} call #t~ret7 := main(); {2160#true} is VALID [2020-07-11 02:31:48,227 INFO L280 TraceCheckUtils]: 4: Hoare triple {2160#true} havoc ~in~0; {2160#true} is VALID [2020-07-11 02:31:48,228 INFO L280 TraceCheckUtils]: 5: Hoare triple {2160#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2160#true} is VALID [2020-07-11 02:31:48,228 INFO L280 TraceCheckUtils]: 6: Hoare triple {2160#true} ~inlen~0 := #t~nondet0; {2160#true} is VALID [2020-07-11 02:31:48,228 INFO L280 TraceCheckUtils]: 7: Hoare triple {2160#true} havoc #t~nondet0; {2160#true} is VALID [2020-07-11 02:31:48,229 INFO L280 TraceCheckUtils]: 8: Hoare triple {2160#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2160#true} is VALID [2020-07-11 02:31:48,229 INFO L280 TraceCheckUtils]: 9: Hoare triple {2160#true} ~bufferlen~0 := #t~nondet1; {2160#true} is VALID [2020-07-11 02:31:48,229 INFO L280 TraceCheckUtils]: 10: Hoare triple {2160#true} havoc #t~nondet1; {2160#true} is VALID [2020-07-11 02:31:48,229 INFO L280 TraceCheckUtils]: 11: Hoare triple {2160#true} havoc ~buf~0; {2160#true} is VALID [2020-07-11 02:31:48,230 INFO L280 TraceCheckUtils]: 12: Hoare triple {2160#true} havoc ~buflim~0; {2160#true} is VALID [2020-07-11 02:31:48,230 INFO L280 TraceCheckUtils]: 13: Hoare triple {2160#true} assume ~bufferlen~0 > 1; {2160#true} is VALID [2020-07-11 02:31:48,230 INFO L280 TraceCheckUtils]: 14: Hoare triple {2160#true} assume ~inlen~0 > 0; {2160#true} is VALID [2020-07-11 02:31:48,230 INFO L280 TraceCheckUtils]: 15: Hoare triple {2160#true} assume ~bufferlen~0 < ~inlen~0; {2160#true} is VALID [2020-07-11 02:31:48,231 INFO L280 TraceCheckUtils]: 16: Hoare triple {2160#true} ~buf~0 := 0; {2160#true} is VALID [2020-07-11 02:31:48,232 INFO L280 TraceCheckUtils]: 17: Hoare triple {2160#true} ~in~0 := 0; {2164#(<= 0 main_~in~0)} is VALID [2020-07-11 02:31:48,232 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-11 02:31:48,233 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-11 02:31:48,234 INFO L280 TraceCheckUtils]: 20: Hoare triple {2164#(<= 0 main_~in~0)} assume !!(0 != #t~nondet2); {2164#(<= 0 main_~in~0)} is VALID [2020-07-11 02:31:48,239 INFO L280 TraceCheckUtils]: 21: Hoare triple {2164#(<= 0 main_~in~0)} havoc #t~nondet2; {2164#(<= 0 main_~in~0)} is VALID [2020-07-11 02:31:48,240 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-11 02:31:48,240 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-11 02:31:48,241 INFO L280 TraceCheckUtils]: 24: Hoare triple {2160#true} ~cond := #in~cond; {2160#true} is VALID [2020-07-11 02:31:48,241 INFO L280 TraceCheckUtils]: 25: Hoare triple {2160#true} assume !(0 == ~cond); {2160#true} is VALID [2020-07-11 02:31:48,241 INFO L280 TraceCheckUtils]: 26: Hoare triple {2160#true} assume true; {2160#true} is VALID [2020-07-11 02:31:48,242 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2160#true} {2164#(<= 0 main_~in~0)} #103#return; {2164#(<= 0 main_~in~0)} is VALID [2020-07-11 02:31:48,243 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-11 02:31:48,243 INFO L280 TraceCheckUtils]: 29: Hoare triple {2160#true} ~cond := #in~cond; {2160#true} is VALID [2020-07-11 02:31:48,243 INFO L280 TraceCheckUtils]: 30: Hoare triple {2160#true} assume !(0 == ~cond); {2160#true} is VALID [2020-07-11 02:31:48,243 INFO L280 TraceCheckUtils]: 31: Hoare triple {2160#true} assume true; {2160#true} is VALID [2020-07-11 02:31:48,244 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2160#true} {2164#(<= 0 main_~in~0)} #105#return; {2164#(<= 0 main_~in~0)} is VALID [2020-07-11 02:31:48,245 INFO L280 TraceCheckUtils]: 33: Hoare triple {2164#(<= 0 main_~in~0)} #t~post3 := ~buf~0; {2164#(<= 0 main_~in~0)} is VALID [2020-07-11 02:31:48,246 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-11 02:31:48,246 INFO L280 TraceCheckUtils]: 35: Hoare triple {2164#(<= 0 main_~in~0)} havoc #t~post3; {2164#(<= 0 main_~in~0)} is VALID [2020-07-11 02:31:48,247 INFO L280 TraceCheckUtils]: 36: Hoare triple {2164#(<= 0 main_~in~0)} #t~post4 := ~in~0; {2173#(<= 0 |main_#t~post4|)} is VALID [2020-07-11 02:31:48,248 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-11 02:31:48,248 INFO L280 TraceCheckUtils]: 38: Hoare triple {2174#(<= 1 main_~in~0)} havoc #t~post4; {2174#(<= 1 main_~in~0)} is VALID [2020-07-11 02:31:48,249 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-11 02:31:48,250 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-11 02:31:48,250 INFO L280 TraceCheckUtils]: 41: Hoare triple {2176#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2161#false} is VALID [2020-07-11 02:31:48,250 INFO L280 TraceCheckUtils]: 42: Hoare triple {2161#false} assume !false; {2161#false} is VALID [2020-07-11 02:31:48,253 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-11 02:31:48,253 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1435720596] [2020-07-11 02:31:48,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:31:48,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 02:31:48,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867926267] [2020-07-11 02:31:48,254 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-07-11 02:31:48,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:48,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 02:31:48,303 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-11 02:31:48,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 02:31:48,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:48,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 02:31:48,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-11 02:31:48,306 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand 7 states. [2020-07-11 02:31:48,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:48,734 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2020-07-11 02:31:48,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 02:31:48,734 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-07-11 02:31:48,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:48,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:31:48,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2020-07-11 02:31:48,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:31:48,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2020-07-11 02:31:48,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 73 transitions. [2020-07-11 02:31:48,821 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-11 02:31:48,824 INFO L225 Difference]: With dead ends: 72 [2020-07-11 02:31:48,824 INFO L226 Difference]: Without dead ends: 70 [2020-07-11 02:31:48,826 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-11 02:31:48,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-11 02:31:48,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2020-07-11 02:31:48,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:48,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 65 states. [2020-07-11 02:31:48,908 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 65 states. [2020-07-11 02:31:48,908 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 65 states. [2020-07-11 02:31:48,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:48,911 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2020-07-11 02:31:48,911 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2020-07-11 02:31:48,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:48,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:48,912 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 70 states. [2020-07-11 02:31:48,912 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 70 states. [2020-07-11 02:31:48,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:48,915 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2020-07-11 02:31:48,915 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2020-07-11 02:31:48,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:48,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:48,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:48,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:48,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-11 02:31:48,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2020-07-11 02:31:48,919 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 43 [2020-07-11 02:31:48,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:48,920 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2020-07-11 02:31:48,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 02:31:48,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 65 states and 72 transitions. [2020-07-11 02:31:49,022 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-11 02:31:49,022 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2020-07-11 02:31:49,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-11 02:31:49,023 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:49,023 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-11 02:31:49,024 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 02:31:49,024 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:49,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:49,024 INFO L82 PathProgramCache]: Analyzing trace with hash 146364602, now seen corresponding path program 1 times [2020-07-11 02:31:49,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:49,025 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2041159292] [2020-07-11 02:31:49,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:49,147 INFO L280 TraceCheckUtils]: 0: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-11 02:31:49,148 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2599#true} {2599#true} #99#return; {2599#true} is VALID [2020-07-11 02:31:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:49,165 INFO L280 TraceCheckUtils]: 0: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2020-07-11 02:31:49,165 INFO L280 TraceCheckUtils]: 1: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2020-07-11 02:31:49,166 INFO L280 TraceCheckUtils]: 2: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-11 02:31:49,176 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-11 02:31:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:49,187 INFO L280 TraceCheckUtils]: 0: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2020-07-11 02:31:49,187 INFO L280 TraceCheckUtils]: 1: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2020-07-11 02:31:49,187 INFO L280 TraceCheckUtils]: 2: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-11 02:31:49,189 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-11 02:31:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:49,197 INFO L280 TraceCheckUtils]: 0: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2020-07-11 02:31:49,197 INFO L280 TraceCheckUtils]: 1: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2020-07-11 02:31:49,198 INFO L280 TraceCheckUtils]: 2: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-11 02:31:49,199 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-11 02:31:49,199 INFO L263 TraceCheckUtils]: 0: Hoare triple {2599#true} call ULTIMATE.init(); {2599#true} is VALID [2020-07-11 02:31:49,200 INFO L280 TraceCheckUtils]: 1: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-11 02:31:49,200 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2599#true} {2599#true} #99#return; {2599#true} is VALID [2020-07-11 02:31:49,200 INFO L263 TraceCheckUtils]: 3: Hoare triple {2599#true} call #t~ret7 := main(); {2599#true} is VALID [2020-07-11 02:31:49,201 INFO L280 TraceCheckUtils]: 4: Hoare triple {2599#true} havoc ~in~0; {2599#true} is VALID [2020-07-11 02:31:49,201 INFO L280 TraceCheckUtils]: 5: Hoare triple {2599#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2599#true} is VALID [2020-07-11 02:31:49,201 INFO L280 TraceCheckUtils]: 6: Hoare triple {2599#true} ~inlen~0 := #t~nondet0; {2599#true} is VALID [2020-07-11 02:31:49,202 INFO L280 TraceCheckUtils]: 7: Hoare triple {2599#true} havoc #t~nondet0; {2599#true} is VALID [2020-07-11 02:31:49,202 INFO L280 TraceCheckUtils]: 8: Hoare triple {2599#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2599#true} is VALID [2020-07-11 02:31:49,202 INFO L280 TraceCheckUtils]: 9: Hoare triple {2599#true} ~bufferlen~0 := #t~nondet1; {2599#true} is VALID [2020-07-11 02:31:49,203 INFO L280 TraceCheckUtils]: 10: Hoare triple {2599#true} havoc #t~nondet1; {2599#true} is VALID [2020-07-11 02:31:49,203 INFO L280 TraceCheckUtils]: 11: Hoare triple {2599#true} havoc ~buf~0; {2599#true} is VALID [2020-07-11 02:31:49,203 INFO L280 TraceCheckUtils]: 12: Hoare triple {2599#true} havoc ~buflim~0; {2599#true} is VALID [2020-07-11 02:31:49,205 INFO L280 TraceCheckUtils]: 13: Hoare triple {2599#true} assume ~bufferlen~0 > 1; {2603#(<= 2 main_~bufferlen~0)} is VALID [2020-07-11 02:31:49,206 INFO L280 TraceCheckUtils]: 14: Hoare triple {2603#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {2603#(<= 2 main_~bufferlen~0)} is VALID [2020-07-11 02:31:49,208 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-11 02:31:49,208 INFO L280 TraceCheckUtils]: 16: Hoare triple {2604#(<= 3 main_~inlen~0)} ~buf~0 := 0; {2604#(<= 3 main_~inlen~0)} is VALID [2020-07-11 02:31:49,209 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-11 02:31:49,210 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-11 02:31:49,211 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-11 02:31:49,211 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-11 02:31:49,224 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-11 02:31:49,225 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-11 02:31:49,225 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-11 02:31:49,225 INFO L280 TraceCheckUtils]: 24: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2020-07-11 02:31:49,225 INFO L280 TraceCheckUtils]: 25: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2020-07-11 02:31:49,225 INFO L280 TraceCheckUtils]: 26: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-11 02:31:49,226 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-11 02:31:49,226 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-11 02:31:49,227 INFO L280 TraceCheckUtils]: 29: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2020-07-11 02:31:49,227 INFO L280 TraceCheckUtils]: 30: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2020-07-11 02:31:49,227 INFO L280 TraceCheckUtils]: 31: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-11 02:31:49,229 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-11 02:31:49,229 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-11 02:31:49,230 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-11 02:31:49,230 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-11 02:31:49,231 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-11 02:31:49,233 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-11 02:31:49,234 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-11 02:31:49,235 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-11 02:31:49,235 INFO L280 TraceCheckUtils]: 40: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2020-07-11 02:31:49,235 INFO L280 TraceCheckUtils]: 41: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2020-07-11 02:31:49,236 INFO L280 TraceCheckUtils]: 42: Hoare triple {2599#true} assume true; {2599#true} is VALID [2020-07-11 02:31:49,237 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-11 02:31:49,238 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-11 02:31:49,239 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-11 02:31:49,240 INFO L280 TraceCheckUtils]: 46: Hoare triple {2621#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2600#false} is VALID [2020-07-11 02:31:49,240 INFO L280 TraceCheckUtils]: 47: Hoare triple {2600#false} assume !false; {2600#false} is VALID [2020-07-11 02:31:49,243 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-11 02:31:49,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2041159292] [2020-07-11 02:31:49,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:31:49,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-11 02:31:49,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114820272] [2020-07-11 02:31:49,245 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-07-11 02:31:49,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:49,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-11 02:31:49,306 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-11 02:31:49,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-11 02:31:49,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:49,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-11 02:31:49,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-11 02:31:49,307 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 9 states. [2020-07-11 02:31:50,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:50,287 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2020-07-11 02:31:50,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-11 02:31:50,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-07-11 02:31:50,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 02:31:50,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2020-07-11 02:31:50,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 02:31:50,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2020-07-11 02:31:50,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 104 transitions. [2020-07-11 02:31:50,439 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-11 02:31:50,442 INFO L225 Difference]: With dead ends: 98 [2020-07-11 02:31:50,442 INFO L226 Difference]: Without dead ends: 96 [2020-07-11 02:31:50,443 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-11 02:31:50,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-11 02:31:50,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 77. [2020-07-11 02:31:50,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:50,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 77 states. [2020-07-11 02:31:50,620 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 77 states. [2020-07-11 02:31:50,620 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 77 states. [2020-07-11 02:31:50,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:50,625 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2020-07-11 02:31:50,625 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2020-07-11 02:31:50,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:50,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:50,626 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 96 states. [2020-07-11 02:31:50,626 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 96 states. [2020-07-11 02:31:50,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:50,631 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2020-07-11 02:31:50,631 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2020-07-11 02:31:50,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:50,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:50,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:50,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:50,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-11 02:31:50,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2020-07-11 02:31:50,636 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 48 [2020-07-11 02:31:50,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:50,636 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2020-07-11 02:31:50,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-11 02:31:50,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 77 states and 85 transitions. [2020-07-11 02:31:50,795 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-11 02:31:50,795 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2020-07-11 02:31:50,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-11 02:31:50,797 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:50,797 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-11 02:31:50,797 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 02:31:50,798 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:50,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:50,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1943579560, now seen corresponding path program 1 times [2020-07-11 02:31:50,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:50,798 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [845608002] [2020-07-11 02:31:50,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:50,911 INFO L280 TraceCheckUtils]: 0: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-11 02:31:50,911 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3178#true} {3178#true} #99#return; {3178#true} is VALID [2020-07-11 02:31:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:50,921 INFO L280 TraceCheckUtils]: 0: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-11 02:31:50,922 INFO L280 TraceCheckUtils]: 1: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-11 02:31:50,922 INFO L280 TraceCheckUtils]: 2: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-11 02:31:50,926 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3178#true} {3182#(<= 0 main_~buf~0)} #103#return; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:50,932 INFO L280 TraceCheckUtils]: 0: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-11 02:31:50,933 INFO L280 TraceCheckUtils]: 1: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-11 02:31:50,933 INFO L280 TraceCheckUtils]: 2: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-11 02:31:50,934 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3178#true} {3182#(<= 0 main_~buf~0)} #105#return; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:50,944 INFO L280 TraceCheckUtils]: 0: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-11 02:31:50,945 INFO L280 TraceCheckUtils]: 1: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-11 02:31:50,945 INFO L280 TraceCheckUtils]: 2: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-11 02:31:50,946 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3178#true} {3192#(<= 1 main_~buf~0)} #107#return; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-11 02:31:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:50,952 INFO L280 TraceCheckUtils]: 0: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-11 02:31:50,953 INFO L280 TraceCheckUtils]: 1: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-11 02:31:50,953 INFO L280 TraceCheckUtils]: 2: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-11 02:31:50,954 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3178#true} {3192#(<= 1 main_~buf~0)} #109#return; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-11 02:31:50,954 INFO L263 TraceCheckUtils]: 0: Hoare triple {3178#true} call ULTIMATE.init(); {3178#true} is VALID [2020-07-11 02:31:50,955 INFO L280 TraceCheckUtils]: 1: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-11 02:31:50,955 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3178#true} {3178#true} #99#return; {3178#true} is VALID [2020-07-11 02:31:50,955 INFO L263 TraceCheckUtils]: 3: Hoare triple {3178#true} call #t~ret7 := main(); {3178#true} is VALID [2020-07-11 02:31:50,955 INFO L280 TraceCheckUtils]: 4: Hoare triple {3178#true} havoc ~in~0; {3178#true} is VALID [2020-07-11 02:31:50,955 INFO L280 TraceCheckUtils]: 5: Hoare triple {3178#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3178#true} is VALID [2020-07-11 02:31:50,956 INFO L280 TraceCheckUtils]: 6: Hoare triple {3178#true} ~inlen~0 := #t~nondet0; {3178#true} is VALID [2020-07-11 02:31:50,956 INFO L280 TraceCheckUtils]: 7: Hoare triple {3178#true} havoc #t~nondet0; {3178#true} is VALID [2020-07-11 02:31:50,956 INFO L280 TraceCheckUtils]: 8: Hoare triple {3178#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3178#true} is VALID [2020-07-11 02:31:50,956 INFO L280 TraceCheckUtils]: 9: Hoare triple {3178#true} ~bufferlen~0 := #t~nondet1; {3178#true} is VALID [2020-07-11 02:31:50,957 INFO L280 TraceCheckUtils]: 10: Hoare triple {3178#true} havoc #t~nondet1; {3178#true} is VALID [2020-07-11 02:31:50,957 INFO L280 TraceCheckUtils]: 11: Hoare triple {3178#true} havoc ~buf~0; {3178#true} is VALID [2020-07-11 02:31:50,957 INFO L280 TraceCheckUtils]: 12: Hoare triple {3178#true} havoc ~buflim~0; {3178#true} is VALID [2020-07-11 02:31:50,957 INFO L280 TraceCheckUtils]: 13: Hoare triple {3178#true} assume ~bufferlen~0 > 1; {3178#true} is VALID [2020-07-11 02:31:50,957 INFO L280 TraceCheckUtils]: 14: Hoare triple {3178#true} assume ~inlen~0 > 0; {3178#true} is VALID [2020-07-11 02:31:50,958 INFO L280 TraceCheckUtils]: 15: Hoare triple {3178#true} assume ~bufferlen~0 < ~inlen~0; {3178#true} is VALID [2020-07-11 02:31:50,958 INFO L280 TraceCheckUtils]: 16: Hoare triple {3178#true} ~buf~0 := 0; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:50,959 INFO L280 TraceCheckUtils]: 17: Hoare triple {3182#(<= 0 main_~buf~0)} ~in~0 := 0; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:50,960 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-11 02:31:50,960 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-11 02:31:50,961 INFO L280 TraceCheckUtils]: 20: Hoare triple {3182#(<= 0 main_~buf~0)} assume !!(0 != #t~nondet2); {3182#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:50,962 INFO L280 TraceCheckUtils]: 21: Hoare triple {3182#(<= 0 main_~buf~0)} havoc #t~nondet2; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:50,962 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-11 02:31:50,963 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-11 02:31:50,963 INFO L280 TraceCheckUtils]: 24: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-11 02:31:50,963 INFO L280 TraceCheckUtils]: 25: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-11 02:31:50,963 INFO L280 TraceCheckUtils]: 26: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-11 02:31:50,964 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {3178#true} {3182#(<= 0 main_~buf~0)} #103#return; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:50,964 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-11 02:31:50,965 INFO L280 TraceCheckUtils]: 29: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-11 02:31:50,965 INFO L280 TraceCheckUtils]: 30: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-11 02:31:50,965 INFO L280 TraceCheckUtils]: 31: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-11 02:31:50,966 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {3178#true} {3182#(<= 0 main_~buf~0)} #105#return; {3182#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:50,966 INFO L280 TraceCheckUtils]: 33: Hoare triple {3182#(<= 0 main_~buf~0)} #t~post3 := ~buf~0; {3191#(<= 0 |main_#t~post3|)} is VALID [2020-07-11 02:31:50,967 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-11 02:31:50,968 INFO L280 TraceCheckUtils]: 35: Hoare triple {3192#(<= 1 main_~buf~0)} havoc #t~post3; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-11 02:31:50,969 INFO L280 TraceCheckUtils]: 36: Hoare triple {3192#(<= 1 main_~buf~0)} #t~post4 := ~in~0; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-11 02:31:50,969 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-11 02:31:50,970 INFO L280 TraceCheckUtils]: 38: Hoare triple {3192#(<= 1 main_~buf~0)} havoc #t~post4; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-11 02:31:50,970 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-11 02:31:50,970 INFO L280 TraceCheckUtils]: 40: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-11 02:31:50,971 INFO L280 TraceCheckUtils]: 41: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-11 02:31:50,971 INFO L280 TraceCheckUtils]: 42: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-11 02:31:50,972 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3178#true} {3192#(<= 1 main_~buf~0)} #107#return; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-11 02:31:50,972 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-11 02:31:50,972 INFO L280 TraceCheckUtils]: 45: Hoare triple {3178#true} ~cond := #in~cond; {3178#true} is VALID [2020-07-11 02:31:50,972 INFO L280 TraceCheckUtils]: 46: Hoare triple {3178#true} assume !(0 == ~cond); {3178#true} is VALID [2020-07-11 02:31:50,973 INFO L280 TraceCheckUtils]: 47: Hoare triple {3178#true} assume true; {3178#true} is VALID [2020-07-11 02:31:50,973 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {3178#true} {3192#(<= 1 main_~buf~0)} #109#return; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-11 02:31:50,974 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-11 02:31:50,975 INFO L280 TraceCheckUtils]: 50: Hoare triple {3192#(<= 1 main_~buf~0)} assume !(0 != #t~nondet2); {3192#(<= 1 main_~buf~0)} is VALID [2020-07-11 02:31:50,977 INFO L280 TraceCheckUtils]: 51: Hoare triple {3192#(<= 1 main_~buf~0)} havoc #t~nondet2; {3192#(<= 1 main_~buf~0)} is VALID [2020-07-11 02:31:50,978 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-11 02:31:50,980 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-11 02:31:50,982 INFO L280 TraceCheckUtils]: 54: Hoare triple {3202#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3179#false} is VALID [2020-07-11 02:31:50,982 INFO L280 TraceCheckUtils]: 55: Hoare triple {3179#false} assume !false; {3179#false} is VALID [2020-07-11 02:31:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-11 02:31:50,985 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [845608002] [2020-07-11 02:31:50,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:31:50,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 02:31:50,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625986173] [2020-07-11 02:31:50,987 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-07-11 02:31:50,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:50,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 02:31:51,040 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-11 02:31:51,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 02:31:51,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:51,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 02:31:51,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-11 02:31:51,042 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 7 states. [2020-07-11 02:31:51,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:51,563 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2020-07-11 02:31:51,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 02:31:51,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-07-11 02:31:51,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:51,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:31:51,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2020-07-11 02:31:51,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:31:51,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2020-07-11 02:31:51,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 70 transitions. [2020-07-11 02:31:51,644 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-11 02:31:51,648 INFO L225 Difference]: With dead ends: 83 [2020-07-11 02:31:51,648 INFO L226 Difference]: Without dead ends: 81 [2020-07-11 02:31:51,649 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-11 02:31:51,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-11 02:31:51,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-07-11 02:31:51,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:51,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 81 states. [2020-07-11 02:31:51,811 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-11 02:31:51,811 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-11 02:31:51,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:51,815 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2020-07-11 02:31:51,816 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2020-07-11 02:31:51,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:51,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:51,816 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-11 02:31:51,816 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-11 02:31:51,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:51,820 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2020-07-11 02:31:51,820 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2020-07-11 02:31:51,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:51,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:51,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:51,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:51,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-11 02:31:51,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2020-07-11 02:31:51,824 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 56 [2020-07-11 02:31:51,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:51,825 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2020-07-11 02:31:51,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 02:31:51,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states and 88 transitions. [2020-07-11 02:31:51,960 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-11 02:31:51,960 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2020-07-11 02:31:51,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-11 02:31:51,962 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:51,962 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-11 02:31:51,962 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-11 02:31:51,962 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:51,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:51,963 INFO L82 PathProgramCache]: Analyzing trace with hash 903884048, now seen corresponding path program 1 times [2020-07-11 02:31:51,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:51,963 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1265786457] [2020-07-11 02:31:51,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:52,099 INFO L280 TraceCheckUtils]: 0: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-11 02:31:52,100 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3701#true} {3701#true} #99#return; {3701#true} is VALID [2020-07-11 02:31:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:52,107 INFO L280 TraceCheckUtils]: 0: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-11 02:31:52,107 INFO L280 TraceCheckUtils]: 1: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-11 02:31:52,107 INFO L280 TraceCheckUtils]: 2: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-11 02:31:52,108 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-11 02:31:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:52,122 INFO L280 TraceCheckUtils]: 0: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-11 02:31:52,123 INFO L280 TraceCheckUtils]: 1: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-11 02:31:52,123 INFO L280 TraceCheckUtils]: 2: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-11 02:31:52,124 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-11 02:31:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:52,133 INFO L280 TraceCheckUtils]: 0: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-11 02:31:52,134 INFO L280 TraceCheckUtils]: 1: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-11 02:31:52,134 INFO L280 TraceCheckUtils]: 2: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-11 02:31:52,135 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-11 02:31:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:52,149 INFO L280 TraceCheckUtils]: 0: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-11 02:31:52,149 INFO L280 TraceCheckUtils]: 1: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-11 02:31:52,150 INFO L280 TraceCheckUtils]: 2: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-11 02:31:52,151 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-11 02:31:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:52,156 INFO L280 TraceCheckUtils]: 0: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-11 02:31:52,157 INFO L280 TraceCheckUtils]: 1: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-11 02:31:52,157 INFO L280 TraceCheckUtils]: 2: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-11 02:31:52,158 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-11 02:31:52,159 INFO L263 TraceCheckUtils]: 0: Hoare triple {3701#true} call ULTIMATE.init(); {3701#true} is VALID [2020-07-11 02:31:52,159 INFO L280 TraceCheckUtils]: 1: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-11 02:31:52,159 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3701#true} {3701#true} #99#return; {3701#true} is VALID [2020-07-11 02:31:52,160 INFO L263 TraceCheckUtils]: 3: Hoare triple {3701#true} call #t~ret7 := main(); {3701#true} is VALID [2020-07-11 02:31:52,160 INFO L280 TraceCheckUtils]: 4: Hoare triple {3701#true} havoc ~in~0; {3701#true} is VALID [2020-07-11 02:31:52,160 INFO L280 TraceCheckUtils]: 5: Hoare triple {3701#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3701#true} is VALID [2020-07-11 02:31:52,161 INFO L280 TraceCheckUtils]: 6: Hoare triple {3701#true} ~inlen~0 := #t~nondet0; {3701#true} is VALID [2020-07-11 02:31:52,161 INFO L280 TraceCheckUtils]: 7: Hoare triple {3701#true} havoc #t~nondet0; {3701#true} is VALID [2020-07-11 02:31:52,161 INFO L280 TraceCheckUtils]: 8: Hoare triple {3701#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3701#true} is VALID [2020-07-11 02:31:52,161 INFO L280 TraceCheckUtils]: 9: Hoare triple {3701#true} ~bufferlen~0 := #t~nondet1; {3701#true} is VALID [2020-07-11 02:31:52,162 INFO L280 TraceCheckUtils]: 10: Hoare triple {3701#true} havoc #t~nondet1; {3701#true} is VALID [2020-07-11 02:31:52,162 INFO L280 TraceCheckUtils]: 11: Hoare triple {3701#true} havoc ~buf~0; {3701#true} is VALID [2020-07-11 02:31:52,165 INFO L280 TraceCheckUtils]: 12: Hoare triple {3701#true} havoc ~buflim~0; {3701#true} is VALID [2020-07-11 02:31:52,167 INFO L280 TraceCheckUtils]: 13: Hoare triple {3701#true} assume ~bufferlen~0 > 1; {3705#(<= 2 main_~bufferlen~0)} is VALID [2020-07-11 02:31:52,168 INFO L280 TraceCheckUtils]: 14: Hoare triple {3705#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {3705#(<= 2 main_~bufferlen~0)} is VALID [2020-07-11 02:31:52,169 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-11 02:31:52,170 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-11 02:31:52,170 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-11 02:31:52,171 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-11 02:31:52,172 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-11 02:31:52,173 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-11 02:31:52,174 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-11 02:31:52,175 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-11 02:31:52,175 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-11 02:31:52,175 INFO L280 TraceCheckUtils]: 24: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-11 02:31:52,176 INFO L280 TraceCheckUtils]: 25: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-11 02:31:52,176 INFO L280 TraceCheckUtils]: 26: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-11 02:31:52,180 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-11 02:31:52,180 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-11 02:31:52,181 INFO L280 TraceCheckUtils]: 29: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-11 02:31:52,181 INFO L280 TraceCheckUtils]: 30: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-11 02:31:52,181 INFO L280 TraceCheckUtils]: 31: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-11 02:31:52,183 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-11 02:31:52,184 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-11 02:31:52,185 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-11 02:31:52,185 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-11 02:31:52,186 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-11 02:31:52,187 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-11 02:31:52,188 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-11 02:31:52,188 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-11 02:31:52,188 INFO L280 TraceCheckUtils]: 40: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-11 02:31:52,189 INFO L280 TraceCheckUtils]: 41: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-11 02:31:52,189 INFO L280 TraceCheckUtils]: 42: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-11 02:31:52,190 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-11 02:31:52,191 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-11 02:31:52,191 INFO L280 TraceCheckUtils]: 45: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-11 02:31:52,191 INFO L280 TraceCheckUtils]: 46: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-11 02:31:52,191 INFO L280 TraceCheckUtils]: 47: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-11 02:31:52,196 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-11 02:31:52,197 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-11 02:31:52,198 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-11 02:31:52,201 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-11 02:31:52,202 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-11 02:31:52,202 INFO L280 TraceCheckUtils]: 53: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2020-07-11 02:31:52,203 INFO L280 TraceCheckUtils]: 54: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2020-07-11 02:31:52,203 INFO L280 TraceCheckUtils]: 55: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-11 02:31:52,204 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-11 02:31:52,206 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-11 02:31:52,206 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-11 02:31:52,207 INFO L280 TraceCheckUtils]: 59: Hoare triple {3730#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3702#false} is VALID [2020-07-11 02:31:52,207 INFO L280 TraceCheckUtils]: 60: Hoare triple {3702#false} assume !false; {3702#false} is VALID [2020-07-11 02:31:52,212 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-11 02:31:52,212 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1265786457] [2020-07-11 02:31:52,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:31:52,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-11 02:31:52,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567497070] [2020-07-11 02:31:52,217 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-07-11 02:31:52,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:52,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 02:31:52,289 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-11 02:31:52,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 02:31:52,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:52,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 02:31:52,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-11 02:31:52,290 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 8 states. [2020-07-11 02:31:53,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:53,085 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2020-07-11 02:31:53,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 02:31:53,086 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-07-11 02:31:53,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:53,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:31:53,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2020-07-11 02:31:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:31:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2020-07-11 02:31:53,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 97 transitions. [2020-07-11 02:31:53,221 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-11 02:31:53,225 INFO L225 Difference]: With dead ends: 100 [2020-07-11 02:31:53,225 INFO L226 Difference]: Without dead ends: 98 [2020-07-11 02:31:53,226 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 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-11 02:31:53,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-11 02:31:53,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2020-07-11 02:31:53,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:53,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 94 states. [2020-07-11 02:31:53,439 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 94 states. [2020-07-11 02:31:53,439 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 94 states. [2020-07-11 02:31:53,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:53,443 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2020-07-11 02:31:53,444 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2020-07-11 02:31:53,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:53,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:53,445 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 98 states. [2020-07-11 02:31:53,445 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 98 states. [2020-07-11 02:31:53,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:53,448 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2020-07-11 02:31:53,448 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2020-07-11 02:31:53,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:53,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:53,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:53,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:53,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-11 02:31:53,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2020-07-11 02:31:53,453 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 61 [2020-07-11 02:31:53,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:53,453 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2020-07-11 02:31:53,453 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 02:31:53,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 94 states and 106 transitions. [2020-07-11 02:31:53,617 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-11 02:31:53,617 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2020-07-11 02:31:53,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-11 02:31:53,618 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:53,619 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-11 02:31:53,619 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-11 02:31:53,619 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:53,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:53,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1662212275, now seen corresponding path program 1 times [2020-07-11 02:31:53,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:53,620 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [675997867] [2020-07-11 02:31:53,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:53,743 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-11 02:31:53,743 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4327#true} {4327#true} #99#return; {4327#true} is VALID [2020-07-11 02:31:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:53,748 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-11 02:31:53,749 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-11 02:31:53,749 INFO L280 TraceCheckUtils]: 2: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-11 02:31:53,749 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4327#true} {4331#(<= 0 main_~buf~0)} #103#return; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:53,757 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-11 02:31:53,757 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-11 02:31:53,757 INFO L280 TraceCheckUtils]: 2: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-11 02:31:53,758 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4327#true} {4331#(<= 0 main_~buf~0)} #105#return; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:53,767 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-11 02:31:53,767 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-11 02:31:53,767 INFO L280 TraceCheckUtils]: 2: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-11 02:31:53,768 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #107#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-11 02:31:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:53,790 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-11 02:31:53,790 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-11 02:31:53,791 INFO L280 TraceCheckUtils]: 2: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-11 02:31:53,791 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #109#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-11 02:31:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:53,798 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-11 02:31:53,798 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-11 02:31:53,799 INFO L280 TraceCheckUtils]: 2: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-11 02:31:53,800 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #111#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-11 02:31:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:53,805 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-11 02:31:53,805 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-11 02:31:53,806 INFO L280 TraceCheckUtils]: 2: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-11 02:31:53,806 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #113#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-11 02:31:53,806 INFO L263 TraceCheckUtils]: 0: Hoare triple {4327#true} call ULTIMATE.init(); {4327#true} is VALID [2020-07-11 02:31:53,807 INFO L280 TraceCheckUtils]: 1: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-11 02:31:53,807 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4327#true} {4327#true} #99#return; {4327#true} is VALID [2020-07-11 02:31:53,807 INFO L263 TraceCheckUtils]: 3: Hoare triple {4327#true} call #t~ret7 := main(); {4327#true} is VALID [2020-07-11 02:31:53,807 INFO L280 TraceCheckUtils]: 4: Hoare triple {4327#true} havoc ~in~0; {4327#true} is VALID [2020-07-11 02:31:53,807 INFO L280 TraceCheckUtils]: 5: Hoare triple {4327#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4327#true} is VALID [2020-07-11 02:31:53,807 INFO L280 TraceCheckUtils]: 6: Hoare triple {4327#true} ~inlen~0 := #t~nondet0; {4327#true} is VALID [2020-07-11 02:31:53,807 INFO L280 TraceCheckUtils]: 7: Hoare triple {4327#true} havoc #t~nondet0; {4327#true} is VALID [2020-07-11 02:31:53,808 INFO L280 TraceCheckUtils]: 8: Hoare triple {4327#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4327#true} is VALID [2020-07-11 02:31:53,808 INFO L280 TraceCheckUtils]: 9: Hoare triple {4327#true} ~bufferlen~0 := #t~nondet1; {4327#true} is VALID [2020-07-11 02:31:53,808 INFO L280 TraceCheckUtils]: 10: Hoare triple {4327#true} havoc #t~nondet1; {4327#true} is VALID [2020-07-11 02:31:53,808 INFO L280 TraceCheckUtils]: 11: Hoare triple {4327#true} havoc ~buf~0; {4327#true} is VALID [2020-07-11 02:31:53,808 INFO L280 TraceCheckUtils]: 12: Hoare triple {4327#true} havoc ~buflim~0; {4327#true} is VALID [2020-07-11 02:31:53,808 INFO L280 TraceCheckUtils]: 13: Hoare triple {4327#true} assume ~bufferlen~0 > 1; {4327#true} is VALID [2020-07-11 02:31:53,808 INFO L280 TraceCheckUtils]: 14: Hoare triple {4327#true} assume ~inlen~0 > 0; {4327#true} is VALID [2020-07-11 02:31:53,809 INFO L280 TraceCheckUtils]: 15: Hoare triple {4327#true} assume ~bufferlen~0 < ~inlen~0; {4327#true} is VALID [2020-07-11 02:31:53,810 INFO L280 TraceCheckUtils]: 16: Hoare triple {4327#true} ~buf~0 := 0; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:53,811 INFO L280 TraceCheckUtils]: 17: Hoare triple {4331#(<= 0 main_~buf~0)} ~in~0 := 0; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:53,812 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-11 02:31:53,813 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-11 02:31:53,813 INFO L280 TraceCheckUtils]: 20: Hoare triple {4331#(<= 0 main_~buf~0)} assume !!(0 != #t~nondet2); {4331#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:53,814 INFO L280 TraceCheckUtils]: 21: Hoare triple {4331#(<= 0 main_~buf~0)} havoc #t~nondet2; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:53,814 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-11 02:31:53,815 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-11 02:31:53,815 INFO L280 TraceCheckUtils]: 24: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-11 02:31:53,815 INFO L280 TraceCheckUtils]: 25: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-11 02:31:53,815 INFO L280 TraceCheckUtils]: 26: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-11 02:31:53,816 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {4327#true} {4331#(<= 0 main_~buf~0)} #103#return; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:53,816 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-11 02:31:53,817 INFO L280 TraceCheckUtils]: 29: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-11 02:31:53,817 INFO L280 TraceCheckUtils]: 30: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-11 02:31:53,817 INFO L280 TraceCheckUtils]: 31: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-11 02:31:53,818 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {4327#true} {4331#(<= 0 main_~buf~0)} #105#return; {4331#(<= 0 main_~buf~0)} is VALID [2020-07-11 02:31:53,820 INFO L280 TraceCheckUtils]: 33: Hoare triple {4331#(<= 0 main_~buf~0)} #t~post3 := ~buf~0; {4340#(<= 0 |main_#t~post3|)} is VALID [2020-07-11 02:31:53,821 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-11 02:31:53,822 INFO L280 TraceCheckUtils]: 35: Hoare triple {4341#(<= 1 main_~buf~0)} havoc #t~post3; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-11 02:31:53,823 INFO L280 TraceCheckUtils]: 36: Hoare triple {4341#(<= 1 main_~buf~0)} #t~post4 := ~in~0; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-11 02:31:53,824 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-11 02:31:53,825 INFO L280 TraceCheckUtils]: 38: Hoare triple {4341#(<= 1 main_~buf~0)} havoc #t~post4; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-11 02:31:53,825 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-11 02:31:53,825 INFO L280 TraceCheckUtils]: 40: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-11 02:31:53,826 INFO L280 TraceCheckUtils]: 41: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-11 02:31:53,826 INFO L280 TraceCheckUtils]: 42: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-11 02:31:53,826 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #107#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-11 02:31:53,826 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-11 02:31:53,827 INFO L280 TraceCheckUtils]: 45: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-11 02:31:53,827 INFO L280 TraceCheckUtils]: 46: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-11 02:31:53,827 INFO L280 TraceCheckUtils]: 47: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-11 02:31:53,827 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #109#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-11 02:31:53,828 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-11 02:31:53,828 INFO L280 TraceCheckUtils]: 50: Hoare triple {4341#(<= 1 main_~buf~0)} assume !(0 != #t~nondet2); {4341#(<= 1 main_~buf~0)} is VALID [2020-07-11 02:31:53,829 INFO L280 TraceCheckUtils]: 51: Hoare triple {4341#(<= 1 main_~buf~0)} havoc #t~nondet2; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-11 02:31:53,829 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-11 02:31:53,829 INFO L280 TraceCheckUtils]: 53: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-11 02:31:53,830 INFO L280 TraceCheckUtils]: 54: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-11 02:31:53,830 INFO L280 TraceCheckUtils]: 55: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-11 02:31:53,831 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #111#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-11 02:31:53,831 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-11 02:31:53,831 INFO L280 TraceCheckUtils]: 58: Hoare triple {4327#true} ~cond := #in~cond; {4327#true} is VALID [2020-07-11 02:31:53,831 INFO L280 TraceCheckUtils]: 59: Hoare triple {4327#true} assume !(0 == ~cond); {4327#true} is VALID [2020-07-11 02:31:53,831 INFO L280 TraceCheckUtils]: 60: Hoare triple {4327#true} assume true; {4327#true} is VALID [2020-07-11 02:31:53,832 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {4327#true} {4341#(<= 1 main_~buf~0)} #113#return; {4341#(<= 1 main_~buf~0)} is VALID [2020-07-11 02:31:53,832 INFO L280 TraceCheckUtils]: 62: Hoare triple {4341#(<= 1 main_~buf~0)} #t~post5 := ~buf~0; {4358#(<= 1 |main_#t~post5|)} is VALID [2020-07-11 02:31:53,833 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-11 02:31:53,834 INFO L280 TraceCheckUtils]: 64: Hoare triple {4359#(<= 2 main_~buf~0)} havoc #t~post5; {4359#(<= 2 main_~buf~0)} is VALID [2020-07-11 02:31:53,835 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-11 02:31:53,835 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-11 02:31:53,836 INFO L280 TraceCheckUtils]: 67: Hoare triple {4361#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4328#false} is VALID [2020-07-11 02:31:53,836 INFO L280 TraceCheckUtils]: 68: Hoare triple {4328#false} assume !false; {4328#false} is VALID [2020-07-11 02:31:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-07-11 02:31:53,839 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [675997867] [2020-07-11 02:31:53,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:31:53,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-11 02:31:53,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414606819] [2020-07-11 02:31:53,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2020-07-11 02:31:53,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:53,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-11 02:31:53,907 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-11 02:31:53,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-11 02:31:53,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:53,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-11 02:31:53,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-11 02:31:53,908 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 9 states. [2020-07-11 02:31:54,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:54,602 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2020-07-11 02:31:54,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-11 02:31:54,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2020-07-11 02:31:54,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 02:31:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2020-07-11 02:31:54,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 02:31:54,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2020-07-11 02:31:54,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2020-07-11 02:31:54,688 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-11 02:31:54,691 INFO L225 Difference]: With dead ends: 100 [2020-07-11 02:31:54,691 INFO L226 Difference]: Without dead ends: 98 [2020-07-11 02:31:54,692 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-11 02:31:54,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-11 02:31:54,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2020-07-11 02:31:54,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:54,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 98 states. [2020-07-11 02:31:54,940 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 98 states. [2020-07-11 02:31:54,940 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 98 states. [2020-07-11 02:31:54,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:54,947 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2020-07-11 02:31:54,948 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2020-07-11 02:31:54,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:54,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:54,949 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 98 states. [2020-07-11 02:31:54,949 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 98 states. [2020-07-11 02:31:54,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:54,955 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2020-07-11 02:31:54,955 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2020-07-11 02:31:54,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:54,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:54,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:54,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:54,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-07-11 02:31:54,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2020-07-11 02:31:54,963 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 69 [2020-07-11 02:31:54,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:54,964 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2020-07-11 02:31:54,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-11 02:31:54,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 98 states and 109 transitions. [2020-07-11 02:31:55,162 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-11 02:31:55,163 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2020-07-11 02:31:55,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-07-11 02:31:55,164 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:55,164 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-11 02:31:55,165 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-11 02:31:55,165 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:55,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:55,165 INFO L82 PathProgramCache]: Analyzing trace with hash 71900773, now seen corresponding path program 1 times [2020-07-11 02:31:55,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:55,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [248767434] [2020-07-11 02:31:55,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:55,386 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-11 02:31:55,387 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4966#true} {4966#true} #99#return; {4966#true} is VALID [2020-07-11 02:31:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:55,403 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-11 02:31:55,403 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-11 02:31:55,403 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-11 02:31:55,404 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-11 02:31:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:55,414 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-11 02:31:55,415 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-11 02:31:55,415 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-11 02:31:55,416 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-11 02:31:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:55,421 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-11 02:31:55,422 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-11 02:31:55,422 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-11 02:31:55,423 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-11 02:31:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:55,440 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-11 02:31:55,441 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-11 02:31:55,441 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-11 02:31:55,442 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-11 02:31:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:55,451 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-11 02:31:55,452 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-11 02:31:55,452 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-11 02:31:55,452 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-11 02:31:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:55,462 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-11 02:31:55,462 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-11 02:31:55,462 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-11 02:31:55,463 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-11 02:31:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:55,471 INFO L280 TraceCheckUtils]: 0: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-11 02:31:55,471 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-11 02:31:55,471 INFO L280 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-11 02:31:55,472 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-11 02:31:55,473 INFO L263 TraceCheckUtils]: 0: Hoare triple {4966#true} call ULTIMATE.init(); {4966#true} is VALID [2020-07-11 02:31:55,473 INFO L280 TraceCheckUtils]: 1: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-11 02:31:55,473 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4966#true} {4966#true} #99#return; {4966#true} is VALID [2020-07-11 02:31:55,473 INFO L263 TraceCheckUtils]: 3: Hoare triple {4966#true} call #t~ret7 := main(); {4966#true} is VALID [2020-07-11 02:31:55,473 INFO L280 TraceCheckUtils]: 4: Hoare triple {4966#true} havoc ~in~0; {4966#true} is VALID [2020-07-11 02:31:55,474 INFO L280 TraceCheckUtils]: 5: Hoare triple {4966#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4966#true} is VALID [2020-07-11 02:31:55,474 INFO L280 TraceCheckUtils]: 6: Hoare triple {4966#true} ~inlen~0 := #t~nondet0; {4966#true} is VALID [2020-07-11 02:31:55,474 INFO L280 TraceCheckUtils]: 7: Hoare triple {4966#true} havoc #t~nondet0; {4966#true} is VALID [2020-07-11 02:31:55,474 INFO L280 TraceCheckUtils]: 8: Hoare triple {4966#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4966#true} is VALID [2020-07-11 02:31:55,474 INFO L280 TraceCheckUtils]: 9: Hoare triple {4966#true} ~bufferlen~0 := #t~nondet1; {4966#true} is VALID [2020-07-11 02:31:55,474 INFO L280 TraceCheckUtils]: 10: Hoare triple {4966#true} havoc #t~nondet1; {4966#true} is VALID [2020-07-11 02:31:55,475 INFO L280 TraceCheckUtils]: 11: Hoare triple {4966#true} havoc ~buf~0; {4966#true} is VALID [2020-07-11 02:31:55,475 INFO L280 TraceCheckUtils]: 12: Hoare triple {4966#true} havoc ~buflim~0; {4966#true} is VALID [2020-07-11 02:31:55,476 INFO L280 TraceCheckUtils]: 13: Hoare triple {4966#true} assume ~bufferlen~0 > 1; {4970#(<= 2 main_~bufferlen~0)} is VALID [2020-07-11 02:31:55,476 INFO L280 TraceCheckUtils]: 14: Hoare triple {4970#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {4970#(<= 2 main_~bufferlen~0)} is VALID [2020-07-11 02:31:55,477 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-11 02:31:55,477 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-11 02:31:55,478 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-11 02:31:55,479 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-11 02:31:55,479 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-11 02:31:55,480 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-11 02:31:55,481 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-11 02:31:55,482 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-11 02:31:55,482 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-11 02:31:55,482 INFO L280 TraceCheckUtils]: 24: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-11 02:31:55,482 INFO L280 TraceCheckUtils]: 25: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-11 02:31:55,482 INFO L280 TraceCheckUtils]: 26: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-11 02:31:55,483 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-11 02:31:55,483 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-11 02:31:55,484 INFO L280 TraceCheckUtils]: 29: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-11 02:31:55,484 INFO L280 TraceCheckUtils]: 30: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-11 02:31:55,484 INFO L280 TraceCheckUtils]: 31: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-11 02:31:55,485 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-11 02:31:55,486 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-11 02:31:55,487 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-11 02:31:55,488 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-11 02:31:55,489 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-11 02:31:55,490 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-11 02:31:55,491 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-11 02:31:55,492 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-11 02:31:55,492 INFO L280 TraceCheckUtils]: 40: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-11 02:31:55,492 INFO L280 TraceCheckUtils]: 41: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-11 02:31:55,492 INFO L280 TraceCheckUtils]: 42: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-11 02:31:55,493 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-11 02:31:55,493 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-11 02:31:55,493 INFO L280 TraceCheckUtils]: 45: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-11 02:31:55,494 INFO L280 TraceCheckUtils]: 46: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-11 02:31:55,494 INFO L280 TraceCheckUtils]: 47: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-11 02:31:55,495 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-11 02:31:55,496 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-11 02:31:55,497 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-11 02:31:55,498 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-11 02:31:55,498 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-11 02:31:55,498 INFO L280 TraceCheckUtils]: 53: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-11 02:31:55,498 INFO L280 TraceCheckUtils]: 54: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-11 02:31:55,499 INFO L280 TraceCheckUtils]: 55: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-11 02:31:55,499 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-11 02:31:55,500 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-11 02:31:55,500 INFO L280 TraceCheckUtils]: 58: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-11 02:31:55,500 INFO L280 TraceCheckUtils]: 59: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-11 02:31:55,500 INFO L280 TraceCheckUtils]: 60: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-11 02:31:55,501 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-11 02:31:55,502 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-11 02:31:55,503 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-11 02:31:55,504 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-11 02:31:55,504 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-11 02:31:55,505 INFO L280 TraceCheckUtils]: 66: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2020-07-11 02:31:55,505 INFO L280 TraceCheckUtils]: 67: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2020-07-11 02:31:55,505 INFO L280 TraceCheckUtils]: 68: Hoare triple {4966#true} assume true; {4966#true} is VALID [2020-07-11 02:31:55,506 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-11 02:31:55,508 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-11 02:31:55,509 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-11 02:31:55,510 INFO L280 TraceCheckUtils]: 72: Hoare triple {5006#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4967#false} is VALID [2020-07-11 02:31:55,511 INFO L280 TraceCheckUtils]: 73: Hoare triple {4967#false} assume !false; {4967#false} is VALID [2020-07-11 02:31:55,520 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-11 02:31:55,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [248767434] [2020-07-11 02:31:55,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:31:55,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-11 02:31:55,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160706143] [2020-07-11 02:31:55,521 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2020-07-11 02:31:55,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:55,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-11 02:31:55,594 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-11 02:31:55,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-11 02:31:55,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:55,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-11 02:31:55,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-11 02:31:55,596 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 11 states. [2020-07-11 02:31:57,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:57,121 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2020-07-11 02:31:57,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-11 02:31:57,121 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2020-07-11 02:31:57,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:57,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:31:57,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 113 transitions. [2020-07-11 02:31:57,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:31:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 113 transitions. [2020-07-11 02:31:57,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 113 transitions. [2020-07-11 02:31:57,274 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-11 02:31:57,280 INFO L225 Difference]: With dead ends: 119 [2020-07-11 02:31:57,280 INFO L226 Difference]: Without dead ends: 101 [2020-07-11 02:31:57,281 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-11 02:31:57,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-11 02:31:57,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2020-07-11 02:31:57,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:57,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 95 states. [2020-07-11 02:31:57,492 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 95 states. [2020-07-11 02:31:57,492 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 95 states. [2020-07-11 02:31:57,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:57,497 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2020-07-11 02:31:57,497 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2020-07-11 02:31:57,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:57,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:57,498 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 101 states. [2020-07-11 02:31:57,498 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 101 states. [2020-07-11 02:31:57,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:57,502 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2020-07-11 02:31:57,502 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2020-07-11 02:31:57,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:57,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:57,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:57,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:57,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-07-11 02:31:57,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2020-07-11 02:31:57,507 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 74 [2020-07-11 02:31:57,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:57,508 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2020-07-11 02:31:57,508 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-11 02:31:57,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 95 states and 102 transitions. [2020-07-11 02:31:57,670 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-11 02:31:57,670 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2020-07-11 02:31:57,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-11 02:31:57,671 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:57,671 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-11 02:31:57,671 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-11 02:31:57,672 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:57,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:57,672 INFO L82 PathProgramCache]: Analyzing trace with hash -50388093, now seen corresponding path program 1 times [2020-07-11 02:31:57,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:57,672 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1304910072] [2020-07-11 02:31:57,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:57,825 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-11 02:31:57,825 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5661#true} {5661#true} #99#return; {5661#true} is VALID [2020-07-11 02:31:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:57,830 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-11 02:31:57,830 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-11 02:31:57,830 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-11 02:31:57,831 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-11 02:31:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:57,836 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-11 02:31:57,837 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-11 02:31:57,837 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-11 02:31:57,838 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-11 02:31:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:57,843 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-11 02:31:57,844 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-11 02:31:57,844 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-11 02:31:57,845 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-11 02:31:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:57,850 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-11 02:31:57,851 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-11 02:31:57,851 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-11 02:31:57,852 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-11 02:31:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:57,857 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-11 02:31:57,858 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-11 02:31:57,858 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-11 02:31:57,859 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-11 02:31:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:57,865 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-11 02:31:57,865 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-11 02:31:57,865 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-11 02:31:57,866 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-11 02:31:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:57,871 INFO L280 TraceCheckUtils]: 0: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-11 02:31:57,872 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-11 02:31:57,872 INFO L280 TraceCheckUtils]: 2: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-11 02:31:57,873 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-11 02:31:57,873 INFO L263 TraceCheckUtils]: 0: Hoare triple {5661#true} call ULTIMATE.init(); {5661#true} is VALID [2020-07-11 02:31:57,873 INFO L280 TraceCheckUtils]: 1: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-11 02:31:57,874 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5661#true} {5661#true} #99#return; {5661#true} is VALID [2020-07-11 02:31:57,874 INFO L263 TraceCheckUtils]: 3: Hoare triple {5661#true} call #t~ret7 := main(); {5661#true} is VALID [2020-07-11 02:31:57,874 INFO L280 TraceCheckUtils]: 4: Hoare triple {5661#true} havoc ~in~0; {5661#true} is VALID [2020-07-11 02:31:57,874 INFO L280 TraceCheckUtils]: 5: Hoare triple {5661#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {5661#true} is VALID [2020-07-11 02:31:57,874 INFO L280 TraceCheckUtils]: 6: Hoare triple {5661#true} ~inlen~0 := #t~nondet0; {5661#true} is VALID [2020-07-11 02:31:57,875 INFO L280 TraceCheckUtils]: 7: Hoare triple {5661#true} havoc #t~nondet0; {5661#true} is VALID [2020-07-11 02:31:57,875 INFO L280 TraceCheckUtils]: 8: Hoare triple {5661#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5661#true} is VALID [2020-07-11 02:31:57,875 INFO L280 TraceCheckUtils]: 9: Hoare triple {5661#true} ~bufferlen~0 := #t~nondet1; {5661#true} is VALID [2020-07-11 02:31:57,875 INFO L280 TraceCheckUtils]: 10: Hoare triple {5661#true} havoc #t~nondet1; {5661#true} is VALID [2020-07-11 02:31:57,875 INFO L280 TraceCheckUtils]: 11: Hoare triple {5661#true} havoc ~buf~0; {5661#true} is VALID [2020-07-11 02:31:57,875 INFO L280 TraceCheckUtils]: 12: Hoare triple {5661#true} havoc ~buflim~0; {5661#true} is VALID [2020-07-11 02:31:57,876 INFO L280 TraceCheckUtils]: 13: Hoare triple {5661#true} assume ~bufferlen~0 > 1; {5665#(<= 2 main_~bufferlen~0)} is VALID [2020-07-11 02:31:57,877 INFO L280 TraceCheckUtils]: 14: Hoare triple {5665#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {5665#(<= 2 main_~bufferlen~0)} is VALID [2020-07-11 02:31:57,878 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-11 02:31:57,879 INFO L280 TraceCheckUtils]: 16: Hoare triple {5666#(<= 3 main_~inlen~0)} ~buf~0 := 0; {5666#(<= 3 main_~inlen~0)} is VALID [2020-07-11 02:31:57,880 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-11 02:31:57,881 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-11 02:31:57,881 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-11 02:31:57,882 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-11 02:31:57,883 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-11 02:31:57,883 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-11 02:31:57,883 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-11 02:31:57,884 INFO L280 TraceCheckUtils]: 24: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-11 02:31:57,884 INFO L280 TraceCheckUtils]: 25: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-11 02:31:57,884 INFO L280 TraceCheckUtils]: 26: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-11 02:31:57,885 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-11 02:31:57,885 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-11 02:31:57,885 INFO L280 TraceCheckUtils]: 29: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-11 02:31:57,886 INFO L280 TraceCheckUtils]: 30: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-11 02:31:57,886 INFO L280 TraceCheckUtils]: 31: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-11 02:31:57,887 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-11 02:31:57,887 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-11 02:31:57,888 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-11 02:31:57,889 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-11 02:31:57,889 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-11 02:31:57,890 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-11 02:31:57,891 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-11 02:31:57,891 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-11 02:31:57,892 INFO L280 TraceCheckUtils]: 40: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-11 02:31:57,892 INFO L280 TraceCheckUtils]: 41: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-11 02:31:57,892 INFO L280 TraceCheckUtils]: 42: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-11 02:31:57,893 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-11 02:31:57,893 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-11 02:31:57,893 INFO L280 TraceCheckUtils]: 45: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-11 02:31:57,893 INFO L280 TraceCheckUtils]: 46: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-11 02:31:57,894 INFO L280 TraceCheckUtils]: 47: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-11 02:31:57,895 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-11 02:31:57,895 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-11 02:31:57,896 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-11 02:31:57,896 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-11 02:31:57,897 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-11 02:31:57,897 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-11 02:31:57,897 INFO L280 TraceCheckUtils]: 54: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-11 02:31:57,897 INFO L280 TraceCheckUtils]: 55: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-11 02:31:57,897 INFO L280 TraceCheckUtils]: 56: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-11 02:31:57,898 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-11 02:31:57,898 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-11 02:31:57,898 INFO L280 TraceCheckUtils]: 59: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-11 02:31:57,898 INFO L280 TraceCheckUtils]: 60: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-11 02:31:57,898 INFO L280 TraceCheckUtils]: 61: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-11 02:31:57,899 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-11 02:31:57,900 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-11 02:31:57,900 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-11 02:31:57,901 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-11 02:31:57,901 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-11 02:31:57,902 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-11 02:31:57,902 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-11 02:31:57,902 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-11 02:31:57,903 INFO L280 TraceCheckUtils]: 70: Hoare triple {5661#true} ~cond := #in~cond; {5661#true} is VALID [2020-07-11 02:31:57,903 INFO L280 TraceCheckUtils]: 71: Hoare triple {5661#true} assume !(0 == ~cond); {5661#true} is VALID [2020-07-11 02:31:57,903 INFO L280 TraceCheckUtils]: 72: Hoare triple {5661#true} assume true; {5661#true} is VALID [2020-07-11 02:31:57,904 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-11 02:31:57,905 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-11 02:31:57,905 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-11 02:31:57,906 INFO L280 TraceCheckUtils]: 76: Hoare triple {5701#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {5662#false} is VALID [2020-07-11 02:31:57,906 INFO L280 TraceCheckUtils]: 77: Hoare triple {5662#false} assume !false; {5662#false} is VALID [2020-07-11 02:31:57,911 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-11 02:31:57,911 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1304910072] [2020-07-11 02:31:57,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:31:57,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-11 02:31:57,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666343530] [2020-07-11 02:31:57,912 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2020-07-11 02:31:57,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:57,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-11 02:31:57,986 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-11 02:31:57,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-11 02:31:57,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:57,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-11 02:31:57,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-11 02:31:57,987 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 11 states. [2020-07-11 02:31:59,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:59,503 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2020-07-11 02:31:59,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-11 02:31:59,503 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2020-07-11 02:31:59,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:59,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:31:59,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 122 transitions. [2020-07-11 02:31:59,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:31:59,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 122 transitions. [2020-07-11 02:31:59,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 122 transitions. [2020-07-11 02:31:59,691 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-11 02:31:59,698 INFO L225 Difference]: With dead ends: 128 [2020-07-11 02:31:59,698 INFO L226 Difference]: Without dead ends: 126 [2020-07-11 02:31:59,699 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-11 02:31:59,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-07-11 02:32:00,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 107. [2020-07-11 02:32:00,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:00,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 107 states. [2020-07-11 02:32:00,003 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 107 states. [2020-07-11 02:32:00,004 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 107 states. [2020-07-11 02:32:00,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:00,008 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2020-07-11 02:32:00,008 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2020-07-11 02:32:00,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:00,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:00,009 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 126 states. [2020-07-11 02:32:00,010 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 126 states. [2020-07-11 02:32:00,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:00,014 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2020-07-11 02:32:00,014 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2020-07-11 02:32:00,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:00,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:00,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:00,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:00,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-07-11 02:32:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2020-07-11 02:32:00,019 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 78 [2020-07-11 02:32:00,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:00,020 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2020-07-11 02:32:00,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-11 02:32:00,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 107 states and 115 transitions. [2020-07-11 02:32:00,208 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-11 02:32:00,208 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2020-07-11 02:32:00,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-11 02:32:00,210 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:00,210 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-11 02:32:00,210 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-11 02:32:00,210 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:00,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:00,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1911943399, now seen corresponding path program 2 times [2020-07-11 02:32:00,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:00,211 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [182796335] [2020-07-11 02:32:00,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:00,452 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-11 02:32:00,452 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {6444#true} {6444#true} #99#return; {6444#true} is VALID [2020-07-11 02:32:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:00,464 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-11 02:32:00,464 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-11 02:32:00,464 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-11 02:32:00,465 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-11 02:32:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:00,470 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-11 02:32:00,471 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-11 02:32:00,471 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-11 02:32:00,472 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-11 02:32:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:00,476 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-11 02:32:00,477 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-11 02:32:00,477 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-11 02:32:00,478 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-11 02:32:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:00,485 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-11 02:32:00,485 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-11 02:32:00,485 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-11 02:32:00,486 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-11 02:32:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:00,492 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-11 02:32:00,493 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-11 02:32:00,493 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-11 02:32:00,498 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-11 02:32:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:00,503 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-11 02:32:00,503 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-11 02:32:00,503 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-11 02:32:00,504 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-11 02:32:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:00,523 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-11 02:32:00,524 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-11 02:32:00,524 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-11 02:32:00,525 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-11 02:32:00,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:00,535 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-11 02:32:00,535 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-11 02:32:00,535 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-11 02:32:00,536 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-11 02:32:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:00,543 INFO L280 TraceCheckUtils]: 0: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-11 02:32:00,544 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-11 02:32:00,544 INFO L280 TraceCheckUtils]: 2: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-11 02:32:00,545 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-11 02:32:00,545 INFO L263 TraceCheckUtils]: 0: Hoare triple {6444#true} call ULTIMATE.init(); {6444#true} is VALID [2020-07-11 02:32:00,546 INFO L280 TraceCheckUtils]: 1: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-11 02:32:00,546 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6444#true} {6444#true} #99#return; {6444#true} is VALID [2020-07-11 02:32:00,546 INFO L263 TraceCheckUtils]: 3: Hoare triple {6444#true} call #t~ret7 := main(); {6444#true} is VALID [2020-07-11 02:32:00,546 INFO L280 TraceCheckUtils]: 4: Hoare triple {6444#true} havoc ~in~0; {6444#true} is VALID [2020-07-11 02:32:00,546 INFO L280 TraceCheckUtils]: 5: Hoare triple {6444#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {6444#true} is VALID [2020-07-11 02:32:00,546 INFO L280 TraceCheckUtils]: 6: Hoare triple {6444#true} ~inlen~0 := #t~nondet0; {6444#true} is VALID [2020-07-11 02:32:00,547 INFO L280 TraceCheckUtils]: 7: Hoare triple {6444#true} havoc #t~nondet0; {6444#true} is VALID [2020-07-11 02:32:00,547 INFO L280 TraceCheckUtils]: 8: Hoare triple {6444#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {6444#true} is VALID [2020-07-11 02:32:00,547 INFO L280 TraceCheckUtils]: 9: Hoare triple {6444#true} ~bufferlen~0 := #t~nondet1; {6444#true} is VALID [2020-07-11 02:32:00,547 INFO L280 TraceCheckUtils]: 10: Hoare triple {6444#true} havoc #t~nondet1; {6444#true} is VALID [2020-07-11 02:32:00,547 INFO L280 TraceCheckUtils]: 11: Hoare triple {6444#true} havoc ~buf~0; {6444#true} is VALID [2020-07-11 02:32:00,548 INFO L280 TraceCheckUtils]: 12: Hoare triple {6444#true} havoc ~buflim~0; {6444#true} is VALID [2020-07-11 02:32:00,548 INFO L280 TraceCheckUtils]: 13: Hoare triple {6444#true} assume ~bufferlen~0 > 1; {6448#(<= 2 main_~bufferlen~0)} is VALID [2020-07-11 02:32:00,549 INFO L280 TraceCheckUtils]: 14: Hoare triple {6448#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {6448#(<= 2 main_~bufferlen~0)} is VALID [2020-07-11 02:32:00,550 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-11 02:32:00,551 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-11 02:32:00,551 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-11 02:32:00,552 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-11 02:32:00,553 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-11 02:32:00,554 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-11 02:32:00,555 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-11 02:32:00,556 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-11 02:32:00,556 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-11 02:32:00,556 INFO L280 TraceCheckUtils]: 24: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-11 02:32:00,556 INFO L280 TraceCheckUtils]: 25: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-11 02:32:00,557 INFO L280 TraceCheckUtils]: 26: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-11 02:32:00,558 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-11 02:32:00,558 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-11 02:32:00,558 INFO L280 TraceCheckUtils]: 29: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-11 02:32:00,558 INFO L280 TraceCheckUtils]: 30: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-11 02:32:00,558 INFO L280 TraceCheckUtils]: 31: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-11 02:32:00,559 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-11 02:32:00,560 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-11 02:32:00,561 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-11 02:32:00,561 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-11 02:32:00,562 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-11 02:32:00,563 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-11 02:32:00,563 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-11 02:32:00,563 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-11 02:32:00,564 INFO L280 TraceCheckUtils]: 40: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-11 02:32:00,564 INFO L280 TraceCheckUtils]: 41: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-11 02:32:00,564 INFO L280 TraceCheckUtils]: 42: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-11 02:32:00,565 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-11 02:32:00,565 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-11 02:32:00,565 INFO L280 TraceCheckUtils]: 45: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-11 02:32:00,565 INFO L280 TraceCheckUtils]: 46: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-11 02:32:00,566 INFO L280 TraceCheckUtils]: 47: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-11 02:32:00,567 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-11 02:32:00,567 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-11 02:32:00,568 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-11 02:32:00,568 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-11 02:32:00,569 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-11 02:32:00,569 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-11 02:32:00,569 INFO L280 TraceCheckUtils]: 54: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-11 02:32:00,570 INFO L280 TraceCheckUtils]: 55: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-11 02:32:00,570 INFO L280 TraceCheckUtils]: 56: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-11 02:32:00,571 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-11 02:32:00,571 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-11 02:32:00,571 INFO L280 TraceCheckUtils]: 59: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-11 02:32:00,571 INFO L280 TraceCheckUtils]: 60: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-11 02:32:00,571 INFO L280 TraceCheckUtils]: 61: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-11 02:32:00,572 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-11 02:32:00,573 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-11 02:32:00,574 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-11 02:32:00,575 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-11 02:32:00,575 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-11 02:32:00,576 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-11 02:32:00,576 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-11 02:32:00,576 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-11 02:32:00,577 INFO L280 TraceCheckUtils]: 70: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-11 02:32:00,577 INFO L280 TraceCheckUtils]: 71: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-11 02:32:00,577 INFO L280 TraceCheckUtils]: 72: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-11 02:32:00,578 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-11 02:32:00,578 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-11 02:32:00,578 INFO L280 TraceCheckUtils]: 75: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-11 02:32:00,579 INFO L280 TraceCheckUtils]: 76: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-11 02:32:00,579 INFO L280 TraceCheckUtils]: 77: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-11 02:32:00,580 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-11 02:32:00,580 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-11 02:32:00,581 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-11 02:32:00,581 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-11 02:32:00,582 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-11 02:32:00,582 INFO L280 TraceCheckUtils]: 83: Hoare triple {6444#true} ~cond := #in~cond; {6444#true} is VALID [2020-07-11 02:32:00,582 INFO L280 TraceCheckUtils]: 84: Hoare triple {6444#true} assume !(0 == ~cond); {6444#true} is VALID [2020-07-11 02:32:00,582 INFO L280 TraceCheckUtils]: 85: Hoare triple {6444#true} assume true; {6444#true} is VALID [2020-07-11 02:32:00,583 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-11 02:32:00,584 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-11 02:32:00,585 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-11 02:32:00,585 INFO L280 TraceCheckUtils]: 89: Hoare triple {6492#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {6445#false} is VALID [2020-07-11 02:32:00,586 INFO L280 TraceCheckUtils]: 90: Hoare triple {6445#false} assume !false; {6445#false} is VALID [2020-07-11 02:32:00,597 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2020-07-11 02:32:00,598 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [182796335] [2020-07-11 02:32:00,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:00,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-11 02:32:00,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575720662] [2020-07-11 02:32:00,599 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2020-07-11 02:32:00,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:00,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-11 02:32:00,689 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-11 02:32:00,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-11 02:32:00,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:00,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-11 02:32:00,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-11 02:32:00,690 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 11 states. [2020-07-11 02:32:02,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:02,473 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2020-07-11 02:32:02,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-11 02:32:02,473 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2020-07-11 02:32:02,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:02,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:32:02,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2020-07-11 02:32:02,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:32:02,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2020-07-11 02:32:02,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 127 transitions. [2020-07-11 02:32:02,665 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-11 02:32:02,673 INFO L225 Difference]: With dead ends: 134 [2020-07-11 02:32:02,676 INFO L226 Difference]: Without dead ends: 132 [2020-07-11 02:32:02,678 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-11 02:32:02,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-07-11 02:32:03,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 120. [2020-07-11 02:32:03,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:03,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 120 states. [2020-07-11 02:32:03,054 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 120 states. [2020-07-11 02:32:03,054 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 120 states. [2020-07-11 02:32:03,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:03,060 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2020-07-11 02:32:03,061 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2020-07-11 02:32:03,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:03,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:03,062 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 132 states. [2020-07-11 02:32:03,062 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 132 states. [2020-07-11 02:32:03,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:03,068 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2020-07-11 02:32:03,068 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2020-07-11 02:32:03,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:03,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:03,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:03,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:03,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-07-11 02:32:03,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2020-07-11 02:32:03,074 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 91 [2020-07-11 02:32:03,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:03,074 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2020-07-11 02:32:03,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-11 02:32:03,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 120 states and 133 transitions. [2020-07-11 02:32:03,306 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-11 02:32:03,306 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2020-07-11 02:32:03,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-07-11 02:32:03,308 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:03,308 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-11 02:32:03,308 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-11 02:32:03,308 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:03,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:03,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1949077486, now seen corresponding path program 2 times [2020-07-11 02:32:03,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:03,309 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1008818721] [2020-07-11 02:32:03,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:03,606 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-11 02:32:03,606 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {7289#true} {7289#true} #99#return; {7289#true} is VALID [2020-07-11 02:32:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:03,611 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-11 02:32:03,612 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-11 02:32:03,612 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-11 02:32:03,613 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-11 02:32:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:03,618 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-11 02:32:03,619 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-11 02:32:03,619 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-11 02:32:03,620 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-11 02:32:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:03,626 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-11 02:32:03,626 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-11 02:32:03,626 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-11 02:32:03,628 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-11 02:32:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:03,634 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-11 02:32:03,634 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-11 02:32:03,634 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-11 02:32:03,635 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-11 02:32:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:03,640 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-11 02:32:03,640 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-11 02:32:03,641 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-11 02:32:03,642 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-11 02:32:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:03,647 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-11 02:32:03,648 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-11 02:32:03,648 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-11 02:32:03,649 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-11 02:32:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:03,653 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-11 02:32:03,653 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-11 02:32:03,654 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-11 02:32:03,655 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-11 02:32:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:03,659 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-11 02:32:03,660 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-11 02:32:03,660 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-11 02:32:03,661 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-11 02:32:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:03,665 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-11 02:32:03,666 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-11 02:32:03,666 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-11 02:32:03,667 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-11 02:32:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:03,673 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-11 02:32:03,674 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-11 02:32:03,674 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-11 02:32:03,675 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-11 02:32:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:03,680 INFO L280 TraceCheckUtils]: 0: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-11 02:32:03,680 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-11 02:32:03,680 INFO L280 TraceCheckUtils]: 2: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-11 02:32:03,681 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-11 02:32:03,682 INFO L263 TraceCheckUtils]: 0: Hoare triple {7289#true} call ULTIMATE.init(); {7289#true} is VALID [2020-07-11 02:32:03,682 INFO L280 TraceCheckUtils]: 1: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-11 02:32:03,682 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7289#true} {7289#true} #99#return; {7289#true} is VALID [2020-07-11 02:32:03,682 INFO L263 TraceCheckUtils]: 3: Hoare triple {7289#true} call #t~ret7 := main(); {7289#true} is VALID [2020-07-11 02:32:03,682 INFO L280 TraceCheckUtils]: 4: Hoare triple {7289#true} havoc ~in~0; {7289#true} is VALID [2020-07-11 02:32:03,683 INFO L280 TraceCheckUtils]: 5: Hoare triple {7289#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {7289#true} is VALID [2020-07-11 02:32:03,683 INFO L280 TraceCheckUtils]: 6: Hoare triple {7289#true} ~inlen~0 := #t~nondet0; {7289#true} is VALID [2020-07-11 02:32:03,683 INFO L280 TraceCheckUtils]: 7: Hoare triple {7289#true} havoc #t~nondet0; {7289#true} is VALID [2020-07-11 02:32:03,683 INFO L280 TraceCheckUtils]: 8: Hoare triple {7289#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {7289#true} is VALID [2020-07-11 02:32:03,683 INFO L280 TraceCheckUtils]: 9: Hoare triple {7289#true} ~bufferlen~0 := #t~nondet1; {7289#true} is VALID [2020-07-11 02:32:03,684 INFO L280 TraceCheckUtils]: 10: Hoare triple {7289#true} havoc #t~nondet1; {7289#true} is VALID [2020-07-11 02:32:03,684 INFO L280 TraceCheckUtils]: 11: Hoare triple {7289#true} havoc ~buf~0; {7289#true} is VALID [2020-07-11 02:32:03,684 INFO L280 TraceCheckUtils]: 12: Hoare triple {7289#true} havoc ~buflim~0; {7289#true} is VALID [2020-07-11 02:32:03,685 INFO L280 TraceCheckUtils]: 13: Hoare triple {7289#true} assume ~bufferlen~0 > 1; {7293#(<= 2 main_~bufferlen~0)} is VALID [2020-07-11 02:32:03,685 INFO L280 TraceCheckUtils]: 14: Hoare triple {7293#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {7293#(<= 2 main_~bufferlen~0)} is VALID [2020-07-11 02:32:03,686 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-11 02:32:03,687 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-11 02:32:03,687 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-11 02:32:03,688 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-11 02:32:03,689 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-11 02:32:03,690 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-11 02:32:03,692 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-11 02:32:03,693 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-11 02:32:03,693 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-11 02:32:03,693 INFO L280 TraceCheckUtils]: 24: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-11 02:32:03,694 INFO L280 TraceCheckUtils]: 25: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-11 02:32:03,694 INFO L280 TraceCheckUtils]: 26: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-11 02:32:03,695 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-11 02:32:03,695 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-11 02:32:03,696 INFO L280 TraceCheckUtils]: 29: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-11 02:32:03,696 INFO L280 TraceCheckUtils]: 30: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-11 02:32:03,696 INFO L280 TraceCheckUtils]: 31: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-11 02:32:03,697 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-11 02:32:03,698 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-11 02:32:03,700 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-11 02:32:03,701 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-11 02:32:03,702 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-11 02:32:03,702 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-11 02:32:03,703 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-11 02:32:03,704 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-11 02:32:03,704 INFO L280 TraceCheckUtils]: 40: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-11 02:32:03,704 INFO L280 TraceCheckUtils]: 41: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-11 02:32:03,704 INFO L280 TraceCheckUtils]: 42: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-11 02:32:03,705 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-11 02:32:03,705 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-11 02:32:03,706 INFO L280 TraceCheckUtils]: 45: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-11 02:32:03,706 INFO L280 TraceCheckUtils]: 46: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-11 02:32:03,706 INFO L280 TraceCheckUtils]: 47: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-11 02:32:03,707 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-11 02:32:03,708 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-11 02:32:03,709 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-11 02:32:03,710 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-11 02:32:03,711 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-11 02:32:03,711 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-11 02:32:03,712 INFO L280 TraceCheckUtils]: 54: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-11 02:32:03,712 INFO L280 TraceCheckUtils]: 55: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-11 02:32:03,712 INFO L280 TraceCheckUtils]: 56: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-11 02:32:03,713 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-11 02:32:03,714 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-11 02:32:03,714 INFO L280 TraceCheckUtils]: 59: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-11 02:32:03,714 INFO L280 TraceCheckUtils]: 60: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-11 02:32:03,715 INFO L280 TraceCheckUtils]: 61: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-11 02:32:03,716 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-11 02:32:03,716 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-11 02:32:03,718 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-11 02:32:03,719 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-11 02:32:03,719 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-11 02:32:03,720 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-11 02:32:03,721 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-11 02:32:03,721 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-11 02:32:03,721 INFO L280 TraceCheckUtils]: 70: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-11 02:32:03,721 INFO L280 TraceCheckUtils]: 71: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-11 02:32:03,722 INFO L280 TraceCheckUtils]: 72: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-11 02:32:03,723 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-11 02:32:03,723 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-11 02:32:03,723 INFO L280 TraceCheckUtils]: 75: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-11 02:32:03,723 INFO L280 TraceCheckUtils]: 76: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-11 02:32:03,724 INFO L280 TraceCheckUtils]: 77: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-11 02:32:03,725 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-11 02:32:03,725 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-11 02:32:03,726 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-11 02:32:03,727 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-11 02:32:03,727 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-11 02:32:03,728 INFO L280 TraceCheckUtils]: 83: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-11 02:32:03,728 INFO L280 TraceCheckUtils]: 84: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-11 02:32:03,728 INFO L280 TraceCheckUtils]: 85: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-11 02:32:03,729 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-11 02:32:03,730 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-11 02:32:03,730 INFO L280 TraceCheckUtils]: 88: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-11 02:32:03,730 INFO L280 TraceCheckUtils]: 89: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-11 02:32:03,731 INFO L280 TraceCheckUtils]: 90: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-11 02:32:03,732 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-11 02:32:03,733 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-11 02:32:03,735 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-11 02:32:03,736 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-11 02:32:03,736 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-11 02:32:03,736 INFO L280 TraceCheckUtils]: 96: Hoare triple {7289#true} ~cond := #in~cond; {7289#true} is VALID [2020-07-11 02:32:03,737 INFO L280 TraceCheckUtils]: 97: Hoare triple {7289#true} assume !(0 == ~cond); {7289#true} is VALID [2020-07-11 02:32:03,737 INFO L280 TraceCheckUtils]: 98: Hoare triple {7289#true} assume true; {7289#true} is VALID [2020-07-11 02:32:03,738 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-11 02:32:03,740 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-11 02:32:03,741 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-11 02:32:03,742 INFO L280 TraceCheckUtils]: 102: Hoare triple {7347#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {7290#false} is VALID [2020-07-11 02:32:03,742 INFO L280 TraceCheckUtils]: 103: Hoare triple {7290#false} assume !false; {7290#false} is VALID [2020-07-11 02:32:03,792 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2020-07-11 02:32:03,793 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1008818721] [2020-07-11 02:32:03,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:03,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-11 02:32:03,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039843185] [2020-07-11 02:32:03,794 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2020-07-11 02:32:03,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:03,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-11 02:32:03,888 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-11 02:32:03,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-11 02:32:03,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:03,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-11 02:32:03,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-07-11 02:32:03,889 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand 13 states. [2020-07-11 02:32:05,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:05,181 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2020-07-11 02:32:05,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-11 02:32:05,181 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2020-07-11 02:32:05,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:05,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 02:32:05,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 60 transitions. [2020-07-11 02:32:05,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 02:32:05,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 60 transitions. [2020-07-11 02:32:05,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 60 transitions. [2020-07-11 02:32:05,269 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-11 02:32:05,272 INFO L225 Difference]: With dead ends: 126 [2020-07-11 02:32:05,272 INFO L226 Difference]: Without dead ends: 109 [2020-07-11 02:32:05,274 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-11 02:32:05,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-07-11 02:32:05,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2020-07-11 02:32:05,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:05,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 99 states. [2020-07-11 02:32:05,555 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 99 states. [2020-07-11 02:32:05,555 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 99 states. [2020-07-11 02:32:05,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:05,559 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2020-07-11 02:32:05,559 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2020-07-11 02:32:05,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:05,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:05,560 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 109 states. [2020-07-11 02:32:05,560 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 109 states. [2020-07-11 02:32:05,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:05,565 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2020-07-11 02:32:05,565 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2020-07-11 02:32:05,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:05,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:05,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:05,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:05,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-07-11 02:32:05,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2020-07-11 02:32:05,570 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 104 [2020-07-11 02:32:05,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:05,571 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2020-07-11 02:32:05,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-11 02:32:05,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 99 states and 102 transitions. [2020-07-11 02:32:05,772 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-11 02:32:05,772 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2020-07-11 02:32:05,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-07-11 02:32:05,774 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:05,774 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-11 02:32:05,774 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-11 02:32:05,775 INFO L427 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:05,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:05,775 INFO L82 PathProgramCache]: Analyzing trace with hash 55355532, now seen corresponding path program 2 times [2020-07-11 02:32:05,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:05,775 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [864685961] [2020-07-11 02:32:05,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:06,109 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-11 02:32:06,109 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8036#true} {8036#true} #99#return; {8036#true} is VALID [2020-07-11 02:32:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:06,114 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-11 02:32:06,114 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-11 02:32:06,115 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-11 02:32:06,115 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-11 02:32:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:06,120 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-11 02:32:06,120 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-11 02:32:06,121 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-11 02:32:06,122 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-11 02:32:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:06,126 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-11 02:32:06,127 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-11 02:32:06,127 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-11 02:32:06,128 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-11 02:32:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:06,133 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-11 02:32:06,133 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-11 02:32:06,133 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-11 02:32:06,134 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-11 02:32:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:06,139 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-11 02:32:06,140 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-11 02:32:06,140 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-11 02:32:06,141 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-11 02:32:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:06,146 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-11 02:32:06,146 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-11 02:32:06,146 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-11 02:32:06,147 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-11 02:32:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:06,153 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-11 02:32:06,153 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-11 02:32:06,153 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-11 02:32:06,154 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-11 02:32:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:06,159 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-11 02:32:06,160 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-11 02:32:06,160 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-11 02:32:06,161 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-11 02:32:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:06,166 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-11 02:32:06,166 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-11 02:32:06,167 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-11 02:32:06,168 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-11 02:32:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:06,173 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-11 02:32:06,173 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-11 02:32:06,173 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-11 02:32:06,174 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-11 02:32:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:06,180 INFO L280 TraceCheckUtils]: 0: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-11 02:32:06,180 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-11 02:32:06,180 INFO L280 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-11 02:32:06,181 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-11 02:32:06,182 INFO L263 TraceCheckUtils]: 0: Hoare triple {8036#true} call ULTIMATE.init(); {8036#true} is VALID [2020-07-11 02:32:06,182 INFO L280 TraceCheckUtils]: 1: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-11 02:32:06,182 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8036#true} {8036#true} #99#return; {8036#true} is VALID [2020-07-11 02:32:06,182 INFO L263 TraceCheckUtils]: 3: Hoare triple {8036#true} call #t~ret7 := main(); {8036#true} is VALID [2020-07-11 02:32:06,183 INFO L280 TraceCheckUtils]: 4: Hoare triple {8036#true} havoc ~in~0; {8036#true} is VALID [2020-07-11 02:32:06,183 INFO L280 TraceCheckUtils]: 5: Hoare triple {8036#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {8036#true} is VALID [2020-07-11 02:32:06,183 INFO L280 TraceCheckUtils]: 6: Hoare triple {8036#true} ~inlen~0 := #t~nondet0; {8036#true} is VALID [2020-07-11 02:32:06,183 INFO L280 TraceCheckUtils]: 7: Hoare triple {8036#true} havoc #t~nondet0; {8036#true} is VALID [2020-07-11 02:32:06,183 INFO L280 TraceCheckUtils]: 8: Hoare triple {8036#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {8036#true} is VALID [2020-07-11 02:32:06,183 INFO L280 TraceCheckUtils]: 9: Hoare triple {8036#true} ~bufferlen~0 := #t~nondet1; {8036#true} is VALID [2020-07-11 02:32:06,184 INFO L280 TraceCheckUtils]: 10: Hoare triple {8036#true} havoc #t~nondet1; {8036#true} is VALID [2020-07-11 02:32:06,184 INFO L280 TraceCheckUtils]: 11: Hoare triple {8036#true} havoc ~buf~0; {8036#true} is VALID [2020-07-11 02:32:06,184 INFO L280 TraceCheckUtils]: 12: Hoare triple {8036#true} havoc ~buflim~0; {8036#true} is VALID [2020-07-11 02:32:06,185 INFO L280 TraceCheckUtils]: 13: Hoare triple {8036#true} assume ~bufferlen~0 > 1; {8040#(<= 2 main_~bufferlen~0)} is VALID [2020-07-11 02:32:06,186 INFO L280 TraceCheckUtils]: 14: Hoare triple {8040#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {8040#(<= 2 main_~bufferlen~0)} is VALID [2020-07-11 02:32:06,187 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-11 02:32:06,189 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-11 02:32:06,190 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-11 02:32:06,191 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-11 02:32:06,193 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-11 02:32:06,194 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-11 02:32:06,195 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-11 02:32:06,196 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-11 02:32:06,197 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-11 02:32:06,197 INFO L280 TraceCheckUtils]: 24: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-11 02:32:06,197 INFO L280 TraceCheckUtils]: 25: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-11 02:32:06,198 INFO L280 TraceCheckUtils]: 26: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-11 02:32:06,199 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-11 02:32:06,199 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-11 02:32:06,199 INFO L280 TraceCheckUtils]: 29: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-11 02:32:06,199 INFO L280 TraceCheckUtils]: 30: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-11 02:32:06,200 INFO L280 TraceCheckUtils]: 31: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-11 02:32:06,201 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-11 02:32:06,202 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-11 02:32:06,202 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-11 02:32:06,203 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-11 02:32:06,204 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-11 02:32:06,205 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-11 02:32:06,206 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-11 02:32:06,206 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-11 02:32:06,207 INFO L280 TraceCheckUtils]: 40: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-11 02:32:06,207 INFO L280 TraceCheckUtils]: 41: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-11 02:32:06,207 INFO L280 TraceCheckUtils]: 42: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-11 02:32:06,208 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-11 02:32:06,208 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-11 02:32:06,209 INFO L280 TraceCheckUtils]: 45: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-11 02:32:06,209 INFO L280 TraceCheckUtils]: 46: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-11 02:32:06,209 INFO L280 TraceCheckUtils]: 47: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-11 02:32:06,210 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-11 02:32:06,211 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-11 02:32:06,212 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-11 02:32:06,213 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-11 02:32:06,213 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-11 02:32:06,214 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-11 02:32:06,214 INFO L280 TraceCheckUtils]: 54: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-11 02:32:06,214 INFO L280 TraceCheckUtils]: 55: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-11 02:32:06,214 INFO L280 TraceCheckUtils]: 56: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-11 02:32:06,215 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-11 02:32:06,215 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-11 02:32:06,215 INFO L280 TraceCheckUtils]: 59: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-11 02:32:06,216 INFO L280 TraceCheckUtils]: 60: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-11 02:32:06,216 INFO L280 TraceCheckUtils]: 61: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-11 02:32:06,217 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-11 02:32:06,217 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-11 02:32:06,218 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-11 02:32:06,218 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-11 02:32:06,219 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-11 02:32:06,220 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-11 02:32:06,221 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-11 02:32:06,221 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-11 02:32:06,221 INFO L280 TraceCheckUtils]: 70: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-11 02:32:06,221 INFO L280 TraceCheckUtils]: 71: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-11 02:32:06,221 INFO L280 TraceCheckUtils]: 72: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-11 02:32:06,222 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-11 02:32:06,222 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-11 02:32:06,223 INFO L280 TraceCheckUtils]: 75: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-11 02:32:06,223 INFO L280 TraceCheckUtils]: 76: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-11 02:32:06,223 INFO L280 TraceCheckUtils]: 77: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-11 02:32:06,224 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-11 02:32:06,225 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-11 02:32:06,225 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-11 02:32:06,226 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-11 02:32:06,227 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-11 02:32:06,227 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-11 02:32:06,227 INFO L280 TraceCheckUtils]: 84: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-11 02:32:06,227 INFO L280 TraceCheckUtils]: 85: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-11 02:32:06,228 INFO L280 TraceCheckUtils]: 86: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-11 02:32:06,229 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-11 02:32:06,229 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-11 02:32:06,229 INFO L280 TraceCheckUtils]: 89: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-11 02:32:06,229 INFO L280 TraceCheckUtils]: 90: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-11 02:32:06,229 INFO L280 TraceCheckUtils]: 91: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-11 02:32:06,230 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-11 02:32:06,231 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-11 02:32:06,232 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-11 02:32:06,233 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-11 02:32:06,233 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-11 02:32:06,235 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-11 02:32:06,235 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-11 02:32:06,236 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-11 02:32:06,236 INFO L280 TraceCheckUtils]: 100: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2020-07-11 02:32:06,236 INFO L280 TraceCheckUtils]: 101: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2020-07-11 02:32:06,236 INFO L280 TraceCheckUtils]: 102: Hoare triple {8036#true} assume true; {8036#true} is VALID [2020-07-11 02:32:06,237 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-11 02:32:06,239 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-11 02:32:06,240 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-11 02:32:06,240 INFO L280 TraceCheckUtils]: 106: Hoare triple {8097#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {8037#false} is VALID [2020-07-11 02:32:06,241 INFO L280 TraceCheckUtils]: 107: Hoare triple {8037#false} assume !false; {8037#false} is VALID [2020-07-11 02:32:06,255 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 22 proven. 42 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2020-07-11 02:32:06,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [864685961] [2020-07-11 02:32:06,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:06,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-07-11 02:32:06,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954360218] [2020-07-11 02:32:06,257 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2020-07-11 02:32:06,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:06,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-11 02:32:06,409 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-11 02:32:06,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-11 02:32:06,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:06,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-11 02:32:06,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-07-11 02:32:06,411 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand 16 states. [2020-07-11 02:32:08,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:08,791 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2020-07-11 02:32:08,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-11 02:32:08,791 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2020-07-11 02:32:08,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:08,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-11 02:32:08,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 114 transitions. [2020-07-11 02:32:08,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-11 02:32:08,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 114 transitions. [2020-07-11 02:32:08,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 114 transitions. [2020-07-11 02:32:08,969 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-11 02:32:08,973 INFO L225 Difference]: With dead ends: 130 [2020-07-11 02:32:08,973 INFO L226 Difference]: Without dead ends: 128 [2020-07-11 02:32:08,977 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2020-07-11 02:32:08,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-07-11 02:32:09,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 117. [2020-07-11 02:32:09,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:09,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 117 states. [2020-07-11 02:32:09,386 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 117 states. [2020-07-11 02:32:09,386 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 117 states. [2020-07-11 02:32:09,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:09,391 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2020-07-11 02:32:09,391 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2020-07-11 02:32:09,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:09,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:09,392 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 128 states. [2020-07-11 02:32:09,392 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 128 states. [2020-07-11 02:32:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:09,396 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2020-07-11 02:32:09,396 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2020-07-11 02:32:09,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:09,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:09,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:09,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:09,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-11 02:32:09,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2020-07-11 02:32:09,402 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 108 [2020-07-11 02:32:09,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:09,403 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2020-07-11 02:32:09,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-11 02:32:09,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 117 states and 123 transitions. [2020-07-11 02:32:09,629 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-11 02:32:09,630 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2020-07-11 02:32:09,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-07-11 02:32:09,632 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:09,632 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-11 02:32:09,633 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-11 02:32:09,633 INFO L427 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:09,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:09,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1897035733, now seen corresponding path program 3 times [2020-07-11 02:32:09,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:09,634 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [977204596] [2020-07-11 02:32:09,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:10,360 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,360 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8880#true} {8880#true} #99#return; {8880#true} is VALID [2020-07-11 02:32:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:10,368 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,369 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,369 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,370 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-11 02:32:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:10,376 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,377 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,377 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,378 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-11 02:32:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:10,384 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,385 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,385 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,386 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-11 02:32:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:10,394 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,394 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,394 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,396 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-11 02:32:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:10,401 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,401 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,401 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,402 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-11 02:32:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:10,408 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,409 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,409 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,410 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-11 02:32:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:10,416 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,416 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,416 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,417 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-11 02:32:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:10,423 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,423 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,424 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,425 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-11 02:32:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:10,450 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,450 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,450 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,452 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-11 02:32:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:10,458 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,459 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,459 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,460 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-11 02:32:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:10,468 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,469 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,469 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,470 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-11 02:32:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:10,474 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,474 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,475 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,475 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-11 02:32:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:10,480 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,481 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,481 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,482 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-11 02:32:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:10,493 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,494 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,494 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,495 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-11 02:32:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:10,499 INFO L280 TraceCheckUtils]: 0: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,499 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,500 INFO L280 TraceCheckUtils]: 2: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,500 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-11 02:32:10,501 INFO L263 TraceCheckUtils]: 0: Hoare triple {8880#true} call ULTIMATE.init(); {8880#true} is VALID [2020-07-11 02:32:10,501 INFO L280 TraceCheckUtils]: 1: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,501 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8880#true} {8880#true} #99#return; {8880#true} is VALID [2020-07-11 02:32:10,501 INFO L263 TraceCheckUtils]: 3: Hoare triple {8880#true} call #t~ret7 := main(); {8880#true} is VALID [2020-07-11 02:32:10,502 INFO L280 TraceCheckUtils]: 4: Hoare triple {8880#true} havoc ~in~0; {8880#true} is VALID [2020-07-11 02:32:10,502 INFO L280 TraceCheckUtils]: 5: Hoare triple {8880#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {8880#true} is VALID [2020-07-11 02:32:10,502 INFO L280 TraceCheckUtils]: 6: Hoare triple {8880#true} ~inlen~0 := #t~nondet0; {8880#true} is VALID [2020-07-11 02:32:10,502 INFO L280 TraceCheckUtils]: 7: Hoare triple {8880#true} havoc #t~nondet0; {8880#true} is VALID [2020-07-11 02:32:10,502 INFO L280 TraceCheckUtils]: 8: Hoare triple {8880#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {8880#true} is VALID [2020-07-11 02:32:10,502 INFO L280 TraceCheckUtils]: 9: Hoare triple {8880#true} ~bufferlen~0 := #t~nondet1; {8880#true} is VALID [2020-07-11 02:32:10,503 INFO L280 TraceCheckUtils]: 10: Hoare triple {8880#true} havoc #t~nondet1; {8880#true} is VALID [2020-07-11 02:32:10,503 INFO L280 TraceCheckUtils]: 11: Hoare triple {8880#true} havoc ~buf~0; {8880#true} is VALID [2020-07-11 02:32:10,503 INFO L280 TraceCheckUtils]: 12: Hoare triple {8880#true} havoc ~buflim~0; {8880#true} is VALID [2020-07-11 02:32:10,504 INFO L280 TraceCheckUtils]: 13: Hoare triple {8880#true} assume ~bufferlen~0 > 1; {8884#(<= 2 main_~bufferlen~0)} is VALID [2020-07-11 02:32:10,504 INFO L280 TraceCheckUtils]: 14: Hoare triple {8884#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {8884#(<= 2 main_~bufferlen~0)} is VALID [2020-07-11 02:32:10,505 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-11 02:32:10,506 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-11 02:32:10,507 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-11 02:32:10,509 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-11 02:32:10,510 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-11 02:32:10,510 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-11 02:32:10,511 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-11 02:32:10,512 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-11 02:32:10,513 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-11 02:32:10,513 INFO L280 TraceCheckUtils]: 24: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,513 INFO L280 TraceCheckUtils]: 25: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,513 INFO L280 TraceCheckUtils]: 26: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,514 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-11 02:32:10,515 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-11 02:32:10,515 INFO L280 TraceCheckUtils]: 29: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,515 INFO L280 TraceCheckUtils]: 30: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,515 INFO L280 TraceCheckUtils]: 31: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,517 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-11 02:32:10,518 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-11 02:32:10,520 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-11 02:32:10,521 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-11 02:32:10,522 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-11 02:32:10,524 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-11 02:32:10,525 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-11 02:32:10,525 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-11 02:32:10,525 INFO L280 TraceCheckUtils]: 40: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,526 INFO L280 TraceCheckUtils]: 41: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,526 INFO L280 TraceCheckUtils]: 42: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,527 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-11 02:32:10,527 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-11 02:32:10,527 INFO L280 TraceCheckUtils]: 45: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,528 INFO L280 TraceCheckUtils]: 46: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,528 INFO L280 TraceCheckUtils]: 47: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,529 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-11 02:32:10,530 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-11 02:32:10,531 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-11 02:32:10,532 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-11 02:32:10,533 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-11 02:32:10,533 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-11 02:32:10,533 INFO L280 TraceCheckUtils]: 54: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,533 INFO L280 TraceCheckUtils]: 55: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,534 INFO L280 TraceCheckUtils]: 56: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,534 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-11 02:32:10,535 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-11 02:32:10,535 INFO L280 TraceCheckUtils]: 59: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,535 INFO L280 TraceCheckUtils]: 60: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,535 INFO L280 TraceCheckUtils]: 61: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,536 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-11 02:32:10,537 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-11 02:32:10,538 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-11 02:32:10,538 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-11 02:32:10,539 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-11 02:32:10,540 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-11 02:32:10,541 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-11 02:32:10,541 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-11 02:32:10,541 INFO L280 TraceCheckUtils]: 70: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,541 INFO L280 TraceCheckUtils]: 71: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,541 INFO L280 TraceCheckUtils]: 72: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,542 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-11 02:32:10,543 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-11 02:32:10,543 INFO L280 TraceCheckUtils]: 75: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,543 INFO L280 TraceCheckUtils]: 76: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,543 INFO L280 TraceCheckUtils]: 77: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,544 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-11 02:32:10,545 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-11 02:32:10,545 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-11 02:32:10,546 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-11 02:32:10,547 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-11 02:32:10,547 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-11 02:32:10,548 INFO L280 TraceCheckUtils]: 84: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,548 INFO L280 TraceCheckUtils]: 85: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,548 INFO L280 TraceCheckUtils]: 86: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,549 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-11 02:32:10,549 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-11 02:32:10,550 INFO L280 TraceCheckUtils]: 89: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,550 INFO L280 TraceCheckUtils]: 90: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,550 INFO L280 TraceCheckUtils]: 91: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,551 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-11 02:32:10,552 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-11 02:32:10,553 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-11 02:32:10,554 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-11 02:32:10,555 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-11 02:32:10,556 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-11 02:32:10,557 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-11 02:32:10,557 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-11 02:32:10,557 INFO L280 TraceCheckUtils]: 100: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,557 INFO L280 TraceCheckUtils]: 101: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,558 INFO L280 TraceCheckUtils]: 102: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,559 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-11 02:32:10,559 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-11 02:32:10,559 INFO L280 TraceCheckUtils]: 105: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,559 INFO L280 TraceCheckUtils]: 106: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,559 INFO L280 TraceCheckUtils]: 107: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,560 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-11 02:32:10,561 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-11 02:32:10,562 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-11 02:32:10,562 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-11 02:32:10,563 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-11 02:32:10,563 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-11 02:32:10,563 INFO L280 TraceCheckUtils]: 114: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,564 INFO L280 TraceCheckUtils]: 115: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,564 INFO L280 TraceCheckUtils]: 116: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,565 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-11 02:32:10,565 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-11 02:32:10,565 INFO L280 TraceCheckUtils]: 119: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,565 INFO L280 TraceCheckUtils]: 120: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,566 INFO L280 TraceCheckUtils]: 121: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,567 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-11 02:32:10,568 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-11 02:32:10,568 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-11 02:32:10,569 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-11 02:32:10,570 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-11 02:32:10,571 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-11 02:32:10,572 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-11 02:32:10,572 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-11 02:32:10,573 INFO L280 TraceCheckUtils]: 130: Hoare triple {8880#true} ~cond := #in~cond; {8880#true} is VALID [2020-07-11 02:32:10,573 INFO L280 TraceCheckUtils]: 131: Hoare triple {8880#true} assume !(0 == ~cond); {8880#true} is VALID [2020-07-11 02:32:10,573 INFO L280 TraceCheckUtils]: 132: Hoare triple {8880#true} assume true; {8880#true} is VALID [2020-07-11 02:32:10,574 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-11 02:32:10,576 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-11 02:32:10,577 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-11 02:32:10,578 INFO L280 TraceCheckUtils]: 136: Hoare triple {8962#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {8881#false} is VALID [2020-07-11 02:32:10,578 INFO L280 TraceCheckUtils]: 137: Hoare triple {8881#false} assume !false; {8881#false} is VALID [2020-07-11 02:32:10,609 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 30 proven. 84 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2020-07-11 02:32:10,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [977204596] [2020-07-11 02:32:10,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:10,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-07-11 02:32:10,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348263722] [2020-07-11 02:32:10,614 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 138 [2020-07-11 02:32:10,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:10,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2020-07-11 02:32:10,751 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-11 02:32:10,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-11 02:32:10,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:10,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-11 02:32:10,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2020-07-11 02:32:10,752 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 21 states. [2020-07-11 02:32:12,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:12,875 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2020-07-11 02:32:12,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-11 02:32:12,875 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 138 [2020-07-11 02:32:12,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:12,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-11 02:32:12,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 55 transitions. [2020-07-11 02:32:12,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-11 02:32:12,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 55 transitions. [2020-07-11 02:32:12,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 55 transitions. [2020-07-11 02:32:12,968 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-11 02:32:12,968 INFO L225 Difference]: With dead ends: 117 [2020-07-11 02:32:12,968 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 02:32:12,970 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=232, Invalid=890, Unknown=0, NotChecked=0, Total=1122 [2020-07-11 02:32:12,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 02:32:12,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 02:32:12,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:12,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:12,974 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:12,974 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:12,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:12,975 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:32:12,975 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:32:12,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:12,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:12,975 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:12,976 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:12,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:12,976 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:32:12,976 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:32:12,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:12,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:12,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:12,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:12,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 02:32:12,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 02:32:12,977 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2020-07-11 02:32:12,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:12,978 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 02:32:12,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-11 02:32:12,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 02:32:12,978 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-11 02:32:12,979 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:32:12,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:12,981 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-11 02:32:12,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 02:32:14,154 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2020-07-11 02:32:14,789 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 26 [2020-07-11 02:32:15,066 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 29 [2020-07-11 02:32:15,659 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 36 [2020-07-11 02:32:15,667 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:32:15,668 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:32:15,668 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:32:15,668 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 02:32:15,668 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 02:32:15,668 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:32:15,668 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:32:15,668 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:32:15,668 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-11 02:32:15,668 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-11 02:32:15,668 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:32:15,669 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-11 02:32:15,669 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 45) the Hoare annotation is: true [2020-07-11 02:32:15,669 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-11 02:32:15,669 INFO L271 CegarLoopResult]: At program point L44(lines 14 45) the Hoare annotation is: true [2020-07-11 02:32:15,670 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-11 02:32:15,670 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-11 02:32:15,671 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-11 02:32:15,671 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-11 02:32:15,671 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-11 02:32:15,671 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-11 02:32:15,672 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-11 02:32:15,672 INFO L271 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-07-11 02:32:15,672 INFO L264 CegarLoopResult]: At program point L20-1(lines 14 45) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2020-07-11 02:32:15,672 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-11 02:32:15,672 INFO L271 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: true [2020-07-11 02:32:15,673 INFO L271 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: true [2020-07-11 02:32:15,673 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-11 02:32:15,673 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-11 02:32:15,673 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-11 02:32:15,673 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-11 02:32:15,673 INFO L264 CegarLoopResult]: At program point L21(lines 14 45) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2020-07-11 02:32:15,674 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-11 02:32:15,674 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-07-11 02:32:15,674 INFO L271 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-07-11 02:32:15,674 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 45) the Hoare annotation is: true [2020-07-11 02:32:15,674 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-07-11 02:32:15,674 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-11 02:32:15,674 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-11 02:32:15,675 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-11 02:32:15,675 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-11 02:32:15,675 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 45) the Hoare annotation is: true [2020-07-11 02:32:15,675 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-11 02:32:15,676 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-11 02:32:15,676 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-11 02:32:15,676 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-11 02:32:15,676 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-11 02:32:15,677 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-11 02:32:15,677 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-11 02:32:15,677 INFO L271 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: true [2020-07-11 02:32:15,677 INFO L271 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: true [2020-07-11 02:32:15,677 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-11 02:32:15,677 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-11 02:32:15,677 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-11 02:32:15,678 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-11 02:32:15,678 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-11 02:32:15,678 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:32:15,678 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-11 02:32:15,678 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-11 02:32:15,678 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:32:15,683 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-11 02:32:15,684 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:32:15,684 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:32:15,685 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-11 02:32:15,685 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-11 02:32:15,722 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-11 02:32:15,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:32:15 BoogieIcfgContainer [2020-07-11 02:32:15,740 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:32:15,743 INFO L168 Benchmark]: Toolchain (without parser) took 34316.82 ms. Allocated memory was 135.3 MB in the beginning and 497.0 MB in the end (delta: 361.8 MB). Free memory was 100.2 MB in the beginning and 400.6 MB in the end (delta: -300.4 MB). Peak memory consumption was 61.4 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:15,743 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 135.3 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-11 02:32:15,744 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.81 ms. Allocated memory is still 135.3 MB. Free memory was 100.0 MB in the beginning and 89.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:15,744 INFO L168 Benchmark]: Boogie Preprocessor took 124.82 ms. Allocated memory was 135.3 MB in the beginning and 199.2 MB in the end (delta: 64.0 MB). Free memory was 89.3 MB in the beginning and 177.9 MB in the end (delta: -88.6 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:15,745 INFO L168 Benchmark]: RCFGBuilder took 587.80 ms. Allocated memory is still 199.2 MB. Free memory was 177.9 MB in the beginning and 151.6 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:15,746 INFO L168 Benchmark]: TraceAbstraction took 33265.80 ms. Allocated memory was 199.2 MB in the beginning and 497.0 MB in the end (delta: 297.8 MB). Free memory was 150.9 MB in the beginning and 400.6 MB in the end (delta: -249.7 MB). Peak memory consumption was 48.1 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:15,748 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.25 ms. Allocated memory is still 135.3 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 329.81 ms. Allocated memory is still 135.3 MB. Free memory was 100.0 MB in the beginning and 89.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.82 ms. Allocated memory was 135.3 MB in the beginning and 199.2 MB in the end (delta: 64.0 MB). Free memory was 89.3 MB in the beginning and 177.9 MB in the end (delta: -88.6 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 587.80 ms. Allocated memory is still 199.2 MB. Free memory was 177.9 MB in the beginning and 151.6 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 33265.80 ms. Allocated memory was 199.2 MB in the beginning and 497.0 MB in the end (delta: 297.8 MB). Free memory was 150.9 MB in the beginning and 400.6 MB in the end (delta: -249.7 MB). Peak memory consumption was 48.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((((buf <= buflim && in + buflim + 3 <= buf + inlen) && 1 <= in) && buflim + 2 <= bufferlen) && 1 <= buf) && bufferlen + 1 <= inlen) || (((((in + bufferlen + 1 <= buf + inlen && buf <= buflim) && 0 <= in) && buflim + 2 <= bufferlen) && bufferlen + 1 <= inlen) && 0 <= buf) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 30.4s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 18.7s, 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.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 460 GetRequests, 239 SyntacticMatches, 1 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 3.8s 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: 3.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 101 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 55 LocationsWithAnnotation, 289 PreInvPairs, 460 NumberOfFragments, 917 HoareAnnotationTreeSize, 289 FomulaSimplifications, 48443 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 55 FomulaSimplificationsInter, 3846 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1034 NumberOfCodeBlocks, 1034 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1018 ConstructedInterpolants, 0 QuantifiedInterpolants, 264896 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 1508/1684 InterpolantCoveringCapability, 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...