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/nested9.i_3.bplTransformedIcfg_BEv2_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:27:27,511 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:27:27,514 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:27:27,533 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:27:27,533 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:27:27,535 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:27:27,536 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:27:27,539 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:27:27,541 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:27:27,544 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:27:27,545 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:27:27,545 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:27:27,546 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:27:27,550 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:27:27,551 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:27:27,559 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:27:27,560 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:27:27,562 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:27:27,566 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:27:27,569 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:27:27,571 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:27:27,573 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:27:27,577 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:27:27,577 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:27:27,578 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:27:27,578 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:27:27,579 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:27:27,583 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:27:27,584 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:27:27,586 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:27:27,586 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:27:27,587 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:27:27,587 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:27:27,587 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:27:27,589 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:27:27,590 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:27:27,590 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:27:27,615 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:27:27,615 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:27:27,616 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:27:27,617 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:27:27,621 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:27:27,621 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:27:27,621 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:27:27,622 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:27:27,622 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:27:27,622 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:27:27,622 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:27:27,622 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:27:27,623 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:27:27,623 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:27:27,624 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:27:27,625 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:27:27,625 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:27:27,625 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:27:27,626 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:27:27,626 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:27:27,626 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:27:27,626 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:27:27,626 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:27:27,626 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:27:27,628 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:27:27,628 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:27:27,629 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:27:27,629 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:27:27,629 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:27:27,629 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:27:27,630 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:27:27,630 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:27:27,630 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:27:27,631 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:27:27,631 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:27:27,631 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:27:27,631 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:27:27,631 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:27:27,632 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:27:27,672 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:27:27,690 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:27:27,696 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:27:27,698 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:27:27,698 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:27:27,699 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested9.i_3.bplTransformedIcfg_BEv2_4.bpl [2018-12-03 17:27:27,700 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested9.i_3.bplTransformedIcfg_BEv2_4.bpl' [2018-12-03 17:27:27,759 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:27:27,762 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:27:27,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:27:27,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:27:27,763 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:27:27,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nested9.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:27" (1/1) ... [2018-12-03 17:27:27,791 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nested9.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:27" (1/1) ... [2018-12-03 17:27:27,803 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:27:27,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:27:27,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:27:27,804 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:27:27,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested9.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:27" (1/1) ... [2018-12-03 17:27:27,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested9.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:27" (1/1) ... [2018-12-03 17:27:27,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested9.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:27" (1/1) ... [2018-12-03 17:27:27,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested9.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:27" (1/1) ... [2018-12-03 17:27:27,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested9.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:27" (1/1) ... [2018-12-03 17:27:27,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested9.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:27" (1/1) ... [2018-12-03 17:27:27,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested9.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:27" (1/1) ... [2018-12-03 17:27:27,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:27:27,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:27:27,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:27:27,834 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:27:27,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested9.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:27" (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:27:27,906 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 17:27:27,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:27:27,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:27:28,234 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:27:28,235 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 17:27:28,235 INFO L202 PluginConnector]: Adding new model nested9.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:27:28 BoogieIcfgContainer [2018-12-03 17:27:28,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:27:28,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:27:28,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:27:28,242 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:27:28,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested9.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:27" (1/2) ... [2018-12-03 17:27:28,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117acd29 and model type nested9.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:27:28, skipping insertion in model container [2018-12-03 17:27:28,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested9.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:27:28" (2/2) ... [2018-12-03 17:27:28,251 INFO L112 eAbstractionObserver]: Analyzing ICFG nested9.i_3.bplTransformedIcfg_BEv2_4.bpl [2018-12-03 17:27:28,268 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:27:28,276 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:27:28,325 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:27:28,402 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:27:28,402 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:27:28,403 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:27:28,403 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:27:28,403 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:27:28,403 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:27:28,403 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:27:28,404 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:27:28,440 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2018-12-03 17:27:28,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:27:28,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:28,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:27:28,455 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:28,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:28,476 INFO L82 PathProgramCache]: Analyzing trace with hash 149057677, now seen corresponding path program 1 times [2018-12-03 17:27:28,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:28,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:28,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:28,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:28,530 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:28,681 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:27:28,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:27:28,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:27:28,684 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:27:28,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:27:28,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:27:28,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:27:28,705 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2018-12-03 17:27:28,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:28,813 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2018-12-03 17:27:28,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:27:28,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-12-03 17:27:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:28,827 INFO L225 Difference]: With dead ends: 19 [2018-12-03 17:27:28,827 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 17:27:28,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:27:28,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 17:27:28,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 17:27:28,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 17:27:28,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-12-03 17:27:28,869 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2018-12-03 17:27:28,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:28,869 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-12-03 17:27:28,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:27:28,869 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-12-03 17:27:28,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 17:27:28,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:28,870 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:27:28,871 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:28,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:28,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1897199943, now seen corresponding path program 1 times [2018-12-03 17:27:28,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:28,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:28,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:28,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:28,873 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:28,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:28,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:28,995 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:28,996 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2018-12-03 17:27:28,998 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [16], [18], [22], [26] [2018-12-03 17:27:29,057 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:27:29,057 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:27:29,514 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:27:29,515 INFO L272 AbstractInterpreter]: Visited 9 different actions 44 times. Merged at 8 different actions 34 times. Widened at 2 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:27:29,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:29,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:27:29,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:29,562 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:29,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:29,577 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:27:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:29,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:29,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:29,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:30,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:30,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 17:27:30,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2018-12-03 17:27:30,241 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:27:30,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 17:27:30,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 17:27:30,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:27:30,244 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 6 states. [2018-12-03 17:27:30,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:30,310 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-12-03 17:27:30,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 17:27:30,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-12-03 17:27:30,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:30,312 INFO L225 Difference]: With dead ends: 23 [2018-12-03 17:27:30,312 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 17:27:30,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:27:30,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 17:27:30,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-12-03 17:27:30,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 17:27:30,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-12-03 17:27:30,319 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2018-12-03 17:27:30,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:30,320 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-03 17:27:30,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 17:27:30,320 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2018-12-03 17:27:30,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 17:27:30,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:30,321 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:27:30,322 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:30,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:30,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1897140361, now seen corresponding path program 1 times [2018-12-03 17:27:30,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:30,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:30,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:30,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:30,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:30,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:27:30,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:27:30,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:27:30,397 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:27:30,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:27:30,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:27:30,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:27:30,399 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 4 states. [2018-12-03 17:27:30,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:30,437 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-12-03 17:27:30,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:27:30,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-03 17:27:30,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:30,439 INFO L225 Difference]: With dead ends: 21 [2018-12-03 17:27:30,439 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 17:27:30,440 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:27:30,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 17:27:30,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-12-03 17:27:30,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 17:27:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-12-03 17:27:30,446 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2018-12-03 17:27:30,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:30,447 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-12-03 17:27:30,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:27:30,447 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-12-03 17:27:30,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:27:30,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:30,448 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:27:30,448 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:30,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:30,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1297716867, now seen corresponding path program 1 times [2018-12-03 17:27:30,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:30,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:30,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:30,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:30,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:30,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:30,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:30,740 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:30,741 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-12-03 17:27:30,741 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26] [2018-12-03 17:27:30,743 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:27:30,744 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:27:31,511 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:27:31,511 INFO L272 AbstractInterpreter]: Visited 11 different actions 160 times. Merged at 10 different actions 124 times. Widened at 9 different actions 80 times. Found 26 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 17:27:31,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:31,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:27:31,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:31,564 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:31,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:31,577 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:27:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:31,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:31,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:31,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:32,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:32,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:32,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2018-12-03 17:27:32,030 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:32,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:27:32,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:27:32,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:27:32,032 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 10 states. [2018-12-03 17:27:32,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:32,188 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-12-03 17:27:32,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 17:27:32,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2018-12-03 17:27:32,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:32,190 INFO L225 Difference]: With dead ends: 18 [2018-12-03 17:27:32,190 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 17:27:32,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:27:32,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 17:27:32,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 17:27:32,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 17:27:32,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 17:27:32,192 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-12-03 17:27:32,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:32,192 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 17:27:32,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:27:32,193 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 17:27:32,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 17:27:32,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 17:27:32,462 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-12-03 17:27:32,787 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 17 [2018-12-03 17:27:33,008 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 16 [2018-12-03 17:27:33,010 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 90) no Hoare annotation was computed. [2018-12-03 17:27:33,012 INFO L444 ceAbstractionStarter]: At program point L62(lines 62 69) the Hoare annotation is: (and (exists ((ULTIMATE.start_main_~i~5 Int)) (and (<= ULTIMATE.start_main_~j~5 (* 2 ULTIMATE.start_main_~i~5)) (<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 1))) (<= ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 1) (< ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~n~5) (<= 1 ULTIMATE.start_main_~i~5)) [2018-12-03 17:27:33,012 INFO L444 ceAbstractionStarter]: At program point L87(lines 53 87) the Hoare annotation is: (and (exists ((ULTIMATE.start_main_~i~5 Int)) (and (<= ULTIMATE.start_main_~j~5 (* 2 ULTIMATE.start_main_~i~5)) (<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 1))) (<= ULTIMATE.start_main_~i~5 1) (< ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~n~5) (<= 1 ULTIMATE.start_main_~i~5)) [2018-12-03 17:27:33,012 INFO L444 ceAbstractionStarter]: At program point L81(lines 81 88) the Hoare annotation is: false [2018-12-03 17:27:33,012 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 90) no Hoare annotation was computed. [2018-12-03 17:27:33,013 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 90) no Hoare annotation was computed. [2018-12-03 17:27:33,013 INFO L444 ceAbstractionStarter]: At program point L59(lines 43 59) the Hoare annotation is: (or (and (<= 0 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 0)) (and (<= ULTIMATE.start_main_~j~5 (* 2 ULTIMATE.start_main_~i~5)) (<= ULTIMATE.start_main_~i~5 1) (<= 1 ULTIMATE.start_main_~i~5))) [2018-12-03 17:27:33,013 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 89) no Hoare annotation was computed. [2018-12-03 17:27:33,013 INFO L444 ceAbstractionStarter]: At program point L47(lines 47 54) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~j~5 (* 2 ULTIMATE.start_main_~i~5)))) (or (and .cse0 (<= ULTIMATE.start_main_~i~5 1) (< ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~n~5) (<= 1 ULTIMATE.start_main_~i~5)) (and .cse0 (<= (* 3 ULTIMATE.start_main_~i~5) ULTIMATE.start_main_~j~5) (<= 0 ULTIMATE.start_main_~i~5)))) [2018-12-03 17:27:33,014 INFO L444 ceAbstractionStarter]: At program point L76(lines 76 82) the Hoare annotation is: (and (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (exists ((ULTIMATE.start_main_~i~5 Int)) (and (<= ULTIMATE.start_main_~j~5 (* 2 ULTIMATE.start_main_~i~5)) (<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 1))) (<= ULTIMATE.start_main_~i~5 1) (< ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~n~5) (<= 1 ULTIMATE.start_main_~i~5) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond|)) [2018-12-03 17:27:33,014 INFO L444 ceAbstractionStarter]: At program point L72(lines 68 73) the Hoare annotation is: (and (exists ((ULTIMATE.start_main_~i~5 Int)) (and (<= ULTIMATE.start_main_~j~5 (* 2 ULTIMATE.start_main_~i~5)) (<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 1))) (<= ULTIMATE.start_main_~i~5 1) (< ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~n~5) (<= 1 ULTIMATE.start_main_~i~5) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond|)) [2018-12-03 17:27:33,032 INFO L202 PluginConnector]: Adding new model nested9.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:27:33 BoogieIcfgContainer [2018-12-03 17:27:33,032 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 17:27:33,034 INFO L168 Benchmark]: Toolchain (without parser) took 5273.04 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 712.0 MB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -437.1 MB). Peak memory consumption was 274.9 MB. Max. memory is 7.1 GB. [2018-12-03 17:27:33,035 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 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:27:33,036 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.11 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:27:33,036 INFO L168 Benchmark]: Boogie Preprocessor took 26.35 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:27:33,037 INFO L168 Benchmark]: RCFGBuilder took 401.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 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:27:33,038 INFO L168 Benchmark]: TraceAbstraction took 4796.10 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 712.0 MB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -458.3 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-12-03 17:27:33,046 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.24 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 41.11 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 26.35 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 401.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4796.10 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 712.0 MB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -458.3 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 89]: 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: 47]: Loop Invariant Derived loop invariant: (((main_~j~5 <= 2 * main_~i~5 && main_~i~5 <= 1) && main_~i~5 < main_~n~5) && 1 <= main_~i~5) || ((main_~j~5 <= 2 * main_~i~5 && 3 * main_~i~5 <= main_~j~5) && 0 <= main_~i~5) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: (0 <= main_~i~5 && main_~i~5 <= 0) || ((main_~j~5 <= 2 * main_~i~5 && main_~i~5 <= 1) && 1 <= main_~i~5) - InvariantResult [Line: 81]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: ((((1 <= __VERIFIER_assert_~cond && (exists ULTIMATE.start_main_~i~5 : int :: (main_~j~5 <= 2 * ULTIMATE.start_main_~i~5 && ULTIMATE.start_main_~i~5 <= main_~k~5) && ULTIMATE.start_main_~i~5 <= 1)) && main_~i~5 <= 1) && main_~i~5 < main_~n~5) && 1 <= main_~i~5) && 1 <= __VERIFIER_assert_#in~cond - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: (((exists ULTIMATE.start_main_~i~5 : int :: (main_~j~5 <= 2 * ULTIMATE.start_main_~i~5 && ULTIMATE.start_main_~i~5 <= main_~k~5) && ULTIMATE.start_main_~i~5 <= 1) && main_~i~5 <= 1) && main_~i~5 < main_~n~5) && 1 <= main_~i~5 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: ((((exists ULTIMATE.start_main_~i~5 : int :: (main_~j~5 <= 2 * ULTIMATE.start_main_~i~5 && ULTIMATE.start_main_~i~5 <= main_~k~5) && ULTIMATE.start_main_~i~5 <= 1) && main_~i~5 <= 1) && main_~i~5 < main_~n~5) && 1 <= main_~i~5) && 1 <= __VERIFIER_assert_#in~cond - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((((exists ULTIMATE.start_main_~i~5 : int :: (main_~j~5 <= 2 * ULTIMATE.start_main_~i~5 && ULTIMATE.start_main_~i~5 <= main_~k~5) && ULTIMATE.start_main_~i~5 <= 1) && main_~k~5 <= main_~i~5) && main_~i~5 <= 1) && main_~i~5 < main_~n~5) && 1 <= main_~i~5 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. SAFE Result, 4.6s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 27 SDtfs, 48 SDslu, 31 SDs, 0 SdLazy, 71 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.3s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 14 NumberOfFragments, 155 HoareAnnotationTreeSize, 7 FomulaSimplifications, 62 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 57 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 82 ConstructedInterpolants, 8 QuantifiedInterpolants, 3655 SizeOfPredicates, 7 NumberOfNonLiveVariables, 97 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 18/26 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...