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/20170304-DifficultPathPrograms/down.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:39:17,317 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:39:17,319 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:39:17,331 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:39:17,331 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:39:17,332 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:39:17,333 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:39:17,335 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:39:17,337 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:39:17,338 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:39:17,339 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:39:17,339 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:39:17,340 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:39:17,341 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:39:17,342 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:39:17,343 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:39:17,344 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:39:17,346 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:39:17,348 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:39:17,349 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:39:17,351 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:39:17,352 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:39:17,354 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:39:17,355 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:39:17,355 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:39:17,356 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:39:17,357 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:39:17,358 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:39:17,359 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:39:17,360 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:39:17,360 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:39:17,361 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:39:17,361 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:39:17,362 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:39:17,363 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:39:17,364 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:39:17,364 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:39:17,377 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:39:17,377 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:39:17,378 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:39:17,379 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:39:17,379 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:39:17,379 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:39:17,379 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:39:17,379 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:39:17,380 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:39:17,380 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:39:17,380 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:39:17,380 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:39:17,380 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:39:17,381 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:39:17,381 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:39:17,381 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:39:17,383 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:39:17,383 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:39:17,383 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:39:17,383 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:39:17,385 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:39:17,385 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:39:17,385 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:39:17,385 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:39:17,385 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:39:17,386 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:39:17,386 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:39:17,386 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:39:17,386 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:39:17,386 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:39:17,388 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:39:17,388 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:39:17,388 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:39:17,389 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:39:17,389 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:39:17,389 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:39:17,389 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:39:17,389 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:39:17,391 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:39:17,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:39:17,461 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:39:17,467 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:39:17,470 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:39:17,471 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:39:17,471 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/down.i_4.bpl [2018-12-03 17:39:17,472 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/down.i_4.bpl' [2018-12-03 17:39:17,520 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:39:17,522 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:39:17,523 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:39:17,524 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:39:17,525 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:39:17,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:39:17" (1/1) ... [2018-12-03 17:39:17,552 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:39:17" (1/1) ... [2018-12-03 17:39:17,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:39:17,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:39:17,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:39:17,562 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:39:17,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:39:17" (1/1) ... [2018-12-03 17:39:17,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:39:17" (1/1) ... [2018-12-03 17:39:17,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:39:17" (1/1) ... [2018-12-03 17:39:17,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:39:17" (1/1) ... [2018-12-03 17:39:17,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:39:17" (1/1) ... [2018-12-03 17:39:17,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:39:17" (1/1) ... [2018-12-03 17:39:17,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:39:17" (1/1) ... [2018-12-03 17:39:17,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:39:17,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:39:17,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:39:17,585 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:39:17,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:39:17" (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:39:17,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:39:17,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:39:17,971 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:39:17,971 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-03 17:39:17,972 INFO L202 PluginConnector]: Adding new model down.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:39:17 BoogieIcfgContainer [2018-12-03 17:39:17,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:39:17,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:39:17,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:39:17,977 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:39:17,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:39:17" (1/2) ... [2018-12-03 17:39:17,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eddd932 and model type down.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:39:17, skipping insertion in model container [2018-12-03 17:39:17,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:39:17" (2/2) ... [2018-12-03 17:39:17,982 INFO L112 eAbstractionObserver]: Analyzing ICFG down.i_4.bpl [2018-12-03 17:39:17,994 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:39:18,003 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:39:18,022 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:39:18,064 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:39:18,065 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:39:18,065 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:39:18,065 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:39:18,065 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:39:18,065 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:39:18,066 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:39:18,066 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:39:18,083 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-12-03 17:39:18,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 17:39:18,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:39:18,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 17:39:18,096 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:39:18,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:39:18,103 INFO L82 PathProgramCache]: Analyzing trace with hash 28787237, now seen corresponding path program 1 times [2018-12-03 17:39:18,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:39:18,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:18,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:39:18,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:18,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:39:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:39:18,313 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:39:18,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:39:18,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:39:18,317 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:39:18,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:39:18,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:39:18,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:39:18,346 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 4 states. [2018-12-03 17:39:18,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:39:18,495 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-12-03 17:39:18,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:39:18,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-03 17:39:18,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:39:18,509 INFO L225 Difference]: With dead ends: 14 [2018-12-03 17:39:18,509 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 17:39:18,513 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:39:18,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 17:39:18,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 17:39:18,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 17:39:18,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-03 17:39:18,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-12-03 17:39:18,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:39:18,550 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-03 17:39:18,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:39:18,550 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-03 17:39:18,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 17:39:18,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:39:18,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 17:39:18,551 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:39:18,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:39:18,552 INFO L82 PathProgramCache]: Analyzing trace with hash 894126414, now seen corresponding path program 1 times [2018-12-03 17:39:18,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:39:18,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:18,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:39:18,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:18,553 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:39:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:39:18,642 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:39:18,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:39:18,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:39:18,643 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:39:18,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:39:18,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:39:18,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:39:18,646 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2018-12-03 17:39:18,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:39:18,748 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-12-03 17:39:18,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 17:39:18,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-12-03 17:39:18,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:39:18,749 INFO L225 Difference]: With dead ends: 15 [2018-12-03 17:39:18,749 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 17:39:18,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:39:18,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 17:39:18,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-12-03 17:39:18,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 17:39:18,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-03 17:39:18,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-12-03 17:39:18,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:39:18,755 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-03 17:39:18,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:39:18,756 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-03 17:39:18,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:39:18,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:39:18,756 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-03 17:39:18,757 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:39:18,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:39:18,757 INFO L82 PathProgramCache]: Analyzing trace with hash 261957866, now seen corresponding path program 1 times [2018-12-03 17:39:18,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:39:18,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:18,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:39:18,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:18,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:39:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:39:18,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:18,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:18,873 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:39:18,874 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 17:39:18,876 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9], [13], [15], [17] [2018-12-03 17:39:18,938 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:39:18,939 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:39:19,597 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:39:19,598 INFO L272 AbstractInterpreter]: Visited 6 different actions 41 times. Merged at 4 different actions 23 times. Widened at 4 different actions 8 times. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 17:39:19,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:39:19,644 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:39:19,788 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 58.33% of their original sizes. [2018-12-03 17:39:19,788 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:39:20,011 INFO L418 sIntCurrentIteration]: We unified 7 AI predicates to 7 [2018-12-03 17:39:20,011 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:39:20,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:39:20,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2018-12-03 17:39:20,012 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:39:20,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 17:39:20,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 17:39:20,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:39:20,014 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 6 states. [2018-12-03 17:39:20,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:39:20,405 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 17:39:20,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 17:39:20,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-12-03 17:39:20,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:39:20,406 INFO L225 Difference]: With dead ends: 9 [2018-12-03 17:39:20,406 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 17:39:20,407 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:39:20,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 17:39:20,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 17:39:20,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 17:39:20,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 17:39:20,408 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2018-12-03 17:39:20,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:39:20,408 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 17:39:20,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 17:39:20,409 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 17:39:20,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 17:39:20,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 17:39:21,100 WARN L180 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 18 [2018-12-03 17:39:21,641 WARN L180 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 32 [2018-12-03 17:39:21,646 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 67) no Hoare annotation was computed. [2018-12-03 17:39:21,646 INFO L444 ceAbstractionStarter]: At program point L64(lines 64 65) the Hoare annotation is: false [2018-12-03 17:39:21,646 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 67) no Hoare annotation was computed. [2018-12-03 17:39:21,647 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 67) no Hoare annotation was computed. [2018-12-03 17:39:21,647 INFO L444 ceAbstractionStarter]: At program point L60(lines 33 60) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_main_~k~5 (+ ULTIMATE.start_main_~j~5 2147483648))) (.cse3 (<= ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~k~5))) (or (let ((.cse0 (* 2 ULTIMATE.start_main_~k~5)) (.cse2 (* 2 ULTIMATE.start___VERIFIER_assert_~cond))) (and (<= .cse0 4294967294) .cse1 (<= 2 .cse2) (<= 0 .cse0) .cse3 (<= .cse2 2))) (and (<= ULTIMATE.start_main_~j~5 0) (<= ULTIMATE.start_main_~i~5 0)) (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) .cse1 .cse3 (<= 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:39:21,647 INFO L444 ceAbstractionStarter]: At program point L49(lines 49 61) the Hoare annotation is: (let ((.cse0 (* 2 ULTIMATE.start___VERIFIER_assert_~cond))) (and (<= 2 .cse0) (<= 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)) (<= .cse0 2))) [2018-12-03 17:39:21,648 INFO L444 ceAbstractionStarter]: At program point L42(lines 24 42) 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:39:21,648 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 66) no Hoare annotation was computed. [2018-12-03 17:39:21,658 INFO L202 PluginConnector]: Adding new model down.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:39:21 BoogieIcfgContainer [2018-12-03 17:39:21,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 17:39:21,658 INFO L168 Benchmark]: Toolchain (without parser) took 4137.70 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 686.3 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -626.5 MB). Peak memory consumption was 59.8 MB. Max. memory is 7.1 GB. [2018-12-03 17:39:21,660 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.79 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:39:21,661 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.53 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:39:21,661 INFO L168 Benchmark]: Boogie Preprocessor took 22.86 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:39:21,662 INFO L168 Benchmark]: RCFGBuilder took 387.63 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:39:21,663 INFO L168 Benchmark]: TraceAbstraction took 3683.73 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 686.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -647.6 MB). Peak memory consumption was 38.7 MB. Max. memory is 7.1 GB. [2018-12-03 17:39:21,667 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.79 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 37.53 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 22.86 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 387.63 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 3683.73 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 686.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -647.6 MB). Peak memory consumption was 38.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 66]: 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: 24]: 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: 64]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (((2 <= 2 * __VERIFIER_assert_~cond && main_~j~5 <= main_~k~5) && __VERIFIER_assert_~cond <= main_~j~5) && main_~k~5 <= __VERIFIER_assert_~cond + 2147483646) && 2 * __VERIFIER_assert_~cond <= 2 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((2 * main_~k~5 <= 4294967294 && main_~k~5 <= main_~j~5 + 2147483648) && 2 <= 2 * __VERIFIER_assert_~cond) && 0 <= 2 * main_~k~5) && main_~j~5 <= main_~k~5) && 2 * __VERIFIER_assert_~cond <= 2) || (main_~j~5 <= 0 && main_~i~5 <= 0)) || ((((((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) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 3.5s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 10 SDtfs, 9 SDslu, 14 SDs, 0 SdLazy, 30 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=2, 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.8896103896103896 AbsIntWeakeningRatio, 1.2857142857142858 AbsIntAvgWeakeningVarsNumRemoved, 24.571428571428573 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 10 NumberOfFragments, 117 HoareAnnotationTreeSize, 4 FomulaSimplifications, 177 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 4 FomulaSimplificationsInter, 346 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 216 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 3/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...