java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:10:39,502 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:10:39,504 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:10:39,516 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:10:39,516 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:10:39,517 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:10:39,519 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:10:39,521 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:10:39,522 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:10:39,523 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:10:39,524 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:10:39,525 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:10:39,525 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:10:39,526 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:10:39,528 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:10:39,528 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:10:39,529 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:10:39,531 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:10:39,537 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:10:39,538 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:10:39,539 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:10:39,542 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:10:39,548 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:10:39,548 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:10:39,548 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:10:39,549 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:10:39,550 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:10:39,551 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:10:39,552 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:10:39,554 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:10:39,554 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:10:39,555 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:10:39,556 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:10:39,556 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:10:39,558 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:10:39,559 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:10:39,559 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:10:39,592 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:10:39,592 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:10:39,593 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:10:39,594 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:10:39,594 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:10:39,594 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:10:39,595 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:10:39,595 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:10:39,595 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:10:39,595 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:10:39,595 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:10:39,597 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:10:39,597 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:10:39,597 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:10:39,597 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:10:39,597 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:10:39,597 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:10:39,598 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:10:39,598 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:10:39,598 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:10:39,598 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:10:39,598 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:10:39,600 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:10:39,600 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:10:39,600 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:10:39,601 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:10:39,601 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:10:39,601 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:10:39,601 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:10:39,601 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:10:39,601 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:10:39,650 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:10:39,663 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:10:39,667 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:10:39,669 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:10:39,669 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:10:39,670 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2018-11-23 13:10:39,730 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7504360ea/b6a288292a7841029f36049eb5379fc4/FLAGc9e7a81cf [2018-11-23 13:10:40,196 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:10:40,197 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2018-11-23 13:10:40,205 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7504360ea/b6a288292a7841029f36049eb5379fc4/FLAGc9e7a81cf [2018-11-23 13:10:40,525 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7504360ea/b6a288292a7841029f36049eb5379fc4 [2018-11-23 13:10:40,534 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:10:40,535 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:10:40,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:10:40,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:10:40,540 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:10:40,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:10:40" (1/1) ... [2018-11-23 13:10:40,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2690c4ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:40, skipping insertion in model container [2018-11-23 13:10:40,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:10:40" (1/1) ... [2018-11-23 13:10:40,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:10:40,596 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:10:40,851 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:10:40,865 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:10:40,908 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:10:40,925 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:10:40,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:40 WrapperNode [2018-11-23 13:10:40,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:10:40,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:10:40,927 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:10:40,927 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:10:40,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:40" (1/1) ... [2018-11-23 13:10:40,941 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:40" (1/1) ... [2018-11-23 13:10:40,949 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:10:40,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:10:40,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:10:40,950 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:10:40,960 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:40" (1/1) ... [2018-11-23 13:10:40,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:40" (1/1) ... [2018-11-23 13:10:40,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:40" (1/1) ... [2018-11-23 13:10:40,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:40" (1/1) ... [2018-11-23 13:10:40,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:40" (1/1) ... [2018-11-23 13:10:40,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:40" (1/1) ... [2018-11-23 13:10:40,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:40" (1/1) ... [2018-11-23 13:10:40,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:10:40,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:10:40,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:10:40,984 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:10:40,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:40" (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 [2018-11-23 13:10:41,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:10:41,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:10:41,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:10:41,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:10:41,117 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:10:41,117 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:10:42,143 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:10:42,143 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 13:10:42,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:10:42 BoogieIcfgContainer [2018-11-23 13:10:42,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:10:42,145 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:10:42,145 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:10:42,148 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:10:42,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:10:40" (1/3) ... [2018-11-23 13:10:42,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a3537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:10:42, skipping insertion in model container [2018-11-23 13:10:42,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:40" (2/3) ... [2018-11-23 13:10:42,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a3537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:10:42, skipping insertion in model container [2018-11-23 13:10:42,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:10:42" (3/3) ... [2018-11-23 13:10:42,152 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2018-11-23 13:10:42,161 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:10:42,169 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2018-11-23 13:10:42,184 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2018-11-23 13:10:42,216 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:10:42,217 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:10:42,218 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:10:42,218 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:10:42,219 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:10:42,219 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:10:42,219 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:10:42,219 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:10:42,220 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:10:42,241 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-11-23 13:10:42,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:10:42,248 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:42,249 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:42,251 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:42,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:42,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1118366569, now seen corresponding path program 1 times [2018-11-23 13:10:42,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:42,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:42,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:42,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:42,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:42,457 INFO L256 TraceCheckUtils]: 0: Hoare triple {68#true} call ULTIMATE.init(); {68#true} is VALID [2018-11-23 13:10:42,461 INFO L273 TraceCheckUtils]: 1: Hoare triple {68#true} ~__return_main~0 := 0;~__return_334~0 := 0; {68#true} is VALID [2018-11-23 13:10:42,462 INFO L273 TraceCheckUtils]: 2: Hoare triple {68#true} assume true; {68#true} is VALID [2018-11-23 13:10:42,462 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {68#true} {68#true} #139#return; {68#true} is VALID [2018-11-23 13:10:42,463 INFO L256 TraceCheckUtils]: 4: Hoare triple {68#true} call #t~ret4 := main(); {68#true} is VALID [2018-11-23 13:10:42,463 INFO L273 TraceCheckUtils]: 5: Hoare triple {68#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {68#true} is VALID [2018-11-23 13:10:42,463 INFO L273 TraceCheckUtils]: 6: Hoare triple {68#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {68#true} is VALID [2018-11-23 13:10:42,463 INFO L273 TraceCheckUtils]: 7: Hoare triple {68#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {68#true} is VALID [2018-11-23 13:10:42,464 INFO L273 TraceCheckUtils]: 8: Hoare triple {68#true} assume ~main__i~0 < ~main__len~0; {68#true} is VALID [2018-11-23 13:10:42,464 INFO L273 TraceCheckUtils]: 9: Hoare triple {68#true} assume ~main__j~0 < ~main__limit~0; {68#true} is VALID [2018-11-23 13:10:42,465 INFO L273 TraceCheckUtils]: 10: Hoare triple {68#true} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {70#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:10:42,466 INFO L273 TraceCheckUtils]: 11: Hoare triple {70#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {69#false} is VALID [2018-11-23 13:10:42,466 INFO L273 TraceCheckUtils]: 12: Hoare triple {69#false} assume !false; {69#false} is VALID [2018-11-23 13:10:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:42,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:10:42,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:10:42,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 13:10:42,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:42,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:10:42,563 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:42,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:10:42,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:10:42,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:10:42,573 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2018-11-23 13:10:43,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:43,282 INFO L93 Difference]: Finished difference Result 88 states and 116 transitions. [2018-11-23 13:10:43,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:10:43,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 13:10:43,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:43,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:10:43,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2018-11-23 13:10:43,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:10:43,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2018-11-23 13:10:43,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 116 transitions. [2018-11-23 13:10:43,819 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:43,837 INFO L225 Difference]: With dead ends: 88 [2018-11-23 13:10:43,838 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 13:10:43,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:10:43,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 13:10:43,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2018-11-23 13:10:43,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:43,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 59 states. [2018-11-23 13:10:43,907 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 59 states. [2018-11-23 13:10:43,907 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 59 states. [2018-11-23 13:10:43,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:43,916 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2018-11-23 13:10:43,916 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-11-23 13:10:43,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:43,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:43,917 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 76 states. [2018-11-23 13:10:43,918 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 76 states. [2018-11-23 13:10:43,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:43,925 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2018-11-23 13:10:43,925 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-11-23 13:10:43,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:43,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:43,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:43,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:43,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 13:10:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-23 13:10:43,933 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2018-11-23 13:10:43,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:43,934 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-23 13:10:43,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:10:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-23 13:10:43,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:10:43,935 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:43,935 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:43,936 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:43,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:43,937 INFO L82 PathProgramCache]: Analyzing trace with hash -306453431, now seen corresponding path program 1 times [2018-11-23 13:10:43,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:43,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:43,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:43,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:43,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:44,089 INFO L256 TraceCheckUtils]: 0: Hoare triple {389#true} call ULTIMATE.init(); {389#true} is VALID [2018-11-23 13:10:44,089 INFO L273 TraceCheckUtils]: 1: Hoare triple {389#true} ~__return_main~0 := 0;~__return_334~0 := 0; {389#true} is VALID [2018-11-23 13:10:44,090 INFO L273 TraceCheckUtils]: 2: Hoare triple {389#true} assume true; {389#true} is VALID [2018-11-23 13:10:44,090 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {389#true} {389#true} #139#return; {389#true} is VALID [2018-11-23 13:10:44,090 INFO L256 TraceCheckUtils]: 4: Hoare triple {389#true} call #t~ret4 := main(); {389#true} is VALID [2018-11-23 13:10:44,091 INFO L273 TraceCheckUtils]: 5: Hoare triple {389#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {389#true} is VALID [2018-11-23 13:10:44,091 INFO L273 TraceCheckUtils]: 6: Hoare triple {389#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {389#true} is VALID [2018-11-23 13:10:44,100 INFO L273 TraceCheckUtils]: 7: Hoare triple {389#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {391#(< main_~main__i~0 main_~main__len~0)} is VALID [2018-11-23 13:10:44,109 INFO L273 TraceCheckUtils]: 8: Hoare triple {391#(< main_~main__i~0 main_~main__len~0)} assume ~main__i~0 < ~main__len~0; {391#(< main_~main__i~0 main_~main__len~0)} is VALID [2018-11-23 13:10:44,127 INFO L273 TraceCheckUtils]: 9: Hoare triple {391#(< main_~main__i~0 main_~main__len~0)} assume ~main__j~0 < ~main__limit~0; {391#(< main_~main__i~0 main_~main__len~0)} is VALID [2018-11-23 13:10:44,136 INFO L273 TraceCheckUtils]: 10: Hoare triple {391#(< main_~main__i~0 main_~main__len~0)} assume !(1 + ~main__i~0 < ~main__len~0); {391#(< main_~main__i~0 main_~main__len~0)} is VALID [2018-11-23 13:10:44,137 INFO L273 TraceCheckUtils]: 11: Hoare triple {391#(< main_~main__i~0 main_~main__len~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {392#(= main_~__VERIFIER_assert__cond~2 1)} is VALID [2018-11-23 13:10:44,138 INFO L273 TraceCheckUtils]: 12: Hoare triple {392#(= main_~__VERIFIER_assert__cond~2 1)} assume 0 == ~__VERIFIER_assert__cond~2; {390#false} is VALID [2018-11-23 13:10:44,138 INFO L273 TraceCheckUtils]: 13: Hoare triple {390#false} assume !false; {390#false} is VALID [2018-11-23 13:10:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:44,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:10:44,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:10:44,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-23 13:10:44,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:44,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 13:10:44,191 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:44,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:10:44,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:10:44,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:10:44,192 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2018-11-23 13:10:44,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:44,796 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2018-11-23 13:10:44,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:10:44,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-23 13:10:44,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:44,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:10:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2018-11-23 13:10:44,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:10:44,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2018-11-23 13:10:44,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 168 transitions. [2018-11-23 13:10:45,121 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:45,127 INFO L225 Difference]: With dead ends: 153 [2018-11-23 13:10:45,128 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 13:10:45,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:10:45,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 13:10:45,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2018-11-23 13:10:45,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:45,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 58 states. [2018-11-23 13:10:45,167 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 58 states. [2018-11-23 13:10:45,167 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 58 states. [2018-11-23 13:10:45,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:45,172 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-11-23 13:10:45,172 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2018-11-23 13:10:45,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:45,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:45,174 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 101 states. [2018-11-23 13:10:45,174 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 101 states. [2018-11-23 13:10:45,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:45,180 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-11-23 13:10:45,180 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2018-11-23 13:10:45,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:45,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:45,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:45,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:45,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 13:10:45,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-11-23 13:10:45,185 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2018-11-23 13:10:45,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:45,186 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-11-23 13:10:45,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:10:45,186 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-23 13:10:45,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:10:45,187 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:45,187 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:45,188 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:45,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:45,188 INFO L82 PathProgramCache]: Analyzing trace with hash -309622200, now seen corresponding path program 1 times [2018-11-23 13:10:45,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:45,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:45,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:45,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:45,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:45,309 INFO L256 TraceCheckUtils]: 0: Hoare triple {835#true} call ULTIMATE.init(); {835#true} is VALID [2018-11-23 13:10:45,310 INFO L273 TraceCheckUtils]: 1: Hoare triple {835#true} ~__return_main~0 := 0;~__return_334~0 := 0; {835#true} is VALID [2018-11-23 13:10:45,310 INFO L273 TraceCheckUtils]: 2: Hoare triple {835#true} assume true; {835#true} is VALID [2018-11-23 13:10:45,310 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {835#true} {835#true} #139#return; {835#true} is VALID [2018-11-23 13:10:45,311 INFO L256 TraceCheckUtils]: 4: Hoare triple {835#true} call #t~ret4 := main(); {835#true} is VALID [2018-11-23 13:10:45,311 INFO L273 TraceCheckUtils]: 5: Hoare triple {835#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {835#true} is VALID [2018-11-23 13:10:45,312 INFO L273 TraceCheckUtils]: 6: Hoare triple {835#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {837#(<= 0 main_~main__i~0)} is VALID [2018-11-23 13:10:45,313 INFO L273 TraceCheckUtils]: 7: Hoare triple {837#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {837#(<= 0 main_~main__i~0)} is VALID [2018-11-23 13:10:45,313 INFO L273 TraceCheckUtils]: 8: Hoare triple {837#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0; {837#(<= 0 main_~main__i~0)} is VALID [2018-11-23 13:10:45,314 INFO L273 TraceCheckUtils]: 9: Hoare triple {837#(<= 0 main_~main__i~0)} assume ~main__j~0 < ~main__limit~0; {837#(<= 0 main_~main__i~0)} is VALID [2018-11-23 13:10:45,315 INFO L273 TraceCheckUtils]: 10: Hoare triple {837#(<= 0 main_~main__i~0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {838#(and (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 1))} is VALID [2018-11-23 13:10:45,316 INFO L273 TraceCheckUtils]: 11: Hoare triple {838#(and (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 1))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {839#(not (= 0 main_~__VERIFIER_assert__cond~1))} is VALID [2018-11-23 13:10:45,317 INFO L273 TraceCheckUtils]: 12: Hoare triple {839#(not (= 0 main_~__VERIFIER_assert__cond~1))} assume 0 == ~__VERIFIER_assert__cond~1; {836#false} is VALID [2018-11-23 13:10:45,317 INFO L273 TraceCheckUtils]: 13: Hoare triple {836#false} assume !false; {836#false} is VALID [2018-11-23 13:10:45,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:45,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:10:45,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:10:45,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 13:10:45,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:45,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:10:45,343 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:45,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:10:45,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:10:45,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:10:45,344 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 5 states. [2018-11-23 13:10:45,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:45,704 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-11-23 13:10:45,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:10:45,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 13:10:45,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:45,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:10:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2018-11-23 13:10:45,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:10:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2018-11-23 13:10:45,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 80 transitions. [2018-11-23 13:10:45,933 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:45,935 INFO L225 Difference]: With dead ends: 75 [2018-11-23 13:10:45,935 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 13:10:45,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:10:45,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 13:10:45,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2018-11-23 13:10:45,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:45,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 56 states. [2018-11-23 13:10:45,968 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 56 states. [2018-11-23 13:10:45,969 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 56 states. [2018-11-23 13:10:45,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:45,971 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-11-23 13:10:45,972 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-11-23 13:10:45,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:45,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:45,973 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 73 states. [2018-11-23 13:10:45,973 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 73 states. [2018-11-23 13:10:45,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:45,977 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-11-23 13:10:45,977 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-11-23 13:10:45,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:45,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:45,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:45,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:45,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 13:10:45,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-23 13:10:45,981 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2018-11-23 13:10:45,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:45,981 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-23 13:10:45,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:10:45,982 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-23 13:10:45,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:10:45,982 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:45,983 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:45,987 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:45,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:45,988 INFO L82 PathProgramCache]: Analyzing trace with hash -910118681, now seen corresponding path program 1 times [2018-11-23 13:10:45,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:45,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:45,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:45,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:45,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:46,112 INFO L256 TraceCheckUtils]: 0: Hoare triple {1141#true} call ULTIMATE.init(); {1141#true} is VALID [2018-11-23 13:10:46,113 INFO L273 TraceCheckUtils]: 1: Hoare triple {1141#true} ~__return_main~0 := 0;~__return_334~0 := 0; {1141#true} is VALID [2018-11-23 13:10:46,113 INFO L273 TraceCheckUtils]: 2: Hoare triple {1141#true} assume true; {1141#true} is VALID [2018-11-23 13:10:46,113 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1141#true} {1141#true} #139#return; {1141#true} is VALID [2018-11-23 13:10:46,114 INFO L256 TraceCheckUtils]: 4: Hoare triple {1141#true} call #t~ret4 := main(); {1141#true} is VALID [2018-11-23 13:10:46,114 INFO L273 TraceCheckUtils]: 5: Hoare triple {1141#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {1141#true} is VALID [2018-11-23 13:10:46,116 INFO L273 TraceCheckUtils]: 6: Hoare triple {1141#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {1143#(<= 0 main_~main__i~0)} is VALID [2018-11-23 13:10:46,117 INFO L273 TraceCheckUtils]: 7: Hoare triple {1143#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {1144#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__i~0))} is VALID [2018-11-23 13:10:46,117 INFO L273 TraceCheckUtils]: 8: Hoare triple {1144#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__i~0))} assume ~main__i~0 < ~main__len~0; {1144#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__i~0))} is VALID [2018-11-23 13:10:46,123 INFO L273 TraceCheckUtils]: 9: Hoare triple {1144#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__i~0))} assume ~main__j~0 < ~main__limit~0; {1144#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__i~0))} is VALID [2018-11-23 13:10:46,127 INFO L273 TraceCheckUtils]: 10: Hoare triple {1144#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__i~0))} assume !(1 + ~main__i~0 < ~main__len~0); {1144#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__i~0))} is VALID [2018-11-23 13:10:46,128 INFO L273 TraceCheckUtils]: 11: Hoare triple {1144#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__i~0))} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1145#(and (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~2 1))} is VALID [2018-11-23 13:10:46,128 INFO L273 TraceCheckUtils]: 12: Hoare triple {1145#(and (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~2 1))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {1146#(not (= 0 main_~__VERIFIER_assert__cond~3))} is VALID [2018-11-23 13:10:46,134 INFO L273 TraceCheckUtils]: 13: Hoare triple {1146#(not (= 0 main_~__VERIFIER_assert__cond~3))} assume 0 == ~__VERIFIER_assert__cond~3; {1142#false} is VALID [2018-11-23 13:10:46,134 INFO L273 TraceCheckUtils]: 14: Hoare triple {1142#false} assume !false; {1142#false} is VALID [2018-11-23 13:10:46,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:46,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:10:46,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:10:46,136 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 13:10:46,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:46,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:10:46,152 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:46,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:10:46,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:10:46,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:10:46,154 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 6 states. [2018-11-23 13:10:46,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:46,836 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-11-23 13:10:46,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:10:46,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 13:10:46,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:46,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:10:46,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2018-11-23 13:10:46,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:10:46,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2018-11-23 13:10:46,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 106 transitions. [2018-11-23 13:10:46,976 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:46,980 INFO L225 Difference]: With dead ends: 98 [2018-11-23 13:10:46,980 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 13:10:46,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:10:46,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 13:10:47,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 54. [2018-11-23 13:10:47,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:47,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 54 states. [2018-11-23 13:10:47,028 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 54 states. [2018-11-23 13:10:47,028 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 54 states. [2018-11-23 13:10:47,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:47,032 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2018-11-23 13:10:47,032 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-11-23 13:10:47,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:47,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:47,033 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 96 states. [2018-11-23 13:10:47,033 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 96 states. [2018-11-23 13:10:47,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:47,038 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2018-11-23 13:10:47,038 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-11-23 13:10:47,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:47,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:47,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:47,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:47,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 13:10:47,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-23 13:10:47,041 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2018-11-23 13:10:47,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:47,042 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-23 13:10:47,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:10:47,042 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-23 13:10:47,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:10:47,043 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:47,043 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:47,044 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:47,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:47,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1851095055, now seen corresponding path program 1 times [2018-11-23 13:10:47,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:47,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:47,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:47,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:47,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:47,207 INFO L256 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2018-11-23 13:10:47,207 INFO L273 TraceCheckUtils]: 1: Hoare triple {1521#true} ~__return_main~0 := 0;~__return_334~0 := 0; {1521#true} is VALID [2018-11-23 13:10:47,208 INFO L273 TraceCheckUtils]: 2: Hoare triple {1521#true} assume true; {1521#true} is VALID [2018-11-23 13:10:47,208 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1521#true} {1521#true} #139#return; {1521#true} is VALID [2018-11-23 13:10:47,208 INFO L256 TraceCheckUtils]: 4: Hoare triple {1521#true} call #t~ret4 := main(); {1521#true} is VALID [2018-11-23 13:10:47,209 INFO L273 TraceCheckUtils]: 5: Hoare triple {1521#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {1521#true} is VALID [2018-11-23 13:10:47,211 INFO L273 TraceCheckUtils]: 6: Hoare triple {1521#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {1523#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2018-11-23 13:10:47,212 INFO L273 TraceCheckUtils]: 7: Hoare triple {1523#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {1524#(and (< main_~main__i~0 main_~main__len~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0))} is VALID [2018-11-23 13:10:47,212 INFO L273 TraceCheckUtils]: 8: Hoare triple {1524#(and (< main_~main__i~0 main_~main__len~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0))} assume ~main__i~0 < ~main__len~0; {1524#(and (< main_~main__i~0 main_~main__len~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0))} is VALID [2018-11-23 13:10:47,216 INFO L273 TraceCheckUtils]: 9: Hoare triple {1524#(and (< main_~main__i~0 main_~main__len~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0))} assume ~main__j~0 < ~main__limit~0; {1525#(and (< main_~main__i~0 main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0))} is VALID [2018-11-23 13:10:47,217 INFO L273 TraceCheckUtils]: 10: Hoare triple {1525#(and (< main_~main__i~0 main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0))} assume !(1 + ~main__i~0 < ~main__len~0); {1525#(and (< main_~main__i~0 main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0))} is VALID [2018-11-23 13:10:47,218 INFO L273 TraceCheckUtils]: 11: Hoare triple {1525#(and (< main_~main__i~0 main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0))} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1526#(and (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= main_~__VERIFIER_assert__cond~2 1))} is VALID [2018-11-23 13:10:47,223 INFO L273 TraceCheckUtils]: 12: Hoare triple {1526#(and (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= main_~__VERIFIER_assert__cond~2 1))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {1527#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-23 13:10:47,229 INFO L273 TraceCheckUtils]: 13: Hoare triple {1527#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~3);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {1528#(not (= 0 main_~__VERIFIER_assert__cond~4))} is VALID [2018-11-23 13:10:47,229 INFO L273 TraceCheckUtils]: 14: Hoare triple {1528#(not (= 0 main_~__VERIFIER_assert__cond~4))} assume 0 == ~__VERIFIER_assert__cond~4; {1522#false} is VALID [2018-11-23 13:10:47,230 INFO L273 TraceCheckUtils]: 15: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2018-11-23 13:10:47,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:47,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:10:47,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 13:10:47,231 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-11-23 13:10:47,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:47,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:10:47,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:47,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:10:47,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:10:47,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:10:47,250 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 8 states. [2018-11-23 13:10:48,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:48,527 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-11-23 13:10:48,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:10:48,527 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-11-23 13:10:48,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:48,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:10:48,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2018-11-23 13:10:48,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:10:48,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2018-11-23 13:10:48,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 105 transitions. [2018-11-23 13:10:48,773 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:48,775 INFO L225 Difference]: With dead ends: 97 [2018-11-23 13:10:48,775 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 13:10:48,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:10:48,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 13:10:48,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 52. [2018-11-23 13:10:48,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:48,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 52 states. [2018-11-23 13:10:48,859 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 52 states. [2018-11-23 13:10:48,859 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 52 states. [2018-11-23 13:10:48,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:48,862 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2018-11-23 13:10:48,862 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-11-23 13:10:48,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:48,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:48,863 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 95 states. [2018-11-23 13:10:48,863 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 95 states. [2018-11-23 13:10:48,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:48,867 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2018-11-23 13:10:48,867 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-11-23 13:10:48,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:48,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:48,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:48,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:48,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 13:10:48,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-11-23 13:10:48,870 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-11-23 13:10:48,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:48,870 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-11-23 13:10:48,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:10:48,871 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 13:10:48,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:10:48,871 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:48,871 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:48,872 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:48,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:48,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1194066488, now seen corresponding path program 1 times [2018-11-23 13:10:48,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:48,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:48,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:48,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:48,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:49,013 INFO L256 TraceCheckUtils]: 0: Hoare triple {1904#true} call ULTIMATE.init(); {1904#true} is VALID [2018-11-23 13:10:49,013 INFO L273 TraceCheckUtils]: 1: Hoare triple {1904#true} ~__return_main~0 := 0;~__return_334~0 := 0; {1904#true} is VALID [2018-11-23 13:10:49,014 INFO L273 TraceCheckUtils]: 2: Hoare triple {1904#true} assume true; {1904#true} is VALID [2018-11-23 13:10:49,014 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1904#true} {1904#true} #139#return; {1904#true} is VALID [2018-11-23 13:10:49,014 INFO L256 TraceCheckUtils]: 4: Hoare triple {1904#true} call #t~ret4 := main(); {1904#true} is VALID [2018-11-23 13:10:49,014 INFO L273 TraceCheckUtils]: 5: Hoare triple {1904#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {1904#true} is VALID [2018-11-23 13:10:49,014 INFO L273 TraceCheckUtils]: 6: Hoare triple {1904#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {1904#true} is VALID [2018-11-23 13:10:49,016 INFO L273 TraceCheckUtils]: 7: Hoare triple {1904#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {1906#(< main_~main__i~0 main_~main__len~0)} is VALID [2018-11-23 13:10:49,016 INFO L273 TraceCheckUtils]: 8: Hoare triple {1906#(< main_~main__i~0 main_~main__len~0)} assume ~main__i~0 < ~main__len~0; {1906#(< main_~main__i~0 main_~main__len~0)} is VALID [2018-11-23 13:10:49,018 INFO L273 TraceCheckUtils]: 9: Hoare triple {1906#(< main_~main__i~0 main_~main__len~0)} assume ~main__j~0 < ~main__limit~0; {1906#(< main_~main__i~0 main_~main__len~0)} is VALID [2018-11-23 13:10:49,018 INFO L273 TraceCheckUtils]: 10: Hoare triple {1906#(< main_~main__i~0 main_~main__len~0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1907#(and (< main_~main__i~0 main_~main__len~0) (= main_~__VERIFIER_assert__cond~0 1))} is VALID [2018-11-23 13:10:49,020 INFO L273 TraceCheckUtils]: 11: Hoare triple {1907#(and (< main_~main__i~0 main_~main__len~0) (= main_~__VERIFIER_assert__cond~0 1))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1906#(< main_~main__i~0 main_~main__len~0)} is VALID [2018-11-23 13:10:49,020 INFO L273 TraceCheckUtils]: 12: Hoare triple {1906#(< main_~main__i~0 main_~main__len~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {1906#(< main_~main__i~0 main_~main__len~0)} is VALID [2018-11-23 13:10:49,022 INFO L273 TraceCheckUtils]: 13: Hoare triple {1906#(< main_~main__i~0 main_~main__len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {1908#(not (= 0 main_~__VERIFIER_assert__cond~6))} is VALID [2018-11-23 13:10:49,026 INFO L273 TraceCheckUtils]: 14: Hoare triple {1908#(not (= 0 main_~__VERIFIER_assert__cond~6))} assume 0 == ~__VERIFIER_assert__cond~6; {1905#false} is VALID [2018-11-23 13:10:49,026 INFO L273 TraceCheckUtils]: 15: Hoare triple {1905#false} assume !false; {1905#false} is VALID [2018-11-23 13:10:49,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:49,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:10:49,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:10:49,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 13:10:49,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:49,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:10:49,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:49,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:10:49,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:10:49,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:10:49,061 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2018-11-23 13:10:49,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:49,653 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2018-11-23 13:10:49,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:10:49,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 13:10:49,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:49,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:10:49,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2018-11-23 13:10:49,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:10:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2018-11-23 13:10:49,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 91 transitions. [2018-11-23 13:10:49,781 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:49,783 INFO L225 Difference]: With dead ends: 83 [2018-11-23 13:10:49,783 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 13:10:49,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:10:49,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 13:10:49,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 50. [2018-11-23 13:10:49,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:49,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 50 states. [2018-11-23 13:10:49,829 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 50 states. [2018-11-23 13:10:49,829 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 50 states. [2018-11-23 13:10:49,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:49,831 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-11-23 13:10:49,831 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-11-23 13:10:49,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:49,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:49,832 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 81 states. [2018-11-23 13:10:49,832 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 81 states. [2018-11-23 13:10:49,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:49,834 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-11-23 13:10:49,834 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-11-23 13:10:49,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:49,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:49,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:49,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 13:10:49,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-23 13:10:49,837 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2018-11-23 13:10:49,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:49,837 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-23 13:10:49,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:10:49,837 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 13:10:49,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:10:49,838 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:49,838 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:49,838 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:49,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:49,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1549374957, now seen corresponding path program 1 times [2018-11-23 13:10:49,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:49,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:49,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:49,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:49,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:49,985 INFO L256 TraceCheckUtils]: 0: Hoare triple {2234#true} call ULTIMATE.init(); {2234#true} is VALID [2018-11-23 13:10:49,986 INFO L273 TraceCheckUtils]: 1: Hoare triple {2234#true} ~__return_main~0 := 0;~__return_334~0 := 0; {2234#true} is VALID [2018-11-23 13:10:49,986 INFO L273 TraceCheckUtils]: 2: Hoare triple {2234#true} assume true; {2234#true} is VALID [2018-11-23 13:10:49,986 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2234#true} {2234#true} #139#return; {2234#true} is VALID [2018-11-23 13:10:49,987 INFO L256 TraceCheckUtils]: 4: Hoare triple {2234#true} call #t~ret4 := main(); {2234#true} is VALID [2018-11-23 13:10:49,987 INFO L273 TraceCheckUtils]: 5: Hoare triple {2234#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {2234#true} is VALID [2018-11-23 13:10:49,987 INFO L273 TraceCheckUtils]: 6: Hoare triple {2234#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {2234#true} is VALID [2018-11-23 13:10:49,988 INFO L273 TraceCheckUtils]: 7: Hoare triple {2234#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {2236#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0))} is VALID [2018-11-23 13:10:49,988 INFO L273 TraceCheckUtils]: 8: Hoare triple {2236#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0))} assume ~main__i~0 < ~main__len~0; {2236#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0))} is VALID [2018-11-23 13:10:49,990 INFO L273 TraceCheckUtils]: 9: Hoare triple {2236#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0))} assume ~main__j~0 < ~main__limit~0; {2236#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0))} is VALID [2018-11-23 13:10:49,991 INFO L273 TraceCheckUtils]: 10: Hoare triple {2236#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0))} assume !(1 + ~main__i~0 < ~main__len~0); {2236#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0))} is VALID [2018-11-23 13:10:49,992 INFO L273 TraceCheckUtils]: 11: Hoare triple {2236#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0))} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2237#(and (= main_~__VERIFIER_assert__cond~2 1) (<= 0 main_~main__j~0))} is VALID [2018-11-23 13:10:49,992 INFO L273 TraceCheckUtils]: 12: Hoare triple {2237#(and (= main_~__VERIFIER_assert__cond~2 1) (<= 0 main_~main__j~0))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2238#(<= 0 main_~main__j~0)} is VALID [2018-11-23 13:10:49,993 INFO L273 TraceCheckUtils]: 13: Hoare triple {2238#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~3);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {2238#(<= 0 main_~main__j~0)} is VALID [2018-11-23 13:10:49,993 INFO L273 TraceCheckUtils]: 14: Hoare triple {2238#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {2239#(not (= 0 main_~__VERIFIER_assert__cond~5))} is VALID [2018-11-23 13:10:49,993 INFO L273 TraceCheckUtils]: 15: Hoare triple {2239#(not (= 0 main_~__VERIFIER_assert__cond~5))} assume 0 == ~__VERIFIER_assert__cond~5; {2235#false} is VALID [2018-11-23 13:10:49,994 INFO L273 TraceCheckUtils]: 16: Hoare triple {2235#false} assume !false; {2235#false} is VALID [2018-11-23 13:10:49,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:49,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:10:49,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:10:49,995 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 13:10:49,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:49,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:10:50,144 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:50,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:10:50,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:10:50,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:10:50,145 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 6 states. [2018-11-23 13:10:50,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:50,895 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-11-23 13:10:50,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:10:50,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 13:10:50,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:50,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:10:50,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2018-11-23 13:10:50,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:10:50,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2018-11-23 13:10:50,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2018-11-23 13:10:51,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:51,013 INFO L225 Difference]: With dead ends: 93 [2018-11-23 13:10:51,013 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 13:10:51,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:10:51,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 13:10:51,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 48. [2018-11-23 13:10:51,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:51,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 48 states. [2018-11-23 13:10:51,058 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 48 states. [2018-11-23 13:10:51,058 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 48 states. [2018-11-23 13:10:51,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:51,063 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2018-11-23 13:10:51,063 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2018-11-23 13:10:51,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:51,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:51,064 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 91 states. [2018-11-23 13:10:51,064 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 91 states. [2018-11-23 13:10:51,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:51,067 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2018-11-23 13:10:51,067 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2018-11-23 13:10:51,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:51,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:51,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:51,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:51,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 13:10:51,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-11-23 13:10:51,070 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2018-11-23 13:10:51,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:51,071 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-23 13:10:51,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:10:51,071 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-23 13:10:51,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:10:51,071 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:51,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:51,072 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:51,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:51,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1638647651, now seen corresponding path program 1 times [2018-11-23 13:10:51,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:51,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:51,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:51,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:51,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:51,185 INFO L256 TraceCheckUtils]: 0: Hoare triple {2594#true} call ULTIMATE.init(); {2594#true} is VALID [2018-11-23 13:10:51,185 INFO L273 TraceCheckUtils]: 1: Hoare triple {2594#true} ~__return_main~0 := 0;~__return_334~0 := 0; {2594#true} is VALID [2018-11-23 13:10:51,185 INFO L273 TraceCheckUtils]: 2: Hoare triple {2594#true} assume true; {2594#true} is VALID [2018-11-23 13:10:51,185 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2594#true} {2594#true} #139#return; {2594#true} is VALID [2018-11-23 13:10:51,186 INFO L256 TraceCheckUtils]: 4: Hoare triple {2594#true} call #t~ret4 := main(); {2594#true} is VALID [2018-11-23 13:10:51,186 INFO L273 TraceCheckUtils]: 5: Hoare triple {2594#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {2594#true} is VALID [2018-11-23 13:10:51,186 INFO L273 TraceCheckUtils]: 6: Hoare triple {2594#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {2594#true} is VALID [2018-11-23 13:10:51,186 INFO L273 TraceCheckUtils]: 7: Hoare triple {2594#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {2594#true} is VALID [2018-11-23 13:10:51,187 INFO L273 TraceCheckUtils]: 8: Hoare triple {2594#true} assume ~main__i~0 < ~main__len~0; {2594#true} is VALID [2018-11-23 13:10:51,187 INFO L273 TraceCheckUtils]: 9: Hoare triple {2594#true} assume ~main__j~0 < ~main__limit~0; {2594#true} is VALID [2018-11-23 13:10:51,187 INFO L273 TraceCheckUtils]: 10: Hoare triple {2594#true} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2594#true} is VALID [2018-11-23 13:10:51,188 INFO L273 TraceCheckUtils]: 11: Hoare triple {2594#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2596#(or (and (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~1 1)) (and (< main_~main__i~0 0) (= main_~__VERIFIER_assert__cond~1 0)))} is VALID [2018-11-23 13:10:51,190 INFO L273 TraceCheckUtils]: 12: Hoare triple {2596#(or (and (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~1 1)) (and (< main_~main__i~0 0) (= main_~__VERIFIER_assert__cond~1 0)))} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {2597#(<= 0 main_~main__i~0)} is VALID [2018-11-23 13:10:51,190 INFO L273 TraceCheckUtils]: 13: Hoare triple {2597#(<= 0 main_~main__i~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {2597#(<= 0 main_~main__i~0)} is VALID [2018-11-23 13:10:51,192 INFO L273 TraceCheckUtils]: 14: Hoare triple {2597#(<= 0 main_~main__i~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {2598#(not (= 0 main_~__VERIFIER_assert__cond~7))} is VALID [2018-11-23 13:10:51,209 INFO L273 TraceCheckUtils]: 15: Hoare triple {2598#(not (= 0 main_~__VERIFIER_assert__cond~7))} assume 0 == ~__VERIFIER_assert__cond~7; {2595#false} is VALID [2018-11-23 13:10:51,209 INFO L273 TraceCheckUtils]: 16: Hoare triple {2595#false} assume !false; {2595#false} is VALID [2018-11-23 13:10:51,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:51,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:10:51,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:10:51,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 13:10:51,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:51,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:10:51,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:51,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:10:51,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:10:51,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:10:51,268 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 5 states. [2018-11-23 13:10:51,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:51,666 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2018-11-23 13:10:51,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:10:51,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 13:10:51,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:51,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:10:51,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2018-11-23 13:10:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:10:51,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2018-11-23 13:10:51,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2018-11-23 13:10:51,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:51,763 INFO L225 Difference]: With dead ends: 73 [2018-11-23 13:10:51,763 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 13:10:51,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:10:51,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 13:10:51,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2018-11-23 13:10:51,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:51,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 46 states. [2018-11-23 13:10:51,808 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 46 states. [2018-11-23 13:10:51,808 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 46 states. [2018-11-23 13:10:51,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:51,813 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-11-23 13:10:51,813 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2018-11-23 13:10:51,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:51,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:51,814 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 71 states. [2018-11-23 13:10:51,814 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 71 states. [2018-11-23 13:10:51,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:51,817 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-11-23 13:10:51,817 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2018-11-23 13:10:51,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:51,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:51,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:51,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:51,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 13:10:51,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-23 13:10:51,820 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2018-11-23 13:10:51,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:51,820 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-23 13:10:51,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:10:51,820 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-23 13:10:51,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:10:51,821 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:51,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:51,821 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:51,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:51,822 INFO L82 PathProgramCache]: Analyzing trace with hash -741527250, now seen corresponding path program 1 times [2018-11-23 13:10:51,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:51,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:51,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:51,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:51,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:51,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {2892#true} call ULTIMATE.init(); {2892#true} is VALID [2018-11-23 13:10:51,941 INFO L273 TraceCheckUtils]: 1: Hoare triple {2892#true} ~__return_main~0 := 0;~__return_334~0 := 0; {2892#true} is VALID [2018-11-23 13:10:51,941 INFO L273 TraceCheckUtils]: 2: Hoare triple {2892#true} assume true; {2892#true} is VALID [2018-11-23 13:10:51,942 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2892#true} {2892#true} #139#return; {2892#true} is VALID [2018-11-23 13:10:51,942 INFO L256 TraceCheckUtils]: 4: Hoare triple {2892#true} call #t~ret4 := main(); {2892#true} is VALID [2018-11-23 13:10:51,942 INFO L273 TraceCheckUtils]: 5: Hoare triple {2892#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {2892#true} is VALID [2018-11-23 13:10:51,943 INFO L273 TraceCheckUtils]: 6: Hoare triple {2892#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {2894#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2018-11-23 13:10:51,944 INFO L273 TraceCheckUtils]: 7: Hoare triple {2894#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {2894#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2018-11-23 13:10:51,944 INFO L273 TraceCheckUtils]: 8: Hoare triple {2894#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0; {2894#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2018-11-23 13:10:51,944 INFO L273 TraceCheckUtils]: 9: Hoare triple {2894#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__j~0 < ~main__limit~0; {2895#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-23 13:10:51,945 INFO L273 TraceCheckUtils]: 10: Hoare triple {2895#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2896#(and (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= main_~__VERIFIER_assert__cond~0 1))} is VALID [2018-11-23 13:10:51,945 INFO L273 TraceCheckUtils]: 11: Hoare triple {2896#(and (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= main_~__VERIFIER_assert__cond~0 1))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2895#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-23 13:10:51,946 INFO L273 TraceCheckUtils]: 12: Hoare triple {2895#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {2895#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-23 13:10:51,946 INFO L273 TraceCheckUtils]: 13: Hoare triple {2895#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {2895#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-23 13:10:51,946 INFO L273 TraceCheckUtils]: 14: Hoare triple {2895#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {2895#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-23 13:10:51,947 INFO L273 TraceCheckUtils]: 15: Hoare triple {2895#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {2897#(not (= 0 main_~__VERIFIER_assert__cond~8))} is VALID [2018-11-23 13:10:51,948 INFO L273 TraceCheckUtils]: 16: Hoare triple {2897#(not (= 0 main_~__VERIFIER_assert__cond~8))} assume 0 == ~__VERIFIER_assert__cond~8; {2893#false} is VALID [2018-11-23 13:10:51,948 INFO L273 TraceCheckUtils]: 17: Hoare triple {2893#false} assume !false; {2893#false} is VALID [2018-11-23 13:10:51,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:51,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:10:51,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:10:51,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 13:10:51,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:51,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:10:51,976 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:51,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:10:51,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:10:51,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:10:51,977 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 6 states. [2018-11-23 13:10:52,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:52,491 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-11-23 13:10:52,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:10:52,491 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 13:10:52,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:10:52,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2018-11-23 13:10:52,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:10:52,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2018-11-23 13:10:52,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 77 transitions. [2018-11-23 13:10:52,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:52,668 INFO L225 Difference]: With dead ends: 71 [2018-11-23 13:10:52,668 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 13:10:52,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:10:52,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 13:10:53,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 44. [2018-11-23 13:10:53,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:53,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 44 states. [2018-11-23 13:10:53,231 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 44 states. [2018-11-23 13:10:53,231 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 44 states. [2018-11-23 13:10:53,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:53,234 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2018-11-23 13:10:53,234 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2018-11-23 13:10:53,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:53,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:53,235 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 69 states. [2018-11-23 13:10:53,235 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 69 states. [2018-11-23 13:10:53,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:53,237 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2018-11-23 13:10:53,237 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2018-11-23 13:10:53,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:53,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:53,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:53,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:53,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 13:10:53,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-23 13:10:53,240 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2018-11-23 13:10:53,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:53,240 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-23 13:10:53,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:10:53,240 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-23 13:10:53,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:10:53,241 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:53,241 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:53,242 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:53,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:53,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1512505143, now seen corresponding path program 1 times [2018-11-23 13:10:53,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:53,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:53,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:53,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:53,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:53,330 INFO L256 TraceCheckUtils]: 0: Hoare triple {3185#true} call ULTIMATE.init(); {3185#true} is VALID [2018-11-23 13:10:53,330 INFO L273 TraceCheckUtils]: 1: Hoare triple {3185#true} ~__return_main~0 := 0;~__return_334~0 := 0; {3185#true} is VALID [2018-11-23 13:10:53,330 INFO L273 TraceCheckUtils]: 2: Hoare triple {3185#true} assume true; {3185#true} is VALID [2018-11-23 13:10:53,331 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3185#true} {3185#true} #139#return; {3185#true} is VALID [2018-11-23 13:10:53,331 INFO L256 TraceCheckUtils]: 4: Hoare triple {3185#true} call #t~ret4 := main(); {3185#true} is VALID [2018-11-23 13:10:53,331 INFO L273 TraceCheckUtils]: 5: Hoare triple {3185#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {3185#true} is VALID [2018-11-23 13:10:53,331 INFO L273 TraceCheckUtils]: 6: Hoare triple {3185#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {3185#true} is VALID [2018-11-23 13:10:53,332 INFO L273 TraceCheckUtils]: 7: Hoare triple {3185#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {3187#(<= 0 main_~main__j~0)} is VALID [2018-11-23 13:10:53,332 INFO L273 TraceCheckUtils]: 8: Hoare triple {3187#(<= 0 main_~main__j~0)} assume ~main__i~0 < ~main__len~0; {3187#(<= 0 main_~main__j~0)} is VALID [2018-11-23 13:10:53,332 INFO L273 TraceCheckUtils]: 9: Hoare triple {3187#(<= 0 main_~main__j~0)} assume ~main__j~0 < ~main__limit~0; {3187#(<= 0 main_~main__j~0)} is VALID [2018-11-23 13:10:53,333 INFO L273 TraceCheckUtils]: 10: Hoare triple {3187#(<= 0 main_~main__j~0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3188#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__j~0))} is VALID [2018-11-23 13:10:53,333 INFO L273 TraceCheckUtils]: 11: Hoare triple {3188#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__j~0))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3187#(<= 0 main_~main__j~0)} is VALID [2018-11-23 13:10:53,333 INFO L273 TraceCheckUtils]: 12: Hoare triple {3187#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {3187#(<= 0 main_~main__j~0)} is VALID [2018-11-23 13:10:53,334 INFO L273 TraceCheckUtils]: 13: Hoare triple {3187#(<= 0 main_~main__j~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {3187#(<= 0 main_~main__j~0)} is VALID [2018-11-23 13:10:53,334 INFO L273 TraceCheckUtils]: 14: Hoare triple {3187#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {3187#(<= 0 main_~main__j~0)} is VALID [2018-11-23 13:10:53,335 INFO L273 TraceCheckUtils]: 15: Hoare triple {3187#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {3187#(<= 0 main_~main__j~0)} is VALID [2018-11-23 13:10:53,336 INFO L273 TraceCheckUtils]: 16: Hoare triple {3187#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {3189#(not (= 0 main_~__VERIFIER_assert__cond~9))} is VALID [2018-11-23 13:10:53,337 INFO L273 TraceCheckUtils]: 17: Hoare triple {3189#(not (= 0 main_~__VERIFIER_assert__cond~9))} assume 0 == ~__VERIFIER_assert__cond~9; {3186#false} is VALID [2018-11-23 13:10:53,337 INFO L273 TraceCheckUtils]: 18: Hoare triple {3186#false} assume !false; {3186#false} is VALID [2018-11-23 13:10:53,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:53,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:10:53,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:10:53,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 13:10:53,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:53,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:10:53,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:53,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:10:53,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:10:53,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:10:53,385 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2018-11-23 13:10:54,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:54,044 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-11-23 13:10:54,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:10:54,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 13:10:54,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:54,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:10:54,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2018-11-23 13:10:54,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:10:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2018-11-23 13:10:54,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 79 transitions. [2018-11-23 13:10:54,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:54,160 INFO L225 Difference]: With dead ends: 71 [2018-11-23 13:10:54,160 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 13:10:54,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:10:54,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 13:10:54,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 42. [2018-11-23 13:10:54,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:54,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 42 states. [2018-11-23 13:10:54,214 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 42 states. [2018-11-23 13:10:54,214 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 42 states. [2018-11-23 13:10:54,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:54,217 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-11-23 13:10:54,217 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-11-23 13:10:54,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:54,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:54,217 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 69 states. [2018-11-23 13:10:54,218 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 69 states. [2018-11-23 13:10:54,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:54,219 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-11-23 13:10:54,219 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-11-23 13:10:54,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:54,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:54,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:54,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:54,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 13:10:54,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-23 13:10:54,221 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2018-11-23 13:10:54,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:54,221 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-23 13:10:54,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:10:54,222 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-23 13:10:54,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:10:54,222 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:54,222 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:54,223 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:54,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:54,223 INFO L82 PathProgramCache]: Analyzing trace with hash 356983956, now seen corresponding path program 1 times [2018-11-23 13:10:54,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:54,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:54,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:54,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:54,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:54,296 INFO L256 TraceCheckUtils]: 0: Hoare triple {3470#true} call ULTIMATE.init(); {3470#true} is VALID [2018-11-23 13:10:54,296 INFO L273 TraceCheckUtils]: 1: Hoare triple {3470#true} ~__return_main~0 := 0;~__return_334~0 := 0; {3470#true} is VALID [2018-11-23 13:10:54,296 INFO L273 TraceCheckUtils]: 2: Hoare triple {3470#true} assume true; {3470#true} is VALID [2018-11-23 13:10:54,297 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3470#true} {3470#true} #139#return; {3470#true} is VALID [2018-11-23 13:10:54,297 INFO L256 TraceCheckUtils]: 4: Hoare triple {3470#true} call #t~ret4 := main(); {3470#true} is VALID [2018-11-23 13:10:54,297 INFO L273 TraceCheckUtils]: 5: Hoare triple {3470#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {3470#true} is VALID [2018-11-23 13:10:54,297 INFO L273 TraceCheckUtils]: 6: Hoare triple {3470#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {3470#true} is VALID [2018-11-23 13:10:54,298 INFO L273 TraceCheckUtils]: 7: Hoare triple {3470#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {3470#true} is VALID [2018-11-23 13:10:54,298 INFO L273 TraceCheckUtils]: 8: Hoare triple {3470#true} assume ~main__i~0 < ~main__len~0; {3470#true} is VALID [2018-11-23 13:10:54,298 INFO L273 TraceCheckUtils]: 9: Hoare triple {3470#true} assume ~main__j~0 < ~main__limit~0; {3470#true} is VALID [2018-11-23 13:10:54,299 INFO L273 TraceCheckUtils]: 10: Hoare triple {3470#true} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3472#(and (<= (+ main_~main__i~0 2) main_~main__len~0) (= main_~__VERIFIER_assert__cond~0 1))} is VALID [2018-11-23 13:10:54,299 INFO L273 TraceCheckUtils]: 11: Hoare triple {3472#(and (<= (+ main_~main__i~0 2) main_~main__len~0) (= main_~__VERIFIER_assert__cond~0 1))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3473#(<= (+ main_~main__i~0 2) main_~main__len~0)} is VALID [2018-11-23 13:10:54,300 INFO L273 TraceCheckUtils]: 12: Hoare triple {3473#(<= (+ main_~main__i~0 2) main_~main__len~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {3473#(<= (+ main_~main__i~0 2) main_~main__len~0)} is VALID [2018-11-23 13:10:54,300 INFO L273 TraceCheckUtils]: 13: Hoare triple {3473#(<= (+ main_~main__i~0 2) main_~main__len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {3473#(<= (+ main_~main__i~0 2) main_~main__len~0)} is VALID [2018-11-23 13:10:54,300 INFO L273 TraceCheckUtils]: 14: Hoare triple {3473#(<= (+ main_~main__i~0 2) main_~main__len~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {3473#(<= (+ main_~main__i~0 2) main_~main__len~0)} is VALID [2018-11-23 13:10:54,301 INFO L273 TraceCheckUtils]: 15: Hoare triple {3473#(<= (+ main_~main__i~0 2) main_~main__len~0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {3473#(<= (+ main_~main__i~0 2) main_~main__len~0)} is VALID [2018-11-23 13:10:54,301 INFO L273 TraceCheckUtils]: 16: Hoare triple {3473#(<= (+ main_~main__i~0 2) main_~main__len~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {3473#(<= (+ main_~main__i~0 2) main_~main__len~0)} is VALID [2018-11-23 13:10:54,302 INFO L273 TraceCheckUtils]: 17: Hoare triple {3473#(<= (+ main_~main__i~0 2) main_~main__len~0)} assume !(0 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {3474#(not (= 0 main_~__VERIFIER_assert__cond~10))} is VALID [2018-11-23 13:10:54,303 INFO L273 TraceCheckUtils]: 18: Hoare triple {3474#(not (= 0 main_~__VERIFIER_assert__cond~10))} assume 0 == ~__VERIFIER_assert__cond~10; {3471#false} is VALID [2018-11-23 13:10:54,304 INFO L273 TraceCheckUtils]: 19: Hoare triple {3471#false} assume !false; {3471#false} is VALID [2018-11-23 13:10:54,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:54,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:10:54,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:10:54,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 13:10:54,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:54,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:10:54,323 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:54,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:10:54,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:10:54,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:10:54,324 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2018-11-23 13:10:55,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:55,185 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2018-11-23 13:10:55,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:10:55,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 13:10:55,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:55,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:10:55,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2018-11-23 13:10:55,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:10:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2018-11-23 13:10:55,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 75 transitions. [2018-11-23 13:10:55,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:55,270 INFO L225 Difference]: With dead ends: 69 [2018-11-23 13:10:55,271 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 13:10:55,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:10:55,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 13:10:55,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2018-11-23 13:10:55,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:55,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 40 states. [2018-11-23 13:10:55,688 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 40 states. [2018-11-23 13:10:55,689 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 40 states. [2018-11-23 13:10:55,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:55,691 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-11-23 13:10:55,691 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2018-11-23 13:10:55,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:55,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:55,692 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 67 states. [2018-11-23 13:10:55,692 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 67 states. [2018-11-23 13:10:55,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:55,694 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-11-23 13:10:55,694 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2018-11-23 13:10:55,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:55,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:55,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:55,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:55,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:10:55,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-23 13:10:55,695 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2018-11-23 13:10:55,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:55,696 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-23 13:10:55,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:10:55,696 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 13:10:55,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 13:10:55,696 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:55,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:55,697 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:55,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:55,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1818396113, now seen corresponding path program 1 times [2018-11-23 13:10:55,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:55,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:55,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:55,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:55,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:55,877 INFO L256 TraceCheckUtils]: 0: Hoare triple {3744#true} call ULTIMATE.init(); {3744#true} is VALID [2018-11-23 13:10:55,877 INFO L273 TraceCheckUtils]: 1: Hoare triple {3744#true} ~__return_main~0 := 0;~__return_334~0 := 0; {3744#true} is VALID [2018-11-23 13:10:55,877 INFO L273 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2018-11-23 13:10:55,877 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3744#true} #139#return; {3744#true} is VALID [2018-11-23 13:10:55,877 INFO L256 TraceCheckUtils]: 4: Hoare triple {3744#true} call #t~ret4 := main(); {3744#true} is VALID [2018-11-23 13:10:55,878 INFO L273 TraceCheckUtils]: 5: Hoare triple {3744#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {3744#true} is VALID [2018-11-23 13:10:55,878 INFO L273 TraceCheckUtils]: 6: Hoare triple {3744#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {3746#(<= 0 main_~main__i~0)} is VALID [2018-11-23 13:10:55,879 INFO L273 TraceCheckUtils]: 7: Hoare triple {3746#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {3746#(<= 0 main_~main__i~0)} is VALID [2018-11-23 13:10:55,880 INFO L273 TraceCheckUtils]: 8: Hoare triple {3746#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0; {3746#(<= 0 main_~main__i~0)} is VALID [2018-11-23 13:10:55,880 INFO L273 TraceCheckUtils]: 9: Hoare triple {3746#(<= 0 main_~main__i~0)} assume ~main__j~0 < ~main__limit~0; {3746#(<= 0 main_~main__i~0)} is VALID [2018-11-23 13:10:55,880 INFO L273 TraceCheckUtils]: 10: Hoare triple {3746#(<= 0 main_~main__i~0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3747#(and (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 1))} is VALID [2018-11-23 13:10:55,881 INFO L273 TraceCheckUtils]: 11: Hoare triple {3747#(and (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 1))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3746#(<= 0 main_~main__i~0)} is VALID [2018-11-23 13:10:55,881 INFO L273 TraceCheckUtils]: 12: Hoare triple {3746#(<= 0 main_~main__i~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {3746#(<= 0 main_~main__i~0)} is VALID [2018-11-23 13:10:55,885 INFO L273 TraceCheckUtils]: 13: Hoare triple {3746#(<= 0 main_~main__i~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {3746#(<= 0 main_~main__i~0)} is VALID [2018-11-23 13:10:55,886 INFO L273 TraceCheckUtils]: 14: Hoare triple {3746#(<= 0 main_~main__i~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {3746#(<= 0 main_~main__i~0)} is VALID [2018-11-23 13:10:55,886 INFO L273 TraceCheckUtils]: 15: Hoare triple {3746#(<= 0 main_~main__i~0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {3746#(<= 0 main_~main__i~0)} is VALID [2018-11-23 13:10:55,887 INFO L273 TraceCheckUtils]: 16: Hoare triple {3746#(<= 0 main_~main__i~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {3746#(<= 0 main_~main__i~0)} is VALID [2018-11-23 13:10:55,887 INFO L273 TraceCheckUtils]: 17: Hoare triple {3746#(<= 0 main_~main__i~0)} assume !(0 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {3748#(<= 1 main_~main__i~0)} is VALID [2018-11-23 13:10:55,888 INFO L273 TraceCheckUtils]: 18: Hoare triple {3748#(<= 1 main_~main__i~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {3749#(not (= 0 main_~__VERIFIER_assert__cond~11))} is VALID [2018-11-23 13:10:55,888 INFO L273 TraceCheckUtils]: 19: Hoare triple {3749#(not (= 0 main_~__VERIFIER_assert__cond~11))} assume 0 == ~__VERIFIER_assert__cond~11; {3745#false} is VALID [2018-11-23 13:10:55,889 INFO L273 TraceCheckUtils]: 20: Hoare triple {3745#false} assume !false; {3745#false} is VALID [2018-11-23 13:10:55,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:55,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:10:55,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:10:55,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 13:10:55,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:55,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:10:55,911 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:55,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:10:55,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:10:55,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:10:55,912 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2018-11-23 13:10:56,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:56,612 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2018-11-23 13:10:56,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:10:56,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 13:10:56,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:56,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:10:56,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2018-11-23 13:10:56,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:10:56,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2018-11-23 13:10:56,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 100 transitions. [2018-11-23 13:10:56,789 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:56,791 INFO L225 Difference]: With dead ends: 89 [2018-11-23 13:10:56,792 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 13:10:56,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:10:56,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 13:10:56,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 38. [2018-11-23 13:10:56,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:56,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 38 states. [2018-11-23 13:10:56,869 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 38 states. [2018-11-23 13:10:56,869 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 38 states. [2018-11-23 13:10:56,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:56,872 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2018-11-23 13:10:56,872 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2018-11-23 13:10:56,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:56,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:56,873 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 87 states. [2018-11-23 13:10:56,873 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 87 states. [2018-11-23 13:10:56,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:56,875 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2018-11-23 13:10:56,876 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2018-11-23 13:10:56,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:56,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:56,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:56,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:56,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:10:56,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-23 13:10:56,878 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2018-11-23 13:10:56,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:56,878 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-23 13:10:56,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:10:56,879 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 13:10:56,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:10:56,879 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:56,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:56,880 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:56,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:56,881 INFO L82 PathProgramCache]: Analyzing trace with hash -535701510, now seen corresponding path program 1 times [2018-11-23 13:10:56,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:56,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:56,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:56,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:56,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:56,999 INFO L256 TraceCheckUtils]: 0: Hoare triple {4085#true} call ULTIMATE.init(); {4085#true} is VALID [2018-11-23 13:10:57,000 INFO L273 TraceCheckUtils]: 1: Hoare triple {4085#true} ~__return_main~0 := 0;~__return_334~0 := 0; {4085#true} is VALID [2018-11-23 13:10:57,000 INFO L273 TraceCheckUtils]: 2: Hoare triple {4085#true} assume true; {4085#true} is VALID [2018-11-23 13:10:57,001 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4085#true} {4085#true} #139#return; {4085#true} is VALID [2018-11-23 13:10:57,001 INFO L256 TraceCheckUtils]: 4: Hoare triple {4085#true} call #t~ret4 := main(); {4085#true} is VALID [2018-11-23 13:10:57,002 INFO L273 TraceCheckUtils]: 5: Hoare triple {4085#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {4085#true} is VALID [2018-11-23 13:10:57,007 INFO L273 TraceCheckUtils]: 6: Hoare triple {4085#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {4087#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2018-11-23 13:10:57,009 INFO L273 TraceCheckUtils]: 7: Hoare triple {4087#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {4087#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2018-11-23 13:10:57,009 INFO L273 TraceCheckUtils]: 8: Hoare triple {4087#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0; {4087#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2018-11-23 13:10:57,010 INFO L273 TraceCheckUtils]: 9: Hoare triple {4087#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__j~0 < ~main__limit~0; {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-23 13:10:57,011 INFO L273 TraceCheckUtils]: 10: Hoare triple {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4089#(and (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= main_~__VERIFIER_assert__cond~0 1))} is VALID [2018-11-23 13:10:57,012 INFO L273 TraceCheckUtils]: 11: Hoare triple {4089#(and (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= main_~__VERIFIER_assert__cond~0 1))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-23 13:10:57,012 INFO L273 TraceCheckUtils]: 12: Hoare triple {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-23 13:10:57,013 INFO L273 TraceCheckUtils]: 13: Hoare triple {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-23 13:10:57,021 INFO L273 TraceCheckUtils]: 14: Hoare triple {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-23 13:10:57,022 INFO L273 TraceCheckUtils]: 15: Hoare triple {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-23 13:10:57,022 INFO L273 TraceCheckUtils]: 16: Hoare triple {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-23 13:10:57,023 INFO L273 TraceCheckUtils]: 17: Hoare triple {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {4090#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} is VALID [2018-11-23 13:10:57,023 INFO L273 TraceCheckUtils]: 18: Hoare triple {4090#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {4090#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} is VALID [2018-11-23 13:10:57,024 INFO L273 TraceCheckUtils]: 19: Hoare triple {4090#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {4091#(not (= 0 main_~__VERIFIER_assert__cond~12))} is VALID [2018-11-23 13:10:57,033 INFO L273 TraceCheckUtils]: 20: Hoare triple {4091#(not (= 0 main_~__VERIFIER_assert__cond~12))} assume 0 == ~__VERIFIER_assert__cond~12; {4086#false} is VALID [2018-11-23 13:10:57,034 INFO L273 TraceCheckUtils]: 21: Hoare triple {4086#false} assume !false; {4086#false} is VALID [2018-11-23 13:10:57,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:57,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:10:57,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 13:10:57,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-23 13:10:57,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:57,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:10:57,059 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:57,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:10:57,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:10:57,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:10:57,060 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 7 states. [2018-11-23 13:10:58,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:58,027 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-11-23 13:10:58,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:10:58,027 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-23 13:10:58,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:58,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:10:58,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2018-11-23 13:10:58,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:10:58,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2018-11-23 13:10:58,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 82 transitions. [2018-11-23 13:10:58,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:58,129 INFO L225 Difference]: With dead ends: 72 [2018-11-23 13:10:58,130 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 13:10:58,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:10:58,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 13:10:58,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 36. [2018-11-23 13:10:58,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:58,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 36 states. [2018-11-23 13:10:58,234 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 36 states. [2018-11-23 13:10:58,234 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 36 states. [2018-11-23 13:10:58,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:58,236 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2018-11-23 13:10:58,236 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2018-11-23 13:10:58,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:58,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:58,237 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 70 states. [2018-11-23 13:10:58,237 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 70 states. [2018-11-23 13:10:58,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:58,238 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2018-11-23 13:10:58,239 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2018-11-23 13:10:58,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:58,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:58,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:58,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:58,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:10:58,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-23 13:10:58,240 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2018-11-23 13:10:58,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:58,241 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-23 13:10:58,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:10:58,241 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-23 13:10:58,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:10:58,242 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:58,242 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:58,242 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:58,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:58,243 INFO L82 PathProgramCache]: Analyzing trace with hash 573125525, now seen corresponding path program 1 times [2018-11-23 13:10:58,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:58,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:58,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:58,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:58,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:58,684 INFO L256 TraceCheckUtils]: 0: Hoare triple {4381#true} call ULTIMATE.init(); {4381#true} is VALID [2018-11-23 13:10:58,684 INFO L273 TraceCheckUtils]: 1: Hoare triple {4381#true} ~__return_main~0 := 0;~__return_334~0 := 0; {4381#true} is VALID [2018-11-23 13:10:58,684 INFO L273 TraceCheckUtils]: 2: Hoare triple {4381#true} assume true; {4381#true} is VALID [2018-11-23 13:10:58,684 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4381#true} {4381#true} #139#return; {4381#true} is VALID [2018-11-23 13:10:58,684 INFO L256 TraceCheckUtils]: 4: Hoare triple {4381#true} call #t~ret4 := main(); {4381#true} is VALID [2018-11-23 13:10:58,685 INFO L273 TraceCheckUtils]: 5: Hoare triple {4381#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {4381#true} is VALID [2018-11-23 13:10:58,685 INFO L273 TraceCheckUtils]: 6: Hoare triple {4381#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {4381#true} is VALID [2018-11-23 13:10:58,685 INFO L273 TraceCheckUtils]: 7: Hoare triple {4381#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {4383#(<= 0 main_~main__j~0)} is VALID [2018-11-23 13:10:58,685 INFO L273 TraceCheckUtils]: 8: Hoare triple {4383#(<= 0 main_~main__j~0)} assume ~main__i~0 < ~main__len~0; {4383#(<= 0 main_~main__j~0)} is VALID [2018-11-23 13:10:58,686 INFO L273 TraceCheckUtils]: 9: Hoare triple {4383#(<= 0 main_~main__j~0)} assume ~main__j~0 < ~main__limit~0; {4383#(<= 0 main_~main__j~0)} is VALID [2018-11-23 13:10:58,687 INFO L273 TraceCheckUtils]: 10: Hoare triple {4383#(<= 0 main_~main__j~0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4384#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__j~0))} is VALID [2018-11-23 13:10:58,687 INFO L273 TraceCheckUtils]: 11: Hoare triple {4384#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__j~0))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4383#(<= 0 main_~main__j~0)} is VALID [2018-11-23 13:10:58,688 INFO L273 TraceCheckUtils]: 12: Hoare triple {4383#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {4383#(<= 0 main_~main__j~0)} is VALID [2018-11-23 13:10:58,688 INFO L273 TraceCheckUtils]: 13: Hoare triple {4383#(<= 0 main_~main__j~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {4383#(<= 0 main_~main__j~0)} is VALID [2018-11-23 13:10:58,689 INFO L273 TraceCheckUtils]: 14: Hoare triple {4383#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {4383#(<= 0 main_~main__j~0)} is VALID [2018-11-23 13:10:58,690 INFO L273 TraceCheckUtils]: 15: Hoare triple {4383#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {4383#(<= 0 main_~main__j~0)} is VALID [2018-11-23 13:10:58,690 INFO L273 TraceCheckUtils]: 16: Hoare triple {4383#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {4383#(<= 0 main_~main__j~0)} is VALID [2018-11-23 13:10:58,691 INFO L273 TraceCheckUtils]: 17: Hoare triple {4383#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {4385#(<= 1 main_~main__j~0)} is VALID [2018-11-23 13:10:58,692 INFO L273 TraceCheckUtils]: 18: Hoare triple {4385#(<= 1 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {4385#(<= 1 main_~main__j~0)} is VALID [2018-11-23 13:10:58,693 INFO L273 TraceCheckUtils]: 19: Hoare triple {4385#(<= 1 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {4385#(<= 1 main_~main__j~0)} is VALID [2018-11-23 13:10:58,694 INFO L273 TraceCheckUtils]: 20: Hoare triple {4385#(<= 1 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {4386#(not (= 0 main_~__VERIFIER_assert__cond~13))} is VALID [2018-11-23 13:10:58,694 INFO L273 TraceCheckUtils]: 21: Hoare triple {4386#(not (= 0 main_~__VERIFIER_assert__cond~13))} assume 0 == ~__VERIFIER_assert__cond~13; {4382#false} is VALID [2018-11-23 13:10:58,695 INFO L273 TraceCheckUtils]: 22: Hoare triple {4382#false} assume !false; {4382#false} is VALID [2018-11-23 13:10:58,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:58,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:10:58,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:10:58,696 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-23 13:10:58,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:58,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:10:58,718 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:58,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:10:58,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:10:58,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:10:58,720 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2018-11-23 13:10:59,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:59,754 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2018-11-23 13:10:59,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:10:59,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-23 13:10:59,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:59,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:10:59,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2018-11-23 13:10:59,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:10:59,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2018-11-23 13:10:59,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 124 transitions. [2018-11-23 13:11:00,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:00,347 INFO L225 Difference]: With dead ends: 105 [2018-11-23 13:11:00,348 INFO L226 Difference]: Without dead ends: 103 [2018-11-23 13:11:00,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:11:00,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-23 13:11:00,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 34. [2018-11-23 13:11:00,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:00,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 34 states. [2018-11-23 13:11:00,403 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 34 states. [2018-11-23 13:11:00,403 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 34 states. [2018-11-23 13:11:00,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:00,406 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2018-11-23 13:11:00,407 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2018-11-23 13:11:00,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:00,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:00,407 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 103 states. [2018-11-23 13:11:00,407 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 103 states. [2018-11-23 13:11:00,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:00,410 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2018-11-23 13:11:00,410 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2018-11-23 13:11:00,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:00,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:00,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:00,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:11:00,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-23 13:11:00,412 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2018-11-23 13:11:00,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:00,412 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-23 13:11:00,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:11:00,412 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 13:11:00,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:11:00,413 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:00,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:00,413 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:00,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:00,414 INFO L82 PathProgramCache]: Analyzing trace with hash 587025248, now seen corresponding path program 1 times [2018-11-23 13:11:00,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:00,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:00,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:00,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:00,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:00,910 INFO L256 TraceCheckUtils]: 0: Hoare triple {4771#true} call ULTIMATE.init(); {4771#true} is VALID [2018-11-23 13:11:00,910 INFO L273 TraceCheckUtils]: 1: Hoare triple {4771#true} ~__return_main~0 := 0;~__return_334~0 := 0; {4771#true} is VALID [2018-11-23 13:11:00,910 INFO L273 TraceCheckUtils]: 2: Hoare triple {4771#true} assume true; {4771#true} is VALID [2018-11-23 13:11:00,911 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4771#true} {4771#true} #139#return; {4771#true} is VALID [2018-11-23 13:11:00,911 INFO L256 TraceCheckUtils]: 4: Hoare triple {4771#true} call #t~ret4 := main(); {4771#true} is VALID [2018-11-23 13:11:00,911 INFO L273 TraceCheckUtils]: 5: Hoare triple {4771#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {4771#true} is VALID [2018-11-23 13:11:00,913 INFO L273 TraceCheckUtils]: 6: Hoare triple {4771#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {4773#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2018-11-23 13:11:00,914 INFO L273 TraceCheckUtils]: 7: Hoare triple {4773#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {4773#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2018-11-23 13:11:00,916 INFO L273 TraceCheckUtils]: 8: Hoare triple {4773#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0; {4773#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2018-11-23 13:11:00,918 INFO L273 TraceCheckUtils]: 9: Hoare triple {4773#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__j~0 < ~main__limit~0; {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-23 13:11:00,923 INFO L273 TraceCheckUtils]: 10: Hoare triple {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4775#(and (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= main_~__VERIFIER_assert__cond~0 1))} is VALID [2018-11-23 13:11:00,925 INFO L273 TraceCheckUtils]: 11: Hoare triple {4775#(and (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= main_~__VERIFIER_assert__cond~0 1))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-23 13:11:00,925 INFO L273 TraceCheckUtils]: 12: Hoare triple {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-23 13:11:00,926 INFO L273 TraceCheckUtils]: 13: Hoare triple {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-23 13:11:00,926 INFO L273 TraceCheckUtils]: 14: Hoare triple {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-23 13:11:00,926 INFO L273 TraceCheckUtils]: 15: Hoare triple {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-23 13:11:00,927 INFO L273 TraceCheckUtils]: 16: Hoare triple {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-23 13:11:00,927 INFO L273 TraceCheckUtils]: 17: Hoare triple {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {4776#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} is VALID [2018-11-23 13:11:00,928 INFO L273 TraceCheckUtils]: 18: Hoare triple {4776#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {4776#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} is VALID [2018-11-23 13:11:00,929 INFO L273 TraceCheckUtils]: 19: Hoare triple {4776#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {4776#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} is VALID [2018-11-23 13:11:00,929 INFO L273 TraceCheckUtils]: 20: Hoare triple {4776#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {4776#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} is VALID [2018-11-23 13:11:00,930 INFO L273 TraceCheckUtils]: 21: Hoare triple {4776#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~13);~main____CPAchecker_TMP_3~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_4~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {4777#(not (= 0 main_~__VERIFIER_assert__cond~14))} is VALID [2018-11-23 13:11:00,931 INFO L273 TraceCheckUtils]: 22: Hoare triple {4777#(not (= 0 main_~__VERIFIER_assert__cond~14))} assume 0 == ~__VERIFIER_assert__cond~14; {4772#false} is VALID [2018-11-23 13:11:00,932 INFO L273 TraceCheckUtils]: 23: Hoare triple {4772#false} assume !false; {4772#false} is VALID [2018-11-23 13:11:00,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:00,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:00,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 13:11:00,934 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-23 13:11:00,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:00,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:11:00,956 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:00,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:11:00,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:11:00,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:11:00,957 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2018-11-23 13:11:01,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:01,964 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2018-11-23 13:11:01,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:11:01,964 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-23 13:11:01,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:01,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:11:01,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2018-11-23 13:11:01,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:11:01,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2018-11-23 13:11:01,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 80 transitions. [2018-11-23 13:11:02,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:02,061 INFO L225 Difference]: With dead ends: 70 [2018-11-23 13:11:02,062 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 13:11:02,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:11:02,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 13:11:02,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 32. [2018-11-23 13:11:02,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:02,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 32 states. [2018-11-23 13:11:02,269 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 32 states. [2018-11-23 13:11:02,269 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 32 states. [2018-11-23 13:11:02,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:02,271 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2018-11-23 13:11:02,271 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2018-11-23 13:11:02,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:02,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:02,271 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 68 states. [2018-11-23 13:11:02,271 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 68 states. [2018-11-23 13:11:02,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:02,273 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2018-11-23 13:11:02,273 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2018-11-23 13:11:02,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:02,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:02,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:02,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:02,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:11:02,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-23 13:11:02,275 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2018-11-23 13:11:02,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:02,275 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-23 13:11:02,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:11:02,275 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 13:11:02,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:11:02,276 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:02,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:02,276 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:02,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:02,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1017916667, now seen corresponding path program 1 times [2018-11-23 13:11:02,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:02,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:02,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:02,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:02,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:02,721 INFO L256 TraceCheckUtils]: 0: Hoare triple {5057#true} call ULTIMATE.init(); {5057#true} is VALID [2018-11-23 13:11:02,721 INFO L273 TraceCheckUtils]: 1: Hoare triple {5057#true} ~__return_main~0 := 0;~__return_334~0 := 0; {5057#true} is VALID [2018-11-23 13:11:02,721 INFO L273 TraceCheckUtils]: 2: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-23 13:11:02,722 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5057#true} {5057#true} #139#return; {5057#true} is VALID [2018-11-23 13:11:02,722 INFO L256 TraceCheckUtils]: 4: Hoare triple {5057#true} call #t~ret4 := main(); {5057#true} is VALID [2018-11-23 13:11:02,722 INFO L273 TraceCheckUtils]: 5: Hoare triple {5057#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {5057#true} is VALID [2018-11-23 13:11:02,723 INFO L273 TraceCheckUtils]: 6: Hoare triple {5057#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {5057#true} is VALID [2018-11-23 13:11:02,723 INFO L273 TraceCheckUtils]: 7: Hoare triple {5057#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {5057#true} is VALID [2018-11-23 13:11:02,723 INFO L273 TraceCheckUtils]: 8: Hoare triple {5057#true} assume ~main__i~0 < ~main__len~0; {5057#true} is VALID [2018-11-23 13:11:02,723 INFO L273 TraceCheckUtils]: 9: Hoare triple {5057#true} assume ~main__j~0 < ~main__limit~0; {5057#true} is VALID [2018-11-23 13:11:02,723 INFO L273 TraceCheckUtils]: 10: Hoare triple {5057#true} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5059#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:11:02,724 INFO L273 TraceCheckUtils]: 11: Hoare triple {5059#(= main_~__VERIFIER_assert__cond~0 1)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5057#true} is VALID [2018-11-23 13:11:02,724 INFO L273 TraceCheckUtils]: 12: Hoare triple {5057#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {5057#true} is VALID [2018-11-23 13:11:02,724 INFO L273 TraceCheckUtils]: 13: Hoare triple {5057#true} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {5057#true} is VALID [2018-11-23 13:11:02,724 INFO L273 TraceCheckUtils]: 14: Hoare triple {5057#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {5057#true} is VALID [2018-11-23 13:11:02,724 INFO L273 TraceCheckUtils]: 15: Hoare triple {5057#true} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {5057#true} is VALID [2018-11-23 13:11:02,724 INFO L273 TraceCheckUtils]: 16: Hoare triple {5057#true} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {5057#true} is VALID [2018-11-23 13:11:02,725 INFO L273 TraceCheckUtils]: 17: Hoare triple {5057#true} assume !(0 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {5057#true} is VALID [2018-11-23 13:11:02,725 INFO L273 TraceCheckUtils]: 18: Hoare triple {5057#true} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {5057#true} is VALID [2018-11-23 13:11:02,725 INFO L273 TraceCheckUtils]: 19: Hoare triple {5057#true} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {5057#true} is VALID [2018-11-23 13:11:02,725 INFO L273 TraceCheckUtils]: 20: Hoare triple {5057#true} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {5060#(or (= 0 main_~__VERIFIER_assert__cond~13) (<= 0 main_~main__j~0))} is VALID [2018-11-23 13:11:02,726 INFO L273 TraceCheckUtils]: 21: Hoare triple {5060#(or (= 0 main_~__VERIFIER_assert__cond~13) (<= 0 main_~main__j~0))} assume !(0 == ~__VERIFIER_assert__cond~13);~main____CPAchecker_TMP_3~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_4~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {5061#(<= 1 main_~main__j~0)} is VALID [2018-11-23 13:11:02,727 INFO L273 TraceCheckUtils]: 22: Hoare triple {5061#(<= 1 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {5062#(not (= 0 main_~__VERIFIER_assert__cond~15))} is VALID [2018-11-23 13:11:02,727 INFO L273 TraceCheckUtils]: 23: Hoare triple {5062#(not (= 0 main_~__VERIFIER_assert__cond~15))} assume 0 == ~__VERIFIER_assert__cond~15; {5058#false} is VALID [2018-11-23 13:11:02,727 INFO L273 TraceCheckUtils]: 24: Hoare triple {5058#false} assume !false; {5058#false} is VALID [2018-11-23 13:11:02,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:02,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:02,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:11:02,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-23 13:11:02,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:02,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:11:02,752 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:02,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:11:02,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:11:02,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:11:02,753 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2018-11-23 13:11:03,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:03,394 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2018-11-23 13:11:03,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:11:03,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-23 13:11:03,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:03,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:11:03,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2018-11-23 13:11:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:11:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2018-11-23 13:11:03,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 97 transitions. [2018-11-23 13:11:03,909 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:03,909 INFO L225 Difference]: With dead ends: 85 [2018-11-23 13:11:03,909 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:11:03,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:11:03,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:11:03,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:11:03,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:03,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:11:03,912 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:11:03,912 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:11:03,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:03,912 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:11:03,912 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:11:03,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:03,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:03,913 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:11:03,913 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:11:03,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:03,913 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:11:03,914 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:11:03,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:03,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:03,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:03,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:11:03,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:11:03,914 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-11-23 13:11:03,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:03,915 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:11:03,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:11:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:11:03,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:03,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:11:03,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 13:11:04,139 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 63 [2018-11-23 13:11:04,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 13:11:04,318 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 94 [2018-11-23 13:11:04,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 13:11:04,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 13:11:04,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 13:11:04,501 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 86 [2018-11-23 13:11:05,938 WARN L180 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 63 DAG size of output: 9 [2018-11-23 13:11:06,454 WARN L180 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 33 [2018-11-23 13:11:06,886 WARN L180 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 18 [2018-11-23 13:11:06,894 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:11:06,894 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:11:06,894 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:11:06,894 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:11:06,895 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:11:06,895 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:11:06,895 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:11:06,895 INFO L448 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 160) no Hoare annotation was computed. [2018-11-23 13:11:06,895 INFO L448 ceAbstractionStarter]: For program point L93(lines 93 120) no Hoare annotation was computed. [2018-11-23 13:11:06,895 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 260) no Hoare annotation was computed. [2018-11-23 13:11:06,895 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 8 308) no Hoare annotation was computed. [2018-11-23 13:11:06,895 INFO L448 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 95) no Hoare annotation was computed. [2018-11-23 13:11:06,896 INFO L448 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 71) no Hoare annotation was computed. [2018-11-23 13:11:06,896 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 281) no Hoare annotation was computed. [2018-11-23 13:11:06,896 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 124) no Hoare annotation was computed. [2018-11-23 13:11:06,896 INFO L444 ceAbstractionStarter]: At program point L259(lines 26 301) the Hoare annotation is: (let ((.cse2 (<= (+ main_~main__j~0 4) main_~main__bufsize~0))) (let ((.cse0 (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) (.cse1 (and (<= 1 main_~main__j~0) (let ((.cse3 (<= 1 main_~main__i~0))) (or (and .cse3 (not (= 0 main_~__VERIFIER_assert__cond~12))) (and .cse3 .cse2)))))) (or (and .cse0 .cse1 (not (= 0 main_~__VERIFIER_assert__cond~14))) (and (and .cse0 (and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__i~0))) (<= 0 main_~main__j~0)) (and .cse0 .cse1 .cse2)))) [2018-11-23 13:11:06,896 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-23 13:11:06,896 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 280) no Hoare annotation was computed. [2018-11-23 13:11:06,896 INFO L448 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 240) no Hoare annotation was computed. [2018-11-23 13:11:06,896 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 266) no Hoare annotation was computed. [2018-11-23 13:11:06,897 INFO L448 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 148) no Hoare annotation was computed. [2018-11-23 13:11:06,897 INFO L448 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2018-11-23 13:11:06,897 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-23 13:11:06,897 INFO L448 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 200) no Hoare annotation was computed. [2018-11-23 13:11:06,897 INFO L448 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2018-11-23 13:11:06,897 INFO L448 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2018-11-23 13:11:06,897 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 270) no Hoare annotation was computed. [2018-11-23 13:11:06,897 INFO L448 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-11-23 13:11:06,897 INFO L448 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 107) no Hoare annotation was computed. [2018-11-23 13:11:06,897 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 8 308) no Hoare annotation was computed. [2018-11-23 13:11:06,898 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 272) no Hoare annotation was computed. [2018-11-23 13:11:06,898 INFO L448 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2018-11-23 13:11:06,898 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 8 308) the Hoare annotation is: true [2018-11-23 13:11:06,898 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2018-11-23 13:11:06,898 INFO L448 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2018-11-23 13:11:06,898 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 276) no Hoare annotation was computed. [2018-11-23 13:11:06,898 INFO L448 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2018-11-23 13:11:06,898 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 118) no Hoare annotation was computed. [2018-11-23 13:11:06,899 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 295) no Hoare annotation was computed. [2018-11-23 13:11:06,899 INFO L448 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2018-11-23 13:11:06,899 INFO L448 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 136) no Hoare annotation was computed. [2018-11-23 13:11:06,899 INFO L448 ceAbstractionStarter]: For program point L81(lines 81 122) no Hoare annotation was computed. [2018-11-23 13:11:06,899 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 307) no Hoare annotation was computed. [2018-11-23 13:11:06,899 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 262) no Hoare annotation was computed. [2018-11-23 13:11:06,899 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-23 13:11:06,900 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2018-11-23 13:11:06,900 INFO L448 ceAbstractionStarter]: For program point L40(lines 40 283) no Hoare annotation was computed. [2018-11-23 13:11:06,900 INFO L444 ceAbstractionStarter]: At program point L288(lines 33 289) the Hoare annotation is: (and (< main_~main__i~0 main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (<= 0 main_~main__i~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0) (<= 0 main_~main__j~0)) [2018-11-23 13:11:06,900 INFO L448 ceAbstractionStarter]: For program point L222(lines 222 264) no Hoare annotation was computed. [2018-11-23 13:11:06,900 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-23 13:11:06,900 INFO L448 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2018-11-23 13:11:06,900 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 268) no Hoare annotation was computed. [2018-11-23 13:11:06,901 INFO L448 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 212) no Hoare annotation was computed. [2018-11-23 13:11:06,901 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 289) no Hoare annotation was computed. [2018-11-23 13:11:06,901 INFO L448 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2018-11-23 13:11:06,901 INFO L448 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2018-11-23 13:11:06,901 INFO L448 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2018-11-23 13:11:06,901 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-11-23 13:11:06,901 INFO L448 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2018-11-23 13:11:06,901 INFO L448 ceAbstractionStarter]: For program point L158(lines 158 274) no Hoare annotation was computed. [2018-11-23 13:11:06,901 INFO L448 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-11-23 13:11:06,901 INFO L448 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2018-11-23 13:11:06,902 INFO L444 ceAbstractionStarter]: At program point L299(lines 20 307) the Hoare annotation is: (and (<= 0 main_~main__i~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2018-11-23 13:11:06,902 INFO L448 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2018-11-23 13:11:06,902 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 278) no Hoare annotation was computed. [2018-11-23 13:11:06,904 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:11:06,904 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:11:06,904 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:11:06,904 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:11:06,904 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:11:06,904 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:11:06,905 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:11:06,905 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:11:06,905 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:11:06,906 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:11:06,906 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:11:06,906 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2018-11-23 13:11:06,907 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2018-11-23 13:11:06,907 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2018-11-23 13:11:06,907 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2018-11-23 13:11:06,908 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2018-11-23 13:11:06,908 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-11-23 13:11:06,908 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-11-23 13:11:06,908 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2018-11-23 13:11:06,908 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2018-11-23 13:11:06,908 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2018-11-23 13:11:06,908 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2018-11-23 13:11:06,909 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2018-11-23 13:11:06,909 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2018-11-23 13:11:06,909 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2018-11-23 13:11:06,909 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2018-11-23 13:11:06,909 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2018-11-23 13:11:06,909 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2018-11-23 13:11:06,910 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2018-11-23 13:11:06,910 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2018-11-23 13:11:06,910 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2018-11-23 13:11:06,910 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2018-11-23 13:11:06,910 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2018-11-23 13:11:06,910 WARN L170 areAnnotationChecker]: L134 has no Hoare annotation [2018-11-23 13:11:06,910 WARN L170 areAnnotationChecker]: L134 has no Hoare annotation [2018-11-23 13:11:06,911 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2018-11-23 13:11:06,911 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2018-11-23 13:11:06,911 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2018-11-23 13:11:06,911 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2018-11-23 13:11:06,911 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2018-11-23 13:11:06,911 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2018-11-23 13:11:06,911 WARN L170 areAnnotationChecker]: L146 has no Hoare annotation [2018-11-23 13:11:06,911 WARN L170 areAnnotationChecker]: L146 has no Hoare annotation [2018-11-23 13:11:06,911 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2018-11-23 13:11:06,911 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2018-11-23 13:11:06,911 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2018-11-23 13:11:06,911 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2018-11-23 13:11:06,912 WARN L170 areAnnotationChecker]: L148 has no Hoare annotation [2018-11-23 13:11:06,912 WARN L170 areAnnotationChecker]: L148 has no Hoare annotation [2018-11-23 13:11:06,912 WARN L170 areAnnotationChecker]: L158 has no Hoare annotation [2018-11-23 13:11:06,912 WARN L170 areAnnotationChecker]: L158 has no Hoare annotation [2018-11-23 13:11:06,912 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2018-11-23 13:11:06,912 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2018-11-23 13:11:06,912 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2018-11-23 13:11:06,913 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2018-11-23 13:11:06,913 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2018-11-23 13:11:06,913 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2018-11-23 13:11:06,913 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2018-11-23 13:11:06,913 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2018-11-23 13:11:06,913 WARN L170 areAnnotationChecker]: L186 has no Hoare annotation [2018-11-23 13:11:06,913 WARN L170 areAnnotationChecker]: L186 has no Hoare annotation [2018-11-23 13:11:06,913 WARN L170 areAnnotationChecker]: L188 has no Hoare annotation [2018-11-23 13:11:06,914 WARN L170 areAnnotationChecker]: L188 has no Hoare annotation [2018-11-23 13:11:06,914 WARN L170 areAnnotationChecker]: L198 has no Hoare annotation [2018-11-23 13:11:06,914 WARN L170 areAnnotationChecker]: L198 has no Hoare annotation [2018-11-23 13:11:06,914 WARN L170 areAnnotationChecker]: L200 has no Hoare annotation [2018-11-23 13:11:06,914 WARN L170 areAnnotationChecker]: L200 has no Hoare annotation [2018-11-23 13:11:06,914 WARN L170 areAnnotationChecker]: L210 has no Hoare annotation [2018-11-23 13:11:06,914 WARN L170 areAnnotationChecker]: L210 has no Hoare annotation [2018-11-23 13:11:06,914 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2018-11-23 13:11:06,914 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2018-11-23 13:11:06,915 WARN L170 areAnnotationChecker]: L222 has no Hoare annotation [2018-11-23 13:11:06,915 WARN L170 areAnnotationChecker]: L222 has no Hoare annotation [2018-11-23 13:11:06,915 WARN L170 areAnnotationChecker]: L224 has no Hoare annotation [2018-11-23 13:11:06,915 WARN L170 areAnnotationChecker]: L224 has no Hoare annotation [2018-11-23 13:11:06,915 WARN L170 areAnnotationChecker]: L238 has no Hoare annotation [2018-11-23 13:11:06,915 WARN L170 areAnnotationChecker]: L238 has no Hoare annotation [2018-11-23 13:11:06,915 WARN L170 areAnnotationChecker]: L240 has no Hoare annotation [2018-11-23 13:11:06,915 WARN L170 areAnnotationChecker]: L240 has no Hoare annotation [2018-11-23 13:11:06,916 WARN L170 areAnnotationChecker]: L250 has no Hoare annotation [2018-11-23 13:11:06,916 WARN L170 areAnnotationChecker]: L250 has no Hoare annotation [2018-11-23 13:11:06,916 WARN L170 areAnnotationChecker]: L252 has no Hoare annotation [2018-11-23 13:11:06,916 WARN L170 areAnnotationChecker]: L252 has no Hoare annotation [2018-11-23 13:11:06,916 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:11:06,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:11:06 BoogieIcfgContainer [2018-11-23 13:11:06,929 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:11:06,929 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:11:06,929 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:11:06,930 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:11:06,930 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:10:42" (3/4) ... [2018-11-23 13:11:06,934 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:11:06,939 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:11:06,940 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:11:06,948 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 13:11:06,948 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 13:11:07,052 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c-witness.graphml [2018-11-23 13:11:07,053 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:11:07,054 INFO L168 Benchmark]: Toolchain (without parser) took 26520.24 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 825.7 MB. Max. memory is 7.1 GB. [2018-11-23 13:11:07,055 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:11:07,055 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:11:07,056 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:11:07,056 INFO L168 Benchmark]: Boogie Preprocessor took 33.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:11:07,056 INFO L168 Benchmark]: RCFGBuilder took 1159.85 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -760.0 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2018-11-23 13:11:07,057 INFO L168 Benchmark]: TraceAbstraction took 24784.29 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 272.6 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 562.8 MB). Peak memory consumption was 835.5 MB. Max. memory is 7.1 GB. [2018-11-23 13:11:07,057 INFO L168 Benchmark]: Witness Printer took 123.52 ms. Allocated memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 57.7 MB). Free memory was 1.6 GB in the beginning and 2.6 GB in the end (delta: -947.6 MB). Peak memory consumption was 389.8 kB. Max. memory is 7.1 GB. [2018-11-23 13:11:07,059 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 390.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 23.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1159.85 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -760.0 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24784.29 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 272.6 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 562.8 MB). Peak memory consumption was 835.5 MB. Max. memory is 7.1 GB. * Witness Printer took 123.52 ms. Allocated memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 57.7 MB). Free memory was 1.6 GB in the beginning and 2.6 GB in the end (delta: -947.6 MB). Peak memory consumption was 389.8 kB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 160]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 200]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 136]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 95]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 240]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 107]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 212]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 224]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 148]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 188]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 <= main__i && main__limit + 4 <= main__bufsize - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((main__limit + 4 <= main__bufsize && 1 <= main__j && ((1 <= main__i && !(0 == __VERIFIER_assert__cond)) || (1 <= main__i && main__j + 4 <= main__bufsize))) && !(0 == __VERIFIER_assert__cond)) || ((main__limit + 4 <= main__bufsize && main__i < main__len && 0 <= main__i) && 0 <= main__j)) || ((main__limit + 4 <= main__bufsize && 1 <= main__j && ((1 <= main__i && !(0 == __VERIFIER_assert__cond)) || (1 <= main__i && main__j + 4 <= main__bufsize))) && main__j + 4 <= main__bufsize) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((main__i < main__len && main__j + 5 <= main__bufsize) && 0 <= main__i) && main__limit + 4 <= main__bufsize) && 0 <= main__j - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 65 locations, 16 error locations. SAFE Result, 24.6s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 15.5s AutomataDifference, 0.0s DeadEndRemovalTime, 2.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 917 SDtfs, 1594 SDslu, 1143 SDs, 0 SdLazy, 1202 SolverSat, 145 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 528 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 23 NumberOfFragments, 118 HoareAnnotationTreeSize, 7 FomulaSimplifications, 1474945965 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1237784 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 14171 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...