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_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:38:20,862 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:38:20,864 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:38:20,876 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:38:20,876 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:38:20,879 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:38:20,880 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:38:20,885 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:38:20,887 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:38:20,889 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:38:20,890 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:38:20,890 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:38:20,891 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:38:20,896 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:38:20,897 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:38:20,898 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:38:20,900 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:38:20,902 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:38:20,909 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:38:20,911 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:38:20,912 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:38:20,917 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:38:20,922 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:38:20,924 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:38:20,924 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:38:20,925 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:38:20,928 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:38:20,930 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:38:20,932 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:38:20,934 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:38:20,934 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:38:20,935 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:38:20,935 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:38:20,937 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:38:20,938 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:38:20,939 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:38:20,940 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_oct.epf [2019-03-04 16:38:20,958 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:38:20,958 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:38:20,959 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:38:20,959 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:38:20,960 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:38:20,960 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:38:20,960 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:38:20,960 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:38:20,960 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:38:20,960 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:38:20,961 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:38:20,964 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:38:20,964 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:38:20,965 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:38:20,965 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:38:20,965 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:38:20,965 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:38:20,967 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:38:20,967 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:38:20,967 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:38:20,967 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:38:20,967 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:38:20,968 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:38:20,968 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:38:20,968 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:38:20,968 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:38:20,968 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:38:20,969 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:38:20,970 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:38:20,970 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:38:20,971 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:38:20,971 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:38:20,971 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:38:20,971 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:38:20,972 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:38:20,972 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:38:20,972 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:38:20,972 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:38:20,972 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:38:21,009 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:38:21,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:38:21,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:38:21,026 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:38:21,026 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:38:21,027 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-03-04 16:38:21,027 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl' [2019-03-04 16:38:21,068 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:38:21,070 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:38:21,070 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:38:21,071 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:38:21,071 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:38:21,088 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 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,102 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 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:38:21,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:38:21,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:38:21,112 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:38:21,124 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 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,125 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 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,127 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 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,128 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 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,133 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 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,136 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 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,138 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 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:38:21,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:38:21,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:38:21,146 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:38:21,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (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-03-04 16:38:21,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:38:21,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:38:21,513 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-03-04 16:38:21,515 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:38:21,515 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-03-04 16:38:21,518 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:38:21 BoogieIcfgContainer [2019-03-04 16:38:21,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:38:21,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:38:21,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:38:21,523 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:38:21,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/2) ... [2019-03-04 16:38:21,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b851c1 and model type eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:38:21, skipping insertion in model container [2019-03-04 16:38:21,525 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 04.03 04:38:21" (2/2) ... [2019-03-04 16:38:21,527 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05.i_5.bpl [2019-03-04 16:38:21,538 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:38:21,545 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-03-04 16:38:21,563 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-03-04 16:38:21,596 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:38:21,597 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:38:21,597 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:38:21,597 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:38:21,597 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:38:21,597 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:38:21,599 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:38:21,599 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:38:21,613 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-03-04 16:38:21,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:21,619 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:21,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:21,622 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:21,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:21,628 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-03-04 16:38:21,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:21,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:21,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:21,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:21,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:21,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:38:21,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:38:21,803 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:21,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:38:21,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:38:21,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:38:21,849 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-03-04 16:38:21,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:21,915 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2019-03-04 16:38:21,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:38:21,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-03-04 16:38:21,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:21,930 INFO L225 Difference]: With dead ends: 11 [2019-03-04 16:38:21,930 INFO L226 Difference]: Without dead ends: 7 [2019-03-04 16:38:21,933 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-03-04 16:38:21,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-03-04 16:38:21,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-03-04 16:38:21,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-03-04 16:38:21,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-03-04 16:38:21,967 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 4 [2019-03-04 16:38:21,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:21,968 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-03-04 16:38:21,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:38:21,968 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-03-04 16:38:21,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:38:21,969 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:21,969 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:38:21,969 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:21,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:21,970 INFO L82 PathProgramCache]: Analyzing trace with hash 28842881, now seen corresponding path program 1 times [2019-03-04 16:38:21,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:21,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:21,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:21,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:21,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:22,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:22,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:22,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:22,077 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:38:22,079 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [16] [2019-03-04 16:38:22,147 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:22,148 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:22,229 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-03-04 16:38:22,230 INFO L272 AbstractInterpreter]: Visited 4 different actions 14 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:38:22,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:22,236 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-03-04 16:38:22,280 INFO L227 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 33.33% of their original sizes. [2019-03-04 16:38:22,280 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-03-04 16:38:22,323 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-03-04 16:38:22,324 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-03-04 16:38:22,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:38:22,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2019-03-04 16:38:22,325 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:22,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:38:22,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:38:22,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:38:22,328 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 4 states. [2019-03-04 16:38:22,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:22,670 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-03-04 16:38:22,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:38:22,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-03-04 16:38:22,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:22,671 INFO L225 Difference]: With dead ends: 11 [2019-03-04 16:38:22,671 INFO L226 Difference]: Without dead ends: 9 [2019-03-04 16:38:22,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03-04 16:38:22,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-03-04 16:38:22,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-03-04 16:38:22,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-03-04 16:38:22,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-03-04 16:38:22,678 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2019-03-04 16:38:22,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:22,679 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-03-04 16:38:22,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:38:22,679 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-03-04 16:38:22,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:38:22,679 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:22,680 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:38:22,680 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:22,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:22,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1948270601, now seen corresponding path program 1 times [2019-03-04 16:38:22,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:22,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:22,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:22,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:22,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:22,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:38:22,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:22,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:22,725 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:38:22,725 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16], [22] [2019-03-04 16:38:22,727 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:22,727 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:22,739 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-03-04 16:38:22,739 INFO L272 AbstractInterpreter]: Visited 6 different actions 16 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:38:22,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:22,740 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-03-04 16:38:22,758 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 28.89% of their original sizes. [2019-03-04 16:38:22,759 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-03-04 16:38:22,922 INFO L420 sIntCurrentIteration]: We unified 6 AI predicates to 6 [2019-03-04 16:38:22,922 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-03-04 16:38:22,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:38:22,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2019-03-04 16:38:22,923 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:22,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:38:22,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:38:22,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:38:22,924 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 5 states. [2019-03-04 16:38:23,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:23,213 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-03-04 16:38:23,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:38:23,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-03-04 16:38:23,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:23,214 INFO L225 Difference]: With dead ends: 14 [2019-03-04 16:38:23,214 INFO L226 Difference]: Without dead ends: 10 [2019-03-04 16:38:23,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:38:23,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-03-04 16:38:23,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-03-04 16:38:23,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-03-04 16:38:23,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-03-04 16:38:23,220 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 7 [2019-03-04 16:38:23,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:23,221 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-03-04 16:38:23,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:38:23,221 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-03-04 16:38:23,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:38:23,222 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:23,222 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:38:23,222 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:23,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:23,223 INFO L82 PathProgramCache]: Analyzing trace with hash 266915571, now seen corresponding path program 1 times [2019-03-04 16:38:23,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:23,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:23,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:23,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:23,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:23,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:38:23,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:23,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:23,337 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:38:23,338 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16], [22], [24] [2019-03-04 16:38:23,339 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:23,340 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:23,504 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:23,505 INFO L272 AbstractInterpreter]: Visited 8 different actions 50 times. Merged at 4 different actions 21 times. Widened at 4 different actions 9 times. Found 10 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:38:23,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:23,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:23,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:23,507 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-03-04 16:38:23,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:23,524 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:23,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2019-03-04 16:38:23,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:23,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:38:23,578 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:23,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:38:23,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:23,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-03-04 16:38:23,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:23,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:38:23,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:38:23,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:38:23,786 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 4 states. [2019-03-04 16:38:23,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:23,848 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2019-03-04 16:38:23,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:38:23,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-03-04 16:38:23,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:23,850 INFO L225 Difference]: With dead ends: 16 [2019-03-04 16:38:23,850 INFO L226 Difference]: Without dead ends: 10 [2019-03-04 16:38:23,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:38:23,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-03-04 16:38:23,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-03-04 16:38:23,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-03-04 16:38:23,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-03-04 16:38:23,856 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2019-03-04 16:38:23,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:23,856 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-03-04 16:38:23,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:38:23,856 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-03-04 16:38:23,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:38:23,857 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:23,857 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:38:23,857 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:23,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:23,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1192626986, now seen corresponding path program 2 times [2019-03-04 16:38:23,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:23,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:23,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:23,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:23,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:38:23,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:23,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:23,958 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:23,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:23,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:23,958 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-03-04 16:38:23,968 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:38:23,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:38:23,985 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-03-04 16:38:23,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:23,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-03-04 16:38:23,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:23,991 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:38:23,991 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:24,085 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:38:24,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:24,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-03-04 16:38:24,105 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:24,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:38:24,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:38:24,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:38:24,106 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2019-03-04 16:38:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:24,150 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-03-04 16:38:24,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:38:24,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-03-04 16:38:24,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:24,151 INFO L225 Difference]: With dead ends: 17 [2019-03-04 16:38:24,152 INFO L226 Difference]: Without dead ends: 11 [2019-03-04 16:38:24,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:38:24,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-03-04 16:38:24,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-03-04 16:38:24,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-03-04 16:38:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-03-04 16:38:24,158 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2019-03-04 16:38:24,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:24,159 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-03-04 16:38:24,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:38:24,159 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-03-04 16:38:24,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 16:38:24,159 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:24,159 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:38:24,160 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:24,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:24,160 INFO L82 PathProgramCache]: Analyzing trace with hash -175090221, now seen corresponding path program 3 times [2019-03-04 16:38:24,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:24,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:24,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:24,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:24,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:24,339 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:38:24,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:24,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:24,340 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:24,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:24,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:24,341 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-03-04 16:38:24,354 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:38:24,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:38:24,378 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:38:24,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:24,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:38:24,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:38:24,384 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:24,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-03-04 16:38:24,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:24,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2019-03-04 16:38:24,473 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:24,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:38:24,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:38:24,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:38:24,474 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 6 states. [2019-03-04 16:38:24,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:24,516 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-03-04 16:38:24,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:38:24,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-03-04 16:38:24,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:24,517 INFO L225 Difference]: With dead ends: 18 [2019-03-04 16:38:24,517 INFO L226 Difference]: Without dead ends: 12 [2019-03-04 16:38:24,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:38:24,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-03-04 16:38:24,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-03-04 16:38:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-03-04 16:38:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-03-04 16:38:24,523 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2019-03-04 16:38:24,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:24,523 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-03-04 16:38:24,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:38:24,524 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-03-04 16:38:24,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-03-04 16:38:24,524 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:24,524 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:38:24,525 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:24,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:24,525 INFO L82 PathProgramCache]: Analyzing trace with hash 375349322, now seen corresponding path program 4 times [2019-03-04 16:38:24,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:24,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:24,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:24,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:24,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:24,702 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:38:24,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:24,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:24,703 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:24,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:24,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:24,703 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-03-04 16:38:24,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:24,714 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:24,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:38:24,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:24,741 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:38:24,741 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:38:24,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:24,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2019-03-04 16:38:24,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:24,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:38:24,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:38:24,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:38:24,816 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-03-04 16:38:24,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:24,888 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-03-04 16:38:24,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:38:24,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-03-04 16:38:24,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:24,890 INFO L225 Difference]: With dead ends: 19 [2019-03-04 16:38:24,890 INFO L226 Difference]: Without dead ends: 13 [2019-03-04 16:38:24,890 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-03-04 16:38:24,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-03-04 16:38:24,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-03-04 16:38:24,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-03-04 16:38:24,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-03-04 16:38:24,897 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2019-03-04 16:38:24,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:24,898 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-03-04 16:38:24,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:38:24,898 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-03-04 16:38:24,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-03-04 16:38:24,899 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:24,899 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:38:24,899 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:24,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:24,899 INFO L82 PathProgramCache]: Analyzing trace with hash 259105971, now seen corresponding path program 5 times [2019-03-04 16:38:24,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:24,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:24,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:24,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:24,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:25,084 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-03-04 16:38:25,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:25,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:25,085 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:25,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:25,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:25,086 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-03-04 16:38:25,114 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:38:25,115 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:38:25,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-03-04 16:38:25,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:25,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-03-04 16:38:25,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:25,552 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-03-04 16:38:25,552 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-03-04 16:38:25,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:25,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2019-03-04 16:38:25,604 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:25,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:25,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:25,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:38:25,605 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 8 states. [2019-03-04 16:38:25,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:25,804 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2019-03-04 16:38:25,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:38:25,804 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-03-04 16:38:25,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:25,805 INFO L225 Difference]: With dead ends: 21 [2019-03-04 16:38:25,805 INFO L226 Difference]: Without dead ends: 19 [2019-03-04 16:38:25,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:38:25,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-03-04 16:38:25,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-03-04 16:38:25,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-03-04 16:38:25,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-03-04 16:38:25,813 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2019-03-04 16:38:25,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:25,814 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-03-04 16:38:25,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:25,814 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-03-04 16:38:25,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-03-04 16:38:25,815 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:25,815 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2019-03-04 16:38:25,815 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:25,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:25,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1746247989, now seen corresponding path program 6 times [2019-03-04 16:38:25,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:25,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:25,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:25,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:25,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:25,896 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-03-04 16:38:25,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:38:25,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-03-04 16:38:25,897 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:25,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:38:25,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:38:25,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:38:25,899 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 4 states. [2019-03-04 16:38:25,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:25,946 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-03-04 16:38:25,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:38:25,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-03-04 16:38:25,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:25,948 INFO L225 Difference]: With dead ends: 29 [2019-03-04 16:38:25,948 INFO L226 Difference]: Without dead ends: 21 [2019-03-04 16:38:25,948 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-03-04 16:38:25,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-03-04 16:38:25,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-03-04 16:38:25,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-03-04 16:38:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-03-04 16:38:25,966 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2019-03-04 16:38:25,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:25,966 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-03-04 16:38:25,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:38:25,967 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-03-04 16:38:25,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-03-04 16:38:25,968 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:25,968 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1] [2019-03-04 16:38:25,968 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:25,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:25,968 INFO L82 PathProgramCache]: Analyzing trace with hash 406829563, now seen corresponding path program 7 times [2019-03-04 16:38:25,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:25,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:25,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:25,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:25,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:26,118 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-03-04 16:38:26,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:26,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:26,119 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:26,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:26,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:26,120 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-03-04 16:38:26,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:26,129 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:26,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:38:26,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:26,220 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-03-04 16:38:26,220 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:26,313 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-03-04 16:38:26,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:26,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2019-03-04 16:38:26,338 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:26,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:38:26,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:38:26,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:38:26,339 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 10 states. [2019-03-04 16:38:26,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:26,621 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-03-04 16:38:26,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:38:26,621 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-03-04 16:38:26,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:26,622 INFO L225 Difference]: With dead ends: 39 [2019-03-04 16:38:26,622 INFO L226 Difference]: Without dead ends: 26 [2019-03-04 16:38:26,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:38:26,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-03-04 16:38:26,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-03-04 16:38:26,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-03-04 16:38:26,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-03-04 16:38:26,634 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 20 [2019-03-04 16:38:26,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:26,634 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-03-04 16:38:26,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:38:26,634 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-03-04 16:38:26,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-03-04 16:38:26,635 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:26,635 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2019-03-04 16:38:26,635 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:26,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:26,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1640374485, now seen corresponding path program 8 times [2019-03-04 16:38:26,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:26,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:26,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:26,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:26,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:26,893 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-03-04 16:38:26,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:26,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:26,894 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:26,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:26,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:26,894 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-03-04 16:38:26,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:38:26,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:38:26,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-03-04 16:38:26,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:26,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:38:26,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:26,966 INFO L453 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-03-04 16:38:26,966 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:26,982 INFO L309 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-03-04 16:38:26,982 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-03-04 16:38:27,123 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-03-04 16:38:27,124 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:27,169 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-03-04 16:38:27,202 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:38:27,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 12 [2019-03-04 16:38:27,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:27,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:38:27,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:38:27,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:38:27,205 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 4 states. [2019-03-04 16:38:27,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:27,305 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-03-04 16:38:27,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:38:27,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-03-04 16:38:27,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:27,306 INFO L225 Difference]: With dead ends: 26 [2019-03-04 16:38:27,306 INFO L226 Difference]: Without dead ends: 0 [2019-03-04 16:38:27,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:38:27,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-03-04 16:38:27,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-03-04 16:38:27,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-03-04 16:38:27,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-03-04 16:38:27,307 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-03-04 16:38:27,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:27,308 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-03-04 16:38:27,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:38:27,308 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-03-04 16:38:27,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-03-04 16:38:27,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-03-04 16:38:27,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:38:27,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:38:27,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:38:27,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:38:28,045 WARN L181 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 40 [2019-03-04 16:38:28,416 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 35 [2019-03-04 16:38:28,419 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 5 99) no Hoare annotation was computed. [2019-03-04 16:38:28,419 INFO L444 ceAbstractionStarter]: At program point L69(lines 69 75) the Hoare annotation is: false [2019-03-04 16:38:28,419 INFO L444 ceAbstractionStarter]: At program point L98(lines 74 98) the Hoare annotation is: (let ((.cse6 (+ ULTIMATE.start_SelectionSort_~lh~4 1))) (let ((.cse0 (<= .cse6 ULTIMATE.start_SelectionSort_~i~4)) (.cse1 (<= 5 ~n)) (.cse2 (<= (* 2 ~n) 10)) (.cse3 (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)))) (.cse4 (<= ~n (+ ULTIMATE.start_main_~i~7 6))) (.cse5 (<= (* 2 ULTIMATE.start_main_~i~7) 8))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)) (and .cse0 (<= ULTIMATE.start_SelectionSort_~i~4 .cse6) .cse1 .cse2 .cse3 .cse4 (<= .cse6 ~n) .cse5)))) [2019-03-04 16:38:28,420 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 5 99) no Hoare annotation was computed. [2019-03-04 16:38:28,420 INFO L444 ceAbstractionStarter]: At program point L90(lines 46 90) the Hoare annotation is: (let ((.cse4 (<= 5 ~n)) (.cse5 (<= ~n ULTIMATE.start_SelectionSort_~i~4)) (.cse6 (<= (* 2 ~n) 10)) (.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 (<= ~n (+ ULTIMATE.start_main_~i~7 6))) (.cse3 (+ ULTIMATE.start_SelectionSort_~lh~4 1)) (.cse2 (<= (* 2 ULTIMATE.start_main_~i~7) 8))) (or (and (<= (+ ULTIMATE.start_SelectionSort_~lh~4 5) ~n) .cse0 .cse1 (<= 0 (* 2 ULTIMATE.start_SelectionSort_~lh~4)) (<= (+ ULTIMATE.start_SelectionSort_~lh~4 ~n) 5) .cse2) (and (<= ULTIMATE.start_SelectionSort_~i~4 .cse3) .cse4 .cse5 .cse6 .cse0 .cse1 .cse2) (and .cse4 .cse5 .cse6 .cse0 .cse1 (<= .cse3 ~n) .cse2))) [2019-03-04 16:38:28,420 INFO L444 ceAbstractionStarter]: At program point L53(lines 32 53) the Hoare annotation is: (let ((.cse0 (<= 5 ~n))) (or (and (<= (* 2 ~n) 10) (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))) (<= (* 2 ULTIMATE.start_main_~i~7) 8) .cse0) (and (<= 4 ULTIMATE.start_main_~i~7) (<= (+ ULTIMATE.start_main_~i~7 ~n) 9) .cse0))) [2019-03-04 16:38:28,420 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 76) no Hoare annotation was computed. [2019-03-04 16:38:28,431 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 04:38:28 BoogieIcfgContainer [2019-03-04 16:38:28,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-03-04 16:38:28,432 INFO L168 Benchmark]: Toolchain (without parser) took 7363.77 ms. Allocated memory was 140.0 MB in the beginning and 260.0 MB in the end (delta: 120.1 MB). Free memory was 107.5 MB in the beginning and 228.4 MB in the end (delta: -120.9 MB). Peak memory consumption was 134.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:38:28,434 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 140.0 MB. Free memory is still 108.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:38:28,434 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.04 ms. Allocated memory is still 140.0 MB. Free memory was 107.3 MB in the beginning and 105.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-03-04 16:38:28,435 INFO L168 Benchmark]: Boogie Preprocessor took 27.65 ms. Allocated memory is still 140.0 MB. Free memory was 105.6 MB in the beginning and 104.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-03-04 16:38:28,436 INFO L168 Benchmark]: RCFGBuilder took 373.02 ms. Allocated memory is still 140.0 MB. Free memory was 104.4 MB in the beginning and 94.2 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:38:28,437 INFO L168 Benchmark]: TraceAbstraction took 6912.13 ms. Allocated memory was 140.0 MB in the beginning and 260.0 MB in the end (delta: 120.1 MB). Free memory was 93.7 MB in the beginning and 228.4 MB in the end (delta: -134.7 MB). Peak memory consumption was 120.5 MB. Max. memory is 7.1 GB. [2019-03-04 16:38:28,442 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.0 MB. Free memory is still 108.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.04 ms. Allocated memory is still 140.0 MB. Free memory was 107.3 MB in the beginning and 105.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.65 ms. Allocated memory is still 140.0 MB. Free memory was 105.6 MB in the beginning and 104.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 373.02 ms. Allocated memory is still 140.0 MB. Free memory was 104.4 MB in the beginning and 94.2 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6912.13 ms. Allocated memory was 140.0 MB in the beginning and 260.0 MB in the end (delta: 120.1 MB). Free memory was 93.7 MB in the beginning and 228.4 MB in the end (delta: -134.7 MB). Peak memory consumption was 120.5 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: ((((((SelectionSort_~lh~4 + 5 <= ~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)) && ~n <= main_~i~7 + 6) && 0 <= 2 * SelectionSort_~lh~4) && SelectionSort_~lh~4 + ~n <= 5) && 2 * main_~i~7 <= 8) || ((((((SelectionSort_~i~4 <= SelectionSort_~lh~4 + 1 && 5 <= ~n) && ~n <= SelectionSort_~i~4) && 2 * ~n <= 10) && (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)) && ~n <= main_~i~7 + 6) && 2 * main_~i~7 <= 8)) || ((((((5 <= ~n && ~n <= SelectionSort_~i~4) && 2 * ~n <= 10) && (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)) && ~n <= main_~i~7 + 6) && SelectionSort_~lh~4 + 1 <= ~n) && 2 * main_~i~7 <= 8) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((2 * ~n <= 10 && (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)) && 2 * main_~i~7 <= 8) && 5 <= ~n) || ((4 <= main_~i~7 && main_~i~7 + ~n <= 9) && 5 <= ~n) - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((((((SelectionSort_~lh~4 + 1 <= SelectionSort_~i~4 && 5 <= ~n) && 2 * ~n <= 10) && (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)) && ~n <= main_~i~7 + 6) && 2 * main_~i~7 <= 8) && SelectionSort_~lh~4 + 2 <= ~n) || (((((((SelectionSort_~lh~4 + 1 <= SelectionSort_~i~4 && SelectionSort_~i~4 <= SelectionSort_~lh~4 + 1) && 5 <= ~n) && 2 * ~n <= 10) && (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)) && ~n <= main_~i~7 + 6) && SelectionSort_~lh~4 + 1 <= ~n) && 2 * main_~i~7 <= 8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 6.8s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 58 SDtfs, 46 SDslu, 79 SDs, 0 SdLazy, 142 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 239 GetRequests, 158 SyntacticMatches, 10 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 2.5s 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.3s AbstIntTime, 3 AbstIntIterations, 2 AbstIntStrong, 0.8588235294117647 AbsIntWeakeningRatio, 2.4 AbsIntAvgWeakeningVarsNumRemoved, 4.8 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 30 NumberOfFragments, 253 HoareAnnotationTreeSize, 4 FomulaSimplifications, 4608 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 905 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s 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...