/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:51:11,787 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:51:11,789 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:51:11,802 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:51:11,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:51:11,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:51:11,804 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:51:11,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:51:11,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:51:11,809 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:51:11,810 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:51:11,811 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:51:11,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:51:11,813 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:51:11,814 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:51:11,816 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:51:11,816 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:51:11,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:51:11,819 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:51:11,821 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:51:11,822 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:51:11,823 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:51:11,824 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:51:11,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:51:11,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:51:11,828 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:51:11,828 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:51:11,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:51:11,829 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:51:11,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:51:11,831 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:51:11,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:51:11,832 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:51:11,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:51:11,834 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:51:11,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:51:11,835 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:51:11,835 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:51:11,835 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:51:11,836 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:51:11,837 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:51:11,838 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:51:11,852 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:51:11,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:51:11,853 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:51:11,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:51:11,854 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:51:11,854 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:51:11,854 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:51:11,855 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:51:11,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:51:11,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:51:11,855 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:51:11,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:51:11,856 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:51:11,856 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:51:11,856 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:51:11,856 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:51:11,856 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:51:11,857 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:51:11,857 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:51:11,857 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:51:11,857 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:51:11,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:51:11,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:51:11,858 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:51:11,858 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:51:11,858 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:51:11,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:51:11,858 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:51:11,859 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:51:11,859 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:51:12,169 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:51:12,181 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:51:12,185 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:51:12,186 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:51:12,187 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:51:12,187 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2020-07-17 22:51:12,262 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dc3526ed/c06beb13e3ad4a8381ddef9ed2c90c11/FLAG90fa76433 [2020-07-17 22:51:12,751 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:51:12,751 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2020-07-17 22:51:12,758 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dc3526ed/c06beb13e3ad4a8381ddef9ed2c90c11/FLAG90fa76433 [2020-07-17 22:51:13,097 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dc3526ed/c06beb13e3ad4a8381ddef9ed2c90c11 [2020-07-17 22:51:13,106 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:51:13,108 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:51:13,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:51:13,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:51:13,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:51:13,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:51:13" (1/1) ... [2020-07-17 22:51:13,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6083abca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:13, skipping insertion in model container [2020-07-17 22:51:13,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:51:13" (1/1) ... [2020-07-17 22:51:13,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:51:13,148 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:51:13,353 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:51:13,358 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:51:13,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:51:13,398 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:51:13,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:13 WrapperNode [2020-07-17 22:51:13,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:51:13,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:51:13,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:51:13,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:51:13,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:13" (1/1) ... [2020-07-17 22:51:13,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:13" (1/1) ... [2020-07-17 22:51:13,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:13" (1/1) ... [2020-07-17 22:51:13,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:13" (1/1) ... [2020-07-17 22:51:13,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:13" (1/1) ... [2020-07-17 22:51:13,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:13" (1/1) ... [2020-07-17 22:51:13,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:13" (1/1) ... [2020-07-17 22:51:13,529 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:51:13,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:51:13,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:51:13,530 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:51:13,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:13" (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-17 22:51:13,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:51:13,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:51:13,596 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:51:13,596 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:51:13,596 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:51:13,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:51:13,596 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:51:13,597 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:51:13,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:51:13,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:51:13,597 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:51:13,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:51:13,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:51:14,062 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:51:14,062 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-17 22:51:14,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:51:14 BoogieIcfgContainer [2020-07-17 22:51:14,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:51:14,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:51:14,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:51:14,071 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:51:14,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:51:13" (1/3) ... [2020-07-17 22:51:14,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69726190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:51:14, skipping insertion in model container [2020-07-17 22:51:14,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:13" (2/3) ... [2020-07-17 22:51:14,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69726190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:51:14, skipping insertion in model container [2020-07-17 22:51:14,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:51:14" (3/3) ... [2020-07-17 22:51:14,075 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2020-07-17 22:51:14,086 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:51:14,092 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:51:14,105 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:51:14,129 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:51:14,130 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:51:14,130 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:51:14,130 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:51:14,130 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:51:14,130 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:51:14,131 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:51:14,131 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:51:14,151 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2020-07-17 22:51:14,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:51:14,157 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:14,158 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:14,158 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:14,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:14,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1128800291, now seen corresponding path program 1 times [2020-07-17 22:51:14,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:14,172 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272848155] [2020-07-17 22:51:14,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:14,405 INFO L280 TraceCheckUtils]: 0: Hoare triple {45#true} assume true; {45#true} is VALID [2020-07-17 22:51:14,406 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {45#true} {45#true} #86#return; {45#true} is VALID [2020-07-17 22:51:14,408 INFO L263 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2020-07-17 22:51:14,409 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#true} assume true; {45#true} is VALID [2020-07-17 22:51:14,409 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {45#true} {45#true} #86#return; {45#true} is VALID [2020-07-17 22:51:14,410 INFO L263 TraceCheckUtils]: 3: Hoare triple {45#true} call #t~ret10 := main(); {45#true} is VALID [2020-07-17 22:51:14,410 INFO L280 TraceCheckUtils]: 4: Hoare triple {45#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~bufsize~0 := #t~nondet0;havoc #t~nondet0; {45#true} is VALID [2020-07-17 22:51:14,411 INFO L280 TraceCheckUtils]: 5: Hoare triple {45#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~len~0 := #t~nondet1;havoc #t~nondet1;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {45#true} is VALID [2020-07-17 22:51:14,411 INFO L280 TraceCheckUtils]: 6: Hoare triple {45#true} assume !!(~i~0 < ~len~0);~j~0 := 0; {45#true} is VALID [2020-07-17 22:51:14,411 INFO L280 TraceCheckUtils]: 7: Hoare triple {45#true} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {45#true} is VALID [2020-07-17 22:51:14,413 INFO L280 TraceCheckUtils]: 8: Hoare triple {45#true} assume 1 + ~i~0 < ~len~0; {49#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-17 22:51:14,416 INFO L263 TraceCheckUtils]: 9: Hoare triple {49#(<= (+ main_~i~0 2) main_~len~0)} call __VERIFIER_assert((if 1 + ~i~0 < ~len~0 then 1 else 0)); {50#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:14,417 INFO L280 TraceCheckUtils]: 10: Hoare triple {50#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {51#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:14,418 INFO L280 TraceCheckUtils]: 11: Hoare triple {51#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {46#false} is VALID [2020-07-17 22:51:14,419 INFO L280 TraceCheckUtils]: 12: Hoare triple {46#false} assume !false; {46#false} is VALID [2020-07-17 22:51:14,421 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-17 22:51:14,422 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272848155] [2020-07-17 22:51:14,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:14,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:51:14,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629836508] [2020-07-17 22:51:14,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:51:14,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:14,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:51:14,492 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:14,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:51:14,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:14,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:51:14,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:51:14,505 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 5 states. [2020-07-17 22:51:15,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:15,100 INFO L93 Difference]: Finished difference Result 87 states and 154 transitions. [2020-07-17 22:51:15,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:51:15,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:51:15,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:15,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:15,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2020-07-17 22:51:15,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:15,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2020-07-17 22:51:15,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 154 transitions. [2020-07-17 22:51:15,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:15,410 INFO L225 Difference]: With dead ends: 87 [2020-07-17 22:51:15,410 INFO L226 Difference]: Without dead ends: 46 [2020-07-17 22:51:15,417 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-17 22:51:15,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-17 22:51:15,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2020-07-17 22:51:15,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:15,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 42 states. [2020-07-17 22:51:15,473 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 42 states. [2020-07-17 22:51:15,473 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 42 states. [2020-07-17 22:51:15,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:15,482 INFO L93 Difference]: Finished difference Result 46 states and 67 transitions. [2020-07-17 22:51:15,482 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2020-07-17 22:51:15,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:15,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:15,485 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 46 states. [2020-07-17 22:51:15,485 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 46 states. [2020-07-17 22:51:15,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:15,499 INFO L93 Difference]: Finished difference Result 46 states and 67 transitions. [2020-07-17 22:51:15,499 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2020-07-17 22:51:15,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:15,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:15,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:15,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:15,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-17 22:51:15,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2020-07-17 22:51:15,516 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 13 [2020-07-17 22:51:15,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:15,517 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2020-07-17 22:51:15,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:51:15,519 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2020-07-17 22:51:15,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:51:15,520 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:15,522 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:15,523 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:51:15,523 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:15,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:15,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1106844324, now seen corresponding path program 1 times [2020-07-17 22:51:15,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:15,524 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843053511] [2020-07-17 22:51:15,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:15,646 INFO L280 TraceCheckUtils]: 0: Hoare triple {349#true} assume true; {349#true} is VALID [2020-07-17 22:51:15,647 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {349#true} {349#true} #86#return; {349#true} is VALID [2020-07-17 22:51:15,647 INFO L263 TraceCheckUtils]: 0: Hoare triple {349#true} call ULTIMATE.init(); {349#true} is VALID [2020-07-17 22:51:15,647 INFO L280 TraceCheckUtils]: 1: Hoare triple {349#true} assume true; {349#true} is VALID [2020-07-17 22:51:15,648 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {349#true} {349#true} #86#return; {349#true} is VALID [2020-07-17 22:51:15,648 INFO L263 TraceCheckUtils]: 3: Hoare triple {349#true} call #t~ret10 := main(); {349#true} is VALID [2020-07-17 22:51:15,648 INFO L280 TraceCheckUtils]: 4: Hoare triple {349#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~bufsize~0 := #t~nondet0;havoc #t~nondet0; {349#true} is VALID [2020-07-17 22:51:15,649 INFO L280 TraceCheckUtils]: 5: Hoare triple {349#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~len~0 := #t~nondet1;havoc #t~nondet1;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {349#true} is VALID [2020-07-17 22:51:15,650 INFO L280 TraceCheckUtils]: 6: Hoare triple {349#true} assume !!(~i~0 < ~len~0);~j~0 := 0; {353#(<= (+ main_~i~0 1) main_~len~0)} is VALID [2020-07-17 22:51:15,651 INFO L280 TraceCheckUtils]: 7: Hoare triple {353#(<= (+ main_~i~0 1) main_~len~0)} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {353#(<= (+ main_~i~0 1) main_~len~0)} is VALID [2020-07-17 22:51:15,651 INFO L280 TraceCheckUtils]: 8: Hoare triple {353#(<= (+ main_~i~0 1) main_~len~0)} assume !(1 + ~i~0 < ~len~0); {353#(<= (+ main_~i~0 1) main_~len~0)} is VALID [2020-07-17 22:51:15,653 INFO L263 TraceCheckUtils]: 9: Hoare triple {353#(<= (+ main_~i~0 1) main_~len~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {354#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:15,654 INFO L280 TraceCheckUtils]: 10: Hoare triple {354#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {355#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:15,655 INFO L280 TraceCheckUtils]: 11: Hoare triple {355#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {350#false} is VALID [2020-07-17 22:51:15,656 INFO L280 TraceCheckUtils]: 12: Hoare triple {350#false} assume !false; {350#false} is VALID [2020-07-17 22:51:15,657 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-17 22:51:15,657 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843053511] [2020-07-17 22:51:15,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:15,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:51:15,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041639497] [2020-07-17 22:51:15,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:51:15,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:15,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:51:15,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:15,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:51:15,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:15,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:51:15,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:51:15,679 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand 5 states. [2020-07-17 22:51:16,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:16,073 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2020-07-17 22:51:16,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:51:16,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:51:16,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:16,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:16,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-17 22:51:16,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:16,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-17 22:51:16,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2020-07-17 22:51:16,167 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:16,170 INFO L225 Difference]: With dead ends: 54 [2020-07-17 22:51:16,171 INFO L226 Difference]: Without dead ends: 52 [2020-07-17 22:51:16,172 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-17 22:51:16,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-17 22:51:16,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2020-07-17 22:51:16,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:16,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 50 states. [2020-07-17 22:51:16,204 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 50 states. [2020-07-17 22:51:16,204 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 50 states. [2020-07-17 22:51:16,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:16,209 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2020-07-17 22:51:16,209 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2020-07-17 22:51:16,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:16,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:16,211 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 52 states. [2020-07-17 22:51:16,211 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 52 states. [2020-07-17 22:51:16,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:16,217 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2020-07-17 22:51:16,217 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2020-07-17 22:51:16,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:16,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:16,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:16,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:16,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-17 22:51:16,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2020-07-17 22:51:16,223 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 13 [2020-07-17 22:51:16,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:16,223 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2020-07-17 22:51:16,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:51:16,224 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2020-07-17 22:51:16,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 22:51:16,224 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:16,225 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:16,225 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:51:16,225 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:16,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:16,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1247762898, now seen corresponding path program 1 times [2020-07-17 22:51:16,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:16,226 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393895687] [2020-07-17 22:51:16,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:16,297 INFO L280 TraceCheckUtils]: 0: Hoare triple {624#true} assume true; {624#true} is VALID [2020-07-17 22:51:16,297 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {624#true} {624#true} #86#return; {624#true} is VALID [2020-07-17 22:51:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:16,306 INFO L280 TraceCheckUtils]: 0: Hoare triple {624#true} ~cond := #in~cond; {624#true} is VALID [2020-07-17 22:51:16,307 INFO L280 TraceCheckUtils]: 1: Hoare triple {624#true} assume !(0 == ~cond); {624#true} is VALID [2020-07-17 22:51:16,307 INFO L280 TraceCheckUtils]: 2: Hoare triple {624#true} assume true; {624#true} is VALID [2020-07-17 22:51:16,308 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {624#true} {628#(<= 0 main_~i~0)} #90#return; {628#(<= 0 main_~i~0)} is VALID [2020-07-17 22:51:16,309 INFO L263 TraceCheckUtils]: 0: Hoare triple {624#true} call ULTIMATE.init(); {624#true} is VALID [2020-07-17 22:51:16,309 INFO L280 TraceCheckUtils]: 1: Hoare triple {624#true} assume true; {624#true} is VALID [2020-07-17 22:51:16,310 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {624#true} {624#true} #86#return; {624#true} is VALID [2020-07-17 22:51:16,310 INFO L263 TraceCheckUtils]: 3: Hoare triple {624#true} call #t~ret10 := main(); {624#true} is VALID [2020-07-17 22:51:16,310 INFO L280 TraceCheckUtils]: 4: Hoare triple {624#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~bufsize~0 := #t~nondet0;havoc #t~nondet0; {624#true} is VALID [2020-07-17 22:51:16,311 INFO L280 TraceCheckUtils]: 5: Hoare triple {624#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~len~0 := #t~nondet1;havoc #t~nondet1;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {628#(<= 0 main_~i~0)} is VALID [2020-07-17 22:51:16,312 INFO L280 TraceCheckUtils]: 6: Hoare triple {628#(<= 0 main_~i~0)} assume !!(~i~0 < ~len~0);~j~0 := 0; {628#(<= 0 main_~i~0)} is VALID [2020-07-17 22:51:16,313 INFO L280 TraceCheckUtils]: 7: Hoare triple {628#(<= 0 main_~i~0)} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {628#(<= 0 main_~i~0)} is VALID [2020-07-17 22:51:16,314 INFO L280 TraceCheckUtils]: 8: Hoare triple {628#(<= 0 main_~i~0)} assume 1 + ~i~0 < ~len~0; {628#(<= 0 main_~i~0)} is VALID [2020-07-17 22:51:16,314 INFO L263 TraceCheckUtils]: 9: Hoare triple {628#(<= 0 main_~i~0)} call __VERIFIER_assert((if 1 + ~i~0 < ~len~0 then 1 else 0)); {624#true} is VALID [2020-07-17 22:51:16,314 INFO L280 TraceCheckUtils]: 10: Hoare triple {624#true} ~cond := #in~cond; {624#true} is VALID [2020-07-17 22:51:16,315 INFO L280 TraceCheckUtils]: 11: Hoare triple {624#true} assume !(0 == ~cond); {624#true} is VALID [2020-07-17 22:51:16,315 INFO L280 TraceCheckUtils]: 12: Hoare triple {624#true} assume true; {624#true} is VALID [2020-07-17 22:51:16,316 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {624#true} {628#(<= 0 main_~i~0)} #90#return; {628#(<= 0 main_~i~0)} is VALID [2020-07-17 22:51:16,317 INFO L263 TraceCheckUtils]: 14: Hoare triple {628#(<= 0 main_~i~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {633#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:16,318 INFO L280 TraceCheckUtils]: 15: Hoare triple {633#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {634#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:16,319 INFO L280 TraceCheckUtils]: 16: Hoare triple {634#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {625#false} is VALID [2020-07-17 22:51:16,319 INFO L280 TraceCheckUtils]: 17: Hoare triple {625#false} assume !false; {625#false} is VALID [2020-07-17 22:51:16,320 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-17 22:51:16,321 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393895687] [2020-07-17 22:51:16,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:16,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:51:16,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711030827] [2020-07-17 22:51:16,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-17 22:51:16,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:16,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:51:16,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:16,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:51:16,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:16,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:51:16,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:51:16,345 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand 5 states. [2020-07-17 22:51:16,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:16,731 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2020-07-17 22:51:16,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:51:16,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-17 22:51:16,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:16,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:16,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2020-07-17 22:51:16,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2020-07-17 22:51:16,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 60 transitions. [2020-07-17 22:51:16,816 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-17 22:51:16,819 INFO L225 Difference]: With dead ends: 56 [2020-07-17 22:51:16,820 INFO L226 Difference]: Without dead ends: 54 [2020-07-17 22:51:16,820 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:51:16,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-17 22:51:16,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-07-17 22:51:16,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:16,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2020-07-17 22:51:16,857 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2020-07-17 22:51:16,857 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2020-07-17 22:51:16,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:16,861 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2020-07-17 22:51:16,861 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2020-07-17 22:51:16,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:16,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:16,863 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2020-07-17 22:51:16,863 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2020-07-17 22:51:16,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:16,867 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2020-07-17 22:51:16,867 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2020-07-17 22:51:16,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:16,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:16,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:16,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:16,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-17 22:51:16,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2020-07-17 22:51:16,872 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 18 [2020-07-17 22:51:16,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:16,872 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2020-07-17 22:51:16,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:51:16,873 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2020-07-17 22:51:16,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:51:16,874 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:16,874 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:16,874 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:51:16,874 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:16,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:16,875 INFO L82 PathProgramCache]: Analyzing trace with hash -2050697988, now seen corresponding path program 1 times [2020-07-17 22:51:16,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:16,875 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187760475] [2020-07-17 22:51:16,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:17,027 INFO L280 TraceCheckUtils]: 0: Hoare triple {913#true} assume true; {913#true} is VALID [2020-07-17 22:51:17,028 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {913#true} {913#true} #86#return; {913#true} is VALID [2020-07-17 22:51:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:17,036 INFO L280 TraceCheckUtils]: 0: Hoare triple {913#true} ~cond := #in~cond; {913#true} is VALID [2020-07-17 22:51:17,036 INFO L280 TraceCheckUtils]: 1: Hoare triple {913#true} assume !(0 == ~cond); {913#true} is VALID [2020-07-17 22:51:17,037 INFO L280 TraceCheckUtils]: 2: Hoare triple {913#true} assume true; {913#true} is VALID [2020-07-17 22:51:17,038 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {913#true} {918#(< main_~j~0 main_~bufsize~0)} #114#return; {918#(< main_~j~0 main_~bufsize~0)} is VALID [2020-07-17 22:51:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:17,045 INFO L280 TraceCheckUtils]: 0: Hoare triple {913#true} ~cond := #in~cond; {913#true} is VALID [2020-07-17 22:51:17,046 INFO L280 TraceCheckUtils]: 1: Hoare triple {913#true} assume !(0 == ~cond); {913#true} is VALID [2020-07-17 22:51:17,046 INFO L280 TraceCheckUtils]: 2: Hoare triple {913#true} assume true; {913#true} is VALID [2020-07-17 22:51:17,047 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {913#true} {918#(< main_~j~0 main_~bufsize~0)} #116#return; {918#(< main_~j~0 main_~bufsize~0)} is VALID [2020-07-17 22:51:17,048 INFO L263 TraceCheckUtils]: 0: Hoare triple {913#true} call ULTIMATE.init(); {913#true} is VALID [2020-07-17 22:51:17,048 INFO L280 TraceCheckUtils]: 1: Hoare triple {913#true} assume true; {913#true} is VALID [2020-07-17 22:51:17,049 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {913#true} {913#true} #86#return; {913#true} is VALID [2020-07-17 22:51:17,049 INFO L263 TraceCheckUtils]: 3: Hoare triple {913#true} call #t~ret10 := main(); {913#true} is VALID [2020-07-17 22:51:17,049 INFO L280 TraceCheckUtils]: 4: Hoare triple {913#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~bufsize~0 := #t~nondet0;havoc #t~nondet0; {913#true} is VALID [2020-07-17 22:51:17,051 INFO L280 TraceCheckUtils]: 5: Hoare triple {913#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~len~0 := #t~nondet1;havoc #t~nondet1;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {917#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2020-07-17 22:51:17,052 INFO L280 TraceCheckUtils]: 6: Hoare triple {917#(<= (+ main_~limit~0 4) main_~bufsize~0)} assume !!(~i~0 < ~len~0);~j~0 := 0; {917#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2020-07-17 22:51:17,053 INFO L280 TraceCheckUtils]: 7: Hoare triple {917#(<= (+ main_~limit~0 4) main_~bufsize~0)} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {918#(< main_~j~0 main_~bufsize~0)} is VALID [2020-07-17 22:51:17,054 INFO L280 TraceCheckUtils]: 8: Hoare triple {918#(< main_~j~0 main_~bufsize~0)} assume !(1 + ~i~0 < ~len~0); {918#(< main_~j~0 main_~bufsize~0)} is VALID [2020-07-17 22:51:17,054 INFO L263 TraceCheckUtils]: 9: Hoare triple {918#(< main_~j~0 main_~bufsize~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {913#true} is VALID [2020-07-17 22:51:17,054 INFO L280 TraceCheckUtils]: 10: Hoare triple {913#true} ~cond := #in~cond; {913#true} is VALID [2020-07-17 22:51:17,055 INFO L280 TraceCheckUtils]: 11: Hoare triple {913#true} assume !(0 == ~cond); {913#true} is VALID [2020-07-17 22:51:17,055 INFO L280 TraceCheckUtils]: 12: Hoare triple {913#true} assume true; {913#true} is VALID [2020-07-17 22:51:17,056 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {913#true} {918#(< main_~j~0 main_~bufsize~0)} #114#return; {918#(< main_~j~0 main_~bufsize~0)} is VALID [2020-07-17 22:51:17,057 INFO L263 TraceCheckUtils]: 14: Hoare triple {918#(< main_~j~0 main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {913#true} is VALID [2020-07-17 22:51:17,057 INFO L280 TraceCheckUtils]: 15: Hoare triple {913#true} ~cond := #in~cond; {913#true} is VALID [2020-07-17 22:51:17,057 INFO L280 TraceCheckUtils]: 16: Hoare triple {913#true} assume !(0 == ~cond); {913#true} is VALID [2020-07-17 22:51:17,058 INFO L280 TraceCheckUtils]: 17: Hoare triple {913#true} assume true; {913#true} is VALID [2020-07-17 22:51:17,059 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {913#true} {918#(< main_~j~0 main_~bufsize~0)} #116#return; {918#(< main_~j~0 main_~bufsize~0)} is VALID [2020-07-17 22:51:17,061 INFO L263 TraceCheckUtils]: 19: Hoare triple {918#(< main_~j~0 main_~bufsize~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {927#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:17,062 INFO L280 TraceCheckUtils]: 20: Hoare triple {927#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {928#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:17,062 INFO L280 TraceCheckUtils]: 21: Hoare triple {928#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {914#false} is VALID [2020-07-17 22:51:17,063 INFO L280 TraceCheckUtils]: 22: Hoare triple {914#false} assume !false; {914#false} is VALID [2020-07-17 22:51:17,064 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-17 22:51:17,064 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187760475] [2020-07-17 22:51:17,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:17,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:51:17,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621992018] [2020-07-17 22:51:17,066 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-17 22:51:17,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:17,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:51:17,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:17,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:51:17,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:17,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:51:17,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:51:17,104 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand 6 states. [2020-07-17 22:51:17,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:17,642 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2020-07-17 22:51:17,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:51:17,642 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-17 22:51:17,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:17,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:17,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2020-07-17 22:51:17,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:17,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2020-07-17 22:51:17,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2020-07-17 22:51:17,728 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-17 22:51:17,734 INFO L225 Difference]: With dead ends: 60 [2020-07-17 22:51:17,734 INFO L226 Difference]: Without dead ends: 58 [2020-07-17 22:51:17,735 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 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-17 22:51:17,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-17 22:51:17,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-07-17 22:51:17,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:17,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2020-07-17 22:51:17,807 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2020-07-17 22:51:17,807 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2020-07-17 22:51:17,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:17,811 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2020-07-17 22:51:17,812 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2020-07-17 22:51:17,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:17,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:17,813 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2020-07-17 22:51:17,813 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2020-07-17 22:51:17,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:17,817 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2020-07-17 22:51:17,817 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2020-07-17 22:51:17,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:17,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:17,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:17,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:17,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-17 22:51:17,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2020-07-17 22:51:17,822 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 23 [2020-07-17 22:51:17,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:17,822 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2020-07-17 22:51:17,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:51:17,822 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2020-07-17 22:51:17,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:51:17,823 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:17,824 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] [2020-07-17 22:51:17,824 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:51:17,824 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:17,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:17,824 INFO L82 PathProgramCache]: Analyzing trace with hash -35497745, now seen corresponding path program 1 times [2020-07-17 22:51:17,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:17,825 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512638694] [2020-07-17 22:51:17,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:17,884 INFO L280 TraceCheckUtils]: 0: Hoare triple {1227#true} assume true; {1227#true} is VALID [2020-07-17 22:51:17,884 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1227#true} {1227#true} #86#return; {1227#true} is VALID [2020-07-17 22:51:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:17,890 INFO L280 TraceCheckUtils]: 0: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2020-07-17 22:51:17,891 INFO L280 TraceCheckUtils]: 1: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2020-07-17 22:51:17,891 INFO L280 TraceCheckUtils]: 2: Hoare triple {1227#true} assume true; {1227#true} is VALID [2020-07-17 22:51:17,892 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1227#true} {1231#(<= 0 main_~j~0)} #114#return; {1231#(<= 0 main_~j~0)} is VALID [2020-07-17 22:51:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:17,898 INFO L280 TraceCheckUtils]: 0: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2020-07-17 22:51:17,899 INFO L280 TraceCheckUtils]: 1: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2020-07-17 22:51:17,899 INFO L280 TraceCheckUtils]: 2: Hoare triple {1227#true} assume true; {1227#true} is VALID [2020-07-17 22:51:17,900 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1227#true} {1231#(<= 0 main_~j~0)} #116#return; {1231#(<= 0 main_~j~0)} is VALID [2020-07-17 22:51:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:17,907 INFO L280 TraceCheckUtils]: 0: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2020-07-17 22:51:17,908 INFO L280 TraceCheckUtils]: 1: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2020-07-17 22:51:17,908 INFO L280 TraceCheckUtils]: 2: Hoare triple {1227#true} assume true; {1227#true} is VALID [2020-07-17 22:51:17,909 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1227#true} {1231#(<= 0 main_~j~0)} #118#return; {1231#(<= 0 main_~j~0)} is VALID [2020-07-17 22:51:17,910 INFO L263 TraceCheckUtils]: 0: Hoare triple {1227#true} call ULTIMATE.init(); {1227#true} is VALID [2020-07-17 22:51:17,910 INFO L280 TraceCheckUtils]: 1: Hoare triple {1227#true} assume true; {1227#true} is VALID [2020-07-17 22:51:17,910 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1227#true} {1227#true} #86#return; {1227#true} is VALID [2020-07-17 22:51:17,911 INFO L263 TraceCheckUtils]: 3: Hoare triple {1227#true} call #t~ret10 := main(); {1227#true} is VALID [2020-07-17 22:51:17,911 INFO L280 TraceCheckUtils]: 4: Hoare triple {1227#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~bufsize~0 := #t~nondet0;havoc #t~nondet0; {1227#true} is VALID [2020-07-17 22:51:17,911 INFO L280 TraceCheckUtils]: 5: Hoare triple {1227#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~len~0 := #t~nondet1;havoc #t~nondet1;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {1227#true} is VALID [2020-07-17 22:51:17,912 INFO L280 TraceCheckUtils]: 6: Hoare triple {1227#true} assume !!(~i~0 < ~len~0);~j~0 := 0; {1231#(<= 0 main_~j~0)} is VALID [2020-07-17 22:51:17,913 INFO L280 TraceCheckUtils]: 7: Hoare triple {1231#(<= 0 main_~j~0)} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {1231#(<= 0 main_~j~0)} is VALID [2020-07-17 22:51:17,913 INFO L280 TraceCheckUtils]: 8: Hoare triple {1231#(<= 0 main_~j~0)} assume !(1 + ~i~0 < ~len~0); {1231#(<= 0 main_~j~0)} is VALID [2020-07-17 22:51:17,914 INFO L263 TraceCheckUtils]: 9: Hoare triple {1231#(<= 0 main_~j~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {1227#true} is VALID [2020-07-17 22:51:17,914 INFO L280 TraceCheckUtils]: 10: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2020-07-17 22:51:17,914 INFO L280 TraceCheckUtils]: 11: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2020-07-17 22:51:17,914 INFO L280 TraceCheckUtils]: 12: Hoare triple {1227#true} assume true; {1227#true} is VALID [2020-07-17 22:51:17,915 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1227#true} {1231#(<= 0 main_~j~0)} #114#return; {1231#(<= 0 main_~j~0)} is VALID [2020-07-17 22:51:17,916 INFO L263 TraceCheckUtils]: 14: Hoare triple {1231#(<= 0 main_~j~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {1227#true} is VALID [2020-07-17 22:51:17,916 INFO L280 TraceCheckUtils]: 15: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2020-07-17 22:51:17,916 INFO L280 TraceCheckUtils]: 16: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2020-07-17 22:51:17,917 INFO L280 TraceCheckUtils]: 17: Hoare triple {1227#true} assume true; {1227#true} is VALID [2020-07-17 22:51:17,918 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1227#true} {1231#(<= 0 main_~j~0)} #116#return; {1231#(<= 0 main_~j~0)} is VALID [2020-07-17 22:51:17,918 INFO L263 TraceCheckUtils]: 19: Hoare triple {1231#(<= 0 main_~j~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {1227#true} is VALID [2020-07-17 22:51:17,918 INFO L280 TraceCheckUtils]: 20: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2020-07-17 22:51:17,919 INFO L280 TraceCheckUtils]: 21: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2020-07-17 22:51:17,919 INFO L280 TraceCheckUtils]: 22: Hoare triple {1227#true} assume true; {1227#true} is VALID [2020-07-17 22:51:17,920 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1227#true} {1231#(<= 0 main_~j~0)} #118#return; {1231#(<= 0 main_~j~0)} is VALID [2020-07-17 22:51:17,921 INFO L263 TraceCheckUtils]: 24: Hoare triple {1231#(<= 0 main_~j~0)} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {1244#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:17,922 INFO L280 TraceCheckUtils]: 25: Hoare triple {1244#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1245#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:17,923 INFO L280 TraceCheckUtils]: 26: Hoare triple {1245#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1228#false} is VALID [2020-07-17 22:51:17,923 INFO L280 TraceCheckUtils]: 27: Hoare triple {1228#false} assume !false; {1228#false} is VALID [2020-07-17 22:51:17,925 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-17 22:51:17,925 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512638694] [2020-07-17 22:51:17,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:17,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:51:17,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904876812] [2020-07-17 22:51:17,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-07-17 22:51:17,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:17,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:51:17,950 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:17,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:51:17,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:17,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:51:17,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:51:17,951 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 5 states. [2020-07-17 22:51:18,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:18,346 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2020-07-17 22:51:18,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:51:18,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-07-17 22:51:18,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:18,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:18,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2020-07-17 22:51:18,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:18,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2020-07-17 22:51:18,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 61 transitions. [2020-07-17 22:51:18,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:18,465 INFO L225 Difference]: With dead ends: 65 [2020-07-17 22:51:18,465 INFO L226 Difference]: Without dead ends: 63 [2020-07-17 22:51:18,466 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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-17 22:51:18,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-17 22:51:18,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2020-07-17 22:51:18,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:18,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 62 states. [2020-07-17 22:51:18,537 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 62 states. [2020-07-17 22:51:18,537 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 62 states. [2020-07-17 22:51:18,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:18,541 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2020-07-17 22:51:18,541 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2020-07-17 22:51:18,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:18,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:18,542 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 63 states. [2020-07-17 22:51:18,543 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 63 states. [2020-07-17 22:51:18,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:18,547 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2020-07-17 22:51:18,547 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2020-07-17 22:51:18,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:18,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:18,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:18,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:18,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-17 22:51:18,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2020-07-17 22:51:18,552 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 28 [2020-07-17 22:51:18,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:18,553 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2020-07-17 22:51:18,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:51:18,553 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2020-07-17 22:51:18,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-17 22:51:18,554 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:18,555 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 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-17 22:51:18,555 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 22:51:18,555 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:18,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:18,556 INFO L82 PathProgramCache]: Analyzing trace with hash 663071772, now seen corresponding path program 1 times [2020-07-17 22:51:18,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:18,556 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906177219] [2020-07-17 22:51:18,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:18,664 INFO L280 TraceCheckUtils]: 0: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-17 22:51:18,664 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1564#true} {1564#true} #86#return; {1564#true} is VALID [2020-07-17 22:51:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:18,679 INFO L280 TraceCheckUtils]: 0: Hoare triple {1564#true} ~cond := #in~cond; {1564#true} is VALID [2020-07-17 22:51:18,679 INFO L280 TraceCheckUtils]: 1: Hoare triple {1564#true} assume !(0 == ~cond); {1564#true} is VALID [2020-07-17 22:51:18,679 INFO L280 TraceCheckUtils]: 2: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-17 22:51:18,680 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1564#true} {1568#(<= (+ main_~i~0 2) main_~len~0)} #90#return; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-17 22:51:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:18,688 INFO L280 TraceCheckUtils]: 0: Hoare triple {1564#true} ~cond := #in~cond; {1564#true} is VALID [2020-07-17 22:51:18,689 INFO L280 TraceCheckUtils]: 1: Hoare triple {1564#true} assume !(0 == ~cond); {1564#true} is VALID [2020-07-17 22:51:18,689 INFO L280 TraceCheckUtils]: 2: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-17 22:51:18,690 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1564#true} {1568#(<= (+ main_~i~0 2) main_~len~0)} #92#return; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-17 22:51:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:18,697 INFO L280 TraceCheckUtils]: 0: Hoare triple {1564#true} ~cond := #in~cond; {1564#true} is VALID [2020-07-17 22:51:18,698 INFO L280 TraceCheckUtils]: 1: Hoare triple {1564#true} assume !(0 == ~cond); {1564#true} is VALID [2020-07-17 22:51:18,698 INFO L280 TraceCheckUtils]: 2: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-17 22:51:18,699 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1564#true} {1568#(<= (+ main_~i~0 2) main_~len~0)} #94#return; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-17 22:51:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:18,719 INFO L280 TraceCheckUtils]: 0: Hoare triple {1564#true} ~cond := #in~cond; {1564#true} is VALID [2020-07-17 22:51:18,719 INFO L280 TraceCheckUtils]: 1: Hoare triple {1564#true} assume !(0 == ~cond); {1564#true} is VALID [2020-07-17 22:51:18,720 INFO L280 TraceCheckUtils]: 2: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-17 22:51:18,720 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1564#true} {1568#(<= (+ main_~i~0 2) main_~len~0)} #96#return; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-17 22:51:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:18,727 INFO L280 TraceCheckUtils]: 0: Hoare triple {1564#true} ~cond := #in~cond; {1564#true} is VALID [2020-07-17 22:51:18,727 INFO L280 TraceCheckUtils]: 1: Hoare triple {1564#true} assume !(0 == ~cond); {1564#true} is VALID [2020-07-17 22:51:18,728 INFO L280 TraceCheckUtils]: 2: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-17 22:51:18,729 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1564#true} {1568#(<= (+ main_~i~0 2) main_~len~0)} #98#return; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-17 22:51:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:18,734 INFO L280 TraceCheckUtils]: 0: Hoare triple {1564#true} ~cond := #in~cond; {1564#true} is VALID [2020-07-17 22:51:18,735 INFO L280 TraceCheckUtils]: 1: Hoare triple {1564#true} assume !(0 == ~cond); {1564#true} is VALID [2020-07-17 22:51:18,735 INFO L280 TraceCheckUtils]: 2: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-17 22:51:18,736 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1564#true} {1568#(<= (+ main_~i~0 2) main_~len~0)} #100#return; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-17 22:51:18,737 INFO L263 TraceCheckUtils]: 0: Hoare triple {1564#true} call ULTIMATE.init(); {1564#true} is VALID [2020-07-17 22:51:18,737 INFO L280 TraceCheckUtils]: 1: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-17 22:51:18,737 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1564#true} {1564#true} #86#return; {1564#true} is VALID [2020-07-17 22:51:18,737 INFO L263 TraceCheckUtils]: 3: Hoare triple {1564#true} call #t~ret10 := main(); {1564#true} is VALID [2020-07-17 22:51:18,738 INFO L280 TraceCheckUtils]: 4: Hoare triple {1564#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~bufsize~0 := #t~nondet0;havoc #t~nondet0; {1564#true} is VALID [2020-07-17 22:51:18,738 INFO L280 TraceCheckUtils]: 5: Hoare triple {1564#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~len~0 := #t~nondet1;havoc #t~nondet1;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {1564#true} is VALID [2020-07-17 22:51:18,738 INFO L280 TraceCheckUtils]: 6: Hoare triple {1564#true} assume !!(~i~0 < ~len~0);~j~0 := 0; {1564#true} is VALID [2020-07-17 22:51:18,739 INFO L280 TraceCheckUtils]: 7: Hoare triple {1564#true} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {1564#true} is VALID [2020-07-17 22:51:18,740 INFO L280 TraceCheckUtils]: 8: Hoare triple {1564#true} assume 1 + ~i~0 < ~len~0; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-17 22:51:18,740 INFO L263 TraceCheckUtils]: 9: Hoare triple {1568#(<= (+ main_~i~0 2) main_~len~0)} call __VERIFIER_assert((if 1 + ~i~0 < ~len~0 then 1 else 0)); {1564#true} is VALID [2020-07-17 22:51:18,740 INFO L280 TraceCheckUtils]: 10: Hoare triple {1564#true} ~cond := #in~cond; {1564#true} is VALID [2020-07-17 22:51:18,740 INFO L280 TraceCheckUtils]: 11: Hoare triple {1564#true} assume !(0 == ~cond); {1564#true} is VALID [2020-07-17 22:51:18,741 INFO L280 TraceCheckUtils]: 12: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-17 22:51:18,742 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1564#true} {1568#(<= (+ main_~i~0 2) main_~len~0)} #90#return; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-17 22:51:18,742 INFO L263 TraceCheckUtils]: 14: Hoare triple {1568#(<= (+ main_~i~0 2) main_~len~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {1564#true} is VALID [2020-07-17 22:51:18,742 INFO L280 TraceCheckUtils]: 15: Hoare triple {1564#true} ~cond := #in~cond; {1564#true} is VALID [2020-07-17 22:51:18,742 INFO L280 TraceCheckUtils]: 16: Hoare triple {1564#true} assume !(0 == ~cond); {1564#true} is VALID [2020-07-17 22:51:18,743 INFO L280 TraceCheckUtils]: 17: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-17 22:51:18,744 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1564#true} {1568#(<= (+ main_~i~0 2) main_~len~0)} #92#return; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-17 22:51:18,744 INFO L280 TraceCheckUtils]: 19: Hoare triple {1568#(<= (+ main_~i~0 2) main_~len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-17 22:51:18,745 INFO L280 TraceCheckUtils]: 20: Hoare triple {1568#(<= (+ main_~i~0 2) main_~len~0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-17 22:51:18,745 INFO L263 TraceCheckUtils]: 21: Hoare triple {1568#(<= (+ main_~i~0 2) main_~len~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {1564#true} is VALID [2020-07-17 22:51:18,746 INFO L280 TraceCheckUtils]: 22: Hoare triple {1564#true} ~cond := #in~cond; {1564#true} is VALID [2020-07-17 22:51:18,746 INFO L280 TraceCheckUtils]: 23: Hoare triple {1564#true} assume !(0 == ~cond); {1564#true} is VALID [2020-07-17 22:51:18,746 INFO L280 TraceCheckUtils]: 24: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-17 22:51:18,747 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1564#true} {1568#(<= (+ main_~i~0 2) main_~len~0)} #94#return; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-17 22:51:18,748 INFO L263 TraceCheckUtils]: 26: Hoare triple {1568#(<= (+ main_~i~0 2) main_~len~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {1564#true} is VALID [2020-07-17 22:51:18,748 INFO L280 TraceCheckUtils]: 27: Hoare triple {1564#true} ~cond := #in~cond; {1564#true} is VALID [2020-07-17 22:51:18,748 INFO L280 TraceCheckUtils]: 28: Hoare triple {1564#true} assume !(0 == ~cond); {1564#true} is VALID [2020-07-17 22:51:18,748 INFO L280 TraceCheckUtils]: 29: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-17 22:51:18,749 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1564#true} {1568#(<= (+ main_~i~0 2) main_~len~0)} #96#return; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-17 22:51:18,750 INFO L263 TraceCheckUtils]: 31: Hoare triple {1568#(<= (+ main_~i~0 2) main_~len~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {1564#true} is VALID [2020-07-17 22:51:18,750 INFO L280 TraceCheckUtils]: 32: Hoare triple {1564#true} ~cond := #in~cond; {1564#true} is VALID [2020-07-17 22:51:18,750 INFO L280 TraceCheckUtils]: 33: Hoare triple {1564#true} assume !(0 == ~cond); {1564#true} is VALID [2020-07-17 22:51:18,750 INFO L280 TraceCheckUtils]: 34: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-17 22:51:18,751 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1564#true} {1568#(<= (+ main_~i~0 2) main_~len~0)} #98#return; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-17 22:51:18,752 INFO L263 TraceCheckUtils]: 36: Hoare triple {1568#(<= (+ main_~i~0 2) main_~len~0)} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {1564#true} is VALID [2020-07-17 22:51:18,752 INFO L280 TraceCheckUtils]: 37: Hoare triple {1564#true} ~cond := #in~cond; {1564#true} is VALID [2020-07-17 22:51:18,752 INFO L280 TraceCheckUtils]: 38: Hoare triple {1564#true} assume !(0 == ~cond); {1564#true} is VALID [2020-07-17 22:51:18,753 INFO L280 TraceCheckUtils]: 39: Hoare triple {1564#true} assume true; {1564#true} is VALID [2020-07-17 22:51:18,754 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1564#true} {1568#(<= (+ main_~i~0 2) main_~len~0)} #100#return; {1568#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2020-07-17 22:51:18,755 INFO L280 TraceCheckUtils]: 41: Hoare triple {1568#(<= (+ main_~i~0 2) main_~len~0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1593#(<= (+ main_~i~0 1) main_~len~0)} is VALID [2020-07-17 22:51:18,757 INFO L263 TraceCheckUtils]: 42: Hoare triple {1593#(<= (+ main_~i~0 1) main_~len~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {1594#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:18,758 INFO L280 TraceCheckUtils]: 43: Hoare triple {1594#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1595#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:18,758 INFO L280 TraceCheckUtils]: 44: Hoare triple {1595#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1565#false} is VALID [2020-07-17 22:51:18,759 INFO L280 TraceCheckUtils]: 45: Hoare triple {1565#false} assume !false; {1565#false} is VALID [2020-07-17 22:51:18,761 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-07-17 22:51:18,762 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906177219] [2020-07-17 22:51:18,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:18,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:51:18,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812560258] [2020-07-17 22:51:18,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2020-07-17 22:51:18,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:18,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:51:18,799 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-17 22:51:18,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:51:18,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:18,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:51:18,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:51:18,801 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 6 states. [2020-07-17 22:51:19,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:19,366 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2020-07-17 22:51:19,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:51:19,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2020-07-17 22:51:19,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:19,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:19,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2020-07-17 22:51:19,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:19,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2020-07-17 22:51:19,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2020-07-17 22:51:19,504 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-17 22:51:19,507 INFO L225 Difference]: With dead ends: 74 [2020-07-17 22:51:19,508 INFO L226 Difference]: Without dead ends: 72 [2020-07-17 22:51:19,508 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:51:19,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-17 22:51:19,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2020-07-17 22:51:19,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:19,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 66 states. [2020-07-17 22:51:19,568 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 66 states. [2020-07-17 22:51:19,568 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 66 states. [2020-07-17 22:51:19,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:19,572 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2020-07-17 22:51:19,573 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2020-07-17 22:51:19,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:19,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:19,574 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 72 states. [2020-07-17 22:51:19,574 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 72 states. [2020-07-17 22:51:19,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:19,577 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2020-07-17 22:51:19,578 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2020-07-17 22:51:19,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:19,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:19,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:19,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:19,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-17 22:51:19,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2020-07-17 22:51:19,582 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 46 [2020-07-17 22:51:19,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:19,582 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2020-07-17 22:51:19,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:51:19,583 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2020-07-17 22:51:19,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-17 22:51:19,584 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:19,585 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 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-17 22:51:19,585 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 22:51:19,585 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:19,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:19,585 INFO L82 PathProgramCache]: Analyzing trace with hash -801825860, now seen corresponding path program 1 times [2020-07-17 22:51:19,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:19,586 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344350024] [2020-07-17 22:51:19,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:19,680 INFO L280 TraceCheckUtils]: 0: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-17 22:51:19,680 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1951#true} {1951#true} #86#return; {1951#true} is VALID [2020-07-17 22:51:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:19,687 INFO L280 TraceCheckUtils]: 0: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-17 22:51:19,687 INFO L280 TraceCheckUtils]: 1: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-17 22:51:19,687 INFO L280 TraceCheckUtils]: 2: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-17 22:51:19,688 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1951#true} {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} #90#return; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:19,694 INFO L280 TraceCheckUtils]: 0: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-17 22:51:19,694 INFO L280 TraceCheckUtils]: 1: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-17 22:51:19,694 INFO L280 TraceCheckUtils]: 2: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-17 22:51:19,695 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1951#true} {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} #92#return; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:19,701 INFO L280 TraceCheckUtils]: 0: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-17 22:51:19,701 INFO L280 TraceCheckUtils]: 1: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-17 22:51:19,702 INFO L280 TraceCheckUtils]: 2: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-17 22:51:19,703 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1951#true} {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} #94#return; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:19,708 INFO L280 TraceCheckUtils]: 0: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-17 22:51:19,709 INFO L280 TraceCheckUtils]: 1: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-17 22:51:19,709 INFO L280 TraceCheckUtils]: 2: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-17 22:51:19,710 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1951#true} {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} #96#return; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:19,715 INFO L280 TraceCheckUtils]: 0: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-17 22:51:19,716 INFO L280 TraceCheckUtils]: 1: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-17 22:51:19,716 INFO L280 TraceCheckUtils]: 2: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-17 22:51:19,717 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1951#true} {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} #98#return; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:19,722 INFO L280 TraceCheckUtils]: 0: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-17 22:51:19,722 INFO L280 TraceCheckUtils]: 1: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-17 22:51:19,722 INFO L280 TraceCheckUtils]: 2: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-17 22:51:19,723 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1951#true} {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} #100#return; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:19,729 INFO L280 TraceCheckUtils]: 0: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-17 22:51:19,729 INFO L280 TraceCheckUtils]: 1: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-17 22:51:19,730 INFO L280 TraceCheckUtils]: 2: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-17 22:51:19,735 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1951#true} {1981#(<= (+ main_~j~0 4) main_~bufsize~0)} #102#return; {1981#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-17 22:51:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:19,742 INFO L280 TraceCheckUtils]: 0: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-17 22:51:19,743 INFO L280 TraceCheckUtils]: 1: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-17 22:51:19,743 INFO L280 TraceCheckUtils]: 2: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-17 22:51:19,746 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1951#true} {1981#(<= (+ main_~j~0 4) main_~bufsize~0)} #104#return; {1981#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-17 22:51:19,747 INFO L263 TraceCheckUtils]: 0: Hoare triple {1951#true} call ULTIMATE.init(); {1951#true} is VALID [2020-07-17 22:51:19,747 INFO L280 TraceCheckUtils]: 1: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-17 22:51:19,747 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1951#true} {1951#true} #86#return; {1951#true} is VALID [2020-07-17 22:51:19,747 INFO L263 TraceCheckUtils]: 3: Hoare triple {1951#true} call #t~ret10 := main(); {1951#true} is VALID [2020-07-17 22:51:19,748 INFO L280 TraceCheckUtils]: 4: Hoare triple {1951#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~bufsize~0 := #t~nondet0;havoc #t~nondet0; {1951#true} is VALID [2020-07-17 22:51:19,750 INFO L280 TraceCheckUtils]: 5: Hoare triple {1951#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~len~0 := #t~nondet1;havoc #t~nondet1;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {1955#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2020-07-17 22:51:19,751 INFO L280 TraceCheckUtils]: 6: Hoare triple {1955#(<= (+ main_~limit~0 4) main_~bufsize~0)} assume !!(~i~0 < ~len~0);~j~0 := 0; {1955#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2020-07-17 22:51:19,751 INFO L280 TraceCheckUtils]: 7: Hoare triple {1955#(<= (+ main_~limit~0 4) main_~bufsize~0)} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:19,752 INFO L280 TraceCheckUtils]: 8: Hoare triple {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} assume 1 + ~i~0 < ~len~0; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:19,752 INFO L263 TraceCheckUtils]: 9: Hoare triple {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} call __VERIFIER_assert((if 1 + ~i~0 < ~len~0 then 1 else 0)); {1951#true} is VALID [2020-07-17 22:51:19,753 INFO L280 TraceCheckUtils]: 10: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-17 22:51:19,753 INFO L280 TraceCheckUtils]: 11: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-17 22:51:19,753 INFO L280 TraceCheckUtils]: 12: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-17 22:51:19,754 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1951#true} {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} #90#return; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:19,755 INFO L263 TraceCheckUtils]: 14: Hoare triple {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {1951#true} is VALID [2020-07-17 22:51:19,755 INFO L280 TraceCheckUtils]: 15: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-17 22:51:19,755 INFO L280 TraceCheckUtils]: 16: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-17 22:51:19,756 INFO L280 TraceCheckUtils]: 17: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-17 22:51:19,758 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1951#true} {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} #92#return; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:19,766 INFO L280 TraceCheckUtils]: 19: Hoare triple {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:19,774 INFO L280 TraceCheckUtils]: 20: Hoare triple {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:19,774 INFO L263 TraceCheckUtils]: 21: Hoare triple {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {1951#true} is VALID [2020-07-17 22:51:19,775 INFO L280 TraceCheckUtils]: 22: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-17 22:51:19,775 INFO L280 TraceCheckUtils]: 23: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-17 22:51:19,775 INFO L280 TraceCheckUtils]: 24: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-17 22:51:19,783 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1951#true} {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} #94#return; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:19,783 INFO L263 TraceCheckUtils]: 26: Hoare triple {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {1951#true} is VALID [2020-07-17 22:51:19,784 INFO L280 TraceCheckUtils]: 27: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-17 22:51:19,784 INFO L280 TraceCheckUtils]: 28: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-17 22:51:19,784 INFO L280 TraceCheckUtils]: 29: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-17 22:51:19,785 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1951#true} {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} #96#return; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:19,786 INFO L263 TraceCheckUtils]: 31: Hoare triple {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {1951#true} is VALID [2020-07-17 22:51:19,786 INFO L280 TraceCheckUtils]: 32: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-17 22:51:19,786 INFO L280 TraceCheckUtils]: 33: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-17 22:51:19,786 INFO L280 TraceCheckUtils]: 34: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-17 22:51:19,787 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1951#true} {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} #98#return; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:19,787 INFO L263 TraceCheckUtils]: 36: Hoare triple {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {1951#true} is VALID [2020-07-17 22:51:19,787 INFO L280 TraceCheckUtils]: 37: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-17 22:51:19,787 INFO L280 TraceCheckUtils]: 38: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-17 22:51:19,787 INFO L280 TraceCheckUtils]: 39: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-17 22:51:19,788 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1951#true} {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} #100#return; {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:19,789 INFO L280 TraceCheckUtils]: 41: Hoare triple {1956#(<= (+ main_~j~0 5) main_~bufsize~0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1981#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-17 22:51:19,789 INFO L263 TraceCheckUtils]: 42: Hoare triple {1981#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {1951#true} is VALID [2020-07-17 22:51:19,789 INFO L280 TraceCheckUtils]: 43: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-17 22:51:19,789 INFO L280 TraceCheckUtils]: 44: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-17 22:51:19,790 INFO L280 TraceCheckUtils]: 45: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-17 22:51:19,792 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {1951#true} {1981#(<= (+ main_~j~0 4) main_~bufsize~0)} #102#return; {1981#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-17 22:51:19,793 INFO L263 TraceCheckUtils]: 47: Hoare triple {1981#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {1951#true} is VALID [2020-07-17 22:51:19,793 INFO L280 TraceCheckUtils]: 48: Hoare triple {1951#true} ~cond := #in~cond; {1951#true} is VALID [2020-07-17 22:51:19,793 INFO L280 TraceCheckUtils]: 49: Hoare triple {1951#true} assume !(0 == ~cond); {1951#true} is VALID [2020-07-17 22:51:19,794 INFO L280 TraceCheckUtils]: 50: Hoare triple {1951#true} assume true; {1951#true} is VALID [2020-07-17 22:51:19,795 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {1951#true} {1981#(<= (+ main_~j~0 4) main_~bufsize~0)} #104#return; {1981#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-17 22:51:19,796 INFO L263 TraceCheckUtils]: 52: Hoare triple {1981#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {1990#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:19,797 INFO L280 TraceCheckUtils]: 53: Hoare triple {1990#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1991#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:19,797 INFO L280 TraceCheckUtils]: 54: Hoare triple {1991#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1952#false} is VALID [2020-07-17 22:51:19,797 INFO L280 TraceCheckUtils]: 55: Hoare triple {1952#false} assume !false; {1952#false} is VALID [2020-07-17 22:51:19,801 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-07-17 22:51:19,802 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344350024] [2020-07-17 22:51:19,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:19,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:51:19,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626397628] [2020-07-17 22:51:19,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-07-17 22:51:19,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:19,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:51:19,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:19,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:51:19,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:19,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:51:19,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:51:19,849 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 7 states. [2020-07-17 22:51:20,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:20,486 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2020-07-17 22:51:20,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:51:20,486 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-07-17 22:51:20,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:51:20,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2020-07-17 22:51:20,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:51:20,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2020-07-17 22:51:20,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 63 transitions. [2020-07-17 22:51:20,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:20,585 INFO L225 Difference]: With dead ends: 74 [2020-07-17 22:51:20,585 INFO L226 Difference]: Without dead ends: 72 [2020-07-17 22:51:20,586 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 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-17 22:51:20,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-17 22:51:20,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2020-07-17 22:51:20,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:20,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 70 states. [2020-07-17 22:51:20,676 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 70 states. [2020-07-17 22:51:20,677 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 70 states. [2020-07-17 22:51:20,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:20,682 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2020-07-17 22:51:20,682 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2020-07-17 22:51:20,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:20,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:20,683 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 72 states. [2020-07-17 22:51:20,683 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 72 states. [2020-07-17 22:51:20,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:20,687 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2020-07-17 22:51:20,687 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2020-07-17 22:51:20,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:20,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:20,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:20,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:20,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-17 22:51:20,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2020-07-17 22:51:20,691 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 56 [2020-07-17 22:51:20,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:20,692 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2020-07-17 22:51:20,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:51:20,692 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2020-07-17 22:51:20,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-17 22:51:20,693 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:20,693 INFO L422 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 22:51:20,693 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 22:51:20,694 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:20,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:20,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1730547273, now seen corresponding path program 1 times [2020-07-17 22:51:20,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:20,695 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016311650] [2020-07-17 22:51:20,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,794 INFO L280 TraceCheckUtils]: 0: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-17 22:51:20,794 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2354#true} {2354#true} #86#return; {2354#true} is VALID [2020-07-17 22:51:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,813 INFO L280 TraceCheckUtils]: 0: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-17 22:51:20,813 INFO L280 TraceCheckUtils]: 1: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-17 22:51:20,813 INFO L280 TraceCheckUtils]: 2: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-17 22:51:20,817 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2354#true} {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} #90#return; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,822 INFO L280 TraceCheckUtils]: 0: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-17 22:51:20,823 INFO L280 TraceCheckUtils]: 1: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-17 22:51:20,823 INFO L280 TraceCheckUtils]: 2: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-17 22:51:20,824 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2354#true} {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} #92#return; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,829 INFO L280 TraceCheckUtils]: 0: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-17 22:51:20,830 INFO L280 TraceCheckUtils]: 1: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-17 22:51:20,830 INFO L280 TraceCheckUtils]: 2: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-17 22:51:20,831 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2354#true} {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} #94#return; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,836 INFO L280 TraceCheckUtils]: 0: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-17 22:51:20,836 INFO L280 TraceCheckUtils]: 1: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-17 22:51:20,836 INFO L280 TraceCheckUtils]: 2: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-17 22:51:20,837 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2354#true} {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} #96#return; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,842 INFO L280 TraceCheckUtils]: 0: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-17 22:51:20,842 INFO L280 TraceCheckUtils]: 1: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-17 22:51:20,843 INFO L280 TraceCheckUtils]: 2: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-17 22:51:20,843 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2354#true} {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} #98#return; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,848 INFO L280 TraceCheckUtils]: 0: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-17 22:51:20,849 INFO L280 TraceCheckUtils]: 1: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-17 22:51:20,849 INFO L280 TraceCheckUtils]: 2: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-17 22:51:20,850 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2354#true} {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} #100#return; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,867 INFO L280 TraceCheckUtils]: 0: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-17 22:51:20,868 INFO L280 TraceCheckUtils]: 1: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-17 22:51:20,868 INFO L280 TraceCheckUtils]: 2: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-17 22:51:20,872 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2354#true} {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} #102#return; {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,886 INFO L280 TraceCheckUtils]: 0: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-17 22:51:20,887 INFO L280 TraceCheckUtils]: 1: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-17 22:51:20,887 INFO L280 TraceCheckUtils]: 2: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-17 22:51:20,888 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2354#true} {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} #104#return; {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,898 INFO L280 TraceCheckUtils]: 0: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-17 22:51:20,899 INFO L280 TraceCheckUtils]: 1: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-17 22:51:20,899 INFO L280 TraceCheckUtils]: 2: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-17 22:51:20,900 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2354#true} {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} #106#return; {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,908 INFO L280 TraceCheckUtils]: 0: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-17 22:51:20,908 INFO L280 TraceCheckUtils]: 1: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-17 22:51:20,908 INFO L280 TraceCheckUtils]: 2: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-17 22:51:20,909 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2354#true} {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} #108#return; {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,909 INFO L263 TraceCheckUtils]: 0: Hoare triple {2354#true} call ULTIMATE.init(); {2354#true} is VALID [2020-07-17 22:51:20,909 INFO L280 TraceCheckUtils]: 1: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-17 22:51:20,910 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2354#true} {2354#true} #86#return; {2354#true} is VALID [2020-07-17 22:51:20,910 INFO L263 TraceCheckUtils]: 3: Hoare triple {2354#true} call #t~ret10 := main(); {2354#true} is VALID [2020-07-17 22:51:20,910 INFO L280 TraceCheckUtils]: 4: Hoare triple {2354#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~bufsize~0 := #t~nondet0;havoc #t~nondet0; {2354#true} is VALID [2020-07-17 22:51:20,911 INFO L280 TraceCheckUtils]: 5: Hoare triple {2354#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~len~0 := #t~nondet1;havoc #t~nondet1;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {2358#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,911 INFO L280 TraceCheckUtils]: 6: Hoare triple {2358#(<= (+ main_~limit~0 4) main_~bufsize~0)} assume !!(~i~0 < ~len~0);~j~0 := 0; {2358#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,912 INFO L280 TraceCheckUtils]: 7: Hoare triple {2358#(<= (+ main_~limit~0 4) main_~bufsize~0)} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,913 INFO L280 TraceCheckUtils]: 8: Hoare triple {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} assume 1 + ~i~0 < ~len~0; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,913 INFO L263 TraceCheckUtils]: 9: Hoare triple {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} call __VERIFIER_assert((if 1 + ~i~0 < ~len~0 then 1 else 0)); {2354#true} is VALID [2020-07-17 22:51:20,913 INFO L280 TraceCheckUtils]: 10: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-17 22:51:20,914 INFO L280 TraceCheckUtils]: 11: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-17 22:51:20,914 INFO L280 TraceCheckUtils]: 12: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-17 22:51:20,915 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2354#true} {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} #90#return; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,915 INFO L263 TraceCheckUtils]: 14: Hoare triple {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {2354#true} is VALID [2020-07-17 22:51:20,915 INFO L280 TraceCheckUtils]: 15: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-17 22:51:20,915 INFO L280 TraceCheckUtils]: 16: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-17 22:51:20,915 INFO L280 TraceCheckUtils]: 17: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-17 22:51:20,916 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2354#true} {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} #92#return; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,917 INFO L280 TraceCheckUtils]: 19: Hoare triple {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,918 INFO L280 TraceCheckUtils]: 20: Hoare triple {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,918 INFO L263 TraceCheckUtils]: 21: Hoare triple {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {2354#true} is VALID [2020-07-17 22:51:20,918 INFO L280 TraceCheckUtils]: 22: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-17 22:51:20,919 INFO L280 TraceCheckUtils]: 23: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-17 22:51:20,919 INFO L280 TraceCheckUtils]: 24: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-17 22:51:20,920 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {2354#true} {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} #94#return; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,920 INFO L263 TraceCheckUtils]: 26: Hoare triple {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {2354#true} is VALID [2020-07-17 22:51:20,920 INFO L280 TraceCheckUtils]: 27: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-17 22:51:20,920 INFO L280 TraceCheckUtils]: 28: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-17 22:51:20,921 INFO L280 TraceCheckUtils]: 29: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-17 22:51:20,922 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2354#true} {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} #96#return; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,922 INFO L263 TraceCheckUtils]: 31: Hoare triple {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {2354#true} is VALID [2020-07-17 22:51:20,922 INFO L280 TraceCheckUtils]: 32: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-17 22:51:20,922 INFO L280 TraceCheckUtils]: 33: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-17 22:51:20,923 INFO L280 TraceCheckUtils]: 34: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-17 22:51:20,923 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {2354#true} {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} #98#return; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,924 INFO L263 TraceCheckUtils]: 36: Hoare triple {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {2354#true} is VALID [2020-07-17 22:51:20,924 INFO L280 TraceCheckUtils]: 37: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-17 22:51:20,924 INFO L280 TraceCheckUtils]: 38: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-17 22:51:20,924 INFO L280 TraceCheckUtils]: 39: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-17 22:51:20,925 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2354#true} {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} #100#return; {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,926 INFO L280 TraceCheckUtils]: 41: Hoare triple {2359#(<= (+ main_~j~0 5) main_~bufsize~0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,926 INFO L263 TraceCheckUtils]: 42: Hoare triple {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {2354#true} is VALID [2020-07-17 22:51:20,926 INFO L280 TraceCheckUtils]: 43: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-17 22:51:20,926 INFO L280 TraceCheckUtils]: 44: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-17 22:51:20,927 INFO L280 TraceCheckUtils]: 45: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-17 22:51:20,929 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {2354#true} {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} #102#return; {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,930 INFO L263 TraceCheckUtils]: 47: Hoare triple {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {2354#true} is VALID [2020-07-17 22:51:20,930 INFO L280 TraceCheckUtils]: 48: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-17 22:51:20,930 INFO L280 TraceCheckUtils]: 49: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-17 22:51:20,930 INFO L280 TraceCheckUtils]: 50: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-17 22:51:20,932 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {2354#true} {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} #104#return; {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,933 INFO L263 TraceCheckUtils]: 52: Hoare triple {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {2354#true} is VALID [2020-07-17 22:51:20,933 INFO L280 TraceCheckUtils]: 53: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-17 22:51:20,936 INFO L280 TraceCheckUtils]: 54: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-17 22:51:20,937 INFO L280 TraceCheckUtils]: 55: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-17 22:51:20,945 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {2354#true} {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} #106#return; {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,945 INFO L263 TraceCheckUtils]: 57: Hoare triple {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {2354#true} is VALID [2020-07-17 22:51:20,946 INFO L280 TraceCheckUtils]: 58: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2020-07-17 22:51:20,946 INFO L280 TraceCheckUtils]: 59: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2020-07-17 22:51:20,946 INFO L280 TraceCheckUtils]: 60: Hoare triple {2354#true} assume true; {2354#true} is VALID [2020-07-17 22:51:20,947 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {2354#true} {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} #108#return; {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,948 INFO L280 TraceCheckUtils]: 62: Hoare triple {2384#(<= (+ main_~j~0 4) main_~bufsize~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2401#(<= (+ main_~j~0 3) main_~bufsize~0)} is VALID [2020-07-17 22:51:20,950 INFO L263 TraceCheckUtils]: 63: Hoare triple {2401#(<= (+ main_~j~0 3) main_~bufsize~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {2402#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:20,950 INFO L280 TraceCheckUtils]: 64: Hoare triple {2402#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2403#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:20,951 INFO L280 TraceCheckUtils]: 65: Hoare triple {2403#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2355#false} is VALID [2020-07-17 22:51:20,951 INFO L280 TraceCheckUtils]: 66: Hoare triple {2355#false} assume !false; {2355#false} is VALID [2020-07-17 22:51:20,960 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2020-07-17 22:51:20,960 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016311650] [2020-07-17 22:51:20,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:20,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-17 22:51:20,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351196015] [2020-07-17 22:51:20,963 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2020-07-17 22:51:20,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:20,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:51:21,014 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-17 22:51:21,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:51:21,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:21,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:51:21,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:51:21,015 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand 8 states. [2020-07-17 22:51:21,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:21,652 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2020-07-17 22:51:21,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:51:21,652 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2020-07-17 22:51:21,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:21,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:51:21,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2020-07-17 22:51:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:51:21,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2020-07-17 22:51:21,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 61 transitions. [2020-07-17 22:51:21,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:21,756 INFO L225 Difference]: With dead ends: 72 [2020-07-17 22:51:21,757 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:51:21,758 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:51:21,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:51:21,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:51:21,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:21,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:21,759 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:21,759 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:21,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:21,760 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:51:21,760 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:21,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:21,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:21,761 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:21,761 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:21,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:21,761 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:51:21,761 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:21,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:21,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:21,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:21,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:21,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:51:21,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:51:21,763 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2020-07-17 22:51:21,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:21,763 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:51:21,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:51:21,763 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:21,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:21,764 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 22:51:21,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:51:22,302 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:51:22,302 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:51:22,302 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:51:22,302 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:51:22,302 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:51:22,302 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:51:22,303 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:51:22,303 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-17 22:51:22,303 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:51:22,303 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:51:22,303 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (and (<= (+ main_~i~0 2) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-17 22:51:22,304 INFO L268 CegarLoopResult]: For program point L27(line 27) no Hoare annotation was computed. [2020-07-17 22:51:22,304 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 56) no Hoare annotation was computed. [2020-07-17 22:51:22,304 INFO L264 CegarLoopResult]: At program point L23-2(lines 23 54) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-07-17 22:51:22,304 INFO L268 CegarLoopResult]: For program point L23-3(lines 23 54) no Hoare annotation was computed. [2020-07-17 22:51:22,304 INFO L264 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-17 22:51:22,305 INFO L264 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~j~0)) [2020-07-17 22:51:22,305 INFO L268 CegarLoopResult]: For program point L32(line 32) no Hoare annotation was computed. [2020-07-17 22:51:22,305 INFO L268 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2020-07-17 22:51:22,305 INFO L264 CegarLoopResult]: At program point L24-2(lines 24 53) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 0 main_~j~0)) [2020-07-17 22:51:22,305 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-17 22:51:22,306 INFO L268 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2020-07-17 22:51:22,306 INFO L264 CegarLoopResult]: At program point L45(lines 25 52) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-17 22:51:22,306 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~j~0)) [2020-07-17 22:51:22,306 INFO L264 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~j~0)) [2020-07-17 22:51:22,306 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~j~0)) [2020-07-17 22:51:22,307 INFO L264 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (and (<= (+ main_~i~0 2) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-17 22:51:22,307 INFO L264 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: (and (<= (+ main_~i~0 2) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-17 22:51:22,307 INFO L268 CegarLoopResult]: For program point L25(lines 25 52) no Hoare annotation was computed. [2020-07-17 22:51:22,307 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-17 22:51:22,307 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 56) no Hoare annotation was computed. [2020-07-17 22:51:22,307 INFO L268 CegarLoopResult]: For program point L42(line 42) no Hoare annotation was computed. [2020-07-17 22:51:22,307 INFO L268 CegarLoopResult]: For program point L38(line 38) no Hoare annotation was computed. [2020-07-17 22:51:22,308 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (<= (+ main_~i~0 2) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-17 22:51:22,308 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 56) the Hoare annotation is: true [2020-07-17 22:51:22,308 INFO L264 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (and (<= (+ main_~i~0 2) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-17 22:51:22,308 INFO L264 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: (and (<= (+ main_~i~0 2) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-17 22:51:22,308 INFO L264 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-17 22:51:22,308 INFO L264 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~j~0)) [2020-07-17 22:51:22,309 INFO L264 CegarLoopResult]: At program point L35-1(line 35) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~j~0)) [2020-07-17 22:51:22,309 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-17 22:51:22,309 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-17 22:51:22,309 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-17 22:51:22,309 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-17 22:51:22,309 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-17 22:51:22,309 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-17 22:51:22,314 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:51:22,314 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:51:22,314 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-17 22:51:22,314 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:51:22,314 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:51:22,315 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:51:22,315 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:51:22,315 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:51:22,315 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-17 22:51:22,315 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-17 22:51:22,315 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:51:22,315 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:51:22,315 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:51:22,315 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-17 22:51:22,316 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:51:22,316 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-17 22:51:22,316 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-17 22:51:22,317 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:51:22,317 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:51:22,317 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-17 22:51:22,317 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:51:22,317 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-17 22:51:22,318 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-17 22:51:22,318 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:22,318 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:22,318 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:22,318 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:22,319 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:22,319 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:22,319 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:22,319 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:22,319 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:22,319 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:22,319 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:22,319 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:22,319 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:22,319 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:22,320 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:22,320 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:22,320 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-17 22:51:22,320 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-17 22:51:22,320 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-17 22:51:22,320 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-17 22:51:22,320 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-17 22:51:22,320 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-17 22:51:22,321 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-17 22:51:22,321 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-17 22:51:22,321 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-17 22:51:22,321 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-17 22:51:22,321 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-17 22:51:22,321 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-17 22:51:22,321 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-17 22:51:22,321 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-17 22:51:22,321 INFO L163 areAnnotationChecker]: CFG has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:51:22,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:51:22 BoogieIcfgContainer [2020-07-17 22:51:22,333 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:51:22,336 INFO L168 Benchmark]: Toolchain (without parser) took 9228.13 ms. Allocated memory was 135.3 MB in the beginning and 336.1 MB in the end (delta: 200.8 MB). Free memory was 100.5 MB in the beginning and 251.0 MB in the end (delta: -150.5 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:22,337 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:51:22,337 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.62 ms. Allocated memory is still 135.3 MB. Free memory was 100.1 MB in the beginning and 89.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:22,338 INFO L168 Benchmark]: Boogie Preprocessor took 129.14 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 89.4 MB in the beginning and 176.2 MB in the end (delta: -86.8 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:22,339 INFO L168 Benchmark]: RCFGBuilder took 537.22 ms. Allocated memory is still 198.2 MB. Free memory was 176.2 MB in the beginning and 145.9 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:22,340 INFO L168 Benchmark]: TraceAbstraction took 8265.03 ms. Allocated memory was 198.2 MB in the beginning and 336.1 MB in the end (delta: 137.9 MB). Free memory was 145.9 MB in the beginning and 251.0 MB in the end (delta: -105.1 MB). Peak memory consumption was 32.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:22,343 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.23 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 290.62 ms. Allocated memory is still 135.3 MB. Free memory was 100.1 MB in the beginning and 89.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.14 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 89.4 MB in the beginning and 176.2 MB in the end (delta: -86.8 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 537.22 ms. Allocated memory is still 198.2 MB. Free memory was 176.2 MB in the beginning and 145.9 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8265.03 ms. Allocated memory was 198.2 MB in the beginning and 336.1 MB in the end (delta: 137.9 MB). Free memory was 145.9 MB in the beginning and 251.0 MB in the end (delta: -105.1 MB). Peak memory consumption was 32.7 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: 24]: Loop Invariant Derived loop invariant: (0 <= i && limit + 4 <= bufsize) && 0 <= j - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (((i + 1 <= len && 0 <= i) && limit + 4 <= bufsize) && 0 <= j) && j + 5 <= bufsize - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: 0 <= i && limit + 4 <= bufsize - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.6s, OverallIterations: 8, TraceHistogramMax: 11, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 395 SDtfs, 104 SDslu, 1002 SDs, 0 SdLazy, 517 SolverSat, 137 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 55 PreInvPairs, 76 NumberOfFragments, 368 HoareAnnotationTreeSize, 55 FomulaSimplifications, 480 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 23 FomulaSimplificationsInter, 114 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 23622 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 428/428 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...