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_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/half_2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:35:23,207 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:35:23,209 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:35:23,224 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:35:23,224 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:35:23,226 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:35:23,228 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:35:23,230 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:35:23,232 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:35:23,233 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:35:23,235 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:35:23,236 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:35:23,237 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:35:23,237 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:35:23,239 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:35:23,239 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:35:23,240 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:35:23,242 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:35:23,244 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:35:23,246 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:35:23,247 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:35:23,248 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:35:23,250 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:35:23,251 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:35:23,251 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:35:23,252 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:35:23,253 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:35:23,254 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:35:23,254 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:35:23,256 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:35:23,256 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:35:23,257 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:35:23,257 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:35:23,257 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:35:23,258 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:35:23,259 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:35:23,259 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:35:23,282 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:35:23,282 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:35:23,283 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:35:23,283 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:35:23,284 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:35:23,284 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:35:23,284 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:35:23,284 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:35:23,284 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:35:23,285 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:35:23,285 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:35:23,285 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:35:23,285 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:35:23,285 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:35:23,286 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:35:23,286 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:35:23,287 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:35:23,287 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:35:23,287 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:35:23,287 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:35:23,287 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:35:23,288 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:35:23,288 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:35:23,288 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:35:23,288 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:35:23,288 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:35:23,288 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:35:23,289 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:35:23,289 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:35:23,289 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:35:23,289 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:35:23,289 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:35:23,290 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:35:23,290 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:35:23,290 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:35:23,290 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:35:23,290 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:35:23,291 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:35:23,291 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:35:23,291 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:35:23,291 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:35:23,342 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:35:23,355 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:35:23,359 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:35:23,361 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:35:23,362 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:35:23,362 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/half_2.i_3.bpl [2018-12-03 15:35:23,363 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/half_2.i_3.bpl' [2018-12-03 15:35:23,420 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:35:23,422 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:35:23,423 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:35:23,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:35:23,423 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:35:23,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:35:23" (1/1) ... [2018-12-03 15:35:23,453 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:35:23" (1/1) ... [2018-12-03 15:35:23,463 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:35:23,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:35:23,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:35:23,465 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:35:23,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:35:23" (1/1) ... [2018-12-03 15:35:23,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:35:23" (1/1) ... [2018-12-03 15:35:23,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:35:23" (1/1) ... [2018-12-03 15:35:23,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:35:23" (1/1) ... [2018-12-03 15:35:23,484 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:35:23" (1/1) ... [2018-12-03 15:35:23,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:35:23" (1/1) ... [2018-12-03 15:35:23,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:35:23" (1/1) ... [2018-12-03 15:35:23,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:35:23,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:35:23,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:35:23,495 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:35:23,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:35:23" (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 15:35:23,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:35:23,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:35:23,833 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:35:23,834 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-03 15:35:23,834 INFO L202 PluginConnector]: Adding new model half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:35:23 BoogieIcfgContainer [2018-12-03 15:35:23,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:35:23,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:35:23,835 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:35:23,839 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:35:23,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:35:23" (1/2) ... [2018-12-03 15:35:23,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e32b86 and model type half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:35:23, skipping insertion in model container [2018-12-03 15:35:23,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:35:23" (2/2) ... [2018-12-03 15:35:23,842 INFO L112 eAbstractionObserver]: Analyzing ICFG half_2.i_3.bpl [2018-12-03 15:35:23,852 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:35:23,860 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:35:23,878 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:35:23,911 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:35:23,911 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:35:23,911 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:35:23,912 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:35:23,912 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:35:23,912 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:35:23,912 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:35:23,912 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:35:23,928 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 15:35:23,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 15:35:23,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:23,935 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 15:35:23,938 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:23,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:23,943 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 15:35:23,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:23,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:23,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:23,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:23,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:24,158 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 15:35:24,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:35:24,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:35:24,161 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:35:24,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:35:24,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:35:24,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:35:24,210 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 15:35:24,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:24,292 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 15:35:24,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:35:24,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 15:35:24,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:24,314 INFO L225 Difference]: With dead ends: 9 [2018-12-03 15:35:24,314 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 15:35:24,319 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 15:35:24,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 15:35:24,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 15:35:24,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 15:35:24,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 15:35:24,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 15:35:24,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:24,357 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 15:35:24,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:35:24,357 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 15:35:24,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 15:35:24,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:24,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 15:35:24,358 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:24,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:24,359 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 15:35:24,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:24,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:24,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:24,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:24,360 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:24,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:24,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:24,500 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:24,501 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 15:35:24,504 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 15:35:24,552 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:35:24,553 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:35:24,811 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:35:24,812 INFO L272 AbstractInterpreter]: Visited 4 different actions 13 times. Merged at 3 different actions 9 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:35:24,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:24,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:35:24,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:24,830 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 15:35:24,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:24,852 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:24,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:25,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:25,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:25,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:25,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:25,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2018-12-03 15:35:25,270 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:25,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:35:25,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:35:25,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:35:25,271 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 6 states. [2018-12-03 15:35:25,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:25,345 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 15:35:25,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:35:25,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-03 15:35:25,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:25,347 INFO L225 Difference]: With dead ends: 8 [2018-12-03 15:35:25,347 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 15:35:25,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:35:25,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 15:35:25,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 15:35:25,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 15:35:25,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 15:35:25,352 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 15:35:25,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:25,353 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 15:35:25,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:35:25,354 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 15:35:25,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:35:25,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:25,354 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 15:35:25,356 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:25,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:25,356 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-03 15:35:25,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:25,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:25,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:25,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:25,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:25,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:25,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:25,694 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:25,695 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:25,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:25,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:25,696 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 15:35:25,711 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:35:25,711 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:35:25,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:35:25,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:25,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:25,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:25,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:25,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:25,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:25,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2018-12-03 15:35:25,910 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:25,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:35:25,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:35:25,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:35:25,912 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 7 states. [2018-12-03 15:35:26,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:26,089 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 15:35:26,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:35:26,092 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2018-12-03 15:35:26,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:26,092 INFO L225 Difference]: With dead ends: 9 [2018-12-03 15:35:26,093 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:35:26,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:35:26,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:35:26,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 15:35:26,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 15:35:26,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 15:35:26,096 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 15:35:26,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:26,096 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 15:35:26,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:35:26,097 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 15:35:26,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:35:26,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:26,097 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 15:35:26,098 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:26,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:26,098 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-12-03 15:35:26,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:26,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:26,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:26,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:26,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:26,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:26,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:26,223 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:26,223 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:26,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:26,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:26,224 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:26,233 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:35:26,233 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:35:26,248 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:35:26,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:26,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:26,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:26,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:26,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:26,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:26,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2018-12-03 15:35:26,559 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:26,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:35:26,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:35:26,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:35:26,561 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 9 states. [2018-12-03 15:35:26,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:26,824 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-12-03 15:35:26,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:35:26,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2018-12-03 15:35:26,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:26,825 INFO L225 Difference]: With dead ends: 7 [2018-12-03 15:35:26,825 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:35:26,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:35:26,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:35:26,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:35:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:35:26,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:35:26,827 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2018-12-03 15:35:26,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:26,827 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:35:26,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:35:26,828 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:35:26,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:35:26,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:35:26,970 INFO L444 ceAbstractionStarter]: At program point L49(lines 26 49) the Hoare annotation is: (or (and (<= ULTIMATE.start_main_~n~5 (+ ULTIMATE.start_main_~k~5 2)) (<= 1 ULTIMATE.start_main_~k~5) (<= 4 ULTIMATE.start_main_~i~5)) (and (<= 2 ULTIMATE.start_main_~i~5) (<= 1 ULTIMATE.start_main_~n~5) (= ULTIMATE.start_main_~n~5 (+ ULTIMATE.start_main_~k~5 1))) (and (<= 0 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 0) (= ULTIMATE.start_main_~n~5 ULTIMATE.start_main_~k~5)) (and (<= 2 ULTIMATE.start_main_~k~5) (<= (+ ULTIMATE.start_main_~n~5 2) (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~i~5)))) [2018-12-03 15:35:26,970 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 52) no Hoare annotation was computed. [2018-12-03 15:35:26,971 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 52) no Hoare annotation was computed. [2018-12-03 15:35:26,971 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 52) no Hoare annotation was computed. [2018-12-03 15:35:26,971 INFO L444 ceAbstractionStarter]: At program point L42(lines 42 50) the Hoare annotation is: false [2018-12-03 15:35:26,971 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 51) no Hoare annotation was computed. [2018-12-03 15:35:26,981 INFO L202 PluginConnector]: Adding new model half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:35:26 BoogieIcfgContainer [2018-12-03 15:35:26,982 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:35:26,982 INFO L168 Benchmark]: Toolchain (without parser) took 3561.94 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 682.1 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -689.8 MB). Peak memory consumption was 167.2 MB. Max. memory is 7.1 GB. [2018-12-03 15:35:26,985 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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 15:35:26,986 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.40 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 15:35:26,987 INFO L168 Benchmark]: Boogie Preprocessor took 26.22 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 15:35:26,987 INFO L168 Benchmark]: RCFGBuilder took 343.21 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 15:35:26,988 INFO L168 Benchmark]: TraceAbstraction took 3146.38 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 682.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -710.9 MB). Peak memory consumption was 146.1 MB. Max. memory is 7.1 GB. [2018-12-03 15:35:26,993 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.21 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.40 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.22 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 343.21 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 3146.38 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 682.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -710.9 MB). Peak memory consumption was 146.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: 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: 42]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((((main_~n~5 <= main_~k~5 + 2 && 1 <= main_~k~5) && 4 <= main_~i~5) || ((2 <= main_~i~5 && 1 <= main_~n~5) && main_~n~5 == main_~k~5 + 1)) || ((0 <= main_~i~5 && main_~i~5 <= 0) && main_~n~5 == main_~k~5)) || (2 <= main_~k~5 && main_~n~5 + 2 <= main_~k~5 + main_~i~5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 3.0s OverallTime, 4 OverallIterations, 3 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 10 SDtfs, 0 SDslu, 10 SDs, 0 SdLazy, 67 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 5 NumberOfFragments, 47 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 841 SizeOfPredicates, 13 NumberOfNonLiveVariables, 96 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 0/30 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...