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_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/CountTillBound-Jupiter.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-df3cc4e-m [2019-01-11 11:30:42,328 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 11:30:42,330 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 11:30:42,343 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 11:30:42,343 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 11:30:42,345 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 11:30:42,346 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 11:30:42,348 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 11:30:42,349 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 11:30:42,350 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 11:30:42,351 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 11:30:42,351 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 11:30:42,352 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 11:30:42,353 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 11:30:42,354 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 11:30:42,355 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 11:30:42,356 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 11:30:42,358 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 11:30:42,360 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 11:30:42,362 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 11:30:42,363 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 11:30:42,364 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 11:30:42,367 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 11:30:42,367 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 11:30:42,368 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 11:30:42,369 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 11:30:42,370 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 11:30:42,370 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 11:30:42,371 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 11:30:42,372 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 11:30:42,373 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 11:30:42,373 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 11:30:42,374 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 11:30:42,374 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 11:30:42,375 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 11:30:42,376 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 11:30:42,376 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-11 11:30:42,390 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 11:30:42,390 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 11:30:42,391 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 11:30:42,391 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 11:30:42,392 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 11:30:42,392 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 11:30:42,392 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 11:30:42,392 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 11:30:42,392 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 11:30:42,393 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-11 11:30:42,393 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-11 11:30:42,393 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 11:30:42,393 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 11:30:42,394 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 11:30:42,394 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 11:30:42,394 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 11:30:42,394 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 11:30:42,395 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 11:30:42,395 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 11:30:42,395 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 11:30:42,395 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 11:30:42,395 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 11:30:42,396 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 11:30:42,396 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 11:30:42,396 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 11:30:42,396 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 11:30:42,396 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 11:30:42,397 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 11:30:42,397 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 11:30:42,397 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 11:30:42,397 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:30:42,397 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 11:30:42,398 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 11:30:42,398 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 11:30:42,398 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 11:30:42,398 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 11:30:42,398 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 11:30:42,399 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 11:30:42,399 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 11:30:42,437 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 11:30:42,449 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 11:30:42,453 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 11:30:42,455 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 11:30:42,455 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 11:30:42,456 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/CountTillBound-Jupiter.bpl [2019-01-11 11:30:42,456 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/CountTillBound-Jupiter.bpl' [2019-01-11 11:30:42,486 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 11:30:42,488 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 11:30:42,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 11:30:42,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 11:30:42,489 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 11:30:42,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:30:42" (1/1) ... [2019-01-11 11:30:42,517 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:30:42" (1/1) ... [2019-01-11 11:30:42,523 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-11 11:30:42,523 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-11 11:30:42,524 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-11 11:30:42,526 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 11:30:42,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 11:30:42,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 11:30:42,527 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 11:30:42,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:30:42" (1/1) ... [2019-01-11 11:30:42,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:30:42" (1/1) ... [2019-01-11 11:30:42,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:30:42" (1/1) ... [2019-01-11 11:30:42,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:30:42" (1/1) ... [2019-01-11 11:30:42,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:30:42" (1/1) ... [2019-01-11 11:30:42,549 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:30:42" (1/1) ... [2019-01-11 11:30:42,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:30:42" (1/1) ... [2019-01-11 11:30:42,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 11:30:42,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 11:30:42,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 11:30:42,552 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 11:30:42,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:30:42" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-11 11:30:42,628 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-01-11 11:30:42,628 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-11 11:30:42,628 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-11 11:30:42,869 INFO L278 CfgBuilder]: Using library mode [2019-01-11 11:30:42,869 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-11 11:30:42,871 INFO L202 PluginConnector]: Adding new model CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:30:42 BoogieIcfgContainer [2019-01-11 11:30:42,871 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 11:30:42,872 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 11:30:42,873 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 11:30:42,877 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 11:30:42,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:30:42" (1/2) ... [2019-01-11 11:30:42,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6308a9e7 and model type CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 11:30:42, skipping insertion in model container [2019-01-11 11:30:42,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:30:42" (2/2) ... [2019-01-11 11:30:42,881 INFO L112 eAbstractionObserver]: Analyzing ICFG CountTillBound-Jupiter.bpl [2019-01-11 11:30:42,894 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 11:30:42,908 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 11:30:42,929 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 11:30:42,977 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 11:30:42,977 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 11:30:42,978 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 11:30:42,978 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 11:30:42,978 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 11:30:42,978 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 11:30:42,979 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 11:30:42,979 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 11:30:43,001 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-11 11:30:43,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:30:43,016 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:30:43,018 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:30:43,024 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:30:43,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:30:43,033 INFO L82 PathProgramCache]: Analyzing trace with hash 30176, now seen corresponding path program 1 times [2019-01-11 11:30:43,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:30:43,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:43,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:30:43,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:43,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:30:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:30:43,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:43,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:30:43,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 11:30:43,244 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:30:43,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 11:30:43,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 11:30:43,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:30:43,267 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-11 11:30:43,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:30:43,345 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-01-11 11:30:43,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:30:43,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-11 11:30:43,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:30:43,362 INFO L225 Difference]: With dead ends: 12 [2019-01-11 11:30:43,362 INFO L226 Difference]: Without dead ends: 6 [2019-01-11 11:30:43,367 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 [2019-01-11 11:30:43,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-11 11:30:43,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-11 11:30:43,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-11 11:30:43,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-11 11:30:43,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2019-01-11 11:30:43,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:30:43,413 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-11 11:30:43,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 11:30:43,414 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-01-11 11:30:43,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:30:43,414 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:30:43,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:30:43,415 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:30:43,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:30:43,416 INFO L82 PathProgramCache]: Analyzing trace with hash 28758310, now seen corresponding path program 1 times [2019-01-11 11:30:43,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:30:43,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:43,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:30:43,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:43,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:30:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:30:43,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:43,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:43,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:30:43,590 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:30:43,592 INFO L207 CegarAbsIntRunner]: [0], [4], [10], [12], [13] [2019-01-11 11:30:43,697 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:30:43,698 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:30:43,929 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-11 11:30:43,931 INFO L272 AbstractInterpreter]: Visited 5 different actions 46 times. Merged at 2 different actions 27 times. Widened at 2 different actions 19 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:30:43,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:30:43,938 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-11 11:30:43,986 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-01-11 11:30:43,986 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-11 11:30:44,138 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-01-11 11:30:44,139 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-11 11:30:44,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 11:30:44,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2019-01-11 11:30:44,140 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:30:44,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 11:30:44,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 11:30:44,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-11 11:30:44,143 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 5 states. [2019-01-11 11:30:44,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:30:44,237 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2019-01-11 11:30:44,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:30:44,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-11 11:30:44,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:30:44,238 INFO L225 Difference]: With dead ends: 9 [2019-01-11 11:30:44,238 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 11:30:44,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-11 11:30:44,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 11:30:44,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 11:30:44,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 11:30:44,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 11:30:44,240 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-01-11 11:30:44,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:30:44,240 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 11:30:44,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 11:30:44,241 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 11:30:44,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 11:30:44,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 11:30:44,555 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2019-01-11 11:30:44,699 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 13 [2019-01-11 11:30:44,702 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 14 28) no Hoare annotation was computed. [2019-01-11 11:30:44,702 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-01-11 11:30:44,702 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 14 28) no Hoare annotation was computed. [2019-01-11 11:30:44,703 INFO L444 ceAbstractionStarter]: At program point L21-1(lines 21 24) the Hoare annotation is: (let ((.cse0 (* 2 main_y))) (and (<= .cse0 84) (<= 84 .cse0) (<= 2 (* 2 main_x)) (<= (+ main_x main_y) 142))) [2019-01-11 11:30:44,703 INFO L444 ceAbstractionStarter]: At program point L19-1(lines 19 25) the Hoare annotation is: (let ((.cse1 (+ main_x main_y))) (or (let ((.cse0 (* 2 main_y))) (and (<= .cse0 84) (<= 84 .cse0) (<= 2 (* 2 main_x)) (<= .cse1 142))) (and (<= main_y (+ main_x 42)) (<= main_x 0) (<= 42 .cse1)))) [2019-01-11 11:30:44,704 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 14 28) no Hoare annotation was computed. [2019-01-11 11:30:44,704 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 27) no Hoare annotation was computed. [2019-01-11 11:30:44,713 INFO L202 PluginConnector]: Adding new model CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 11:30:44 BoogieIcfgContainer [2019-01-11 11:30:44,713 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 11:30:44,714 INFO L168 Benchmark]: Toolchain (without parser) took 2227.34 ms. Allocated memory was 138.9 MB in the beginning and 178.3 MB in the end (delta: 39.3 MB). Free memory was 106.6 MB in the beginning and 129.4 MB in the end (delta: -22.8 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. [2019-01-11 11:30:44,716 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory is still 107.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-11 11:30:44,717 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.51 ms. Allocated memory is still 138.9 MB. Free memory was 106.6 MB in the beginning and 104.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-01-11 11:30:44,718 INFO L168 Benchmark]: Boogie Preprocessor took 24.42 ms. Allocated memory is still 138.9 MB. Free memory was 104.8 MB in the beginning and 103.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-11 11:30:44,719 INFO L168 Benchmark]: RCFGBuilder took 319.25 ms. Allocated memory is still 138.9 MB. Free memory was 103.5 MB in the beginning and 95.4 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 7.1 GB. [2019-01-11 11:30:44,721 INFO L168 Benchmark]: TraceAbstraction took 1840.75 ms. Allocated memory was 138.9 MB in the beginning and 178.3 MB in the end (delta: 39.3 MB). Free memory was 95.2 MB in the beginning and 129.4 MB in the end (delta: -34.2 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. [2019-01-11 11:30:44,726 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.20 ms. Allocated memory is still 138.9 MB. Free memory is still 107.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.51 ms. Allocated memory is still 138.9 MB. Free memory was 106.6 MB in the beginning and 104.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.42 ms. Allocated memory is still 138.9 MB. Free memory was 104.8 MB in the beginning and 103.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 319.25 ms. Allocated memory is still 138.9 MB. Free memory was 103.5 MB in the beginning and 95.4 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1840.75 ms. Allocated memory was 138.9 MB in the beginning and 178.3 MB in the end (delta: 39.3 MB). Free memory was 95.2 MB in the beginning and 129.4 MB in the end (delta: -34.2 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 27]: 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: 19]: Loop Invariant Derived loop invariant: (((2 * y <= 84 && 84 <= 2 * y) && 2 <= 2 * x) && x + y <= 142) || ((y <= x + 42 && x <= 0) && 42 <= x + y) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((2 * y <= 84 && 84 <= 2 * y) && 2 <= 2 * x) && x + y <= 142 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 1.7s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 8 SDtfs, 3 SDslu, 3 SDs, 0 SdLazy, 6 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.0 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 5 NumberOfFragments, 57 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 70 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 8 NumberOfCodeBlocks, 8 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 48 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...