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/eureka_05.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:10:18,309 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:10:18,311 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:10:18,329 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:10:18,329 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:10:18,330 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:10:18,332 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:10:18,335 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:10:18,337 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:10:18,346 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:10:18,347 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:10:18,347 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:10:18,350 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:10:18,352 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:10:18,353 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:10:18,355 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:10:18,357 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:10:18,360 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:10:18,363 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:10:18,365 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:10:18,367 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:10:18,368 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:10:18,372 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:10:18,373 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:10:18,373 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:10:18,374 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:10:18,375 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:10:18,376 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:10:18,377 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:10:18,380 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:10:18,380 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:10:18,381 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:10:18,381 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:10:18,381 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:10:18,384 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:10:18,385 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:10:18,385 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 [2019-02-25 15:10:18,410 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:10:18,410 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:10:18,412 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:10:18,413 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:10:18,413 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:10:18,413 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:10:18,413 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:10:18,414 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:10:18,414 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-25 15:10:18,414 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:10:18,414 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-25 15:10:18,414 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-25 15:10:18,414 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:10:18,415 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:10:18,415 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:10:18,416 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:10:18,422 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:10:18,422 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:10:18,422 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:10:18,423 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:10:18,423 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:10:18,423 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:10:18,423 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:10:18,423 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:10:18,423 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:10:18,424 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:10:18,424 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:10:18,424 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:10:18,426 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:10:18,426 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:10:18,426 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:10:18,426 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:10:18,429 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:10:18,432 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:10:18,432 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:10:18,433 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:10:18,433 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:10:18,433 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:10:18,433 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:10:18,433 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:10:18,469 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:10:18,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:10:18,491 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:10:18,493 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:10:18,493 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:10:18,494 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl [2019-02-25 15:10:18,495 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl' [2019-02-25 15:10:18,557 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:10:18,559 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:10:18,560 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:10:18,560 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:10:18,560 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:10:18,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,594 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:10:18,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:10:18,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:10:18,605 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:10:18,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,626 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:10:18,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:10:18,640 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:10:18,640 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:10:18,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (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 [2019-02-25 15:10:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-25 15:10:18,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-25 15:10:19,036 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-02-25 15:10:19,038 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-25 15:10:19,038 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-02-25 15:10:19,040 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:10:19 BoogieIcfgContainer [2019-02-25 15:10:19,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:10:19,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:10:19,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:10:19,044 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:10:19,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/2) ... [2019-02-25 15:10:19,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@567268cd and model type eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:10:19, skipping insertion in model container [2019-02-25 15:10:19,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:10:19" (2/2) ... [2019-02-25 15:10:19,048 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05.i_5.bpl [2019-02-25 15:10:19,058 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:10:19,067 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-25 15:10:19,085 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-25 15:10:19,117 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:10:19,117 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:10:19,117 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:10:19,118 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:10:19,118 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:10:19,118 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:10:19,118 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:10:19,118 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:10:19,133 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-25 15:10:19,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:10:19,139 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:19,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:10:19,142 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:19,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:19,147 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-02-25 15:10:19,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:19,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:19,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:19,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:19,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:19,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:19,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:10:19,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-25 15:10:19,305 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:10:19,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:10:19,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:10:19,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:10:19,352 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-25 15:10:19,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:19,425 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2019-02-25 15:10:19,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:10:19,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-25 15:10:19,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:19,438 INFO L225 Difference]: With dead ends: 11 [2019-02-25 15:10:19,438 INFO L226 Difference]: Without dead ends: 7 [2019-02-25 15:10:19,442 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-02-25 15:10:19,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-25 15:10:19,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-25 15:10:19,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-25 15:10:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-02-25 15:10:19,478 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 4 [2019-02-25 15:10:19,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:19,479 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-02-25 15:10:19,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:10:19,479 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-02-25 15:10:19,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:10:19,480 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:19,480 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:10:19,480 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:19,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:19,481 INFO L82 PathProgramCache]: Analyzing trace with hash 28842881, now seen corresponding path program 1 times [2019-02-25 15:10:19,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:19,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:19,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:19,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:19,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:19,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:19,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:19,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:19,557 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:10:19,559 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [16] [2019-02-25 15:10:19,598 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:10:19,598 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:10:19,705 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-25 15:10:19,706 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 1 different actions 3 times. Never widened. Performed 75 root evaluator evaluations with a maximum evaluation depth of 3. Performed 75 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:10:19,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:19,713 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-25 15:10:19,743 INFO L227 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 33.33% of their original sizes. [2019-02-25 15:10:19,743 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-25 15:10:19,763 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-02-25 15:10:19,764 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-25 15:10:19,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-25 15:10:19,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2019-02-25 15:10:19,765 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:10:19,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:10:19,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:10:19,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:10:19,767 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 4 states. [2019-02-25 15:10:19,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:19,903 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-02-25 15:10:19,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:10:19,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-25 15:10:19,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:19,903 INFO L225 Difference]: With dead ends: 11 [2019-02-25 15:10:19,904 INFO L226 Difference]: Without dead ends: 9 [2019-02-25 15:10:19,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:10:19,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-25 15:10:19,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-02-25 15:10:19,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-25 15:10:19,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-02-25 15:10:19,908 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2019-02-25 15:10:19,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:19,908 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-02-25 15:10:19,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:10:19,909 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-02-25 15:10:19,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:10:19,909 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:19,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:10:19,910 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:19,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:19,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1948270601, now seen corresponding path program 1 times [2019-02-25 15:10:19,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:19,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:19,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:19,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:19,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:10:19,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:19,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:19,980 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:10:19,981 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16], [22] [2019-02-25 15:10:19,982 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:10:19,982 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:10:19,994 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-25 15:10:19,994 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 1 different actions 3 times. Never widened. Performed 82 root evaluator evaluations with a maximum evaluation depth of 4. Performed 82 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:10:19,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:19,995 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-25 15:10:20,005 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 28.89% of their original sizes. [2019-02-25 15:10:20,005 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-25 15:10:20,102 INFO L420 sIntCurrentIteration]: We unified 6 AI predicates to 6 [2019-02-25 15:10:20,102 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-25 15:10:20,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-25 15:10:20,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2019-02-25 15:10:20,103 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:10:20,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-25 15:10:20,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-25 15:10:20,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-02-25 15:10:20,104 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 5 states. [2019-02-25 15:10:20,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:20,216 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-02-25 15:10:20,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:10:20,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-02-25 15:10:20,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:20,217 INFO L225 Difference]: With dead ends: 14 [2019-02-25 15:10:20,217 INFO L226 Difference]: Without dead ends: 10 [2019-02-25 15:10:20,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-02-25 15:10:20,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-25 15:10:20,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-02-25 15:10:20,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-25 15:10:20,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-02-25 15:10:20,221 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 7 [2019-02-25 15:10:20,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:20,222 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-02-25 15:10:20,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-25 15:10:20,222 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-02-25 15:10:20,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:10:20,222 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:20,222 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:10:20,222 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:20,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:20,223 INFO L82 PathProgramCache]: Analyzing trace with hash 266915571, now seen corresponding path program 1 times [2019-02-25 15:10:20,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:20,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:20,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:20,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:20,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:20,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-25 15:10:20,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:20,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:20,343 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-25 15:10:20,343 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16], [22], [24] [2019-02-25 15:10:20,345 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:10:20,345 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:10:20,379 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:10:20,380 INFO L272 AbstractInterpreter]: Visited 8 different actions 30 times. Merged at 4 different actions 11 times. Widened at 1 different actions 2 times. Performed 344 root evaluator evaluations with a maximum evaluation depth of 4. Performed 344 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 15:10:20,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:20,383 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:10:20,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:20,383 INFO L193 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 [2019-02-25 15:10:20,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:20,394 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:20,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-25 15:10:20,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:20,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-25 15:10:20,442 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:20,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-25 15:10:20,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:20,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-02-25 15:10:20,712 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:20,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:10:20,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:10:20,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:10:20,714 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 4 states. [2019-02-25 15:10:20,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:20,783 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2019-02-25 15:10:20,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:10:20,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-02-25 15:10:20,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:20,784 INFO L225 Difference]: With dead ends: 16 [2019-02-25 15:10:20,784 INFO L226 Difference]: Without dead ends: 10 [2019-02-25 15:10:20,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:10:20,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-25 15:10:20,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-02-25 15:10:20,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-25 15:10:20,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-02-25 15:10:20,789 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2019-02-25 15:10:20,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:20,789 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-02-25 15:10:20,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:10:20,790 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-02-25 15:10:20,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:10:20,790 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:20,790 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:10:20,791 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:20,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:20,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1192626986, now seen corresponding path program 2 times [2019-02-25 15:10:20,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:20,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:20,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:20,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:20,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:21,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-25 15:10:21,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:21,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:21,076 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:21,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:21,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:21,077 INFO L193 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 [2019-02-25 15:10:21,094 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:21,095 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:21,139 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-25 15:10:21,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:21,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-25 15:10:21,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:21,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-25 15:10:21,145 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:21,233 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-25 15:10:21,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:21,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-02-25 15:10:21,253 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:21,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-25 15:10:21,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-25 15:10:21,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:10:21,254 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2019-02-25 15:10:21,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:21,308 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-02-25 15:10:21,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:10:21,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-02-25 15:10:21,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:21,309 INFO L225 Difference]: With dead ends: 17 [2019-02-25 15:10:21,309 INFO L226 Difference]: Without dead ends: 11 [2019-02-25 15:10:21,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:10:21,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-25 15:10:21,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-25 15:10:21,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-25 15:10:21,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-02-25 15:10:21,314 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2019-02-25 15:10:21,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:21,314 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-02-25 15:10:21,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-25 15:10:21,314 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-02-25 15:10:21,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-25 15:10:21,315 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:21,315 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:10:21,315 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:21,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:21,316 INFO L82 PathProgramCache]: Analyzing trace with hash -175090221, now seen corresponding path program 3 times [2019-02-25 15:10:21,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:21,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:21,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:21,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:21,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:21,412 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-25 15:10:21,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:21,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:21,413 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:21,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:21,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:21,414 INFO L193 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 [2019-02-25 15:10:21,430 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:21,430 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:21,448 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:21,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:21,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-25 15:10:21,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:21,453 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-25 15:10:21,453 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:21,576 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-25 15:10:21,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:21,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2019-02-25 15:10:21,595 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:21,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:10:21,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:10:21,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:10:21,596 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 6 states. [2019-02-25 15:10:21,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:21,633 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-02-25 15:10:21,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:10:21,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-02-25 15:10:21,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:21,634 INFO L225 Difference]: With dead ends: 18 [2019-02-25 15:10:21,634 INFO L226 Difference]: Without dead ends: 12 [2019-02-25 15:10:21,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:10:21,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-25 15:10:21,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-25 15:10:21,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-25 15:10:21,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-02-25 15:10:21,638 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2019-02-25 15:10:21,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:21,639 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-02-25 15:10:21,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:10:21,639 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-02-25 15:10:21,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-25 15:10:21,640 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:21,640 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:10:21,640 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:21,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:21,640 INFO L82 PathProgramCache]: Analyzing trace with hash 375349322, now seen corresponding path program 4 times [2019-02-25 15:10:21,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:21,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:21,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:21,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:21,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:21,716 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-25 15:10:21,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:21,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:21,717 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:21,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:21,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:21,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:21,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:21,727 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:21,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-25 15:10:21,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:21,751 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-25 15:10:21,751 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:21,867 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-25 15:10:21,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:21,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2019-02-25 15:10:21,886 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:21,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-25 15:10:21,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-25 15:10:21,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:10:21,887 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-02-25 15:10:21,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:21,917 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-02-25 15:10:21,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:10:21,918 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-02-25 15:10:21,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:21,918 INFO L225 Difference]: With dead ends: 19 [2019-02-25 15:10:21,918 INFO L226 Difference]: Without dead ends: 13 [2019-02-25 15:10:21,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:10:21,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-25 15:10:21,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-25 15:10:21,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-25 15:10:21,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-02-25 15:10:21,924 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2019-02-25 15:10:21,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:21,924 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-02-25 15:10:21,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-25 15:10:21,924 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-02-25 15:10:21,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-25 15:10:21,925 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:21,925 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:10:21,925 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:21,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:21,926 INFO L82 PathProgramCache]: Analyzing trace with hash 259105971, now seen corresponding path program 5 times [2019-02-25 15:10:21,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:21,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:21,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:21,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:21,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-25 15:10:21,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:21,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:21,994 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:21,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:21,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:21,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:22,007 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:22,007 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:22,045 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-25 15:10:22,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:22,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-25 15:10:22,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:22,360 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-02-25 15:10:22,360 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:22,390 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-02-25 15:10:22,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:22,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2019-02-25 15:10:22,410 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:22,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:10:22,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:10:22,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:10:22,412 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 8 states. [2019-02-25 15:10:22,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:22,597 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2019-02-25 15:10:22,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:10:22,598 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-02-25 15:10:22,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:22,599 INFO L225 Difference]: With dead ends: 21 [2019-02-25 15:10:22,599 INFO L226 Difference]: Without dead ends: 19 [2019-02-25 15:10:22,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:10:22,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-25 15:10:22,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-25 15:10:22,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-25 15:10:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-02-25 15:10:22,607 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2019-02-25 15:10:22,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:22,607 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-02-25 15:10:22,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:10:22,608 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-02-25 15:10:22,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-25 15:10:22,608 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:22,608 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2019-02-25 15:10:22,609 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:22,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:22,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1746247989, now seen corresponding path program 6 times [2019-02-25 15:10:22,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:22,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:22,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:22,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:22,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:22,677 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-02-25 15:10:22,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:10:22,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-02-25 15:10:22,678 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:10:22,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:10:22,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:10:22,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:10:22,679 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 4 states. [2019-02-25 15:10:22,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:22,724 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-02-25 15:10:22,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:10:22,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-02-25 15:10:22,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:22,725 INFO L225 Difference]: With dead ends: 29 [2019-02-25 15:10:22,725 INFO L226 Difference]: Without dead ends: 21 [2019-02-25 15:10:22,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-25 15:10:22,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-25 15:10:22,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-25 15:10:22,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-25 15:10:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-02-25 15:10:22,734 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2019-02-25 15:10:22,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:22,734 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-02-25 15:10:22,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:10:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-02-25 15:10:22,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-25 15:10:22,735 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:22,735 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1] [2019-02-25 15:10:22,735 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:22,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:22,736 INFO L82 PathProgramCache]: Analyzing trace with hash 406829563, now seen corresponding path program 7 times [2019-02-25 15:10:22,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:22,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:22,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:22,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:22,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-02-25 15:10:22,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:22,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:22,937 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:22,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:22,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:22,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:22,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:22,948 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:22,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-25 15:10:22,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:23,084 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-02-25 15:10:23,084 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:23,168 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-02-25 15:10:23,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:23,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2019-02-25 15:10:23,193 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:23,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:10:23,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:10:23,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:10:23,195 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 10 states. [2019-02-25 15:10:23,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:23,501 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-02-25 15:10:23,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:10:23,506 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-02-25 15:10:23,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:23,507 INFO L225 Difference]: With dead ends: 39 [2019-02-25 15:10:23,507 INFO L226 Difference]: Without dead ends: 26 [2019-02-25 15:10:23,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:10:23,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-25 15:10:23,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-02-25 15:10:23,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-25 15:10:23,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-02-25 15:10:23,515 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 20 [2019-02-25 15:10:23,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:23,515 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-02-25 15:10:23,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:10:23,516 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-02-25 15:10:23,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-25 15:10:23,516 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:23,516 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2019-02-25 15:10:23,517 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:23,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:23,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1640374485, now seen corresponding path program 8 times [2019-02-25 15:10:23,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:23,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:23,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:23,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:23,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:23,633 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-02-25 15:10:23,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:23,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:23,634 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:23,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:23,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:23,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:23,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:23,647 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:23,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-25 15:10:23,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:23,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:10:23,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:23,697 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:23,698 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:23,716 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:23,716 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-25 15:10:23,816 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-02-25 15:10:23,816 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:23,943 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-02-25 15:10:23,972 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-02-25 15:10:23,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 12 [2019-02-25 15:10:23,972 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:10:23,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:10:23,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:10:23,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:10:23,973 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 4 states. [2019-02-25 15:10:24,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:24,022 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-02-25 15:10:24,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:10:24,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-02-25 15:10:24,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:24,023 INFO L225 Difference]: With dead ends: 26 [2019-02-25 15:10:24,023 INFO L226 Difference]: Without dead ends: 0 [2019-02-25 15:10:24,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:10:24,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-25 15:10:24,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-25 15:10:24,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-25 15:10:24,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-25 15:10:24,025 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-02-25 15:10:24,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:24,025 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-25 15:10:24,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:10:24,025 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-25 15:10:24,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-25 15:10:24,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-25 15:10:24,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:10:24,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:10:24,481 WARN L181 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-02-25 15:10:24,614 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 5 99) no Hoare annotation was computed. [2019-02-25 15:10:24,614 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 76) no Hoare annotation was computed. [2019-02-25 15:10:24,614 INFO L444 ceAbstractionStarter]: At program point L69(lines 69 75) the Hoare annotation is: false [2019-02-25 15:10:24,614 INFO L444 ceAbstractionStarter]: At program point L98(lines 74 98) the Hoare annotation is: (let ((.cse4 (+ ULTIMATE.start_SelectionSort_~lh~4 1))) (let ((.cse0 (exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))) (.cse1 (exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (<= v_ULTIMATE.start_main_~i~7_44 (+ ULTIMATE.start_main_~i~7 1)) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= 0 v_ULTIMATE.start_main_~i~7_44)))) (.cse2 (<= .cse4 ULTIMATE.start_SelectionSort_~i~4)) (.cse3 (= ~n 5))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_SelectionSort_~i~4 .cse4) (<= .cse4 ~n)) (and .cse0 .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n))))) [2019-02-25 15:10:24,615 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 5 99) no Hoare annotation was computed. [2019-02-25 15:10:24,615 INFO L444 ceAbstractionStarter]: At program point L90(lines 46 90) the Hoare annotation is: (let ((.cse0 (exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))) (.cse1 (exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (<= v_ULTIMATE.start_main_~i~7_44 (+ ULTIMATE.start_main_~i~7 1)) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= 0 v_ULTIMATE.start_main_~i~7_44)))) (.cse2 (= ~n 5)) (.cse3 (+ ULTIMATE.start_SelectionSort_~lh~4 1)) (.cse4 (<= ~n ULTIMATE.start_SelectionSort_~i~4))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_SelectionSort_~lh~4 0)) (and .cse0 .cse1 .cse2 (<= .cse3 ~n) .cse4) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_SelectionSort_~i~4 .cse3) .cse4))) [2019-02-25 15:10:24,615 INFO L444 ceAbstractionStarter]: At program point L53(lines 32 53) the Hoare annotation is: (let ((.cse0 (= ~n 5))) (or (and (<= 4 ULTIMATE.start_main_~i~7) .cse0) (and (exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (<= v_ULTIMATE.start_main_~i~7_44 (+ ULTIMATE.start_main_~i~7 1)) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= 0 v_ULTIMATE.start_main_~i~7_44))) .cse0))) [2019-02-25 15:10:24,625 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.02 03:10:24 BoogieIcfgContainer [2019-02-25 15:10:24,626 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-25 15:10:24,626 INFO L168 Benchmark]: Toolchain (without parser) took 6068.46 ms. Allocated memory was 140.5 MB in the beginning and 256.4 MB in the end (delta: 115.9 MB). Free memory was 108.0 MB in the beginning and 145.7 MB in the end (delta: -37.7 MB). Peak memory consumption was 78.2 MB. Max. memory is 7.1 GB. [2019-02-25 15:10:24,628 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 140.5 MB. Free memory is still 109.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-25 15:10:24,628 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.59 ms. Allocated memory is still 140.5 MB. Free memory was 107.8 MB in the beginning and 106.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-02-25 15:10:24,629 INFO L168 Benchmark]: Boogie Preprocessor took 28.92 ms. Allocated memory is still 140.5 MB. Free memory was 106.0 MB in the beginning and 105.1 MB in the end (delta: 969.5 kB). Peak memory consumption was 969.5 kB. Max. memory is 7.1 GB. [2019-02-25 15:10:24,630 INFO L168 Benchmark]: RCFGBuilder took 400.17 ms. Allocated memory is still 140.5 MB. Free memory was 104.9 MB in the beginning and 94.6 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-02-25 15:10:24,631 INFO L168 Benchmark]: TraceAbstraction took 5584.79 ms. Allocated memory was 140.5 MB in the beginning and 256.4 MB in the end (delta: 115.9 MB). Free memory was 94.1 MB in the beginning and 145.7 MB in the end (delta: -51.5 MB). Peak memory consumption was 64.4 MB. Max. memory is 7.1 GB. [2019-02-25 15:10:24,635 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 140.5 MB. Free memory is still 109.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.59 ms. Allocated memory is still 140.5 MB. Free memory was 107.8 MB in the beginning and 106.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.92 ms. Allocated memory is still 140.5 MB. Free memory was 106.0 MB in the beginning and 105.1 MB in the end (delta: 969.5 kB). Peak memory consumption was 969.5 kB. Max. memory is 7.1 GB. * RCFGBuilder took 400.17 ms. Allocated memory is still 140.5 MB. Free memory was 104.9 MB in the beginning and 94.6 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5584.79 ms. Allocated memory was 140.5 MB in the beginning and 256.4 MB in the end (delta: 115.9 MB). Free memory was 94.1 MB in the beginning and 145.7 MB in the end (delta: -51.5 MB). Peak memory consumption was 64.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 76]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((exists v_ULTIMATE.start_main_~i~7_44 : int :: (main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44 && v_ULTIMATE.start_main_~i~7_44 <= 0) && 0 <= v_ULTIMATE.start_main_~i~7_44) && (exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44)) && ~n == 5) && SelectionSort_~lh~4 == 0) || (((((exists v_ULTIMATE.start_main_~i~7_44 : int :: (main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44 && v_ULTIMATE.start_main_~i~7_44 <= 0) && 0 <= v_ULTIMATE.start_main_~i~7_44) && (exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44)) && ~n == 5) && SelectionSort_~lh~4 + 1 <= ~n) && ~n <= SelectionSort_~i~4)) || (((((exists v_ULTIMATE.start_main_~i~7_44 : int :: (main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44 && v_ULTIMATE.start_main_~i~7_44 <= 0) && 0 <= v_ULTIMATE.start_main_~i~7_44) && (exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44)) && ~n == 5) && SelectionSort_~i~4 <= SelectionSort_~lh~4 + 1) && ~n <= SelectionSort_~i~4) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (4 <= main_~i~7 && ~n == 5) || ((exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44) && ~n == 5) - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((((((exists v_ULTIMATE.start_main_~i~7_44 : int :: (main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44 && v_ULTIMATE.start_main_~i~7_44 <= 0) && 0 <= v_ULTIMATE.start_main_~i~7_44) && (exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44)) && SelectionSort_~lh~4 + 1 <= SelectionSort_~i~4) && ~n == 5) && SelectionSort_~i~4 <= SelectionSort_~lh~4 + 1) && SelectionSort_~lh~4 + 1 <= ~n) || (((((exists v_ULTIMATE.start_main_~i~7_44 : int :: (main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44 && v_ULTIMATE.start_main_~i~7_44 <= 0) && 0 <= v_ULTIMATE.start_main_~i~7_44) && (exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44)) && SelectionSort_~lh~4 + 1 <= SelectionSort_~i~4) && ~n == 5) && SelectionSort_~lh~4 + 2 <= ~n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 5.5s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 62 SDtfs, 50 SDslu, 67 SDs, 0 SdLazy, 126 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 158 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 3 AbstIntIterations, 2 AbstIntStrong, -0.7066666666666667 AbsIntWeakeningRatio, 2.4 AbsIntAvgWeakeningVarsNumRemoved, 0.4 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 30 NumberOfFragments, 234 HoareAnnotationTreeSize, 4 FomulaSimplifications, 859 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 312 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 218 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 285 ConstructedInterpolants, 15 QuantifiedInterpolants, 12611 SizeOfPredicates, 15 NumberOfNonLiveVariables, 369 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 415/494 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...