java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/down.i_4.bplTransformedIcfg_BEv2_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:26:28,704 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:26:28,708 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:26:28,721 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:26:28,721 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:26:28,722 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:26:28,723 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:26:28,725 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:26:28,727 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:26:28,730 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:26:28,733 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:26:28,733 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:26:28,734 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:26:28,736 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:26:28,737 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:26:28,740 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:26:28,745 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:26:28,751 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:26:28,753 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:26:28,755 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:26:28,756 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:26:28,757 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:26:28,760 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:26:28,760 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:26:28,760 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:26:28,761 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:26:28,762 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:26:28,763 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:26:28,764 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:26:28,765 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:26:28,765 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:26:28,766 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:26:28,766 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:26:28,766 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:26:28,767 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:26:28,768 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:26:28,769 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:26:28,787 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:26:28,787 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:26:28,788 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:26:28,788 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:26:28,788 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:26:28,788 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:26:28,789 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:26:28,789 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:26:28,789 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:26:28,789 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:26:28,790 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:26:28,790 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:26:28,790 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:26:28,791 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:26:28,791 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:26:28,791 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:26:28,791 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:26:28,792 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:26:28,792 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:26:28,792 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:26:28,792 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:26:28,793 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:26:28,793 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:26:28,793 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:26:28,793 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:26:28,793 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:26:28,794 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:26:28,794 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:26:28,794 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:26:28,794 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:26:28,794 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:26:28,795 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:26:28,795 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:26:28,795 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:26:28,795 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:26:28,795 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:26:28,796 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:26:28,796 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:26:28,796 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:26:28,847 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:26:28,859 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:26:28,864 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:26:28,866 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:26:28,867 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:26:28,867 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/down.i_4.bplTransformedIcfg_BEv2_5.bpl [2018-12-03 17:26:28,868 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/down.i_4.bplTransformedIcfg_BEv2_5.bpl' [2018-12-03 17:26:28,915 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:26:28,917 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:26:28,917 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:26:28,918 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:26:28,918 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:26:28,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:28" (1/1) ... [2018-12-03 17:26:28,945 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:28" (1/1) ... [2018-12-03 17:26:28,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:26:28,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:26:28,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:26:28,953 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:26:28,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:28" (1/1) ... [2018-12-03 17:26:28,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:28" (1/1) ... [2018-12-03 17:26:28,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:28" (1/1) ... [2018-12-03 17:26:28,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:28" (1/1) ... [2018-12-03 17:26:28,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:28" (1/1) ... [2018-12-03 17:26:28,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:28" (1/1) ... [2018-12-03 17:26:28,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:28" (1/1) ... [2018-12-03 17:26:28,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:26:28,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:26:28,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:26:28,979 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:26:28,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:28" (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-12-03 17:26:29,053 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 17:26:29,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:26:29,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:26:29,219 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:26:29,219 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 17:26:29,220 INFO L202 PluginConnector]: Adding new model down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:26:29 BoogieIcfgContainer [2018-12-03 17:26:29,220 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:26:29,221 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:26:29,221 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:26:29,224 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:26:29,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:28" (1/2) ... [2018-12-03 17:26:29,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26bd20aa and model type down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:26:29, skipping insertion in model container [2018-12-03 17:26:29,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:26:29" (2/2) ... [2018-12-03 17:26:29,228 INFO L112 eAbstractionObserver]: Analyzing ICFG down.i_4.bplTransformedIcfg_BEv2_5.bpl [2018-12-03 17:26:29,238 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:26:29,245 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:26:29,259 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:26:29,289 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:26:29,289 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:26:29,289 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:26:29,290 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:26:29,290 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:26:29,290 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:26:29,290 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:26:29,290 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:26:29,304 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2018-12-03 17:26:29,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 17:26:29,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:29,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:26:29,313 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:29,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:29,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1951930377, now seen corresponding path program 1 times [2018-12-03 17:26:29,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:29,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:29,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:29,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:29,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:29,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:29,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:26:29,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:26:29,467 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:26:29,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:26:29,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:26:29,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:26:29,485 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2018-12-03 17:26:29,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:29,557 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2018-12-03 17:26:29,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:26:29,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-03 17:26:29,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:29,571 INFO L225 Difference]: With dead ends: 23 [2018-12-03 17:26:29,571 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 17:26:29,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-03 17:26:29,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 17:26:29,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-12-03 17:26:29,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 17:26:29,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-12-03 17:26:29,632 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 7 [2018-12-03 17:26:29,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:29,632 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-03 17:26:29,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:26:29,633 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2018-12-03 17:26:29,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 17:26:29,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:29,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:26:29,635 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:29,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:29,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1951989959, now seen corresponding path program 1 times [2018-12-03 17:26:29,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:29,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:29,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:29,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:29,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:29,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:29,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:26:29,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:26:29,772 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:26:29,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:26:29,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:26:29,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:26:29,775 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand 4 states. [2018-12-03 17:26:29,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:29,901 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-12-03 17:26:29,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:26:29,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-12-03 17:26:29,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:29,907 INFO L225 Difference]: With dead ends: 20 [2018-12-03 17:26:29,907 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 17:26:29,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:26:29,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 17:26:29,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 17:26:29,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 17:26:29,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-12-03 17:26:29,917 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 7 [2018-12-03 17:26:29,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:29,918 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-12-03 17:26:29,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:26:29,919 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2018-12-03 17:26:29,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:26:29,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:29,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:26:29,920 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:29,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:29,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1455783312, now seen corresponding path program 1 times [2018-12-03 17:26:29,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:29,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:29,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:29,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:29,923 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:29,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:26:29,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:26:29,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:26:29,982 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:26:29,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:26:29,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:26:29,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:26:29,984 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand 4 states. [2018-12-03 17:26:30,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:30,084 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-12-03 17:26:30,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:26:30,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-12-03 17:26:30,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:30,086 INFO L225 Difference]: With dead ends: 19 [2018-12-03 17:26:30,087 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 17:26:30,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-12-03 17:26:30,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 17:26:30,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-12-03 17:26:30,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 17:26:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-12-03 17:26:30,092 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 8 [2018-12-03 17:26:30,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:30,092 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-03 17:26:30,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:26:30,093 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2018-12-03 17:26:30,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:26:30,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:30,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:26:30,094 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:30,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:30,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1455723730, now seen corresponding path program 1 times [2018-12-03 17:26:30,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:30,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:30,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:30,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:30,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:30,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:30,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:26:30,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:26:30,130 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:26:30,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:26:30,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:26:30,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:26:30,131 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 4 states. [2018-12-03 17:26:30,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:30,210 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-12-03 17:26:30,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:26:30,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-12-03 17:26:30,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:30,211 INFO L225 Difference]: With dead ends: 25 [2018-12-03 17:26:30,211 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 17:26:30,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:26:30,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 17:26:30,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-12-03 17:26:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 17:26:30,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-12-03 17:26:30,219 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 8 [2018-12-03 17:26:30,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:30,219 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-12-03 17:26:30,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:26:30,219 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-12-03 17:26:30,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:26:30,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:30,220 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:26:30,220 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:30,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:30,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1394403420, now seen corresponding path program 1 times [2018-12-03 17:26:30,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:30,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:30,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:30,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:30,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:30,350 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:30,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:30,351 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:30,352 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2018-12-03 17:26:30,354 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9], [13], [15], [17], [21], [23], [25] [2018-12-03 17:26:30,413 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:26:30,413 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:26:31,083 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:26:31,085 INFO L272 AbstractInterpreter]: Visited 9 different actions 62 times. Merged at 6 different actions 34 times. Widened at 4 different actions 9 times. Found 6 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:26:31,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:31,116 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:26:31,262 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 59.79% of their original sizes. [2018-12-03 17:26:31,262 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:26:31,816 INFO L418 sIntCurrentIteration]: We unified 11 AI predicates to 11 [2018-12-03 17:26:31,817 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:26:31,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:26:31,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 13 [2018-12-03 17:26:31,819 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:26:31,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:26:31,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:26:31,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:26:31,820 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 10 states. [2018-12-03 17:26:32,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:32,593 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-12-03 17:26:32,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:26:32,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-12-03 17:26:32,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:32,594 INFO L225 Difference]: With dead ends: 17 [2018-12-03 17:26:32,594 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 17:26:32,595 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:26:32,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 17:26:32,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 17:26:32,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 17:26:32,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 17:26:32,596 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2018-12-03 17:26:32,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:32,597 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 17:26:32,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:26:32,597 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 17:26:32,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 17:26:32,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 17:26:33,453 WARN L180 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 36 [2018-12-03 17:26:33,992 WARN L180 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 18 [2018-12-03 17:26:34,339 WARN L180 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 30 [2018-12-03 17:26:34,510 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 30 [2018-12-03 17:26:34,514 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 77) no Hoare annotation was computed. [2018-12-03 17:26:34,514 INFO L444 ceAbstractionStarter]: At program point L60(lines 60 66) the Hoare annotation is: (and (<= ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start___VERIFIER_assert_~cond ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~k~5 (+ ULTIMATE.start___VERIFIER_assert_~cond 2147483646)) (= |ULTIMATE.start___VERIFIER_assert_#in~cond| 1) (= ULTIMATE.start___VERIFIER_assert_~cond 1)) [2018-12-03 17:26:34,515 INFO L444 ceAbstractionStarter]: At program point L56(lines 52 57) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~k~5)) (.cse1 (= |ULTIMATE.start___VERIFIER_assert_#in~cond| 1))) (or (and (= ULTIMATE.start___VERIFIER_assert_~cond 1) .cse0 (<= ULTIMATE.start___VERIFIER_assert_~cond ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~k~5 (+ ULTIMATE.start___VERIFIER_assert_~cond 2147483646)) .cse1) (and (<= (* 2 ULTIMATE.start_main_~n~5) 4294967294) (<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5) (<= (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~i~5) 4294967294) (<= 2 (* 2 ULTIMATE.start_main_~j~5)) .cse0 .cse1 (<= ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~k~5 (+ ULTIMATE.start_main_~n~5 2147483648))))) [2018-12-03 17:26:34,515 INFO L444 ceAbstractionStarter]: At program point L46(lines 46 53) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~k~5))) (or (and (<= (* 2 ULTIMATE.start_main_~n~5) 4294967294) (<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5) (<= (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~i~5) 4294967294) (<= 2 (* 2 ULTIMATE.start_main_~j~5)) .cse0 (<= ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~k~5 (+ ULTIMATE.start_main_~n~5 2147483648))) (and (= ULTIMATE.start___VERIFIER_assert_~cond 1) .cse0 (<= ULTIMATE.start___VERIFIER_assert_~cond ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~k~5 (+ ULTIMATE.start___VERIFIER_assert_~cond 2147483646)) (= |ULTIMATE.start___VERIFIER_assert_#in~cond| 1)))) [2018-12-03 17:26:34,515 INFO L444 ceAbstractionStarter]: At program point L65(lines 65 75) the Hoare annotation is: false [2018-12-03 17:26:34,515 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 76) no Hoare annotation was computed. [2018-12-03 17:26:34,516 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 77) no Hoare annotation was computed. [2018-12-03 17:26:34,516 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 77) no Hoare annotation was computed. [2018-12-03 17:26:34,516 INFO L444 ceAbstractionStarter]: At program point L74(lines 43 74) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~k~5 (+ ULTIMATE.start_main_~j~5 2147483648))) (.cse1 (<= ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~k~5))) (or (and (<= (* 2 ULTIMATE.start_main_~n~5) 4294967294) (<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5) (<= (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~i~5) 4294967294) .cse0 .cse1 (<= ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~k~5 (+ ULTIMATE.start_main_~n~5 2147483648))) (and (<= ULTIMATE.start_main_~k~5 0) (<= ULTIMATE.start_main_~j~5 0) (<= ULTIMATE.start_main_~i~5 0)) (let ((.cse3 (* 2 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (* 2 ULTIMATE.start_main_~k~5))) (and (<= .cse2 4294967294) (<= .cse3 2) .cse0 (<= 2 .cse3) (<= 0 .cse2) .cse1 (= |ULTIMATE.start___VERIFIER_assert_#in~cond| 1))))) [2018-12-03 17:26:34,516 INFO L444 ceAbstractionStarter]: At program point L39(lines 26 40) the Hoare annotation is: (and (<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~i~5) (<= (* 2 ULTIMATE.start_main_~n~5) 4294967294) (<= (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~i~5) 4294967294) (<= 0 (* 2 ULTIMATE.start_main_~i~5)) (<= ULTIMATE.start_main_~k~5 (+ ULTIMATE.start_main_~n~5 2147483648))) [2018-12-03 17:26:34,526 INFO L202 PluginConnector]: Adding new model down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:26:34 BoogieIcfgContainer [2018-12-03 17:26:34,527 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 17:26:34,528 INFO L168 Benchmark]: Toolchain (without parser) took 5611.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 717.2 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -541.1 MB). Peak memory consumption was 176.2 MB. Max. memory is 7.1 GB. [2018-12-03 17:26:34,529 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.57 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-12-03 17:26:34,530 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.33 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-12-03 17:26:34,530 INFO L168 Benchmark]: Boogie Preprocessor took 24.81 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-12-03 17:26:34,531 INFO L168 Benchmark]: RCFGBuilder took 241.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 17:26:34,532 INFO L168 Benchmark]: TraceAbstraction took 5305.97 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 717.2 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -562.2 MB). Peak memory consumption was 155.0 MB. Max. memory is 7.1 GB. [2018-12-03 17:26:34,536 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.57 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. * Boogie Procedure Inliner took 35.33 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. * Boogie Preprocessor took 24.81 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. * RCFGBuilder took 241.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5305.97 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 717.2 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -562.2 MB). Peak memory consumption was 155.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 76]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: (((((((2 * main_~n~5 <= 4294967294 && main_~i~5 <= main_~k~5) && main_~k~5 + main_~i~5 <= 4294967294) && main_~k~5 <= main_~j~5 + 2147483648) && main_~j~5 <= main_~k~5) && main_~k~5 <= main_~i~5) && main_~k~5 <= main_~n~5 + 2147483648) || ((main_~k~5 <= 0 && main_~j~5 <= 0) && main_~i~5 <= 0)) || ((((((2 * main_~k~5 <= 4294967294 && 2 * __VERIFIER_assert_~cond <= 2) && main_~k~5 <= main_~j~5 + 2147483648) && 2 <= 2 * __VERIFIER_assert_~cond) && 0 <= 2 * main_~k~5) && main_~j~5 <= main_~k~5) && __VERIFIER_assert_#in~cond == 1) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: (((main_~j~5 <= main_~k~5 && __VERIFIER_assert_~cond <= main_~j~5) && main_~k~5 <= __VERIFIER_assert_~cond + 2147483646) && __VERIFIER_assert_#in~cond == 1) && __VERIFIER_assert_~cond == 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((((main_~i~5 <= main_~k~5 && main_~k~5 <= main_~i~5) && 2 * main_~n~5 <= 4294967294) && main_~k~5 + main_~i~5 <= 4294967294) && 0 <= 2 * main_~i~5) && main_~k~5 <= main_~n~5 + 2147483648 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: ((((__VERIFIER_assert_~cond == 1 && main_~j~5 <= main_~k~5) && __VERIFIER_assert_~cond <= main_~j~5) && main_~k~5 <= __VERIFIER_assert_~cond + 2147483646) && __VERIFIER_assert_#in~cond == 1) || (((((((2 * main_~n~5 <= 4294967294 && main_~i~5 <= main_~k~5) && main_~k~5 + main_~i~5 <= 4294967294) && 2 <= 2 * main_~j~5) && main_~j~5 <= main_~k~5) && __VERIFIER_assert_#in~cond == 1) && main_~k~5 <= main_~i~5) && main_~k~5 <= main_~n~5 + 2147483648) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((2 * main_~n~5 <= 4294967294 && main_~i~5 <= main_~k~5) && main_~k~5 + main_~i~5 <= 4294967294) && 2 <= 2 * main_~j~5) && main_~j~5 <= main_~k~5) && main_~k~5 <= main_~i~5) && main_~k~5 <= main_~n~5 + 2147483648) || ((((__VERIFIER_assert_~cond == 1 && main_~j~5 <= main_~k~5) && __VERIFIER_assert_~cond <= main_~j~5) && main_~k~5 <= __VERIFIER_assert_~cond + 2147483646) && __VERIFIER_assert_#in~cond == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. SAFE Result, 5.2s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 1.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 33 SDtfs, 36 SDslu, 41 SDs, 0 SdLazy, 46 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9318181818181818 AbsIntWeakeningRatio, 0.8181818181818182 AbsIntAvgWeakeningVarsNumRemoved, 28.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 16 NumberOfFragments, 220 HoareAnnotationTreeSize, 6 FomulaSimplifications, 248 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 6 FomulaSimplificationsInter, 930 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 589 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 6/7 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...