java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:10:34,083 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:10:34,085 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:10:34,097 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:10:34,098 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:10:34,099 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:10:34,100 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:10:34,102 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:10:34,104 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:10:34,105 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:10:34,107 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:10:34,107 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:10:34,108 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:10:34,109 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:10:34,110 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:10:34,111 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:10:34,112 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:10:34,114 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:10:34,116 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:10:34,118 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:10:34,119 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:10:34,121 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:10:34,123 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:10:34,123 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:10:34,124 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:10:34,125 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:10:34,126 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:10:34,127 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:10:34,128 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:10:34,129 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:10:34,129 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:10:34,130 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:10:34,130 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:10:34,131 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:10:34,132 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:10:34,133 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:10:34,133 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-25 15:10:34,146 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:10:34,147 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:10:34,148 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:10:34,148 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:10:34,148 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:10:34,148 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:10:34,149 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:10:34,149 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:10:34,149 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-25 15:10:34,149 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:10:34,149 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-25 15:10:34,149 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-25 15:10:34,150 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:10:34,150 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:10:34,151 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:10:34,151 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:10:34,151 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:10:34,151 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:10:34,152 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:10:34,152 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:10:34,152 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:10:34,152 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:10:34,152 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:10:34,153 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:10:34,153 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:10:34,153 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:10:34,153 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:10:34,153 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:10:34,153 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:10:34,154 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:10:34,154 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:10:34,154 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:10:34,154 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:10:34,154 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:10:34,155 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:10:34,155 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:10:34,155 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:10:34,155 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:10:34,155 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:10:34,156 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:10:34,187 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:10:34,199 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:10:34,203 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:10:34,205 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:10:34,205 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:10:34,206 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl [2019-02-25 15:10:34,207 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl' [2019-02-25 15:10:34,247 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:10:34,249 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:10:34,250 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:10:34,250 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:10:34,250 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:10:34,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:34" (1/1) ... [2019-02-25 15:10:34,280 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:34" (1/1) ... [2019-02-25 15:10:34,288 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-25 15:10:34,289 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-25 15:10:34,289 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-25 15:10:34,305 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:10:34,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:10:34,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:10:34,306 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:10:34,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:34" (1/1) ... [2019-02-25 15:10:34,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:34" (1/1) ... [2019-02-25 15:10:34,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:34" (1/1) ... [2019-02-25 15:10:34,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:34" (1/1) ... [2019-02-25 15:10:34,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:34" (1/1) ... [2019-02-25 15:10:34,327 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:34" (1/1) ... [2019-02-25 15:10:34,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:34" (1/1) ... [2019-02-25 15:10:34,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:10:34,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:10:34,330 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:10:34,330 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:10:34,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:10:34,411 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-25 15:10:34,412 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-25 15:10:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-02-25 15:10:34,641 INFO L278 CfgBuilder]: Using library mode [2019-02-25 15:10:34,641 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-02-25 15:10:34,643 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:10:34 BoogieIcfgContainer [2019-02-25 15:10:34,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:10:34,644 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:10:34,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:10:34,651 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:10:34,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:34" (1/2) ... [2019-02-25 15:10:34,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec6326c and model type PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:10:34, skipping insertion in model container [2019-02-25 15:10:34,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:10:34" (2/2) ... [2019-02-25 15:10:34,659 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified02.bpl [2019-02-25 15:10:34,683 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:10:34,698 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-25 15:10:34,721 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-25 15:10:34,781 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:10:34,781 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:10:34,782 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:10:34,782 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:10:34,782 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:10:34,782 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:10:34,783 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:10:34,783 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:10:34,811 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-02-25 15:10:34,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:10:34,828 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:34,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:10:34,835 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:34,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:34,848 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-02-25 15:10:34,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:34,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:34,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:34,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:34,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:35,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:35,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:10:35,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:10:35,054 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:10:35,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:10:35,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:10:35,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:10:35,071 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-02-25 15:10:35,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:35,141 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-02-25 15:10:35,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:10:35,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-25 15:10:35,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:35,154 INFO L225 Difference]: With dead ends: 17 [2019-02-25 15:10:35,154 INFO L226 Difference]: Without dead ends: 10 [2019-02-25 15:10:35,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:10:35,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-25 15:10:35,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-02-25 15:10:35,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-25 15:10:35,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-02-25 15:10:35,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2019-02-25 15:10:35,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:35,196 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-02-25 15:10:35,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:10:35,196 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-02-25 15:10:35,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:10:35,197 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:35,197 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-02-25 15:10:35,197 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:35,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:35,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times [2019-02-25 15:10:35,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:35,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:35,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:35,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:35,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:35,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:35,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:35,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:35,315 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-25 15:10:35,317 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [8], [9], [13] [2019-02-25 15:10:35,356 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:10:35,357 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:10:35,496 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:10:35,498 INFO L272 AbstractInterpreter]: Visited 6 different actions 16 times. Merged at 5 different actions 10 times. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:10:35,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:35,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:10:35,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:35,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:35,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:35,533 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:35,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:10:35,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:35,618 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:35,619 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:35,651 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:35,652 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:35,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:35,731 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:35,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:35,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:35,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:10:35,836 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:35,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:10:35,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:10:35,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:10:35,838 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2019-02-25 15:10:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:36,021 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-02-25 15:10:36,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:10:36,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-02-25 15:10:36,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:36,023 INFO L225 Difference]: With dead ends: 15 [2019-02-25 15:10:36,023 INFO L226 Difference]: Without dead ends: 14 [2019-02-25 15:10:36,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:10:36,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-25 15:10:36,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-02-25 15:10:36,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-25 15:10:36,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-02-25 15:10:36,028 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2019-02-25 15:10:36,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:36,028 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-02-25 15:10:36,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:10:36,029 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-02-25 15:10:36,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-25 15:10:36,029 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:36,029 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2019-02-25 15:10:36,030 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:36,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:36,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times [2019-02-25 15:10:36,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:36,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:36,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:36,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:36,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:36,379 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:36,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:36,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:36,380 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:36,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:36,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:36,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:36,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:36,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:36,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:10:36,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:36,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:10:36,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:36,452 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:36,452 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:36,510 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:36,511 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:36,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:36,599 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:36,721 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:36,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:36,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:10:36,741 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:36,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:10:36,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:10:36,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:10:36,743 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2019-02-25 15:10:36,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:36,875 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-02-25 15:10:36,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:10:36,876 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-02-25 15:10:36,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:36,877 INFO L225 Difference]: With dead ends: 19 [2019-02-25 15:10:36,878 INFO L226 Difference]: Without dead ends: 18 [2019-02-25 15:10:36,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:10:36,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-02-25 15:10:36,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-02-25 15:10:36,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-25 15:10:36,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-02-25 15:10:36,883 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2019-02-25 15:10:36,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:36,884 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-02-25 15:10:36,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:10:36,884 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-02-25 15:10:36,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-25 15:10:36,885 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:36,885 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2019-02-25 15:10:36,886 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:36,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:36,886 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times [2019-02-25 15:10:36,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:36,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:36,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:36,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:36,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:37,072 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:37,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:37,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:37,073 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:37,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:37,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:37,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:37,090 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:37,090 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:37,102 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:37,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:37,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:10:37,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:37,110 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:37,111 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:37,126 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:37,126 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:37,189 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:37,190 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:37,291 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:37,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:37,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:10:37,311 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:37,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:10:37,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:10:37,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:10:37,313 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-02-25 15:10:37,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:37,658 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-02-25 15:10:37,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:10:37,659 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-02-25 15:10:37,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:37,660 INFO L225 Difference]: With dead ends: 23 [2019-02-25 15:10:37,661 INFO L226 Difference]: Without dead ends: 22 [2019-02-25 15:10:37,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:10:37,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-02-25 15:10:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-02-25 15:10:37,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-25 15:10:37,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-02-25 15:10:37,665 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2019-02-25 15:10:37,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:37,666 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-02-25 15:10:37,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:10:37,666 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-02-25 15:10:37,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-25 15:10:37,667 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:37,667 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2019-02-25 15:10:37,667 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:37,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:37,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times [2019-02-25 15:10:37,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:37,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:37,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:37,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:37,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:37,811 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:37,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:37,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:37,812 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:37,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:37,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:37,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:37,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:37,821 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:37,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-25 15:10:37,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:37,859 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:37,859 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:37,890 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:37,890 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:38,029 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:38,030 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:38,127 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:38,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:38,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:10:38,146 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:38,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:10:38,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:10:38,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:10:38,147 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-02-25 15:10:38,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:38,212 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-02-25 15:10:38,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:10:38,218 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-02-25 15:10:38,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:38,219 INFO L225 Difference]: With dead ends: 27 [2019-02-25 15:10:38,219 INFO L226 Difference]: Without dead ends: 26 [2019-02-25 15:10:38,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:10:38,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-25 15:10:38,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-02-25 15:10:38,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-25 15:10:38,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-02-25 15:10:38,224 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2019-02-25 15:10:38,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:38,224 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-02-25 15:10:38,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:10:38,225 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-02-25 15:10:38,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-25 15:10:38,226 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:38,226 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2019-02-25 15:10:38,226 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:38,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:38,227 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times [2019-02-25 15:10:38,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:38,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:38,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:38,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:38,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:38,428 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:38,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:38,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:38,429 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:38,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:38,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:38,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:38,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:38,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:38,460 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-25 15:10:38,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:38,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 25 conjunts are in the unsatisfiable core [2019-02-25 15:10:38,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:38,469 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:38,470 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:38,492 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:38,493 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:38,673 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:38,673 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:38,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:38,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-25 15:10:38,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:38,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-25 15:10:38,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-25 15:10:38,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:10:38,827 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2019-02-25 15:10:38,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:38,880 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-02-25 15:10:38,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:10:38,880 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-02-25 15:10:38,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:38,881 INFO L225 Difference]: With dead ends: 31 [2019-02-25 15:10:38,881 INFO L226 Difference]: Without dead ends: 30 [2019-02-25 15:10:38,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:10:38,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-02-25 15:10:38,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-02-25 15:10:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-25 15:10:38,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-02-25 15:10:38,886 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2019-02-25 15:10:38,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:38,887 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-02-25 15:10:38,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-25 15:10:38,887 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-02-25 15:10:38,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-25 15:10:38,888 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:38,888 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2019-02-25 15:10:38,888 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:38,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:38,888 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times [2019-02-25 15:10:38,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:38,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:38,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:38,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:38,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:39,002 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:39,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:39,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:39,003 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:39,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:39,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:39,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:39,013 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:39,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:39,036 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:39,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:39,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 28 conjunts are in the unsatisfiable core [2019-02-25 15:10:39,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:39,044 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:39,044 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:39,055 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:39,056 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:39,205 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:39,205 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:39,307 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:39,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:39,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-02-25 15:10:39,335 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:39,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-25 15:10:39,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-25 15:10:39,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-02-25 15:10:39,337 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2019-02-25 15:10:39,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:39,447 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-02-25 15:10:39,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:10:39,448 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-02-25 15:10:39,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:39,449 INFO L225 Difference]: With dead ends: 35 [2019-02-25 15:10:39,450 INFO L226 Difference]: Without dead ends: 34 [2019-02-25 15:10:39,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-02-25 15:10:39,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-02-25 15:10:39,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-02-25 15:10:39,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-25 15:10:39,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-02-25 15:10:39,455 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2019-02-25 15:10:39,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:39,455 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-02-25 15:10:39,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-25 15:10:39,456 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-02-25 15:10:39,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-25 15:10:39,458 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:39,458 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2019-02-25 15:10:39,458 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:39,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:39,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times [2019-02-25 15:10:39,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:39,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:39,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:39,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:39,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:39,680 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:39,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:39,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:39,680 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:39,681 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:39,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:39,681 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:39,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:39,690 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:39,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 31 conjunts are in the unsatisfiable core [2019-02-25 15:10:39,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:39,708 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:39,709 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:39,719 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:39,720 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:39,877 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:39,878 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:40,129 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:40,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:40,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-02-25 15:10:40,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:40,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-25 15:10:40,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-25 15:10:40,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-02-25 15:10:40,149 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2019-02-25 15:10:40,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:40,346 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-02-25 15:10:40,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:10:40,348 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-02-25 15:10:40,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:40,349 INFO L225 Difference]: With dead ends: 39 [2019-02-25 15:10:40,349 INFO L226 Difference]: Without dead ends: 38 [2019-02-25 15:10:40,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-02-25 15:10:40,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-25 15:10:40,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-02-25 15:10:40,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-25 15:10:40,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-02-25 15:10:40,355 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2019-02-25 15:10:40,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:40,355 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-02-25 15:10:40,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-25 15:10:40,356 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-02-25 15:10:40,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-25 15:10:40,356 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:40,357 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2019-02-25 15:10:40,357 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:40,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:40,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times [2019-02-25 15:10:40,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:40,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:40,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:40,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:40,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:40,502 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:40,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:40,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:40,503 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:40,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:40,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:40,503 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:40,513 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:40,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:40,534 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-25 15:10:40,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:40,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-25 15:10:40,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:40,546 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:40,547 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:40,562 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:40,563 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:41,086 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:41,087 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:41,371 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:41,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:41,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-02-25 15:10:41,392 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:41,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-25 15:10:41,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-25 15:10:41,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-02-25 15:10:41,393 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2019-02-25 15:10:41,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:41,506 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-02-25 15:10:41,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:10:41,507 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-02-25 15:10:41,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:41,508 INFO L225 Difference]: With dead ends: 43 [2019-02-25 15:10:41,508 INFO L226 Difference]: Without dead ends: 42 [2019-02-25 15:10:41,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-02-25 15:10:41,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-02-25 15:10:41,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-02-25 15:10:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-25 15:10:41,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-02-25 15:10:41,515 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2019-02-25 15:10:41,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:41,516 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-02-25 15:10:41,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-25 15:10:41,516 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-02-25 15:10:41,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-25 15:10:41,517 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:41,517 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2019-02-25 15:10:41,517 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:41,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:41,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times [2019-02-25 15:10:41,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:41,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:41,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:41,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:41,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:41,787 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:41,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:41,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:41,787 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:41,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:41,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:41,788 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:41,796 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:41,796 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:41,825 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:41,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:41,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 37 conjunts are in the unsatisfiable core [2019-02-25 15:10:41,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:41,832 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:41,833 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:41,842 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:41,843 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:41,997 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:41,998 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:42,387 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:42,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:42,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-02-25 15:10:42,406 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:42,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-25 15:10:42,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-25 15:10:42,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-02-25 15:10:42,408 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2019-02-25 15:10:42,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:42,486 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-02-25 15:10:42,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-25 15:10:42,487 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-02-25 15:10:42,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:42,488 INFO L225 Difference]: With dead ends: 47 [2019-02-25 15:10:42,488 INFO L226 Difference]: Without dead ends: 46 [2019-02-25 15:10:42,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-02-25 15:10:42,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-02-25 15:10:42,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-02-25 15:10:42,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-25 15:10:42,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-02-25 15:10:42,495 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2019-02-25 15:10:42,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:42,496 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-02-25 15:10:42,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-25 15:10:42,496 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-02-25 15:10:42,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-25 15:10:42,497 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:42,497 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2019-02-25 15:10:42,497 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:42,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:42,497 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times [2019-02-25 15:10:42,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:42,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:42,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:42,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:42,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:42,863 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:42,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:42,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:42,864 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:42,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:42,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:42,864 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:42,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:42,873 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:42,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 40 conjunts are in the unsatisfiable core [2019-02-25 15:10:42,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:42,915 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:42,916 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:42,960 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:42,961 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:43,193 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:43,193 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:43,387 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:43,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:43,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-02-25 15:10:43,406 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:43,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-25 15:10:43,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-25 15:10:43,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-02-25 15:10:43,407 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2019-02-25 15:10:43,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:43,507 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-02-25 15:10:43,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-25 15:10:43,508 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-02-25 15:10:43,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:43,509 INFO L225 Difference]: With dead ends: 51 [2019-02-25 15:10:43,509 INFO L226 Difference]: Without dead ends: 50 [2019-02-25 15:10:43,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-02-25 15:10:43,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-25 15:10:43,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-02-25 15:10:43,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-25 15:10:43,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-02-25 15:10:43,516 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2019-02-25 15:10:43,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:43,516 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-02-25 15:10:43,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-25 15:10:43,516 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-02-25 15:10:43,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-25 15:10:43,518 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:43,518 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2019-02-25 15:10:43,518 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:43,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:43,519 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times [2019-02-25 15:10:43,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:43,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:43,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:43,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:43,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:43,744 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:43,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:43,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:43,745 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:43,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:43,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:43,745 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:43,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:43,754 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:43,793 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-02-25 15:10:43,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:43,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 43 conjunts are in the unsatisfiable core [2019-02-25 15:10:43,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:43,800 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:43,801 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:43,809 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:43,810 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:44,066 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:44,067 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:44,289 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:44,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:44,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-02-25 15:10:44,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:44,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-25 15:10:44,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-25 15:10:44,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:10:44,311 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2019-02-25 15:10:44,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:44,414 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-02-25 15:10:44,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-25 15:10:44,415 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-02-25 15:10:44,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:44,416 INFO L225 Difference]: With dead ends: 55 [2019-02-25 15:10:44,416 INFO L226 Difference]: Without dead ends: 54 [2019-02-25 15:10:44,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:10:44,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-25 15:10:44,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-02-25 15:10:44,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-25 15:10:44,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-02-25 15:10:44,422 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2019-02-25 15:10:44,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:44,422 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-02-25 15:10:44,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-25 15:10:44,423 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-02-25 15:10:44,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-25 15:10:44,423 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:44,424 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2019-02-25 15:10:44,424 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:44,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:44,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times [2019-02-25 15:10:44,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:44,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:44,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:44,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:44,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:44,903 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:44,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:44,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:44,904 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:44,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:44,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:44,904 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:44,912 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:44,913 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:44,929 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:44,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:44,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 46 conjunts are in the unsatisfiable core [2019-02-25 15:10:44,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:44,938 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:44,939 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:44,950 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:44,951 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:45,169 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:45,169 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:45,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:45,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-02-25 15:10:45,492 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:45,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-25 15:10:45,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-25 15:10:45,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-02-25 15:10:45,494 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2019-02-25 15:10:45,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:45,590 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-02-25 15:10:45,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-25 15:10:45,590 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2019-02-25 15:10:45,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:45,591 INFO L225 Difference]: With dead ends: 59 [2019-02-25 15:10:45,592 INFO L226 Difference]: Without dead ends: 58 [2019-02-25 15:10:45,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-02-25 15:10:45,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-25 15:10:45,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-02-25 15:10:45,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-25 15:10:45,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-02-25 15:10:45,599 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2019-02-25 15:10:45,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:45,599 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-02-25 15:10:45,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-25 15:10:45,599 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-02-25 15:10:45,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-25 15:10:45,600 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:45,600 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2019-02-25 15:10:45,600 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:45,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:45,601 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times [2019-02-25 15:10:45,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:45,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:45,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:45,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:45,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:46,090 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:46,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:46,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:46,091 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:46,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:46,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:46,091 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:46,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:46,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:46,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 49 conjunts are in the unsatisfiable core [2019-02-25 15:10:46,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:46,130 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:46,130 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:46,134 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:46,134 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:46,376 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:46,377 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:47,268 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:47,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:47,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-02-25 15:10:47,287 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:47,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-25 15:10:47,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-25 15:10:47,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-02-25 15:10:47,289 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2019-02-25 15:10:47,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:47,506 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-02-25 15:10:47,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-25 15:10:47,507 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2019-02-25 15:10:47,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:47,508 INFO L225 Difference]: With dead ends: 63 [2019-02-25 15:10:47,508 INFO L226 Difference]: Without dead ends: 62 [2019-02-25 15:10:47,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-02-25 15:10:47,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-02-25 15:10:47,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-02-25 15:10:47,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-25 15:10:47,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-02-25 15:10:47,515 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2019-02-25 15:10:47,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:47,516 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-02-25 15:10:47,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-25 15:10:47,516 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-02-25 15:10:47,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-25 15:10:47,517 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:47,517 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2019-02-25 15:10:47,517 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:47,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:47,518 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times [2019-02-25 15:10:47,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:47,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:47,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:47,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:47,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:47,874 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:47,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:47,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:47,875 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:47,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:47,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:47,875 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:47,883 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:47,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:47,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-25 15:10:47,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:47,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 52 conjunts are in the unsatisfiable core [2019-02-25 15:10:47,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:47,939 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:47,940 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:47,955 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:47,956 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:48,960 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:48,960 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:49,284 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:49,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:49,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-02-25 15:10:49,304 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:49,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-25 15:10:49,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-25 15:10:49,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-02-25 15:10:49,306 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2019-02-25 15:10:49,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:49,557 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-02-25 15:10:49,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-25 15:10:49,558 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2019-02-25 15:10:49,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:49,559 INFO L225 Difference]: With dead ends: 67 [2019-02-25 15:10:49,559 INFO L226 Difference]: Without dead ends: 66 [2019-02-25 15:10:49,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-02-25 15:10:49,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-02-25 15:10:49,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-02-25 15:10:49,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-25 15:10:49,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-02-25 15:10:49,568 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2019-02-25 15:10:49,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:49,568 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-02-25 15:10:49,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-25 15:10:49,568 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-02-25 15:10:49,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-25 15:10:49,569 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:49,569 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2019-02-25 15:10:49,570 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:49,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:49,570 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times [2019-02-25 15:10:49,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:49,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:49,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:49,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:49,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:50,305 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:50,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:50,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:50,306 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:50,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:50,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:50,306 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:50,314 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:50,315 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:50,339 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:50,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:50,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 55 conjunts are in the unsatisfiable core [2019-02-25 15:10:50,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:50,355 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:50,356 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:50,361 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:50,362 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:50,589 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:51,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:51,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-02-25 15:10:51,269 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:51,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-25 15:10:51,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-25 15:10:51,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:10:51,270 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2019-02-25 15:10:51,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:51,388 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-02-25 15:10:51,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-25 15:10:51,388 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2019-02-25 15:10:51,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:51,389 INFO L225 Difference]: With dead ends: 71 [2019-02-25 15:10:51,389 INFO L226 Difference]: Without dead ends: 70 [2019-02-25 15:10:51,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:10:51,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-25 15:10:51,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-02-25 15:10:51,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-25 15:10:51,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-02-25 15:10:51,395 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2019-02-25 15:10:51,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:51,396 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-02-25 15:10:51,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-25 15:10:51,396 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-02-25 15:10:51,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-25 15:10:51,397 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:51,397 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2019-02-25 15:10:51,397 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:51,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:51,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times [2019-02-25 15:10:51,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:51,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:51,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:51,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:51,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:51,695 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:51,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:51,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:51,696 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:51,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:51,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:51,696 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:51,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:51,707 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:51,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 58 conjunts are in the unsatisfiable core [2019-02-25 15:10:51,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:51,753 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:51,754 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:51,760 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:51,761 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:52,542 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:52,543 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:53,923 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:53,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:53,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-02-25 15:10:53,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:53,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-25 15:10:53,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-25 15:10:53,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-02-25 15:10:53,943 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2019-02-25 15:10:54,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:54,064 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-02-25 15:10:54,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-25 15:10:54,065 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2019-02-25 15:10:54,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:54,065 INFO L225 Difference]: With dead ends: 75 [2019-02-25 15:10:54,066 INFO L226 Difference]: Without dead ends: 74 [2019-02-25 15:10:54,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-02-25 15:10:54,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-02-25 15:10:54,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-02-25 15:10:54,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-25 15:10:54,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-02-25 15:10:54,073 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2019-02-25 15:10:54,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:54,073 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-02-25 15:10:54,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-25 15:10:54,073 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-02-25 15:10:54,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-25 15:10:54,074 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:54,074 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2019-02-25 15:10:54,074 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:54,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:54,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times [2019-02-25 15:10:54,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:54,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:54,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:54,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:54,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:54,380 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:54,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:54,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:54,381 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:54,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:54,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:54,381 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:54,389 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:54,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:54,433 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-25 15:10:54,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:54,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 61 conjunts are in the unsatisfiable core [2019-02-25 15:10:54,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:54,439 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:54,439 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:54,449 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:54,449 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:54,702 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:54,702 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:55,171 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:55,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:55,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-02-25 15:10:55,191 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:55,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-25 15:10:55,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-25 15:10:55,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-02-25 15:10:55,192 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2019-02-25 15:10:55,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:55,316 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-02-25 15:10:55,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-25 15:10:55,317 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2019-02-25 15:10:55,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:55,318 INFO L225 Difference]: With dead ends: 79 [2019-02-25 15:10:55,318 INFO L226 Difference]: Without dead ends: 78 [2019-02-25 15:10:55,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-02-25 15:10:55,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-02-25 15:10:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-02-25 15:10:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-25 15:10:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-02-25 15:10:55,323 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2019-02-25 15:10:55,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:55,324 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-02-25 15:10:55,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-25 15:10:55,324 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-02-25 15:10:55,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-25 15:10:55,325 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:55,325 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2019-02-25 15:10:55,325 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:55,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:55,325 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times [2019-02-25 15:10:55,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:55,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:55,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:55,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:55,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:55,711 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:55,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:55,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:55,711 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:55,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:55,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:55,712 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:55,720 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:55,720 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:55,744 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:55,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:55,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 64 conjunts are in the unsatisfiable core [2019-02-25 15:10:55,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:55,751 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:55,751 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:55,756 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:55,756 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:56,404 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:56,405 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:56,878 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:56,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:56,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-02-25 15:10:56,898 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:56,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-25 15:10:56,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-25 15:10:56,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-02-25 15:10:56,900 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2019-02-25 15:10:57,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:57,051 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-02-25 15:10:57,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-25 15:10:57,051 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2019-02-25 15:10:57,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:57,052 INFO L225 Difference]: With dead ends: 83 [2019-02-25 15:10:57,053 INFO L226 Difference]: Without dead ends: 82 [2019-02-25 15:10:57,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-02-25 15:10:57,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-25 15:10:57,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-02-25 15:10:57,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-25 15:10:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-02-25 15:10:57,058 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2019-02-25 15:10:57,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:57,059 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-02-25 15:10:57,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-25 15:10:57,059 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-02-25 15:10:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-25 15:10:57,059 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:57,059 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2019-02-25 15:10:57,060 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:57,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:57,060 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times [2019-02-25 15:10:57,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:57,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:57,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:57,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:57,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:57,686 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:57,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:57,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:57,686 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:57,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:57,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:57,687 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:57,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:57,696 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:57,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 67 conjunts are in the unsatisfiable core [2019-02-25 15:10:57,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:57,725 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:57,725 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:57,738 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:57,739 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:58,140 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:58,674 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:58,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:58,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-02-25 15:10:58,693 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:58,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-25 15:10:58,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-25 15:10:58,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-02-25 15:10:58,695 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2019-02-25 15:10:58,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:58,823 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-02-25 15:10:58,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-25 15:10:58,824 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2019-02-25 15:10:58,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:58,825 INFO L225 Difference]: With dead ends: 87 [2019-02-25 15:10:58,825 INFO L226 Difference]: Without dead ends: 86 [2019-02-25 15:10:58,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-02-25 15:10:58,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-02-25 15:10:58,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-02-25 15:10:58,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-25 15:10:58,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-02-25 15:10:58,830 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2019-02-25 15:10:58,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:58,831 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-02-25 15:10:58,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-25 15:10:58,831 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-02-25 15:10:58,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-25 15:10:58,831 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:58,832 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2019-02-25 15:10:58,832 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:58,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:58,832 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times [2019-02-25 15:10:58,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:58,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:58,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:58,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:58,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:59,246 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:59,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:59,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:59,247 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:59,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:59,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:59,247 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:59,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:59,256 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:59,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-02-25 15:10:59,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:59,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 70 conjunts are in the unsatisfiable core [2019-02-25 15:10:59,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:59,314 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:59,315 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:59,325 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:59,325 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:59,713 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:59,713 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:00,328 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:00,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:00,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-02-25 15:11:00,347 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:00,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-25 15:11:00,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-25 15:11:00,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-02-25 15:11:00,350 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2019-02-25 15:11:00,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:00,520 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-02-25 15:11:00,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-25 15:11:00,520 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2019-02-25 15:11:00,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:00,521 INFO L225 Difference]: With dead ends: 91 [2019-02-25 15:11:00,522 INFO L226 Difference]: Without dead ends: 90 [2019-02-25 15:11:00,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-02-25 15:11:00,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-25 15:11:00,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-02-25 15:11:00,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-25 15:11:00,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-02-25 15:11:00,527 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2019-02-25 15:11:00,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:00,527 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-02-25 15:11:00,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-25 15:11:00,527 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-02-25 15:11:00,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-25 15:11:00,528 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:00,528 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2019-02-25 15:11:00,528 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:00,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:00,528 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times [2019-02-25 15:11:00,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:00,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:00,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:00,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:00,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:00,846 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:00,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:00,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:00,847 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:00,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:00,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:00,847 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:00,868 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:00,868 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:00,920 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:00,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:00,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 73 conjunts are in the unsatisfiable core [2019-02-25 15:11:00,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:00,942 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:11:00,943 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:00,995 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:00,995 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:01,641 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:01,641 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:02,319 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:02,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:02,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-02-25 15:11:02,338 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:02,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-25 15:11:02,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-25 15:11:02,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-02-25 15:11:02,340 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2019-02-25 15:11:02,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:02,506 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-02-25 15:11:02,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-25 15:11:02,509 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2019-02-25 15:11:02,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:02,510 INFO L225 Difference]: With dead ends: 95 [2019-02-25 15:11:02,511 INFO L226 Difference]: Without dead ends: 94 [2019-02-25 15:11:02,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-02-25 15:11:02,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-25 15:11:02,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-02-25 15:11:02,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-25 15:11:02,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-02-25 15:11:02,514 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2019-02-25 15:11:02,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:02,515 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-02-25 15:11:02,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-25 15:11:02,515 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-02-25 15:11:02,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-25 15:11:02,516 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:02,516 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2019-02-25 15:11:02,516 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:02,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:02,516 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times [2019-02-25 15:11:02,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:02,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:02,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:02,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:02,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:02,925 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:02,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:02,925 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:02,925 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:02,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:02,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:02,926 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:02,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:02,934 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:02,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 76 conjunts are in the unsatisfiable core [2019-02-25 15:11:02,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:02,967 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:11:02,967 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:02,978 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:02,978 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:03,356 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:03,356 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:04,091 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:04,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:04,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-02-25 15:11:04,110 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:04,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-25 15:11:04,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-25 15:11:04,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-02-25 15:11:04,112 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2019-02-25 15:11:04,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:04,273 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-02-25 15:11:04,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-25 15:11:04,274 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2019-02-25 15:11:04,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:04,275 INFO L225 Difference]: With dead ends: 99 [2019-02-25 15:11:04,275 INFO L226 Difference]: Without dead ends: 98 [2019-02-25 15:11:04,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-02-25 15:11:04,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-25 15:11:04,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-02-25 15:11:04,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-25 15:11:04,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-02-25 15:11:04,280 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2019-02-25 15:11:04,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:04,280 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-02-25 15:11:04,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-25 15:11:04,280 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-02-25 15:11:04,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-25 15:11:04,281 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:04,281 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2019-02-25 15:11:04,281 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:04,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:04,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times [2019-02-25 15:11:04,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:04,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:04,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:04,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:04,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:04,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:04,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:04,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:04,898 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:04,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:04,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:04,898 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:04,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:04,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:04,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-25 15:11:04,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:04,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 79 conjunts are in the unsatisfiable core [2019-02-25 15:11:04,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:04,998 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:11:04,998 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:05,009 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:05,010 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:05,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:05,645 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:06,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:06,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:06,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-02-25 15:11:06,700 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:06,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-25 15:11:06,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-25 15:11:06,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-02-25 15:11:06,702 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2019-02-25 15:11:06,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:06,884 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-02-25 15:11:06,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-25 15:11:06,884 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2019-02-25 15:11:06,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:06,886 INFO L225 Difference]: With dead ends: 103 [2019-02-25 15:11:06,886 INFO L226 Difference]: Without dead ends: 102 [2019-02-25 15:11:06,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-02-25 15:11:06,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-02-25 15:11:06,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-02-25 15:11:06,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-25 15:11:06,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-02-25 15:11:06,891 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2019-02-25 15:11:06,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:06,891 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-02-25 15:11:06,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-25 15:11:06,891 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-02-25 15:11:06,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-25 15:11:06,892 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:06,892 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2019-02-25 15:11:06,892 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:06,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:06,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times [2019-02-25 15:11:06,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:06,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:06,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:06,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:06,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:07,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:07,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:07,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:07,404 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:07,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:07,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:07,404 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:07,412 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:07,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:07,453 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:07,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:07,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 82 conjunts are in the unsatisfiable core [2019-02-25 15:11:07,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:07,469 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:11:07,469 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:07,474 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:07,474 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:07,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:07,905 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:08,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:08,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:08,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-02-25 15:11:08,777 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:08,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-25 15:11:08,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-25 15:11:08,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-02-25 15:11:08,779 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2019-02-25 15:11:08,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:08,964 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-02-25 15:11:08,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-25 15:11:08,965 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2019-02-25 15:11:08,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:08,966 INFO L225 Difference]: With dead ends: 107 [2019-02-25 15:11:08,966 INFO L226 Difference]: Without dead ends: 106 [2019-02-25 15:11:08,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-02-25 15:11:08,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-25 15:11:08,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-02-25 15:11:08,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-25 15:11:08,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-02-25 15:11:08,970 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2019-02-25 15:11:08,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:08,971 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-02-25 15:11:08,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-25 15:11:08,971 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-02-25 15:11:08,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-25 15:11:08,971 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:08,972 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2019-02-25 15:11:08,972 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:08,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:08,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times [2019-02-25 15:11:08,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:08,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:08,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:08,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:08,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:09,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:09,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:09,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:09,609 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:09,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:09,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:09,609 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:09,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:09,617 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:09,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 85 conjunts are in the unsatisfiable core [2019-02-25 15:11:09,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:09,656 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:11:09,656 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:09,665 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:09,665 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:10,132 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:11,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:11,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-02-25 15:11:11,073 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:11,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-25 15:11:11,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-25 15:11:11,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:11:11,075 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2019-02-25 15:11:11,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:11,276 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-02-25 15:11:11,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-25 15:11:11,277 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2019-02-25 15:11:11,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:11,278 INFO L225 Difference]: With dead ends: 111 [2019-02-25 15:11:11,278 INFO L226 Difference]: Without dead ends: 110 [2019-02-25 15:11:11,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:11:11,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-25 15:11:11,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-02-25 15:11:11,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-25 15:11:11,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-02-25 15:11:11,283 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2019-02-25 15:11:11,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:11,283 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-02-25 15:11:11,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-25 15:11:11,283 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-02-25 15:11:11,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-25 15:11:11,284 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:11,284 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2019-02-25 15:11:11,284 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:11,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:11,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times [2019-02-25 15:11:11,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:11,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:11,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:11,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:11,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:11,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:11,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:11,841 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:11,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:11,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:11,841 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:11,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:11,851 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:11,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-25 15:11:11,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:11,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 88 conjunts are in the unsatisfiable core [2019-02-25 15:11:11,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:11,941 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:11:11,942 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:11,951 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:11,951 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:12,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:12,489 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:13,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:13,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:13,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-02-25 15:11:13,475 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:13,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-25 15:11:13,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-25 15:11:13,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-02-25 15:11:13,477 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2019-02-25 15:11:13,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:13,663 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-02-25 15:11:13,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-25 15:11:13,664 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2019-02-25 15:11:13,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:13,665 INFO L225 Difference]: With dead ends: 115 [2019-02-25 15:11:13,665 INFO L226 Difference]: Without dead ends: 114 [2019-02-25 15:11:13,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-02-25 15:11:13,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-02-25 15:11:13,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-02-25 15:11:13,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-25 15:11:13,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-02-25 15:11:13,670 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2019-02-25 15:11:13,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:13,670 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-02-25 15:11:13,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-25 15:11:13,670 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-02-25 15:11:13,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-02-25 15:11:13,671 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:13,671 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2019-02-25 15:11:13,671 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:13,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:13,671 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times [2019-02-25 15:11:13,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:13,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:13,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:13,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:13,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:14,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:14,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:14,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:14,183 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:14,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:14,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:14,183 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:14,193 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:14,194 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:14,225 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:14,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:14,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 91 conjunts are in the unsatisfiable core [2019-02-25 15:11:14,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:14,249 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:11:14,250 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:14,284 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:14,284 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:14,890 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:15,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:15,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:15,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-02-25 15:11:15,897 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:15,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-25 15:11:15,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-25 15:11:15,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:11:15,898 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2019-02-25 15:11:16,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:16,086 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-02-25 15:11:16,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-25 15:11:16,086 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2019-02-25 15:11:16,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:16,088 INFO L225 Difference]: With dead ends: 119 [2019-02-25 15:11:16,088 INFO L226 Difference]: Without dead ends: 118 [2019-02-25 15:11:16,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:11:16,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-02-25 15:11:16,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-02-25 15:11:16,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-02-25 15:11:16,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-02-25 15:11:16,092 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2019-02-25 15:11:16,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:16,092 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-02-25 15:11:16,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-25 15:11:16,093 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-02-25 15:11:16,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-02-25 15:11:16,093 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:16,093 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2019-02-25 15:11:16,093 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:16,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:16,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times [2019-02-25 15:11:16,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:16,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:16,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:16,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:16,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:17,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:17,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:17,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:17,032 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:17,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:17,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:17,032 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:17,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:17,040 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:17,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 94 conjunts are in the unsatisfiable core [2019-02-25 15:11:17,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:17,080 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:11:17,080 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:17,089 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:17,089 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:17,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:17,812 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:18,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:18,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:18,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-02-25 15:11:18,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:18,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-25 15:11:18,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-25 15:11:18,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-02-25 15:11:18,947 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2019-02-25 15:11:19,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:19,159 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-02-25 15:11:19,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-25 15:11:19,159 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2019-02-25 15:11:19,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:19,161 INFO L225 Difference]: With dead ends: 123 [2019-02-25 15:11:19,161 INFO L226 Difference]: Without dead ends: 122 [2019-02-25 15:11:19,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-02-25 15:11:19,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-02-25 15:11:19,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-02-25 15:11:19,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-25 15:11:19,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-02-25 15:11:19,167 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2019-02-25 15:11:19,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:19,167 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-02-25 15:11:19,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-25 15:11:19,167 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-02-25 15:11:19,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-02-25 15:11:19,168 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:19,168 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2019-02-25 15:11:19,168 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:19,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:19,169 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times [2019-02-25 15:11:19,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:19,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:19,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:19,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:19,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:19,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:19,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:19,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:19,717 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:19,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:19,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:19,718 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:19,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:19,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:19,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-02-25 15:11:19,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:19,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 97 conjunts are in the unsatisfiable core [2019-02-25 15:11:19,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:19,838 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:11:19,839 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:19,926 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:19,926 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:20,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:20,527 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:21,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:21,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:21,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-02-25 15:11:21,867 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:21,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-25 15:11:21,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-25 15:11:21,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-02-25 15:11:21,869 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2019-02-25 15:11:22,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:22,100 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-02-25 15:11:22,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-25 15:11:22,101 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2019-02-25 15:11:22,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:22,102 INFO L225 Difference]: With dead ends: 127 [2019-02-25 15:11:22,102 INFO L226 Difference]: Without dead ends: 126 [2019-02-25 15:11:22,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-02-25 15:11:22,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-02-25 15:11:22,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-02-25 15:11:22,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-02-25 15:11:22,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-02-25 15:11:22,107 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2019-02-25 15:11:22,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:22,107 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-02-25 15:11:22,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-25 15:11:22,107 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-02-25 15:11:22,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-02-25 15:11:22,108 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:22,108 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2019-02-25 15:11:22,108 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:22,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:22,108 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times [2019-02-25 15:11:22,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:22,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:22,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:22,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:22,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:23,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:23,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:23,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:23,012 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:23,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:23,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:23,012 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:23,027 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:23,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:23,062 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:23,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:23,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 100 conjunts are in the unsatisfiable core [2019-02-25 15:11:23,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:23,069 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:11:23,069 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:23,082 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:23,082 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:23,720 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:24,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:24,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:24,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-02-25 15:11:24,958 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:24,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-25 15:11:24,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-25 15:11:24,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-02-25 15:11:24,959 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2019-02-25 15:11:25,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:25,197 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-02-25 15:11:25,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-25 15:11:25,198 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2019-02-25 15:11:25,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:25,199 INFO L225 Difference]: With dead ends: 131 [2019-02-25 15:11:25,199 INFO L226 Difference]: Without dead ends: 130 [2019-02-25 15:11:25,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3782 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-02-25 15:11:25,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-02-25 15:11:25,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-02-25 15:11:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-02-25 15:11:25,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-02-25 15:11:25,204 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2019-02-25 15:11:25,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:25,204 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-02-25 15:11:25,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-25 15:11:25,205 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-02-25 15:11:25,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-02-25 15:11:25,205 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:25,206 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2019-02-25 15:11:25,206 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:25,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:25,206 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times [2019-02-25 15:11:25,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:25,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:25,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:25,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:25,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:25,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:25,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:25,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:25,844 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:25,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:25,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:25,844 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:25,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:25,853 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:25,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 103 conjunts are in the unsatisfiable core [2019-02-25 15:11:25,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:25,903 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:11:25,903 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:25,914 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:25,914 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:26,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:26,785 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:28,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:28,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:28,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-02-25 15:11:28,170 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:28,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-25 15:11:28,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-25 15:11:28,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-02-25 15:11:28,171 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2019-02-25 15:11:28,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:28,396 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-02-25 15:11:28,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-25 15:11:28,397 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2019-02-25 15:11:28,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:28,398 INFO L225 Difference]: With dead ends: 135 [2019-02-25 15:11:28,398 INFO L226 Difference]: Without dead ends: 134 [2019-02-25 15:11:28,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-02-25 15:11:28,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-02-25 15:11:28,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-02-25 15:11:28,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-25 15:11:28,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-02-25 15:11:28,404 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2019-02-25 15:11:28,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:28,405 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-02-25 15:11:28,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-25 15:11:28,405 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-02-25 15:11:28,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-02-25 15:11:28,405 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:28,406 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2019-02-25 15:11:28,406 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:28,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:28,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times [2019-02-25 15:11:28,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:28,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:28,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:28,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:28,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:29,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:29,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:29,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:29,796 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:29,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:29,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:29,796 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:29,803 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:29,804 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:29,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-02-25 15:11:29,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:29,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 106 conjunts are in the unsatisfiable core [2019-02-25 15:11:29,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:29,967 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:11:29,968 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:29,976 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:29,976 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:31,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:31,120 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:32,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:32,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:32,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-02-25 15:11:32,744 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:32,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-25 15:11:32,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-25 15:11:32,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-02-25 15:11:32,746 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2019-02-25 15:11:32,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:32,976 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-02-25 15:11:32,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-25 15:11:32,977 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2019-02-25 15:11:32,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:32,978 INFO L225 Difference]: With dead ends: 139 [2019-02-25 15:11:32,979 INFO L226 Difference]: Without dead ends: 138 [2019-02-25 15:11:32,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-02-25 15:11:32,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-02-25 15:11:32,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-02-25 15:11:32,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-02-25 15:11:32,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-02-25 15:11:32,985 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2019-02-25 15:11:32,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:32,986 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-02-25 15:11:32,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-25 15:11:32,986 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-02-25 15:11:32,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-02-25 15:11:32,987 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:32,987 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2019-02-25 15:11:32,987 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:32,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:32,987 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times [2019-02-25 15:11:32,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:32,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:32,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:32,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:32,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:33,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:33,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:33,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:33,691 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:33,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:33,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:33,692 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:33,700 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:33,700 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:33,738 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:33,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:33,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 109 conjunts are in the unsatisfiable core [2019-02-25 15:11:33,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:33,759 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:11:33,759 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:33,856 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:33,856 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:35,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:35,154 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:36,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:36,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:36,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-02-25 15:11:36,616 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:36,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-25 15:11:36,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-25 15:11:36,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-02-25 15:11:36,618 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2019-02-25 15:11:36,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:36,979 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-02-25 15:11:36,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-25 15:11:36,980 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2019-02-25 15:11:36,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:36,980 INFO L225 Difference]: With dead ends: 143 [2019-02-25 15:11:36,981 INFO L226 Difference]: Without dead ends: 142 [2019-02-25 15:11:36,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-02-25 15:11:36,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-02-25 15:11:36,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-02-25 15:11:36,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-02-25 15:11:36,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-02-25 15:11:36,984 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2019-02-25 15:11:36,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:36,985 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-02-25 15:11:36,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-25 15:11:36,985 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-02-25 15:11:36,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-02-25 15:11:36,986 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:36,986 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2019-02-25 15:11:36,986 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:36,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:36,986 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times [2019-02-25 15:11:36,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:36,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:36,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:36,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:36,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:37,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:37,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:37,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:37,780 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:37,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:37,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:37,780 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:37,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:37,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:37,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 112 conjunts are in the unsatisfiable core [2019-02-25 15:11:37,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:37,841 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:11:37,841 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:37,854 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:37,854 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:38,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:38,766 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:40,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:40,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:40,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-02-25 15:11:40,336 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:40,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-25 15:11:40,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-25 15:11:40,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-02-25 15:11:40,337 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2019-02-25 15:11:40,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:40,754 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-02-25 15:11:40,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-25 15:11:40,755 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2019-02-25 15:11:40,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:40,756 INFO L225 Difference]: With dead ends: 147 [2019-02-25 15:11:40,756 INFO L226 Difference]: Without dead ends: 146 [2019-02-25 15:11:40,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-02-25 15:11:40,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-02-25 15:11:40,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-02-25 15:11:40,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-02-25 15:11:40,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-02-25 15:11:40,762 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2019-02-25 15:11:40,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:40,762 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-02-25 15:11:40,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-25 15:11:40,763 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-02-25 15:11:40,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-02-25 15:11:40,763 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:40,764 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2019-02-25 15:11:40,764 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:40,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:40,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times [2019-02-25 15:11:40,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:40,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:40,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:40,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:40,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:41,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:41,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:41,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:41,508 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:41,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:41,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:41,508 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:41,517 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:41,517 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:41,629 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-02-25 15:11:41,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:41,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 115 conjunts are in the unsatisfiable core [2019-02-25 15:11:41,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:41,641 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:11:41,641 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:41,662 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:41,663 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:42,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:42,633 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:44,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:44,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:44,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-02-25 15:11:44,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:44,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-25 15:11:44,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-25 15:11:44,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-02-25 15:11:44,280 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2019-02-25 15:11:45,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:45,832 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-02-25 15:11:45,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-25 15:11:45,833 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2019-02-25 15:11:45,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:45,834 INFO L225 Difference]: With dead ends: 151 [2019-02-25 15:11:45,834 INFO L226 Difference]: Without dead ends: 150 [2019-02-25 15:11:45,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5112 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-02-25 15:11:45,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-02-25 15:11:45,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-02-25 15:11:45,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-02-25 15:11:45,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-02-25 15:11:45,840 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2019-02-25 15:11:45,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:45,840 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2019-02-25 15:11:45,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-25 15:11:45,841 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2019-02-25 15:11:45,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-02-25 15:11:45,841 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:45,841 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2019-02-25 15:11:45,842 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:45,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:45,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times [2019-02-25 15:11:45,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:45,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:45,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:45,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:45,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:46,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:46,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:46,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:46,920 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:46,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:46,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:46,920 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:46,933 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:46,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:46,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:46,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:46,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 118 conjunts are in the unsatisfiable core [2019-02-25 15:11:46,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:47,009 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:11:47,010 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:47,097 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:47,098 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:48,493 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:50,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:50,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:50,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-02-25 15:11:50,275 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:50,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-25 15:11:50,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-25 15:11:50,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-02-25 15:11:50,276 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2019-02-25 15:11:50,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:50,610 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-02-25 15:11:50,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-25 15:11:50,610 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2019-02-25 15:11:50,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:50,612 INFO L225 Difference]: With dead ends: 155 [2019-02-25 15:11:50,612 INFO L226 Difference]: Without dead ends: 154 [2019-02-25 15:11:50,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5402 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-02-25 15:11:50,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-02-25 15:11:50,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-02-25 15:11:50,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-02-25 15:11:50,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-02-25 15:11:50,618 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2019-02-25 15:11:50,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:50,618 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2019-02-25 15:11:50,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-25 15:11:50,619 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2019-02-25 15:11:50,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-02-25 15:11:50,619 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:50,620 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2019-02-25 15:11:50,620 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:50,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:50,620 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times [2019-02-25 15:11:50,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:50,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:50,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:50,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:50,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:51,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:51,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:51,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:51,550 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:51,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:51,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:51,550 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:51,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:51,560 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:51,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 121 conjunts are in the unsatisfiable core [2019-02-25 15:11:51,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:51,619 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:11:51,619 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:51,632 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:51,632 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:52,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:52,915 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:54,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:54,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:54,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-02-25 15:11:54,696 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:54,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-25 15:11:54,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-25 15:11:54,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-02-25 15:11:54,697 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2019-02-25 15:11:54,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:54,928 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-02-25 15:11:54,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-25 15:11:54,928 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2019-02-25 15:11:54,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:54,930 INFO L225 Difference]: With dead ends: 159 [2019-02-25 15:11:54,930 INFO L226 Difference]: Without dead ends: 158 [2019-02-25 15:11:54,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5700 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-02-25 15:11:54,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-02-25 15:11:54,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-02-25 15:11:54,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-02-25 15:11:54,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-02-25 15:11:54,936 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2019-02-25 15:11:54,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:54,936 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-02-25 15:11:54,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-25 15:11:54,936 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-02-25 15:11:54,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-02-25 15:11:54,937 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:54,937 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2019-02-25 15:11:54,937 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:54,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:54,938 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times [2019-02-25 15:11:54,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:54,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:54,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:54,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:54,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:55,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:55,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:55,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:55,806 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:55,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:55,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:55,806 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:55,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:55,815 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:55,941 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-02-25 15:11:55,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:55,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 124 conjunts are in the unsatisfiable core [2019-02-25 15:11:55,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:55,950 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:11:55,950 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:55,964 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:55,964 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:56,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:56,996 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:59,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:59,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:59,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-02-25 15:11:59,140 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:59,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-25 15:11:59,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-25 15:11:59,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-02-25 15:11:59,141 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2019-02-25 15:11:59,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:59,440 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2019-02-25 15:11:59,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-25 15:11:59,441 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2019-02-25 15:11:59,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:59,442 INFO L225 Difference]: With dead ends: 163 [2019-02-25 15:11:59,442 INFO L226 Difference]: Without dead ends: 162 [2019-02-25 15:11:59,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6006 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-02-25 15:11:59,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-02-25 15:11:59,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-02-25 15:11:59,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-02-25 15:11:59,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-02-25 15:11:59,448 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2019-02-25 15:11:59,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:59,449 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-02-25 15:11:59,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-25 15:11:59,449 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-02-25 15:11:59,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-02-25 15:11:59,450 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:59,450 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2019-02-25 15:11:59,450 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:59,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:59,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times [2019-02-25 15:11:59,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:59,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:59,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:59,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:59,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:01,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:01,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:01,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:01,359 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:01,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:01,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:01,359 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:01,367 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:12:01,367 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:12:01,410 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:12:01,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:01,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 127 conjunts are in the unsatisfiable core [2019-02-25 15:12:01,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:01,418 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:12:01,418 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:12:01,426 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:12:01,426 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:12:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:02,459 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:04,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:04,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:04,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-02-25 15:12:04,615 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:04,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-25 15:12:04,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-25 15:12:04,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-02-25 15:12:04,616 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2019-02-25 15:12:04,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:04,912 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-02-25 15:12:04,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-25 15:12:04,912 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2019-02-25 15:12:04,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:04,914 INFO L225 Difference]: With dead ends: 167 [2019-02-25 15:12:04,914 INFO L226 Difference]: Without dead ends: 166 [2019-02-25 15:12:04,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-02-25 15:12:04,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-02-25 15:12:04,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-02-25 15:12:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-02-25 15:12:04,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2019-02-25 15:12:04,920 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2019-02-25 15:12:04,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:04,921 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2019-02-25 15:12:04,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-25 15:12:04,921 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2019-02-25 15:12:04,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-02-25 15:12:04,921 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:04,922 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2019-02-25 15:12:04,922 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:04,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:04,922 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times [2019-02-25 15:12:04,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:04,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:04,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:04,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:04,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:06,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:06,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:06,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:06,029 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:06,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:06,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:06,029 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:06,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:06,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:12:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:06,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 130 conjunts are in the unsatisfiable core [2019-02-25 15:12:06,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:06,121 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:12:06,122 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:12:06,152 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:12:06,152 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:12:07,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:07,164 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:09,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:09,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:09,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-02-25 15:12:09,503 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:09,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-25 15:12:09,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-25 15:12:09,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-02-25 15:12:09,505 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2019-02-25 15:12:09,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:09,774 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-02-25 15:12:09,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-25 15:12:09,774 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2019-02-25 15:12:09,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:09,776 INFO L225 Difference]: With dead ends: 171 [2019-02-25 15:12:09,776 INFO L226 Difference]: Without dead ends: 170 [2019-02-25 15:12:09,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6642 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-02-25 15:12:09,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-02-25 15:12:09,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-02-25 15:12:09,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-02-25 15:12:09,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-02-25 15:12:09,782 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2019-02-25 15:12:09,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:09,782 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-02-25 15:12:09,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-25 15:12:09,782 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-02-25 15:12:09,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-02-25 15:12:09,783 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:09,783 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2019-02-25 15:12:09,783 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:09,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:09,784 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times [2019-02-25 15:12:09,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:09,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:09,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:09,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:09,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:10,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:10,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:10,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:10,739 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:10,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:10,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:10,739 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:10,747 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:12:10,748 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:12:10,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-02-25 15:12:10,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:10,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 133 conjunts are in the unsatisfiable core [2019-02-25 15:12:10,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:10,909 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:12:10,910 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:12:11,005 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:12:11,006 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:12:12,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:12,210 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:14,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:14,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:14,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-02-25 15:12:14,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:14,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-25 15:12:14,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-25 15:12:14,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-02-25 15:12:14,719 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2019-02-25 15:12:14,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:14,993 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-02-25 15:12:14,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-25 15:12:14,994 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2019-02-25 15:12:14,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:14,995 INFO L225 Difference]: With dead ends: 175 [2019-02-25 15:12:14,995 INFO L226 Difference]: Without dead ends: 174 [2019-02-25 15:12:14,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6972 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-02-25 15:12:14,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-02-25 15:12:15,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-02-25 15:12:15,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-02-25 15:12:15,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-02-25 15:12:15,001 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2019-02-25 15:12:15,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:15,001 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2019-02-25 15:12:15,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-25 15:12:15,001 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2019-02-25 15:12:15,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-02-25 15:12:15,002 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:15,002 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2019-02-25 15:12:15,003 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:15,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:15,003 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times [2019-02-25 15:12:15,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:15,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:15,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:15,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:15,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:16,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:16,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:16,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:16,201 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:16,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:16,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:16,202 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:16,210 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:12:16,211 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:12:16,262 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:12:16,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:16,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 136 conjunts are in the unsatisfiable core [2019-02-25 15:12:16,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:16,275 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:12:16,275 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:12:16,291 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:12:16,292 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:12:17,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:17,418 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:20,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:20,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:20,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-02-25 15:12:20,044 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:20,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-25 15:12:20,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-25 15:12:20,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-02-25 15:12:20,045 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2019-02-25 15:12:20,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:20,616 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-02-25 15:12:20,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-25 15:12:20,616 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2019-02-25 15:12:20,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:20,617 INFO L225 Difference]: With dead ends: 179 [2019-02-25 15:12:20,617 INFO L226 Difference]: Without dead ends: 178 [2019-02-25 15:12:20,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7310 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-02-25 15:12:20,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-02-25 15:12:20,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-02-25 15:12:20,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-02-25 15:12:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-02-25 15:12:20,628 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2019-02-25 15:12:20,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:20,628 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-02-25 15:12:20,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-25 15:12:20,628 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-02-25 15:12:20,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-02-25 15:12:20,629 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:20,629 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2019-02-25 15:12:20,629 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:20,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:20,630 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times [2019-02-25 15:12:20,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:20,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:20,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:20,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:20,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:21,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:21,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:21,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:21,993 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:21,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:21,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:21,993 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:22,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:22,001 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:12:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:22,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 139 conjunts are in the unsatisfiable core [2019-02-25 15:12:22,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:22,064 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:12:22,065 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:12:22,075 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:12:22,075 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:12:23,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:23,564 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:25,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:25,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:25,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-02-25 15:12:25,956 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:25,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-25 15:12:25,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-25 15:12:25,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-02-25 15:12:25,958 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2019-02-25 15:12:26,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:26,247 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-02-25 15:12:26,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-25 15:12:26,247 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2019-02-25 15:12:26,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:26,249 INFO L225 Difference]: With dead ends: 183 [2019-02-25 15:12:26,249 INFO L226 Difference]: Without dead ends: 182 [2019-02-25 15:12:26,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-02-25 15:12:26,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-02-25 15:12:26,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-02-25 15:12:26,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-02-25 15:12:26,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-02-25 15:12:26,254 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2019-02-25 15:12:26,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:26,254 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-02-25 15:12:26,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-25 15:12:26,254 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-02-25 15:12:26,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-02-25 15:12:26,255 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:26,255 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2019-02-25 15:12:26,255 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:26,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:26,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times [2019-02-25 15:12:26,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:26,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:26,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:26,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:26,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:27,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:27,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:27,370 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:27,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:27,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:27,371 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:27,380 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:12:27,380 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:12:27,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-02-25 15:12:27,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:27,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 142 conjunts are in the unsatisfiable core [2019-02-25 15:12:27,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:27,553 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:12:27,553 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:12:27,561 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:12:27,561 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:12:29,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:29,039 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:31,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:31,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:31,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-02-25 15:12:31,605 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:31,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-25 15:12:31,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-25 15:12:31,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-02-25 15:12:31,607 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2019-02-25 15:12:31,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:31,956 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2019-02-25 15:12:31,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-25 15:12:31,957 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2019-02-25 15:12:31,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:31,958 INFO L225 Difference]: With dead ends: 187 [2019-02-25 15:12:31,958 INFO L226 Difference]: Without dead ends: 186 [2019-02-25 15:12:31,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8010 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-02-25 15:12:31,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-02-25 15:12:31,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-02-25 15:12:31,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-02-25 15:12:31,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2019-02-25 15:12:31,963 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2019-02-25 15:12:31,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:31,964 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2019-02-25 15:12:31,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-25 15:12:31,964 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2019-02-25 15:12:31,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-02-25 15:12:31,965 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:31,965 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2019-02-25 15:12:31,965 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:31,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:31,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times [2019-02-25 15:12:31,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:31,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:31,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:31,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:31,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:33,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:33,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:33,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:33,094 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:33,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:33,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:33,095 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:33,104 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:12:33,105 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:12:33,155 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:12:33,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:33,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 145 conjunts are in the unsatisfiable core [2019-02-25 15:12:33,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:33,162 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:12:33,162 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:12:33,171 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:12:33,171 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:12:34,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:34,647 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:37,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:37,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:37,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-02-25 15:12:37,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:37,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-25 15:12:37,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-25 15:12:37,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-02-25 15:12:37,366 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2019-02-25 15:12:37,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:37,679 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-02-25 15:12:37,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-25 15:12:37,679 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2019-02-25 15:12:37,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:37,681 INFO L225 Difference]: With dead ends: 191 [2019-02-25 15:12:37,681 INFO L226 Difference]: Without dead ends: 190 [2019-02-25 15:12:37,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-02-25 15:12:37,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-02-25 15:12:37,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-02-25 15:12:37,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-02-25 15:12:37,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2019-02-25 15:12:37,687 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2019-02-25 15:12:37,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:37,687 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2019-02-25 15:12:37,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-25 15:12:37,687 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2019-02-25 15:12:37,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-02-25 15:12:37,688 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:37,688 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2019-02-25 15:12:37,688 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:37,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:37,689 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times [2019-02-25 15:12:37,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:37,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:37,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:37,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:37,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:39,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:39,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:39,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:39,683 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:39,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:39,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:39,683 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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:39,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:39,691 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:12:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:39,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 148 conjunts are in the unsatisfiable core [2019-02-25 15:12:39,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:39,749 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:12:39,749 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:12:39,757 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:12:39,758 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:12:41,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:41,708 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:45,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:45,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:45,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-02-25 15:12:45,064 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:45,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-25 15:12:45,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-25 15:12:45,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-02-25 15:12:45,067 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2019-02-25 15:12:45,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:45,491 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-02-25 15:12:45,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-25 15:12:45,491 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2019-02-25 15:12:45,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:45,493 INFO L225 Difference]: With dead ends: 195 [2019-02-25 15:12:45,493 INFO L226 Difference]: Without dead ends: 194 [2019-02-25 15:12:45,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8742 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-02-25 15:12:45,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-02-25 15:12:45,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-02-25 15:12:45,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-02-25 15:12:45,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-02-25 15:12:45,497 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2019-02-25 15:12:45,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:45,498 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-02-25 15:12:45,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-25 15:12:45,498 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-02-25 15:12:45,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-02-25 15:12:45,499 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:45,499 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2019-02-25 15:12:45,499 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:45,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:45,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times [2019-02-25 15:12:45,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:45,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:45,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:45,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:45,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:46,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:46,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:46,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:46,736 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:46,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:46,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:46,736 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:46,744 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:12:46,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:12:46,931 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-02-25 15:12:46,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:46,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 151 conjunts are in the unsatisfiable core [2019-02-25 15:12:46,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:46,954 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:12:46,954 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:12:47,054 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:12:47,055 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:12:48,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:48,697 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:51,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:51,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-02-25 15:12:51,592 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:51,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-25 15:12:51,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-25 15:12:51,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-02-25 15:12:51,594 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2019-02-25 15:12:51,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:51,935 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2019-02-25 15:12:51,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-25 15:12:51,936 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2019-02-25 15:12:51,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:51,937 INFO L225 Difference]: With dead ends: 199 [2019-02-25 15:12:51,937 INFO L226 Difference]: Without dead ends: 198 [2019-02-25 15:12:51,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9120 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-02-25 15:12:51,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-02-25 15:12:51,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-02-25 15:12:51,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-02-25 15:12:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-02-25 15:12:51,942 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2019-02-25 15:12:51,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:51,942 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-02-25 15:12:51,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-25 15:12:51,942 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-02-25 15:12:51,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-02-25 15:12:51,943 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:51,943 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2019-02-25 15:12:51,943 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:51,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:51,944 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times [2019-02-25 15:12:51,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:51,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:51,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:51,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:51,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:53,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:53,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:53,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:53,560 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:53,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:53,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:53,560 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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:53,569 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:12:53,569 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:12:53,629 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:12:53,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:53,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 154 conjunts are in the unsatisfiable core [2019-02-25 15:12:53,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:53,638 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:12:53,638 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:12:53,648 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:12:53,648 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:12:55,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:55,211 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:58,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:58,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-02-25 15:12:58,222 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:58,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-25 15:12:58,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-25 15:12:58,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-02-25 15:12:58,224 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2019-02-25 15:12:58,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:58,581 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-02-25 15:12:58,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-25 15:12:58,582 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2019-02-25 15:12:58,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:58,583 INFO L225 Difference]: With dead ends: 203 [2019-02-25 15:12:58,584 INFO L226 Difference]: Without dead ends: 202 [2019-02-25 15:12:58,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9506 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-02-25 15:12:58,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-02-25 15:12:58,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-02-25 15:12:58,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-02-25 15:12:58,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-02-25 15:12:58,590 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2019-02-25 15:12:58,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:58,590 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-02-25 15:12:58,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-25 15:12:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-02-25 15:12:58,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-02-25 15:12:58,591 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:58,591 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2019-02-25 15:12:58,591 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:58,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:58,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times [2019-02-25 15:12:58,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:58,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:58,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:58,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:58,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:00,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:00,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:00,111 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:00,111 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:00,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:00,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:00,111 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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:13:00,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:13:00,119 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:13:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:00,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 157 conjunts are in the unsatisfiable core [2019-02-25 15:13:00,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:00,178 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:13:00,178 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:13:00,189 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:13:00,189 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:13:01,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:01,721 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:05,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:05,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:05,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-02-25 15:13:05,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:05,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-25 15:13:05,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-25 15:13:05,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-02-25 15:13:05,149 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2019-02-25 15:13:05,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:05,467 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-02-25 15:13:05,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-25 15:13:05,468 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2019-02-25 15:13:05,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:05,469 INFO L225 Difference]: With dead ends: 207 [2019-02-25 15:13:05,470 INFO L226 Difference]: Without dead ends: 206 [2019-02-25 15:13:05,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9900 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-02-25 15:13:05,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-02-25 15:13:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-02-25 15:13:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-02-25 15:13:05,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-02-25 15:13:05,476 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2019-02-25 15:13:05,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:05,476 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-02-25 15:13:05,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-25 15:13:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-02-25 15:13:05,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-02-25 15:13:05,477 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:05,477 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2019-02-25 15:13:05,477 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:05,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:05,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times [2019-02-25 15:13:05,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:05,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:05,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:13:05,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:05,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:06,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:06,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:06,815 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:06,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:06,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:06,815 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:13:06,824 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:13:06,824 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:13:07,006 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-02-25 15:13:07,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:13:07,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 160 conjunts are in the unsatisfiable core [2019-02-25 15:13:07,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:07,026 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:13:07,027 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:13:07,044 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:13:07,044 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:13:08,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:08,579 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:11,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:11,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:11,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2019-02-25 15:13:11,837 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:11,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-25 15:13:11,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-25 15:13:11,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-02-25 15:13:11,840 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2019-02-25 15:13:12,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:12,233 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-02-25 15:13:12,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-25 15:13:12,233 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2019-02-25 15:13:12,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:12,234 INFO L225 Difference]: With dead ends: 211 [2019-02-25 15:13:12,234 INFO L226 Difference]: Without dead ends: 210 [2019-02-25 15:13:12,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 304 SyntacticMatches, 2 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10397 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-02-25 15:13:12,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-02-25 15:13:12,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-02-25 15:13:12,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-02-25 15:13:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2019-02-25 15:13:12,240 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2019-02-25 15:13:12,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:12,241 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2019-02-25 15:13:12,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-25 15:13:12,241 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2019-02-25 15:13:12,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-02-25 15:13:12,242 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:12,242 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2019-02-25 15:13:12,242 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:12,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:12,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times [2019-02-25 15:13:12,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:12,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:12,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:13:12,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:12,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:13,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:13,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:13,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:13,868 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:13,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:13,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:13,868 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:13:13,878 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:13:13,878 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:13:13,952 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:13:13,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:13:13,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 163 conjunts are in the unsatisfiable core [2019-02-25 15:13:13,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:13,976 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:13:13,977 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:13:14,070 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:13:14,070 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:13:17,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:17,168 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:20,741 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:20,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:20,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 152 [2019-02-25 15:13:20,762 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:20,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-25 15:13:20,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-25 15:13:20,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-02-25 15:13:20,764 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2019-02-25 15:13:21,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:21,191 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-02-25 15:13:21,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-25 15:13:21,192 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2019-02-25 15:13:21,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:21,193 INFO L225 Difference]: With dead ends: 215 [2019-02-25 15:13:21,193 INFO L226 Difference]: Without dead ends: 214 [2019-02-25 15:13:21,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 310 SyntacticMatches, 4 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10894 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-02-25 15:13:21,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-02-25 15:13:21,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-02-25 15:13:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-25 15:13:21,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2019-02-25 15:13:21,200 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2019-02-25 15:13:21,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:21,200 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2019-02-25 15:13:21,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-25 15:13:21,200 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2019-02-25 15:13:21,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-02-25 15:13:21,201 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:21,202 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2019-02-25 15:13:21,202 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:21,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:21,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times [2019-02-25 15:13:21,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:21,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:21,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:13:21,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:21,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:22,656 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:22,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:22,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:22,657 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:22,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:22,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:22,657 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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:13:22,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:13:22,665 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:13:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:22,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 166 conjunts are in the unsatisfiable core [2019-02-25 15:13:22,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:22,741 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:13:22,742 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:13:22,784 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:13:22,784 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:13:24,582 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:24,583 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:27,881 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:27,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:27,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 153 [2019-02-25 15:13:27,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:27,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-02-25 15:13:27,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-02-25 15:13:27,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-02-25 15:13:27,901 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2019-02-25 15:13:28,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:28,260 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-02-25 15:13:28,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-25 15:13:28,260 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2019-02-25 15:13:28,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:28,262 INFO L225 Difference]: With dead ends: 219 [2019-02-25 15:13:28,262 INFO L226 Difference]: Without dead ends: 218 [2019-02-25 15:13:28,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 316 SyntacticMatches, 6 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11391 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-02-25 15:13:28,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-02-25 15:13:28,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-02-25 15:13:28,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-02-25 15:13:28,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-02-25 15:13:28,267 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2019-02-25 15:13:28,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:28,267 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-02-25 15:13:28,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-02-25 15:13:28,267 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-02-25 15:13:28,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-02-25 15:13:28,268 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:28,268 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2019-02-25 15:13:28,269 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:28,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:28,269 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times [2019-02-25 15:13:28,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:28,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:28,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:13:28,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:28,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:29,748 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:29,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:29,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:29,749 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:29,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:29,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:29,749 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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:13:29,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:13:29,758 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:13:29,973 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-02-25 15:13:29,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:13:29,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 169 conjunts are in the unsatisfiable core [2019-02-25 15:13:29,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:29,981 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:13:29,981 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:13:29,989 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:13:29,990 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:13:31,686 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:31,687 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:35,216 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:35,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:35,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 154 [2019-02-25 15:13:35,235 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:35,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-02-25 15:13:35,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-02-25 15:13:35,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-02-25 15:13:35,237 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2019-02-25 15:13:35,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:35,619 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2019-02-25 15:13:35,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-25 15:13:35,619 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2019-02-25 15:13:35,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:35,621 INFO L225 Difference]: With dead ends: 223 [2019-02-25 15:13:35,621 INFO L226 Difference]: Without dead ends: 222 [2019-02-25 15:13:35,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 322 SyntacticMatches, 8 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11888 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-02-25 15:13:35,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-02-25 15:13:35,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-02-25 15:13:35,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-02-25 15:13:35,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-02-25 15:13:35,626 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2019-02-25 15:13:35,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:35,626 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-02-25 15:13:35,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-02-25 15:13:35,627 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-02-25 15:13:35,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-02-25 15:13:35,627 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:35,627 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2019-02-25 15:13:35,628 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:35,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:35,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times [2019-02-25 15:13:35,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:35,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:35,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:13:35,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:35,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:37,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:37,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:37,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:37,155 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:37,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:37,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:37,155 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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:13:37,164 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:13:37,164 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:13:37,231 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:13:37,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:13:37,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 172 conjunts are in the unsatisfiable core [2019-02-25 15:13:37,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:37,240 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:13:37,240 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:13:37,248 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:13:37,248 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:13:39,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:39,018 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:42,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:42,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 155 [2019-02-25 15:13:42,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:42,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-02-25 15:13:42,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-02-25 15:13:42,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-02-25 15:13:42,566 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2019-02-25 15:13:43,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:43,026 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2019-02-25 15:13:43,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-25 15:13:43,027 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2019-02-25 15:13:43,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:43,028 INFO L225 Difference]: With dead ends: 227 [2019-02-25 15:13:43,029 INFO L226 Difference]: Without dead ends: 226 [2019-02-25 15:13:43,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 328 SyntacticMatches, 10 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12385 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-02-25 15:13:43,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-02-25 15:13:43,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-02-25 15:13:43,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-02-25 15:13:43,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2019-02-25 15:13:43,035 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2019-02-25 15:13:43,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:43,035 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2019-02-25 15:13:43,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-02-25 15:13:43,035 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2019-02-25 15:13:43,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-02-25 15:13:43,036 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:43,037 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2019-02-25 15:13:43,037 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:43,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:43,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times [2019-02-25 15:13:43,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:43,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:43,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:13:43,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:43,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:44,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:44,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:44,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:44,543 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:44,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:44,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:44,543 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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:13:44,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:13:44,551 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:13:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:44,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 175 conjunts are in the unsatisfiable core [2019-02-25 15:13:44,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:44,622 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:13:44,622 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:13:44,635 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:13:44,636 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:13:46,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:46,754 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:50,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:50,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:50,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 156 [2019-02-25 15:13:50,072 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:50,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-02-25 15:13:50,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-02-25 15:13:50,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-02-25 15:13:50,074 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2019-02-25 15:13:50,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:50,613 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-02-25 15:13:50,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-25 15:13:50,613 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2019-02-25 15:13:50,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:50,615 INFO L225 Difference]: With dead ends: 231 [2019-02-25 15:13:50,615 INFO L226 Difference]: Without dead ends: 230 [2019-02-25 15:13:50,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 334 SyntacticMatches, 12 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12882 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-02-25 15:13:50,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-02-25 15:13:50,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-02-25 15:13:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-02-25 15:13:50,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-02-25 15:13:50,622 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2019-02-25 15:13:50,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:50,623 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-02-25 15:13:50,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-02-25 15:13:50,623 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-02-25 15:13:50,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-02-25 15:13:50,624 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:50,624 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2019-02-25 15:13:50,624 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:50,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:50,625 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times [2019-02-25 15:13:50,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:50,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:50,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:13:50,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:50,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:52,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:52,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:52,191 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:52,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:52,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:52,191 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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:13:52,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:13:52,199 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:13:52,444 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-02-25 15:13:52,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:13:52,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 178 conjunts are in the unsatisfiable core [2019-02-25 15:13:52,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:52,454 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:13:52,454 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:13:52,465 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:13:52,465 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:13:54,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:54,364 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:58,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:58,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:58,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 157 [2019-02-25 15:13:58,021 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:58,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-02-25 15:13:58,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-02-25 15:13:58,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-02-25 15:13:58,023 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2019-02-25 15:13:58,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:58,497 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-02-25 15:13:58,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-25 15:13:58,498 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2019-02-25 15:13:58,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:58,499 INFO L225 Difference]: With dead ends: 235 [2019-02-25 15:13:58,499 INFO L226 Difference]: Without dead ends: 234 [2019-02-25 15:13:58,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 340 SyntacticMatches, 14 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13379 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-02-25 15:13:58,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-02-25 15:13:58,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-02-25 15:13:58,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-02-25 15:13:58,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2019-02-25 15:13:58,507 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2019-02-25 15:13:58,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:58,507 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2019-02-25 15:13:58,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-02-25 15:13:58,507 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2019-02-25 15:13:58,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-02-25 15:13:58,508 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:58,509 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2019-02-25 15:13:58,509 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:58,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:58,509 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times [2019-02-25 15:13:58,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:58,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:58,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:13:58,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:58,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:00,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:00,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:00,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:00,178 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:00,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:00,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:00,178 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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:00,186 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:14:00,186 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:14:00,257 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:14:00,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:14:00,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 181 conjunts are in the unsatisfiable core [2019-02-25 15:14:00,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:00,272 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:14:00,272 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:00,281 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:00,281 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:14:02,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:02,631 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:06,232 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:06,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:06,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 158 [2019-02-25 15:14:06,251 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:06,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-02-25 15:14:06,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-02-25 15:14:06,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-02-25 15:14:06,253 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2019-02-25 15:14:06,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:06,720 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2019-02-25 15:14:06,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-25 15:14:06,720 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2019-02-25 15:14:06,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:06,722 INFO L225 Difference]: With dead ends: 239 [2019-02-25 15:14:06,722 INFO L226 Difference]: Without dead ends: 238 [2019-02-25 15:14:06,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 346 SyntacticMatches, 16 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13876 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-02-25 15:14:06,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-02-25 15:14:06,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2019-02-25 15:14:06,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-02-25 15:14:06,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-02-25 15:14:06,727 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2019-02-25 15:14:06,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:06,727 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2019-02-25 15:14:06,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-02-25 15:14:06,728 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2019-02-25 15:14:06,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-02-25 15:14:06,728 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:06,729 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2019-02-25 15:14:06,729 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:06,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:06,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times [2019-02-25 15:14:06,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:06,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:06,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:14:06,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:06,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:08,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:08,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:08,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:08,412 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:08,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:08,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:08,413 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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:08,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:08,424 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:14:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:08,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 184 conjunts are in the unsatisfiable core [2019-02-25 15:14:08,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:08,494 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:14:08,494 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:08,505 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:08,505 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:14:10,535 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:10,536 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:14,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:14,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:14,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 159 [2019-02-25 15:14:14,142 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:14,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-02-25 15:14:14,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-02-25 15:14:14,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-02-25 15:14:14,144 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2019-02-25 15:14:14,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:14,594 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2019-02-25 15:14:14,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-25 15:14:14,594 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2019-02-25 15:14:14,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:14,596 INFO L225 Difference]: With dead ends: 243 [2019-02-25 15:14:14,596 INFO L226 Difference]: Without dead ends: 242 [2019-02-25 15:14:14,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 352 SyntacticMatches, 18 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14373 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-02-25 15:14:14,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-02-25 15:14:14,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-02-25 15:14:14,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-02-25 15:14:14,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-02-25 15:14:14,601 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2019-02-25 15:14:14,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:14,601 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-02-25 15:14:14,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-02-25 15:14:14,601 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-02-25 15:14:14,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-02-25 15:14:14,602 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:14,602 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2019-02-25 15:14:14,603 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:14,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:14,603 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times [2019-02-25 15:14:14,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:14,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:14,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:14,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:14,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:16,635 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:16,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:16,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:16,635 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:16,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:16,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:16,636 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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:16,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:14:16,646 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:14:16,901 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-02-25 15:14:16,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:14:16,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 187 conjunts are in the unsatisfiable core [2019-02-25 15:14:16,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:16,914 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:14:16,914 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:16,923 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:16,923 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:14:18,999 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:18,999 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:22,774 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:22,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:22,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 160 [2019-02-25 15:14:22,793 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:22,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-02-25 15:14:22,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-02-25 15:14:22,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-02-25 15:14:22,795 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2019-02-25 15:14:23,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:23,254 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2019-02-25 15:14:23,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-25 15:14:23,255 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2019-02-25 15:14:23,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:23,256 INFO L225 Difference]: With dead ends: 247 [2019-02-25 15:14:23,256 INFO L226 Difference]: Without dead ends: 246 [2019-02-25 15:14:23,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 358 SyntacticMatches, 20 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14870 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-02-25 15:14:23,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-02-25 15:14:23,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2019-02-25 15:14:23,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-02-25 15:14:23,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2019-02-25 15:14:23,262 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2019-02-25 15:14:23,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:23,263 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2019-02-25 15:14:23,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-02-25 15:14:23,263 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2019-02-25 15:14:23,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-02-25 15:14:23,264 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:23,264 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2019-02-25 15:14:23,264 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:23,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:23,265 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times [2019-02-25 15:14:23,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:23,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:23,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:14:23,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:23,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:25,035 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:25,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:25,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:25,035 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:25,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:25,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:25,035 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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:25,045 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:14:25,045 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:14:25,120 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:14:25,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:14:25,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 190 conjunts are in the unsatisfiable core [2019-02-25 15:14:25,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:25,145 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:14:25,146 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:25,162 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:25,162 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:14:27,504 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:27,504 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:31,243 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:31,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:31,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 161 [2019-02-25 15:14:31,262 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:31,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-02-25 15:14:31,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-02-25 15:14:31,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-02-25 15:14:31,264 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2019-02-25 15:14:31,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:31,745 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2019-02-25 15:14:31,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-25 15:14:31,745 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2019-02-25 15:14:31,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:31,746 INFO L225 Difference]: With dead ends: 251 [2019-02-25 15:14:31,746 INFO L226 Difference]: Without dead ends: 250 [2019-02-25 15:14:31,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 364 SyntacticMatches, 22 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15367 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-02-25 15:14:31,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-02-25 15:14:31,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2019-02-25 15:14:31,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-02-25 15:14:31,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2019-02-25 15:14:31,753 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2019-02-25 15:14:31,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:31,753 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2019-02-25 15:14:31,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-02-25 15:14:31,753 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2019-02-25 15:14:31,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-02-25 15:14:31,755 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:31,755 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2019-02-25 15:14:31,755 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:31,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:31,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times [2019-02-25 15:14:31,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:31,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:31,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:14:31,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:31,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:33,756 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:33,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:33,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:33,756 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:33,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:33,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:33,757 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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:33,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:33,765 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:14:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:33,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 193 conjunts are in the unsatisfiable core [2019-02-25 15:14:33,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:33,852 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:14:33,853 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:33,862 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:33,862 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:14:36,104 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:36,104 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:39,878 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:39,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:39,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 162 [2019-02-25 15:14:39,897 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:39,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-02-25 15:14:39,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-02-25 15:14:39,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-02-25 15:14:39,899 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2019-02-25 15:14:40,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:40,339 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-02-25 15:14:40,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-25 15:14:40,339 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2019-02-25 15:14:40,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:40,340 INFO L225 Difference]: With dead ends: 255 [2019-02-25 15:14:40,340 INFO L226 Difference]: Without dead ends: 254 [2019-02-25 15:14:40,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 370 SyntacticMatches, 24 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15864 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-02-25 15:14:40,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-02-25 15:14:40,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-02-25 15:14:40,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-02-25 15:14:40,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-02-25 15:14:40,345 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2019-02-25 15:14:40,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:40,345 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-02-25 15:14:40,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-02-25 15:14:40,345 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-02-25 15:14:40,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-02-25 15:14:40,346 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:40,346 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2019-02-25 15:14:40,346 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:40,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:40,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times [2019-02-25 15:14:40,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:40,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:40,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:40,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:40,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:42,445 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:42,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:42,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:42,445 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:42,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:42,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:42,445 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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:42,456 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:14:42,456 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:14:42,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-02-25 15:14:42,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:14:42,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 196 conjunts are in the unsatisfiable core [2019-02-25 15:14:42,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:42,776 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:14:42,776 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:42,784 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:42,784 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:14:45,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:45,084 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:48,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:48,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 163 [2019-02-25 15:14:48,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:48,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-02-25 15:14:48,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-02-25 15:14:48,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-02-25 15:14:48,961 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2019-02-25 15:14:49,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:49,410 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2019-02-25 15:14:49,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-25 15:14:49,410 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2019-02-25 15:14:49,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:49,412 INFO L225 Difference]: With dead ends: 259 [2019-02-25 15:14:49,412 INFO L226 Difference]: Without dead ends: 258 [2019-02-25 15:14:49,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 376 SyntacticMatches, 26 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16361 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-02-25 15:14:49,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-02-25 15:14:49,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-02-25 15:14:49,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-02-25 15:14:49,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-02-25 15:14:49,417 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2019-02-25 15:14:49,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:49,418 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2019-02-25 15:14:49,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-02-25 15:14:49,418 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2019-02-25 15:14:49,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-02-25 15:14:49,419 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:49,419 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2019-02-25 15:14:49,419 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:49,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:49,419 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times [2019-02-25 15:14:49,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:49,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:49,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:14:49,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:49,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:51,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:51,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:51,476 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:51,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:51,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:51,477 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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:51,491 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:14:51,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:14:51,576 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:14:51,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:14:51,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 199 conjunts are in the unsatisfiable core [2019-02-25 15:14:51,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:51,602 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:14:51,603 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:51,671 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:51,671 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:14:54,077 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:54,077 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:57,861 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:57,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:57,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 164 [2019-02-25 15:14:57,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:57,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-02-25 15:14:57,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-02-25 15:14:57,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-02-25 15:14:57,882 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2019-02-25 15:14:58,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:58,352 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2019-02-25 15:14:58,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-25 15:14:58,352 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2019-02-25 15:14:58,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:58,354 INFO L225 Difference]: With dead ends: 263 [2019-02-25 15:14:58,354 INFO L226 Difference]: Without dead ends: 262 [2019-02-25 15:14:58,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 382 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16858 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-02-25 15:14:58,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-02-25 15:14:58,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2019-02-25 15:14:58,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-02-25 15:14:58,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-02-25 15:14:58,360 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2019-02-25 15:14:58,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:58,360 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-02-25 15:14:58,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-02-25 15:14:58,360 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-02-25 15:14:58,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-02-25 15:14:58,362 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:58,362 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2019-02-25 15:14:58,362 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:58,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:58,363 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times [2019-02-25 15:14:58,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:58,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:58,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:14:58,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:58,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:00,423 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:00,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:00,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:00,424 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:00,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:00,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:00,424 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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:15:00,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:15:00,433 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:15:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:00,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 202 conjunts are in the unsatisfiable core [2019-02-25 15:15:00,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:00,513 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:15:00,514 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:15:00,528 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:15:00,528 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:15:03,185 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:03,185 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:15:06,998 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:07,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:15:07,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 165 [2019-02-25 15:15:07,017 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:15:07,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-02-25 15:15:07,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-02-25 15:15:07,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-02-25 15:15:07,019 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2019-02-25 15:15:07,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:15:07,511 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2019-02-25 15:15:07,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-25 15:15:07,512 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2019-02-25 15:15:07,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:15:07,513 INFO L225 Difference]: With dead ends: 267 [2019-02-25 15:15:07,513 INFO L226 Difference]: Without dead ends: 266 [2019-02-25 15:15:07,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 388 SyntacticMatches, 30 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17355 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-02-25 15:15:07,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-02-25 15:15:07,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-02-25 15:15:07,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-02-25 15:15:07,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-02-25 15:15:07,520 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2019-02-25 15:15:07,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:15:07,520 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2019-02-25 15:15:07,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-02-25 15:15:07,520 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2019-02-25 15:15:07,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-02-25 15:15:07,522 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:15:07,522 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2019-02-25 15:15:07,522 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:15:07,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:15:07,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times [2019-02-25 15:15:07,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:15:07,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:07,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:15:07,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:07,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:15:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:09,650 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:09,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:09,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:09,651 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:09,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:09,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:09,651 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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:15:09,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:15:09,659 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:15:09,968 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-02-25 15:15:09,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:15:09,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 205 conjunts are in the unsatisfiable core [2019-02-25 15:15:09,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:09,978 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:15:09,978 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:15:09,988 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:15:09,988 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:15:12,655 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:12,655 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:15:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:16,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:15:16,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 166 [2019-02-25 15:15:16,335 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:15:16,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-02-25 15:15:16,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-02-25 15:15:16,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-02-25 15:15:16,337 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2019-02-25 15:15:16,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:15:16,886 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2019-02-25 15:15:16,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-25 15:15:16,886 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2019-02-25 15:15:16,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:15:16,888 INFO L225 Difference]: With dead ends: 271 [2019-02-25 15:15:16,888 INFO L226 Difference]: Without dead ends: 270 [2019-02-25 15:15:16,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 394 SyntacticMatches, 32 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17852 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-02-25 15:15:16,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-02-25 15:15:16,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2019-02-25 15:15:16,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-02-25 15:15:16,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2019-02-25 15:15:16,895 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2019-02-25 15:15:16,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:15:16,895 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2019-02-25 15:15:16,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-02-25 15:15:16,896 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2019-02-25 15:15:16,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-02-25 15:15:16,897 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:15:16,897 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2019-02-25 15:15:16,897 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:15:16,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:15:16,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times [2019-02-25 15:15:16,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:15:16,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:16,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:15:16,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:16,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:15:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:19,422 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:19,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:19,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:19,422 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:19,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:19,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:19,422 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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:15:19,431 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:15:19,431 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:15:19,513 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:15:19,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:15:19,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 208 conjunts are in the unsatisfiable core [2019-02-25 15:15:19,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:19,524 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:15:19,524 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:15:19,533 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:15:19,533 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:15:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:22,113 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:15:25,887 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:25,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:15:25,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 167 [2019-02-25 15:15:25,905 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:15:25,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-02-25 15:15:25,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-02-25 15:15:25,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-02-25 15:15:25,908 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2019-02-25 15:15:26,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:15:26,405 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-02-25 15:15:26,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-25 15:15:26,405 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2019-02-25 15:15:26,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:15:26,407 INFO L225 Difference]: With dead ends: 275 [2019-02-25 15:15:26,407 INFO L226 Difference]: Without dead ends: 274 [2019-02-25 15:15:26,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 400 SyntacticMatches, 34 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18349 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-02-25 15:15:26,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-02-25 15:15:26,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2019-02-25 15:15:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-02-25 15:15:26,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2019-02-25 15:15:26,413 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2019-02-25 15:15:26,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:15:26,413 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2019-02-25 15:15:26,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-02-25 15:15:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2019-02-25 15:15:26,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-02-25 15:15:26,414 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:15:26,414 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2019-02-25 15:15:26,414 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:15:26,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:15:26,415 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times [2019-02-25 15:15:26,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:15:26,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:26,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:15:26,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:26,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:15:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:28,884 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:28,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:28,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:28,884 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:28,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:28,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:28,885 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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:15:28,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:15:28,893 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:15:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:28,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 211 conjunts are in the unsatisfiable core [2019-02-25 15:15:28,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:28,971 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:15:28,971 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:15:28,983 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:15:28,983 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:15:31,619 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:31,620 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:15:35,650 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:35,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:15:35,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 168 [2019-02-25 15:15:35,670 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:15:35,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-02-25 15:15:35,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-02-25 15:15:35,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-02-25 15:15:35,672 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2019-02-25 15:15:36,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:15:36,284 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2019-02-25 15:15:36,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-25 15:15:36,284 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2019-02-25 15:15:36,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:15:36,286 INFO L225 Difference]: With dead ends: 279 [2019-02-25 15:15:36,286 INFO L226 Difference]: Without dead ends: 278 [2019-02-25 15:15:36,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 406 SyntacticMatches, 36 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18846 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-02-25 15:15:36,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-02-25 15:15:36,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-02-25 15:15:36,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-02-25 15:15:36,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-02-25 15:15:36,292 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2019-02-25 15:15:36,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:15:36,293 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-02-25 15:15:36,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-02-25 15:15:36,293 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-02-25 15:15:36,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-02-25 15:15:36,294 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:15:36,294 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2019-02-25 15:15:36,294 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:15:36,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:15:36,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times [2019-02-25 15:15:36,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:15:36,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:36,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:15:36,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:36,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:15:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:38,831 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:38,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:38,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:38,832 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:38,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:38,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:38,832 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:15:38,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:15:38,843 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:15:39,219 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-02-25 15:15:39,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:15:39,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 214 conjunts are in the unsatisfiable core [2019-02-25 15:15:39,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:39,231 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:15:39,231 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:15:39,240 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:15:39,240 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:15:41,983 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:41,984 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:15:45,888 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:45,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:15:45,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 169 [2019-02-25 15:15:45,907 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:15:45,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-02-25 15:15:45,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-02-25 15:15:45,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-02-25 15:15:45,909 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2019-02-25 15:15:46,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:15:46,422 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2019-02-25 15:15:46,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-25 15:15:46,423 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2019-02-25 15:15:46,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:15:46,425 INFO L225 Difference]: With dead ends: 283 [2019-02-25 15:15:46,425 INFO L226 Difference]: Without dead ends: 282 [2019-02-25 15:15:46,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 412 SyntacticMatches, 38 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19343 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-02-25 15:15:46,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-02-25 15:15:46,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2019-02-25 15:15:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-02-25 15:15:46,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-02-25 15:15:46,431 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2019-02-25 15:15:46,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:15:46,432 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-02-25 15:15:46,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-02-25 15:15:46,432 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-02-25 15:15:46,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-02-25 15:15:46,433 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:15:46,433 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2019-02-25 15:15:46,433 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:15:46,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:15:46,434 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times [2019-02-25 15:15:46,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:15:46,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:46,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:15:46,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:46,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:15:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:48,976 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:48,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:48,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:48,976 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:48,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:48,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:48,977 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:15:48,984 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:15:48,984 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:15:49,067 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:15:49,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:15:49,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 217 conjunts are in the unsatisfiable core [2019-02-25 15:15:49,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:49,078 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:15:49,078 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:15:49,091 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:15:49,091 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:15:51,859 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:51,859 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:15:55,928 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:55,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:15:55,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 170 [2019-02-25 15:15:55,947 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:15:55,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-02-25 15:15:55,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-02-25 15:15:55,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-02-25 15:15:55,949 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2019-02-25 15:15:56,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:15:56,510 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2019-02-25 15:15:56,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-25 15:15:56,510 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2019-02-25 15:15:56,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:15:56,512 INFO L225 Difference]: With dead ends: 287 [2019-02-25 15:15:56,512 INFO L226 Difference]: Without dead ends: 286 [2019-02-25 15:15:56,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 418 SyntacticMatches, 40 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19840 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-02-25 15:15:56,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-02-25 15:15:56,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2019-02-25 15:15:56,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-02-25 15:15:56,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2019-02-25 15:15:56,518 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2019-02-25 15:15:56,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:15:56,519 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2019-02-25 15:15:56,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-02-25 15:15:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2019-02-25 15:15:56,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-02-25 15:15:56,520 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:15:56,520 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2019-02-25 15:15:56,520 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:15:56,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:15:56,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times [2019-02-25 15:15:56,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:15:56,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:56,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:15:56,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:56,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:15:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:59,079 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:59,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:59,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:59,080 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:59,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:59,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:59,080 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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:15:59,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:15:59,090 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:15:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:59,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 220 conjunts are in the unsatisfiable core [2019-02-25 15:15:59,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:59,176 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:15:59,176 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:15:59,187 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:15:59,187 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:16:02,002 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:02,002 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:16:06,143 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:06,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:16:06,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 171 [2019-02-25 15:16:06,162 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:16:06,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-02-25 15:16:06,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-02-25 15:16:06,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-02-25 15:16:06,164 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2019-02-25 15:16:06,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:16:06,722 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-02-25 15:16:06,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-25 15:16:06,722 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2019-02-25 15:16:06,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:16:06,724 INFO L225 Difference]: With dead ends: 291 [2019-02-25 15:16:06,724 INFO L226 Difference]: Without dead ends: 290 [2019-02-25 15:16:06,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 424 SyntacticMatches, 42 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20337 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-02-25 15:16:06,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-02-25 15:16:06,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-02-25 15:16:06,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-02-25 15:16:06,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2019-02-25 15:16:06,729 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2019-02-25 15:16:06,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:16:06,729 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2019-02-25 15:16:06,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-02-25 15:16:06,729 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2019-02-25 15:16:06,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-02-25 15:16:06,730 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:16:06,730 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2019-02-25 15:16:06,731 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:16:06,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:16:06,731 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times [2019-02-25 15:16:06,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:16:06,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:06,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:16:06,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:06,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:16:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:09,377 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:09,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:09,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:16:09,377 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:16:09,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:16:09,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:09,377 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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:16:09,386 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:16:09,386 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:16:09,759 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-02-25 15:16:09,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:16:09,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 223 conjunts are in the unsatisfiable core [2019-02-25 15:16:09,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:16:09,770 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:16:09,770 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:16:09,779 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:16:09,779 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:16:12,868 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:12,868 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:16:17,020 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:17,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:16:17,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 172 [2019-02-25 15:16:17,039 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:16:17,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-02-25 15:16:17,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-02-25 15:16:17,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-02-25 15:16:17,042 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2019-02-25 15:16:17,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:16:17,621 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-02-25 15:16:17,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-25 15:16:17,621 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2019-02-25 15:16:17,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:16:17,623 INFO L225 Difference]: With dead ends: 295 [2019-02-25 15:16:17,623 INFO L226 Difference]: Without dead ends: 294 [2019-02-25 15:16:17,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 430 SyntacticMatches, 44 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20834 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-02-25 15:16:17,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-02-25 15:16:17,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-02-25 15:16:17,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-02-25 15:16:17,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2019-02-25 15:16:17,628 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2019-02-25 15:16:17,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:16:17,628 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2019-02-25 15:16:17,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-02-25 15:16:17,628 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2019-02-25 15:16:17,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-02-25 15:16:17,630 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:16:17,630 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2019-02-25 15:16:17,630 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:16:17,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:16:17,631 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times [2019-02-25 15:16:17,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:16:17,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:17,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:16:17,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:17,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:16:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:20,491 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:20,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:20,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:16:20,491 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:16:20,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:16:20,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:20,491 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:16:20,499 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:16:20,499 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:16:20,593 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:16:20,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:16:20,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 226 conjunts are in the unsatisfiable core [2019-02-25 15:16:20,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:16:20,618 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:16:20,618 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:16:20,631 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:16:20,631 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:16:23,733 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:23,733 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:16:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:27,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:16:27,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 173 [2019-02-25 15:16:27,644 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:16:27,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-02-25 15:16:27,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-02-25 15:16:27,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-02-25 15:16:27,646 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2019-02-25 15:16:28,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:16:28,275 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2019-02-25 15:16:28,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-25 15:16:28,275 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2019-02-25 15:16:28,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:16:28,277 INFO L225 Difference]: With dead ends: 299 [2019-02-25 15:16:28,277 INFO L226 Difference]: Without dead ends: 298 [2019-02-25 15:16:28,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 436 SyntacticMatches, 46 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21331 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-02-25 15:16:28,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-02-25 15:16:28,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2019-02-25 15:16:28,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-02-25 15:16:28,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-02-25 15:16:28,283 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2019-02-25 15:16:28,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:16:28,284 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2019-02-25 15:16:28,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-02-25 15:16:28,284 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2019-02-25 15:16:28,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-02-25 15:16:28,285 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:16:28,285 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2019-02-25 15:16:28,285 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:16:28,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:16:28,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times [2019-02-25 15:16:28,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:16:28,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:28,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:16:28,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:28,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:16:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:31,086 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:31,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:31,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:16:31,086 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:16:31,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:16:31,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:31,087 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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:16:31,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:16:31,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:16:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:31,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 229 conjunts are in the unsatisfiable core [2019-02-25 15:16:31,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:16:31,185 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:16:31,185 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:16:31,196 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:16:31,196 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:16:34,447 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:34,447 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:16:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:38,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:16:38,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 174 [2019-02-25 15:16:38,281 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:16:38,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-02-25 15:16:38,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-02-25 15:16:38,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-02-25 15:16:38,283 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2019-02-25 15:16:38,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:16:38,797 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2019-02-25 15:16:38,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-25 15:16:38,798 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2019-02-25 15:16:38,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:16:38,800 INFO L225 Difference]: With dead ends: 303 [2019-02-25 15:16:38,800 INFO L226 Difference]: Without dead ends: 302 [2019-02-25 15:16:38,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 442 SyntacticMatches, 48 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21828 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-02-25 15:16:38,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-02-25 15:16:38,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-02-25 15:16:38,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-02-25 15:16:38,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-02-25 15:16:38,805 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2019-02-25 15:16:38,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:16:38,806 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-02-25 15:16:38,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-02-25 15:16:38,806 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-02-25 15:16:38,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-02-25 15:16:38,807 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:16:38,807 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2019-02-25 15:16:38,807 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:16:38,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:16:38,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times [2019-02-25 15:16:38,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:16:38,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:38,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:16:38,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:38,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:16:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:41,656 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:41,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:41,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:16:41,656 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:16:41,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:16:41,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:41,657 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 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:16:41,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:16:41,665 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:16:42,066 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-02-25 15:16:42,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:16:42,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 232 conjunts are in the unsatisfiable core [2019-02-25 15:16:42,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:16:42,076 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:16:42,076 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:16:42,088 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:16:42,088 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:16:45,547 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:45,547 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:16:49,612 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:49,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:16:49,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 175 [2019-02-25 15:16:49,632 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:16:49,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-02-25 15:16:49,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-02-25 15:16:49,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-02-25 15:16:49,634 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2019-02-25 15:16:50,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:16:50,264 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2019-02-25 15:16:50,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-25 15:16:50,264 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2019-02-25 15:16:50,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:16:50,266 INFO L225 Difference]: With dead ends: 307 [2019-02-25 15:16:50,266 INFO L226 Difference]: Without dead ends: 306 [2019-02-25 15:16:50,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 673 GetRequests, 448 SyntacticMatches, 50 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22325 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-02-25 15:16:50,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-02-25 15:16:50,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-02-25 15:16:50,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-02-25 15:16:50,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2019-02-25 15:16:50,272 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2019-02-25 15:16:50,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:16:50,272 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2019-02-25 15:16:50,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-02-25 15:16:50,272 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2019-02-25 15:16:50,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-02-25 15:16:50,273 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:16:50,273 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2019-02-25 15:16:50,273 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:16:50,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:16:50,274 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times [2019-02-25 15:16:50,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:16:50,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:50,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:16:50,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:50,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:16:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:52,956 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:52,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:52,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:16:52,957 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:16:52,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:16:52,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:52,957 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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:16:52,965 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:16:52,965 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:16:53,053 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:16:53,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:16:53,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 235 conjunts are in the unsatisfiable core [2019-02-25 15:16:53,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:16:53,064 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:16:53,064 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:16:53,073 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:16:53,073 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:16:56,428 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:56,428 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:17:00,569 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:00,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:17:00,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 176 [2019-02-25 15:17:00,588 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:17:00,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-02-25 15:17:00,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-02-25 15:17:00,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-02-25 15:17:00,590 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. [2019-02-25 15:17:01,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:17:01,206 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2019-02-25 15:17:01,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-25 15:17:01,207 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 304 [2019-02-25 15:17:01,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:17:01,208 INFO L225 Difference]: With dead ends: 311 [2019-02-25 15:17:01,208 INFO L226 Difference]: Without dead ends: 310 [2019-02-25 15:17:01,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 454 SyntacticMatches, 52 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22822 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-02-25 15:17:01,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-02-25 15:17:01,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2019-02-25 15:17:01,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-02-25 15:17:01,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2019-02-25 15:17:01,213 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304 [2019-02-25 15:17:01,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:17:01,213 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2019-02-25 15:17:01,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-02-25 15:17:01,213 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2019-02-25 15:17:01,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-02-25 15:17:01,215 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:17:01,215 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1] [2019-02-25 15:17:01,215 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:17:01,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:17:01,215 INFO L82 PathProgramCache]: Analyzing trace with hash -789644462, now seen corresponding path program 76 times [2019-02-25 15:17:01,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:17:01,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:01,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:17:01,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:01,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:17:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:17:04,038 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:04,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:04,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:17:04,038 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:17:04,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:17:04,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:04,038 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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:17:04,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:17:04,046 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:17:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:17:04,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 238 conjunts are in the unsatisfiable core [2019-02-25 15:17:04,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:17:04,139 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:17:04,139 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:17:04,148 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:17:04,148 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:17:07,595 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:07,595 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:17:11,906 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:11,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:17:11,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 177 [2019-02-25 15:17:11,925 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:17:11,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-02-25 15:17:11,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-02-25 15:17:11,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-02-25 15:17:11,928 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 156 states. [2019-02-25 15:17:12,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:17:12,551 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-02-25 15:17:12,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-25 15:17:12,551 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 308 [2019-02-25 15:17:12,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:17:12,553 INFO L225 Difference]: With dead ends: 315 [2019-02-25 15:17:12,553 INFO L226 Difference]: Without dead ends: 314 [2019-02-25 15:17:12,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 460 SyntacticMatches, 54 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23319 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-02-25 15:17:12,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-02-25 15:17:12,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 313. [2019-02-25 15:17:12,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-02-25 15:17:12,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2019-02-25 15:17:12,559 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 308 [2019-02-25 15:17:12,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:17:12,559 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2019-02-25 15:17:12,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-02-25 15:17:12,560 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2019-02-25 15:17:12,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-02-25 15:17:12,561 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:17:12,561 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1] [2019-02-25 15:17:12,561 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:17:12,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:17:12,561 INFO L82 PathProgramCache]: Analyzing trace with hash 2140213899, now seen corresponding path program 77 times [2019-02-25 15:17:12,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:17:12,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:12,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:17:12,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:12,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:17:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:17:15,756 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:15,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:15,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:17:15,757 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:17:15,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:17:15,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:15,757 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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:17:15,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:17:15,765 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:17:16,189 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-02-25 15:17:16,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:17:16,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 241 conjunts are in the unsatisfiable core [2019-02-25 15:17:16,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:17:16,201 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:17:16,201 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:17:16,216 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:17:16,216 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:17:19,603 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:19,604 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:17:23,947 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:23,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:17:23,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 178 [2019-02-25 15:17:23,966 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:17:23,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-02-25 15:17:23,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-02-25 15:17:23,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-02-25 15:17:23,969 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 158 states. [2019-02-25 15:17:24,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:17:24,596 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2019-02-25 15:17:24,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-25 15:17:24,596 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 312 [2019-02-25 15:17:24,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:17:24,598 INFO L225 Difference]: With dead ends: 319 [2019-02-25 15:17:24,598 INFO L226 Difference]: Without dead ends: 318 [2019-02-25 15:17:24,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 466 SyntacticMatches, 56 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23816 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-02-25 15:17:24,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-02-25 15:17:24,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2019-02-25 15:17:24,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-02-25 15:17:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2019-02-25 15:17:24,604 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 312 [2019-02-25 15:17:24,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:17:24,604 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2019-02-25 15:17:24,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-02-25 15:17:24,604 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2019-02-25 15:17:24,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-02-25 15:17:24,605 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:17:24,605 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 1, 1] [2019-02-25 15:17:24,605 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:17:24,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:17:24,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1416815940, now seen corresponding path program 78 times [2019-02-25 15:17:24,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:17:24,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:24,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:17:24,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:24,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:17:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:17:27,789 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:27,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:27,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:17:27,789 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:17:27,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:17:27,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:27,790 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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:17:27,797 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:17:27,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:17:27,893 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:17:27,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:17:27,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 244 conjunts are in the unsatisfiable core [2019-02-25 15:17:27,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:17:27,905 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:17:27,905 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:17:27,915 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:17:27,915 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:17:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:31,740 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:17:35,928 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:35,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:17:35,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 179 [2019-02-25 15:17:35,947 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:17:35,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-02-25 15:17:35,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-02-25 15:17:35,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-02-25 15:17:35,950 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 160 states. [2019-02-25 15:17:36,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:17:36,634 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2019-02-25 15:17:36,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-25 15:17:36,634 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 316 [2019-02-25 15:17:36,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:17:36,636 INFO L225 Difference]: With dead ends: 323 [2019-02-25 15:17:36,636 INFO L226 Difference]: Without dead ends: 322 [2019-02-25 15:17:36,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 472 SyntacticMatches, 58 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24313 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-02-25 15:17:36,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-02-25 15:17:36,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2019-02-25 15:17:36,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-02-25 15:17:36,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-02-25 15:17:36,641 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 316 [2019-02-25 15:17:36,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:17:36,642 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-02-25 15:17:36,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-02-25 15:17:36,642 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-02-25 15:17:36,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-02-25 15:17:36,643 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:17:36,643 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 1, 1] [2019-02-25 15:17:36,643 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:17:36,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:17:36,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1783280509, now seen corresponding path program 79 times [2019-02-25 15:17:36,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:17:36,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:36,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:17:36,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:36,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:17:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:17:39,605 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:39,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:39,605 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:17:39,605 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:17:39,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:17:39,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:39,605 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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:17:39,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:17:39,614 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:17:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:17:39,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 247 conjunts are in the unsatisfiable core [2019-02-25 15:17:39,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:17:39,707 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:17:39,708 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:17:39,719 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:17:39,719 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:17:43,426 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:43,426 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:17:47,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:47,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:17:47,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 180 [2019-02-25 15:17:47,691 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:17:47,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-02-25 15:17:47,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-02-25 15:17:47,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-02-25 15:17:47,694 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 162 states. [2019-02-25 15:17:48,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:17:48,352 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2019-02-25 15:17:48,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-25 15:17:48,352 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 320 [2019-02-25 15:17:48,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:17:48,353 INFO L225 Difference]: With dead ends: 327 [2019-02-25 15:17:48,354 INFO L226 Difference]: Without dead ends: 326 [2019-02-25 15:17:48,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 478 SyntacticMatches, 60 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24810 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-02-25 15:17:48,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-02-25 15:17:48,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2019-02-25 15:17:48,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-02-25 15:17:48,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2019-02-25 15:17:48,360 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 320 [2019-02-25 15:17:48,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:17:48,360 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2019-02-25 15:17:48,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-02-25 15:17:48,360 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2019-02-25 15:17:48,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-02-25 15:17:48,361 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:17:48,361 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 1, 1] [2019-02-25 15:17:48,361 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:17:48,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:17:48,362 INFO L82 PathProgramCache]: Analyzing trace with hash 380550454, now seen corresponding path program 80 times [2019-02-25 15:17:48,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:17:48,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:48,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:17:48,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:48,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:17:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:17:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:51,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:51,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:17:51,715 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:17:51,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:17:51,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:51,715 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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:17:51,723 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:17:51,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:17:52,200 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-02-25 15:17:52,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:17:52,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 250 conjunts are in the unsatisfiable core [2019-02-25 15:17:52,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:17:52,215 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:17:52,215 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:17:52,224 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:17:52,224 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:17:55,899 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:55,899 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:18:00,208 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:00,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:18:00,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 181 [2019-02-25 15:18:00,227 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:18:00,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-02-25 15:18:00,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-02-25 15:18:00,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-02-25 15:18:00,230 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 164 states. [2019-02-25 15:18:00,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:18:00,950 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2019-02-25 15:18:00,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-25 15:18:00,951 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 324 [2019-02-25 15:18:00,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:18:00,952 INFO L225 Difference]: With dead ends: 331 [2019-02-25 15:18:00,952 INFO L226 Difference]: Without dead ends: 330 [2019-02-25 15:18:00,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 484 SyntacticMatches, 62 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25307 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-02-25 15:18:00,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-02-25 15:18:00,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2019-02-25 15:18:00,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-02-25 15:18:00,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2019-02-25 15:18:00,958 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 324 [2019-02-25 15:18:00,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:18:00,958 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2019-02-25 15:18:00,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-02-25 15:18:00,958 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2019-02-25 15:18:00,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-02-25 15:18:00,960 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:18:00,960 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 1, 1] [2019-02-25 15:18:00,960 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:18:00,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:18:00,960 INFO L82 PathProgramCache]: Analyzing trace with hash 2048213615, now seen corresponding path program 81 times [2019-02-25 15:18:00,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:18:00,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:00,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:18:00,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:00,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:18:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:04,114 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:04,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:04,115 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:18:04,115 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:18:04,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:18:04,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:04,115 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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:18:04,123 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:18:04,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:18:04,222 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:18:04,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:18:04,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 253 conjunts are in the unsatisfiable core [2019-02-25 15:18:04,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:18:04,234 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:18:04,234 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:18:04,245 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:18:04,245 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:18:08,274 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:08,275 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:18:12,675 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:12,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:18:12,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 182 [2019-02-25 15:18:12,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:18:12,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-02-25 15:18:12,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-02-25 15:18:12,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-02-25 15:18:12,697 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 166 states. [2019-02-25 15:18:13,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:18:13,383 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-02-25 15:18:13,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-25 15:18:13,384 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 328 [2019-02-25 15:18:13,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:18:13,385 INFO L225 Difference]: With dead ends: 335 [2019-02-25 15:18:13,385 INFO L226 Difference]: Without dead ends: 334 [2019-02-25 15:18:13,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 490 SyntacticMatches, 64 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25804 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-02-25 15:18:13,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-02-25 15:18:13,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2019-02-25 15:18:13,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-02-25 15:18:13,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2019-02-25 15:18:13,391 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 328 [2019-02-25 15:18:13,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:18:13,391 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2019-02-25 15:18:13,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-02-25 15:18:13,392 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2019-02-25 15:18:13,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-02-25 15:18:13,393 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:18:13,393 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 1, 1] [2019-02-25 15:18:13,393 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:18:13,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:18:13,393 INFO L82 PathProgramCache]: Analyzing trace with hash 265585448, now seen corresponding path program 82 times [2019-02-25 15:18:13,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:18:13,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:13,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:18:13,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:13,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:18:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:16,848 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:16,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:16,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:18:16,849 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:18:16,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:18:16,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:16,849 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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:18:16,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:18:16,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:18:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:16,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 256 conjunts are in the unsatisfiable core [2019-02-25 15:18:16,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:18:16,957 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:18:16,957 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:18:16,966 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:18:16,966 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:18:20,775 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:20,775 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:18:25,177 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:25,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:18:25,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 183 [2019-02-25 15:18:25,197 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:18:25,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-02-25 15:18:25,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-02-25 15:18:25,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-02-25 15:18:25,199 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 168 states. [2019-02-25 15:18:25,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:18:25,859 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2019-02-25 15:18:25,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-25 15:18:25,860 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 332 [2019-02-25 15:18:25,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:18:25,861 INFO L225 Difference]: With dead ends: 339 [2019-02-25 15:18:25,861 INFO L226 Difference]: Without dead ends: 338 [2019-02-25 15:18:25,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 496 SyntacticMatches, 66 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26301 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-02-25 15:18:25,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-02-25 15:18:25,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2019-02-25 15:18:25,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-02-25 15:18:25,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2019-02-25 15:18:25,867 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 332 [2019-02-25 15:18:25,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:18:25,867 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2019-02-25 15:18:25,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-02-25 15:18:25,867 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2019-02-25 15:18:25,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-02-25 15:18:25,869 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:18:25,869 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 1, 1] [2019-02-25 15:18:25,869 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:18:25,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:18:25,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1042464609, now seen corresponding path program 83 times [2019-02-25 15:18:25,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:18:25,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:25,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:18:25,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:25,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:18:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:29,357 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:29,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:29,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:18:29,357 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:18:29,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:18:29,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:29,357 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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:18:29,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:18:29,367 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:18:29,869 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-02-25 15:18:29,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:18:29,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 259 conjunts are in the unsatisfiable core [2019-02-25 15:18:29,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:18:29,880 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:18:29,881 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:18:29,892 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:18:29,892 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:18:34,024 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:34,024 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:18:38,463 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:38,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:18:38,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 184 [2019-02-25 15:18:38,483 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:18:38,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-02-25 15:18:38,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-02-25 15:18:38,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-02-25 15:18:38,486 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 170 states. [2019-02-25 15:18:39,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:18:39,255 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2019-02-25 15:18:39,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-25 15:18:39,256 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 336 [2019-02-25 15:18:39,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:18:39,258 INFO L225 Difference]: With dead ends: 343 [2019-02-25 15:18:39,258 INFO L226 Difference]: Without dead ends: 342 [2019-02-25 15:18:39,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 502 SyntacticMatches, 68 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26798 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-02-25 15:18:39,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-02-25 15:18:39,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2019-02-25 15:18:39,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-02-25 15:18:39,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-02-25 15:18:39,264 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 336 [2019-02-25 15:18:39,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:18:39,265 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-02-25 15:18:39,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-02-25 15:18:39,265 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-02-25 15:18:39,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-02-25 15:18:39,266 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:18:39,267 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 1, 1] [2019-02-25 15:18:39,267 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:18:39,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:18:39,267 INFO L82 PathProgramCache]: Analyzing trace with hash -434751718, now seen corresponding path program 84 times [2019-02-25 15:18:39,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:18:39,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:39,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:18:39,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:39,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:18:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:42,902 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:42,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:42,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:18:42,902 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:18:42,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:18:42,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:42,903 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:18:42,911 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:18:42,911 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:18:43,011 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:18:43,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:18:43,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 262 conjunts are in the unsatisfiable core [2019-02-25 15:18:43,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:18:43,024 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:18:43,024 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:18:43,033 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:18:43,033 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:18:47,192 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:47,192 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:18:51,497 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:51,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:18:51,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 185 [2019-02-25 15:18:51,517 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:18:51,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-02-25 15:18:51,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-02-25 15:18:51,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-02-25 15:18:51,519 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 172 states. [2019-02-25 15:18:52,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:18:52,364 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2019-02-25 15:18:52,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-25 15:18:52,365 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 340 [2019-02-25 15:18:52,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:18:52,367 INFO L225 Difference]: With dead ends: 347 [2019-02-25 15:18:52,367 INFO L226 Difference]: Without dead ends: 346 [2019-02-25 15:18:52,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 508 SyntacticMatches, 70 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27295 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-02-25 15:18:52,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-02-25 15:18:52,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2019-02-25 15:18:52,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-02-25 15:18:52,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2019-02-25 15:18:52,374 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 340 [2019-02-25 15:18:52,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:18:52,375 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2019-02-25 15:18:52,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-02-25 15:18:52,375 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2019-02-25 15:18:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-02-25 15:18:52,376 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:18:52,376 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 1, 1] [2019-02-25 15:18:52,377 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:18:52,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:18:52,377 INFO L82 PathProgramCache]: Analyzing trace with hash -207279533, now seen corresponding path program 85 times [2019-02-25 15:18:52,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:18:52,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:52,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:18:52,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:52,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:18:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:55,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:55,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:18:55,739 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:18:55,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:18:55,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:55,740 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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:18:55,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:18:55,749 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:18:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:55,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 265 conjunts are in the unsatisfiable core [2019-02-25 15:18:55,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:18:55,850 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:18:55,850 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:18:55,861 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:18:55,861 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:19:00,280 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:00,280 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:19:04,639 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:04,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:19:04,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 186 [2019-02-25 15:19:04,658 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:19:04,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-02-25 15:19:04,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-02-25 15:19:04,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-02-25 15:19:04,662 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 174 states. [2019-02-25 15:19:05,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:19:05,436 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2019-02-25 15:19:05,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-25 15:19:05,437 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 344 [2019-02-25 15:19:05,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:19:05,439 INFO L225 Difference]: With dead ends: 351 [2019-02-25 15:19:05,439 INFO L226 Difference]: Without dead ends: 350 [2019-02-25 15:19:05,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 772 GetRequests, 514 SyntacticMatches, 72 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27792 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-02-25 15:19:05,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-02-25 15:19:05,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2019-02-25 15:19:05,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-02-25 15:19:05,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2019-02-25 15:19:05,445 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 344 [2019-02-25 15:19:05,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:19:05,446 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2019-02-25 15:19:05,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-02-25 15:19:05,446 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2019-02-25 15:19:05,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-02-25 15:19:05,447 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:19:05,447 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 1, 1] [2019-02-25 15:19:05,448 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:19:05,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:19:05,448 INFO L82 PathProgramCache]: Analyzing trace with hash -307898100, now seen corresponding path program 86 times [2019-02-25 15:19:05,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:19:05,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:05,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:19:05,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:05,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:19:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:19:09,542 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:09,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:09,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:19:09,543 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:19:09,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:19:09,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:09,543 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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:19:09,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:19:09,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:19:10,082 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2019-02-25 15:19:10,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:19:10,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 268 conjunts are in the unsatisfiable core [2019-02-25 15:19:10,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:19:10,096 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:19:10,096 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:19:10,108 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:19:10,109 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:19:14,514 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:14,515 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:19:18,845 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:18,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:19:18,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 187 [2019-02-25 15:19:18,865 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:19:18,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-02-25 15:19:18,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-02-25 15:19:18,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-02-25 15:19:18,868 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 176 states. [2019-02-25 15:19:19,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:19:19,603 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-02-25 15:19:19,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-25 15:19:19,603 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 348 [2019-02-25 15:19:19,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:19:19,605 INFO L225 Difference]: With dead ends: 355 [2019-02-25 15:19:19,605 INFO L226 Difference]: Without dead ends: 354 [2019-02-25 15:19:19,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 781 GetRequests, 520 SyntacticMatches, 74 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28289 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-02-25 15:19:19,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-02-25 15:19:19,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 353. [2019-02-25 15:19:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-02-25 15:19:19,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2019-02-25 15:19:19,610 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 348 [2019-02-25 15:19:19,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:19:19,611 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2019-02-25 15:19:19,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-02-25 15:19:19,611 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2019-02-25 15:19:19,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-02-25 15:19:19,612 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:19:19,612 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 1, 1] [2019-02-25 15:19:19,612 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:19:19,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:19:19,612 INFO L82 PathProgramCache]: Analyzing trace with hash -2050063547, now seen corresponding path program 87 times [2019-02-25 15:19:19,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:19:19,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:19,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:19:19,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:19,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:19:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:19:23,428 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:23,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:23,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:19:23,429 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:19:23,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:19:23,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:23,429 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:19:23,439 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:19:23,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:19:23,543 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:19:23,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:19:23,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 271 conjunts are in the unsatisfiable core [2019-02-25 15:19:23,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:19:23,555 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:19:23,556 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:19:23,566 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:19:23,566 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:19:27,857 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:27,857 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:19:32,284 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:32,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:19:32,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 188 [2019-02-25 15:19:32,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:19:32,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-02-25 15:19:32,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-02-25 15:19:32,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-02-25 15:19:32,308 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 178 states. [2019-02-25 15:19:32,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:19:32,999 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2019-02-25 15:19:32,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-02-25 15:19:32,999 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 352 [2019-02-25 15:19:33,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:19:33,001 INFO L225 Difference]: With dead ends: 359 [2019-02-25 15:19:33,001 INFO L226 Difference]: Without dead ends: 358 [2019-02-25 15:19:33,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 526 SyntacticMatches, 76 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28786 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-02-25 15:19:33,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-02-25 15:19:33,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2019-02-25 15:19:33,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-02-25 15:19:33,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2019-02-25 15:19:33,007 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 352 [2019-02-25 15:19:33,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:19:33,007 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2019-02-25 15:19:33,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-02-25 15:19:33,007 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2019-02-25 15:19:33,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-02-25 15:19:33,009 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:19:33,009 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 1, 1] [2019-02-25 15:19:33,009 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:19:33,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:19:33,009 INFO L82 PathProgramCache]: Analyzing trace with hash 682977534, now seen corresponding path program 88 times [2019-02-25 15:19:33,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:19:33,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:33,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:19:33,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:33,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:19:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:19:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:36,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:36,935 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:19:36,935 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:19:36,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:19:36,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:36,935 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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:19:36,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:19:36,944 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:19:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:19:37,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 274 conjunts are in the unsatisfiable core [2019-02-25 15:19:37,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:19:37,049 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:19:37,049 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:19:37,062 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:19:37,062 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:19:41,650 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:41,651 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:19:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:46,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:19:46,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 189 [2019-02-25 15:19:46,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:19:46,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2019-02-25 15:19:46,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2019-02-25 15:19:46,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-02-25 15:19:46,150 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 180 states. [2019-02-25 15:19:47,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:19:47,013 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2019-02-25 15:19:47,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-25 15:19:47,014 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 356 [2019-02-25 15:19:47,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:19:47,016 INFO L225 Difference]: With dead ends: 363 [2019-02-25 15:19:47,016 INFO L226 Difference]: Without dead ends: 362 [2019-02-25 15:19:47,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 532 SyntacticMatches, 78 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29283 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-02-25 15:19:47,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-02-25 15:19:47,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2019-02-25 15:19:47,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-02-25 15:19:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-02-25 15:19:47,021 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 356 [2019-02-25 15:19:47,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:19:47,022 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-02-25 15:19:47,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2019-02-25 15:19:47,022 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-02-25 15:19:47,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-02-25 15:19:47,023 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:19:47,023 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 1, 1] [2019-02-25 15:19:47,023 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:19:47,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:19:47,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1915696585, now seen corresponding path program 89 times [2019-02-25 15:19:47,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:19:47,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:47,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:19:47,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:47,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:19:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:19:51,017 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:51,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:51,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:19:51,018 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:19:51,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:19:51,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:51,018 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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:19:51,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:19:51,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:19:51,604 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2019-02-25 15:19:51,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:19:51,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 277 conjunts are in the unsatisfiable core [2019-02-25 15:19:51,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:19:51,624 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:19:51,624 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:19:51,633 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:19:51,633 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:19:56,366 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:56,366 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:00,696 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:00,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:00,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 190 [2019-02-25 15:20:00,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:00,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2019-02-25 15:20:00,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2019-02-25 15:20:00,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-02-25 15:20:00,719 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 182 states. [2019-02-25 15:20:01,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:01,530 INFO L93 Difference]: Finished difference Result 367 states and 367 transitions. [2019-02-25 15:20:01,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-25 15:20:01,531 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 360 [2019-02-25 15:20:01,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:01,533 INFO L225 Difference]: With dead ends: 367 [2019-02-25 15:20:01,533 INFO L226 Difference]: Without dead ends: 366 [2019-02-25 15:20:01,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 538 SyntacticMatches, 80 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29780 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-02-25 15:20:01,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-02-25 15:20:01,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2019-02-25 15:20:01,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-02-25 15:20:01,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 365 transitions. [2019-02-25 15:20:01,540 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 365 transitions. Word has length 360 [2019-02-25 15:20:01,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:01,540 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 365 transitions. [2019-02-25 15:20:01,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2019-02-25 15:20:01,540 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 365 transitions. [2019-02-25 15:20:01,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-02-25 15:20:01,541 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:01,542 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 90, 90, 1, 1] [2019-02-25 15:20:01,542 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:01,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:01,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1198974704, now seen corresponding path program 90 times [2019-02-25 15:20:01,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:01,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:01,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:20:01,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:01,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:05,608 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:05,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:05,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:05,609 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:20:05,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:20:05,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:05,609 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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:05,618 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:20:05,618 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:20:05,732 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:20:05,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:20:05,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 280 conjunts are in the unsatisfiable core [2019-02-25 15:20:05,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:05,744 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:20:05,744 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:05,754 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:05,754 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:20:10,612 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:10,612 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:15,064 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:15,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:15,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 191 [2019-02-25 15:20:15,083 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:15,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2019-02-25 15:20:15,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2019-02-25 15:20:15,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-02-25 15:20:15,086 INFO L87 Difference]: Start difference. First operand 365 states and 365 transitions. Second operand 184 states. [2019-02-25 15:20:15,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:15,797 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2019-02-25 15:20:15,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-25 15:20:15,798 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 364 [2019-02-25 15:20:15,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:15,799 INFO L225 Difference]: With dead ends: 371 [2019-02-25 15:20:15,799 INFO L226 Difference]: Without dead ends: 370 [2019-02-25 15:20:15,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 817 GetRequests, 544 SyntacticMatches, 82 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30277 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-02-25 15:20:15,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-02-25 15:20:15,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 369. [2019-02-25 15:20:15,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-02-25 15:20:15,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 369 transitions. [2019-02-25 15:20:15,805 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 369 transitions. Word has length 364 [2019-02-25 15:20:15,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:15,805 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 369 transitions. [2019-02-25 15:20:15,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2019-02-25 15:20:15,806 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 369 transitions. [2019-02-25 15:20:15,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-02-25 15:20:15,807 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:15,807 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 91, 91, 1, 1] [2019-02-25 15:20:15,807 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:15,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:15,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1390280489, now seen corresponding path program 91 times [2019-02-25 15:20:15,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:15,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:15,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:20:15,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:15,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:19,850 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:19,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:19,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:19,851 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:20:19,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:20:19,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:19,851 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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:19,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:19,862 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:20:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:19,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 283 conjunts are in the unsatisfiable core [2019-02-25 15:20:19,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:19,971 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:20:19,971 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:19,979 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:19,980 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:20:24,987 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:24,988 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:29,324 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:29,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:29,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 192 [2019-02-25 15:20:29,346 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:29,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2019-02-25 15:20:29,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2019-02-25 15:20:29,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-02-25 15:20:29,350 INFO L87 Difference]: Start difference. First operand 369 states and 369 transitions. Second operand 186 states. [2019-02-25 15:20:30,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:30,169 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2019-02-25 15:20:30,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-02-25 15:20:30,170 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 368 [2019-02-25 15:20:30,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:30,172 INFO L225 Difference]: With dead ends: 375 [2019-02-25 15:20:30,172 INFO L226 Difference]: Without dead ends: 374 [2019-02-25 15:20:30,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 826 GetRequests, 550 SyntacticMatches, 84 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30774 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-02-25 15:20:30,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-02-25 15:20:30,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2019-02-25 15:20:30,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-02-25 15:20:30,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2019-02-25 15:20:30,178 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 368 [2019-02-25 15:20:30,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:30,178 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2019-02-25 15:20:30,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2019-02-25 15:20:30,178 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2019-02-25 15:20:30,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-02-25 15:20:30,179 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:30,179 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 92, 92, 1, 1] [2019-02-25 15:20:30,180 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:30,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:30,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1474538782, now seen corresponding path program 92 times [2019-02-25 15:20:30,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:30,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:30,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:30,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:30,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:34,082 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:34,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:34,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:34,082 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:20:34,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:20:34,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:34,083 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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:34,090 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:20:34,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:20:34,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2019-02-25 15:20:34,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:20:34,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 286 conjunts are in the unsatisfiable core [2019-02-25 15:20:34,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:34,717 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:20:34,717 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:34,725 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:34,726 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:20:39,492 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:39,492 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:43,956 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:43,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:43,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 193 [2019-02-25 15:20:43,976 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:43,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2019-02-25 15:20:43,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2019-02-25 15:20:43,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-02-25 15:20:43,980 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 188 states. [2019-02-25 15:20:44,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:44,716 INFO L93 Difference]: Finished difference Result 379 states and 379 transitions. [2019-02-25 15:20:44,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-25 15:20:44,716 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 372 [2019-02-25 15:20:44,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:44,718 INFO L225 Difference]: With dead ends: 379 [2019-02-25 15:20:44,718 INFO L226 Difference]: Without dead ends: 378 [2019-02-25 15:20:44,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 835 GetRequests, 556 SyntacticMatches, 86 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31271 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-02-25 15:20:44,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-02-25 15:20:44,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2019-02-25 15:20:44,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-02-25 15:20:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2019-02-25 15:20:44,724 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 372 [2019-02-25 15:20:44,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:44,724 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2019-02-25 15:20:44,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2019-02-25 15:20:44,724 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2019-02-25 15:20:44,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-02-25 15:20:44,726 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:44,726 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 1, 1] [2019-02-25 15:20:44,726 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:44,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:44,726 INFO L82 PathProgramCache]: Analyzing trace with hash -903339493, now seen corresponding path program 93 times [2019-02-25 15:20:44,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:44,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:44,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:20:44,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:44,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:48,898 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:48,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:48,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:48,899 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:20:48,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:20:48,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:48,899 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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:48,908 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:20:48,908 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:20:49,024 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:20:49,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:20:49,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 289 conjunts are in the unsatisfiable core [2019-02-25 15:20:49,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:49,036 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:20:49,036 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:49,047 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:49,048 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:20:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:54,051 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:58,513 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:58,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:58,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 194 [2019-02-25 15:20:58,532 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:58,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2019-02-25 15:20:58,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2019-02-25 15:20:58,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-02-25 15:20:58,535 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 190 states. [2019-02-25 15:20:59,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:59,246 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2019-02-25 15:20:59,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-02-25 15:20:59,246 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 376 [2019-02-25 15:20:59,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:59,248 INFO L225 Difference]: With dead ends: 383 [2019-02-25 15:20:59,249 INFO L226 Difference]: Without dead ends: 382 [2019-02-25 15:20:59,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 562 SyntacticMatches, 88 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31768 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-02-25 15:20:59,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-02-25 15:20:59,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2019-02-25 15:20:59,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-02-25 15:20:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-02-25 15:20:59,255 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 376 [2019-02-25 15:20:59,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:59,255 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2019-02-25 15:20:59,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2019-02-25 15:20:59,255 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2019-02-25 15:20:59,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-02-25 15:20:59,257 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:59,257 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 1, 1] [2019-02-25 15:20:59,257 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:59,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:59,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1456975060, now seen corresponding path program 94 times [2019-02-25 15:20:59,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:59,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:59,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:20:59,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:59,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:03,609 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:03,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:03,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:03,609 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:21:03,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:21:03,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:03,610 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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:03,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:03,619 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:03,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 292 conjunts are in the unsatisfiable core [2019-02-25 15:21:03,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:03,729 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:21:03,729 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:03,744 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:03,744 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:21:08,865 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:08,865 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:13,385 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:13,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:13,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 195 [2019-02-25 15:21:13,404 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:13,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2019-02-25 15:21:13,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2019-02-25 15:21:13,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-02-25 15:21:13,407 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 192 states. [2019-02-25 15:21:14,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:14,234 INFO L93 Difference]: Finished difference Result 387 states and 387 transitions. [2019-02-25 15:21:14,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-25 15:21:14,234 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 380 [2019-02-25 15:21:14,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:14,236 INFO L225 Difference]: With dead ends: 387 [2019-02-25 15:21:14,236 INFO L226 Difference]: Without dead ends: 386 [2019-02-25 15:21:14,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 568 SyntacticMatches, 90 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32265 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-02-25 15:21:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-02-25 15:21:14,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 385. [2019-02-25 15:21:14,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-02-25 15:21:14,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 385 transitions. [2019-02-25 15:21:14,242 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 385 transitions. Word has length 380 [2019-02-25 15:21:14,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:14,242 INFO L480 AbstractCegarLoop]: Abstraction has 385 states and 385 transitions. [2019-02-25 15:21:14,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2019-02-25 15:21:14,242 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 385 transitions. [2019-02-25 15:21:14,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-02-25 15:21:14,244 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:14,244 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 95, 95, 1, 1] [2019-02-25 15:21:14,244 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:14,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:14,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1763626227, now seen corresponding path program 95 times [2019-02-25 15:21:14,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:14,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:14,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:14,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:14,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:18,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:18,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:18,693 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:21:18,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:21:18,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:18,693 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 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:18,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:21:18,702 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:21:19,359 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2019-02-25 15:21:19,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:21:19,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 295 conjunts are in the unsatisfiable core [2019-02-25 15:21:19,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:19,373 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:21:19,373 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:19,383 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:19,383 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:21:24,625 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:24,625 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:29,298 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:29,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:29,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 196 [2019-02-25 15:21:29,317 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:29,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2019-02-25 15:21:29,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2019-02-25 15:21:29,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-02-25 15:21:29,320 INFO L87 Difference]: Start difference. First operand 385 states and 385 transitions. Second operand 194 states. [2019-02-25 15:21:30,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:30,176 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2019-02-25 15:21:30,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-02-25 15:21:30,176 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 384 [2019-02-25 15:21:30,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:30,177 INFO L225 Difference]: With dead ends: 391 [2019-02-25 15:21:30,177 INFO L226 Difference]: Without dead ends: 390 [2019-02-25 15:21:30,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 862 GetRequests, 574 SyntacticMatches, 92 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32762 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-02-25 15:21:30,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-02-25 15:21:30,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2019-02-25 15:21:30,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-02-25 15:21:30,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2019-02-25 15:21:30,183 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 384 [2019-02-25 15:21:30,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:30,184 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2019-02-25 15:21:30,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2019-02-25 15:21:30,184 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2019-02-25 15:21:30,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-02-25 15:21:30,185 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:30,185 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 96, 96, 1, 1] [2019-02-25 15:21:30,186 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:30,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:30,186 INFO L82 PathProgramCache]: Analyzing trace with hash 232453318, now seen corresponding path program 96 times [2019-02-25 15:21:30,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:30,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:30,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:21:30,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:30,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:34,631 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:34,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:34,631 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:34,631 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:21:34,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:21:34,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:34,632 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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:34,640 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:21:34,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:21:34,761 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:21:34,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:21:34,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 298 conjunts are in the unsatisfiable core [2019-02-25 15:21:34,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:34,777 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:21:34,777 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:34,786 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:34,786 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:21:40,142 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:40,142 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:44,687 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:44,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:44,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 197 [2019-02-25 15:21:44,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:44,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2019-02-25 15:21:44,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2019-02-25 15:21:44,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-02-25 15:21:44,709 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 196 states. [2019-02-25 15:21:45,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:45,640 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2019-02-25 15:21:45,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-25 15:21:45,640 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 388 [2019-02-25 15:21:45,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:45,642 INFO L225 Difference]: With dead ends: 395 [2019-02-25 15:21:45,642 INFO L226 Difference]: Without dead ends: 394 [2019-02-25 15:21:45,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 871 GetRequests, 580 SyntacticMatches, 94 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33259 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-02-25 15:21:45,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-02-25 15:21:45,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2019-02-25 15:21:45,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-02-25 15:21:45,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2019-02-25 15:21:45,648 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 388 [2019-02-25 15:21:45,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:45,649 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2019-02-25 15:21:45,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2019-02-25 15:21:45,649 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2019-02-25 15:21:45,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-02-25 15:21:45,650 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:45,650 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 97, 97, 1, 1] [2019-02-25 15:21:45,650 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:45,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:45,651 INFO L82 PathProgramCache]: Analyzing trace with hash 171651583, now seen corresponding path program 97 times [2019-02-25 15:21:45,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:45,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:45,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:21:45,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:45,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:50,259 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:50,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:50,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:50,260 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:21:50,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:21:50,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:50,260 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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:50,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:50,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:50,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 301 conjunts are in the unsatisfiable core [2019-02-25 15:21:50,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:50,381 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:21:50,381 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:50,389 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:50,389 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:21:55,836 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:55,836 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:22:00,324 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:00,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:22:00,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 198 [2019-02-25 15:22:00,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:22:00,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2019-02-25 15:22:00,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2019-02-25 15:22:00,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-02-25 15:22:00,347 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 198 states. [2019-02-25 15:22:01,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:22:01,138 INFO L93 Difference]: Finished difference Result 399 states and 399 transitions. [2019-02-25 15:22:01,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-02-25 15:22:01,139 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 392 [2019-02-25 15:22:01,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:22:01,140 INFO L225 Difference]: With dead ends: 399 [2019-02-25 15:22:01,140 INFO L226 Difference]: Without dead ends: 398 [2019-02-25 15:22:01,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 880 GetRequests, 586 SyntacticMatches, 96 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33756 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-02-25 15:22:01,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-02-25 15:22:01,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2019-02-25 15:22:01,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-02-25 15:22:01,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2019-02-25 15:22:01,147 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 392 [2019-02-25 15:22:01,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:22:01,147 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2019-02-25 15:22:01,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2019-02-25 15:22:01,147 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2019-02-25 15:22:01,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-02-25 15:22:01,149 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:22:01,149 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 98, 98, 1, 1] [2019-02-25 15:22:01,149 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:22:01,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:01,150 INFO L82 PathProgramCache]: Analyzing trace with hash 894970552, now seen corresponding path program 98 times [2019-02-25 15:22:01,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:22:01,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:01,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:01,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:01,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:22:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:05,867 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:05,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:05,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:22:05,868 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:22:05,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:22:05,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:05,868 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 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:22:05,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:22:05,876 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:22:06,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 99 check-sat command(s) [2019-02-25 15:22:06,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:22:06,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 304 conjunts are in the unsatisfiable core [2019-02-25 15:22:06,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:22:06,589 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:22:06,589 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:06,597 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:06,597 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:22:12,370 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:12,371 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:22:16,618 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:16,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:22:16,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 199 [2019-02-25 15:22:16,638 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:22:16,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2019-02-25 15:22:16,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2019-02-25 15:22:16,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-02-25 15:22:16,642 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 200 states. [2019-02-25 15:22:17,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:22:17,554 INFO L93 Difference]: Finished difference Result 403 states and 403 transitions. [2019-02-25 15:22:17,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-02-25 15:22:17,554 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 396 [2019-02-25 15:22:17,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:22:17,556 INFO L225 Difference]: With dead ends: 403 [2019-02-25 15:22:17,556 INFO L226 Difference]: Without dead ends: 402 [2019-02-25 15:22:17,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 592 SyntacticMatches, 98 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34253 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-02-25 15:22:17,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-02-25 15:22:17,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 401. [2019-02-25 15:22:17,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-02-25 15:22:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2019-02-25 15:22:17,564 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 396 [2019-02-25 15:22:17,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:22:17,564 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2019-02-25 15:22:17,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2019-02-25 15:22:17,565 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2019-02-25 15:22:17,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-02-25 15:22:17,567 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:22:17,567 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 99, 99, 1, 1] [2019-02-25 15:22:17,567 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:22:17,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:17,568 INFO L82 PathProgramCache]: Analyzing trace with hash 594026225, now seen corresponding path program 99 times [2019-02-25 15:22:17,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:22:17,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:17,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:22:17,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:17,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:22:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:22,099 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:22,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:22,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:22:22,100 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:22:22,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:22:22,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:22,100 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 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:22:22,110 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:22:22,110 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:22:22,254 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:22:22,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:22:22,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 307 conjunts are in the unsatisfiable core [2019-02-25 15:22:22,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:22:22,285 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:22:22,285 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:22,296 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:22,296 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:22:27,942 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:27,942 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:22:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:32,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:22:32,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 200 [2019-02-25 15:22:32,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:22:32,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2019-02-25 15:22:32,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2019-02-25 15:22:32,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-02-25 15:22:32,209 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 202 states. [2019-02-25 15:22:33,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:22:33,175 INFO L93 Difference]: Finished difference Result 407 states and 407 transitions. [2019-02-25 15:22:33,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-25 15:22:33,175 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 400 [2019-02-25 15:22:33,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:22:33,177 INFO L225 Difference]: With dead ends: 407 [2019-02-25 15:22:33,178 INFO L226 Difference]: Without dead ends: 406 [2019-02-25 15:22:33,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 898 GetRequests, 599 SyntacticMatches, 99 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34551 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-02-25 15:22:33,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-02-25 15:22:33,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 405. [2019-02-25 15:22:33,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-02-25 15:22:33,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 405 transitions. [2019-02-25 15:22:33,185 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 405 transitions. Word has length 400 [2019-02-25 15:22:33,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:22:33,185 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 405 transitions. [2019-02-25 15:22:33,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2019-02-25 15:22:33,185 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 405 transitions. [2019-02-25 15:22:33,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-02-25 15:22:33,187 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:22:33,187 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 100, 100, 1, 1] [2019-02-25 15:22:33,188 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:22:33,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:33,188 INFO L82 PathProgramCache]: Analyzing trace with hash -478064982, now seen corresponding path program 100 times [2019-02-25 15:22:33,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:22:33,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:33,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:22:33,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:33,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:22:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:37,921 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 19603 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:37,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:37,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:22:37,922 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:22:37,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:22:37,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:37,922 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 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:22:37,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:37,931 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:22:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:38,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 103 conjunts are in the unsatisfiable core [2019-02-25 15:22:38,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:22:38,213 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 20000 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:38,213 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:22:43,150 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 20000 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:43,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:22:43,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 104 [2019-02-25 15:22:43,170 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:22:43,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-02-25 15:22:43,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-02-25 15:22:43,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5258, Invalid=5662, Unknown=0, NotChecked=0, Total=10920 [2019-02-25 15:22:43,172 INFO L87 Difference]: Start difference. First operand 405 states and 405 transitions. Second operand 105 states. [2019-02-25 15:22:44,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:22:44,602 INFO L93 Difference]: Finished difference Result 408 states and 408 transitions. [2019-02-25 15:22:44,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-02-25 15:22:44,602 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 404 [2019-02-25 15:22:44,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:22:44,603 INFO L225 Difference]: With dead ends: 408 [2019-02-25 15:22:44,603 INFO L226 Difference]: Without dead ends: 0 [2019-02-25 15:22:44,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 910 GetRequests, 706 SyntacticMatches, 100 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5643 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=5362, Invalid=5768, Unknown=0, NotChecked=0, Total=11130 [2019-02-25 15:22:44,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-25 15:22:44,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-25 15:22:44,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-25 15:22:44,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-25 15:22:44,607 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 404 [2019-02-25 15:22:44,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:22:44,607 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-25 15:22:44,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-02-25 15:22:44,607 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-25 15:22:44,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-25 15:22:44,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-25 15:22:44,721 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 511 [2019-02-25 15:22:47,584 WARN L181 SmtUtils]: Spent 2.86 s on a formula simplification. DAG size of input: 511 DAG size of output: 509 [2019-02-25 15:22:47,596 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 3 24) no Hoare annotation was computed. [2019-02-25 15:22:47,596 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 3 24) no Hoare annotation was computed. [2019-02-25 15:22:47,596 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-02-25 15:22:47,596 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2019-02-25 15:22:47,596 INFO L448 ceAbstractionStarter]: For program point L16-1(lines 16 20) no Hoare annotation was computed. [2019-02-25 15:22:47,600 INFO L444 ceAbstractionStarter]: At program point L13-1(lines 13 22) the Hoare annotation is: (let ((.cse0 (<= 400 (select |#length| main_q.base)))) (or (and (<= main_q.offset 112) (<= (+ main_p.offset 112) main_q.offset) .cse0) (and (<= main_q.offset 260) (<= (+ main_p.offset 260) main_q.offset) .cse0) (and (<= (+ main_p.offset 128) main_q.offset) (<= main_q.offset 128) .cse0) (and (<= (+ main_p.offset 196) main_q.offset) (<= main_q.offset 196) .cse0) (and (<= main_q.offset 124) (<= (+ main_p.offset 124) main_q.offset) .cse0) (and (<= (+ main_p.offset 308) main_q.offset) (<= main_q.offset 308) .cse0) (and (<= main_q.offset 240) (<= (+ main_p.offset 240) main_q.offset) .cse0) (and (<= main_q.offset 332) (<= (+ main_p.offset 332) main_q.offset) .cse0) (and (<= (+ main_p.offset 296) main_q.offset) (<= main_q.offset 296) .cse0) (and (<= (+ main_p.offset 268) main_q.offset) (<= main_q.offset 268) .cse0) (and (<= main_q.offset 160) (<= (+ main_p.offset 160) main_q.offset) .cse0) (and (<= main_q.offset 180) (<= (+ main_p.offset 180) main_q.offset) .cse0) (and (<= (+ main_p.offset 368) main_q.offset) (<= main_q.offset 368) .cse0) (and (<= main_q.offset 384) (<= (+ main_p.offset 384) main_q.offset) .cse0) (and (<= main_q.offset 392) (<= (+ main_p.offset 392) main_q.offset) .cse0) (and (<= main_q.offset 144) .cse0 (<= (+ main_p.offset 144) main_q.offset)) (and (<= main_q.offset 200) (<= (+ main_p.offset 200) main_q.offset) .cse0) (and (<= (+ main_p.offset 288) main_q.offset) (<= main_q.offset 288) .cse0) (and (<= main_q.offset 340) (<= (+ main_p.offset 340) main_q.offset) .cse0) (and (<= (+ main_p.offset 276) main_q.offset) (<= main_q.offset 276) .cse0) (and (<= main_q.offset 356) (<= (+ main_p.offset 356) main_q.offset) .cse0) (and (<= main_q.offset 336) (<= (+ main_p.offset 336) main_q.offset) .cse0) (and (<= (+ main_p.offset 140) main_q.offset) (<= main_q.offset 140) .cse0) (and (<= main_q.offset 244) (<= (+ main_p.offset 244) main_q.offset) .cse0) (and (<= (+ main_p.offset 312) main_q.offset) (<= main_q.offset 312) .cse0) (and (<= (+ main_p.offset 396) main_q.offset) (<= main_q.offset 396) .cse0) (and (<= main_q.offset 148) (<= (+ main_p.offset 148) main_q.offset) .cse0) (and (<= (+ main_p.offset 352) main_q.offset) (<= main_q.offset 352) .cse0) (and (<= main_q.offset 344) (<= (+ main_p.offset 344) main_q.offset) .cse0) (and (<= main_q.offset 164) (<= (+ main_p.offset 164) main_q.offset) .cse0) (and (<= (+ main_p.offset 304) main_q.offset) (<= main_q.offset 304) .cse0) (and (<= main_q.offset 320) (<= (+ main_p.offset 320) main_q.offset) .cse0) (and (<= (+ main_p.offset 36) main_q.offset) (<= main_q.offset 36) .cse0) (and (<= (+ main_p.offset 44) main_q.offset) (<= main_q.offset 44) .cse0) (and (<= (+ main_p.offset 228) main_q.offset) (<= main_q.offset 228) .cse0) (and (<= (+ main_p.offset 284) main_q.offset) (<= main_q.offset 284) .cse0) (and (<= (+ main_p.offset 188) main_q.offset) (<= main_q.offset 188) .cse0) (and (<= (+ main_p.offset 8) main_q.offset) (<= main_q.offset 8) .cse0) (and (<= main_q.offset 348) .cse0 (<= (+ main_p.offset 348) main_q.offset)) (<= (+ main_p.offset 400) main_q.offset) (and (<= (+ main_p.offset 224) main_q.offset) (<= main_q.offset 224) .cse0) (and (<= (+ main_p.offset 120) main_q.offset) (<= main_q.offset 120) .cse0) (and (<= main_q.offset 232) (<= (+ main_p.offset 232) main_q.offset) .cse0) (and (<= main_q.offset 92) (<= (+ main_p.offset 92) main_q.offset) .cse0) (and (<= main_q.offset 236) (<= (+ main_p.offset 236) main_q.offset) .cse0) (and (<= (+ main_p.offset 328) main_q.offset) (<= main_q.offset 328) .cse0) (and (<= main_q.offset 12) (<= (+ main_p.offset 12) main_q.offset) .cse0) (and (<= (+ main_p.offset 64) main_q.offset) (<= main_q.offset 64) .cse0) (and (<= (+ main_p.offset 192) main_q.offset) (<= main_q.offset 192) .cse0) (and (<= (+ main_p.offset 104) main_q.offset) (<= main_q.offset 104) .cse0) (and (<= main_q.offset 280) (<= (+ main_p.offset 280) main_q.offset) .cse0) (and (<= (+ main_p.offset 316) main_q.offset) (<= main_q.offset 316) .cse0) (and (<= main_q.offset 152) (<= (+ main_p.offset 152) main_q.offset) .cse0) (and (<= (+ main_p.offset 248) main_q.offset) (<= main_q.offset 248) .cse0) (and (<= main_q.offset 28) (<= (+ main_p.offset 28) main_q.offset) .cse0) (and (<= (+ main_p.offset 68) main_q.offset) (<= main_q.offset 68) .cse0) (and (<= main_q.offset 4) .cse0 (<= (+ main_p.offset 4) main_q.offset)) (and (<= (+ main_p.offset 204) main_q.offset) (<= main_q.offset 204) .cse0) (and (<= main_q.offset 380) (<= (+ main_p.offset 380) main_q.offset) .cse0) (and (<= main_q.offset 52) (<= (+ main_p.offset 52) main_q.offset) .cse0) (and (<= (+ main_p.offset 172) main_q.offset) (<= main_q.offset 172) .cse0) (and (<= main_q.offset 56) (<= (+ main_p.offset 56) main_q.offset) .cse0) (and (<= main_q.offset 60) (<= (+ main_p.offset 60) main_q.offset) .cse0) (and (<= main_q.offset 100) (<= (+ main_p.offset 100) main_q.offset) .cse0) (and (<= main_q.offset 208) (<= (+ main_p.offset 208) main_q.offset) .cse0) (and (<= (+ main_p.offset 220) main_q.offset) (<= main_q.offset 220) .cse0) (and (<= (+ main_p.offset 132) main_q.offset) (<= main_q.offset 132) .cse0) (and (<= main_q.offset 176) (<= (+ main_p.offset 176) main_q.offset) .cse0) (and (<= main_q.offset 116) (<= (+ main_p.offset 116) main_q.offset) .cse0) (and (<= (+ main_p.offset 136) main_q.offset) (<= main_q.offset 136) .cse0) (and (<= main_q.offset 184) (<= (+ main_p.offset 184) main_q.offset) .cse0) (and (<= main_q.offset 20) (<= (+ main_p.offset 20) main_q.offset) .cse0) (and (<= (+ main_p.offset 216) main_q.offset) (<= main_q.offset 216) .cse0) (and (<= (+ main_p.offset 376) main_q.offset) (<= main_q.offset 376) .cse0) (and (<= (+ main_p.offset 324) main_q.offset) (<= main_q.offset 324) .cse0) (and (<= (+ main_p.offset 72) main_q.offset) (<= main_q.offset 72) .cse0) (and (<= main_q.offset 76) (<= (+ main_p.offset 76) main_q.offset) .cse0) (and (<= main_q.offset 16) (<= (+ main_p.offset 16) main_q.offset) .cse0) (and (<= main_q.offset 84) (<= (+ main_p.offset 84) main_q.offset) .cse0) (and (<= (+ main_p.offset 156) main_q.offset) (<= main_q.offset 156) .cse0) (and (<= (+ main_p.offset 364) main_q.offset) (<= main_q.offset 364) .cse0) (and (<= (+ main_p.offset 88) main_q.offset) .cse0 (<= main_q.offset 88)) (and (<= main_q.offset 168) (<= (+ main_p.offset 168) main_q.offset) .cse0) (and (<= (+ main_p.offset 48) main_q.offset) (<= main_q.offset 48) .cse0) (and (<= main_q.offset 252) (<= (+ main_p.offset 252) main_q.offset) .cse0) (and (<= (+ main_p.offset 264) main_q.offset) (<= main_q.offset 264) .cse0) (and (<= (+ main_p.offset 388) main_q.offset) (<= main_q.offset 388) .cse0) (and (<= main_q.offset 0) .cse0 (= main_p.offset main_q.offset)) (and (<= (+ main_p.offset 40) main_q.offset) (<= main_q.offset 40) .cse0) (and (<= main_q.offset 256) (<= (+ main_p.offset 256) main_q.offset) .cse0) (and (<= main_q.offset 300) .cse0 (<= (+ main_p.offset 300) main_q.offset)) (and (<= (+ main_p.offset 80) main_q.offset) (<= main_q.offset 80) .cse0) (and (<= main_q.offset 108) .cse0 (<= (+ main_p.offset 108) main_q.offset)) (and (<= main_q.offset 212) (<= (+ main_p.offset 212) main_q.offset) .cse0) (and (<= main_q.offset 372) (<= (+ main_p.offset 372) main_q.offset) .cse0) (and (<= (+ main_p.offset 96) main_q.offset) .cse0 (<= main_q.offset 96)) (and (<= (+ main_p.offset 272) main_q.offset) (<= main_q.offset 272) .cse0) (and (<= main_q.offset 292) (<= (+ main_p.offset 292) main_q.offset) .cse0) (and (<= (+ main_p.offset 360) main_q.offset) (<= main_q.offset 360) .cse0) (and (<= main_q.offset 32) (<= (+ main_p.offset 32) main_q.offset) .cse0) (and (<= (+ main_p.offset 24) main_q.offset) (<= main_q.offset 24) .cse0))) [2019-02-25 15:22:47,600 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 3 24) no Hoare annotation was computed. [2019-02-25 15:22:47,600 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 17) no Hoare annotation was computed. [2019-02-25 15:22:47,665 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.02 03:22:47 BoogieIcfgContainer [2019-02-25 15:22:47,666 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-25 15:22:47,667 INFO L168 Benchmark]: Toolchain (without parser) took 733418.80 ms. Allocated memory was 140.5 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 108.0 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 550.1 MB. Max. memory is 7.1 GB. [2019-02-25 15:22:47,667 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 140.5 MB. Free memory is still 109.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-25 15:22:47,667 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.85 ms. Allocated memory is still 140.5 MB. Free memory was 107.8 MB in the beginning and 105.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-02-25 15:22:47,668 INFO L168 Benchmark]: Boogie Preprocessor took 23.90 ms. Allocated memory is still 140.5 MB. Free memory was 105.6 MB in the beginning and 104.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-25 15:22:47,668 INFO L168 Benchmark]: RCFGBuilder took 312.94 ms. Allocated memory is still 140.5 MB. Free memory was 104.4 MB in the beginning and 94.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-02-25 15:22:47,668 INFO L168 Benchmark]: TraceAbstraction took 733021.69 ms. Allocated memory was 140.5 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 94.1 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 536.1 MB. Max. memory is 7.1 GB. [2019-02-25 15:22:47,670 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 140.5 MB. Free memory is still 109.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.85 ms. Allocated memory is still 140.5 MB. Free memory was 107.8 MB in the beginning and 105.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.90 ms. Allocated memory is still 140.5 MB. Free memory was 105.6 MB in the beginning and 104.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 312.94 ms. Allocated memory is still 140.5 MB. Free memory was 104.4 MB in the beginning and 94.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 733021.69 ms. Allocated memory was 140.5 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 94.1 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 536.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: 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: 13]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((q!offset <= 112 && p!offset + 112 <= q!offset) && 400 <= #length[q!base]) || ((q!offset <= 260 && p!offset + 260 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 128 <= q!offset && q!offset <= 128) && 400 <= #length[q!base])) || ((p!offset + 196 <= q!offset && q!offset <= 196) && 400 <= #length[q!base])) || ((q!offset <= 124 && p!offset + 124 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 308 <= q!offset && q!offset <= 308) && 400 <= #length[q!base])) || ((q!offset <= 240 && p!offset + 240 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 332 && p!offset + 332 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 296 <= q!offset && q!offset <= 296) && 400 <= #length[q!base])) || ((p!offset + 268 <= q!offset && q!offset <= 268) && 400 <= #length[q!base])) || ((q!offset <= 160 && p!offset + 160 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 180 && p!offset + 180 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 368 <= q!offset && q!offset <= 368) && 400 <= #length[q!base])) || ((q!offset <= 384 && p!offset + 384 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 392 && p!offset + 392 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 144 && 400 <= #length[q!base]) && p!offset + 144 <= q!offset)) || ((q!offset <= 200 && p!offset + 200 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 288 <= q!offset && q!offset <= 288) && 400 <= #length[q!base])) || ((q!offset <= 340 && p!offset + 340 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 276 <= q!offset && q!offset <= 276) && 400 <= #length[q!base])) || ((q!offset <= 356 && p!offset + 356 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 336 && p!offset + 336 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 140 <= q!offset && q!offset <= 140) && 400 <= #length[q!base])) || ((q!offset <= 244 && p!offset + 244 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 312 <= q!offset && q!offset <= 312) && 400 <= #length[q!base])) || ((p!offset + 396 <= q!offset && q!offset <= 396) && 400 <= #length[q!base])) || ((q!offset <= 148 && p!offset + 148 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 352 <= q!offset && q!offset <= 352) && 400 <= #length[q!base])) || ((q!offset <= 344 && p!offset + 344 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 164 && p!offset + 164 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 304 <= q!offset && q!offset <= 304) && 400 <= #length[q!base])) || ((q!offset <= 320 && p!offset + 320 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 36 <= q!offset && q!offset <= 36) && 400 <= #length[q!base])) || ((p!offset + 44 <= q!offset && q!offset <= 44) && 400 <= #length[q!base])) || ((p!offset + 228 <= q!offset && q!offset <= 228) && 400 <= #length[q!base])) || ((p!offset + 284 <= q!offset && q!offset <= 284) && 400 <= #length[q!base])) || ((p!offset + 188 <= q!offset && q!offset <= 188) && 400 <= #length[q!base])) || ((p!offset + 8 <= q!offset && q!offset <= 8) && 400 <= #length[q!base])) || ((q!offset <= 348 && 400 <= #length[q!base]) && p!offset + 348 <= q!offset)) || p!offset + 400 <= q!offset) || ((p!offset + 224 <= q!offset && q!offset <= 224) && 400 <= #length[q!base])) || ((p!offset + 120 <= q!offset && q!offset <= 120) && 400 <= #length[q!base])) || ((q!offset <= 232 && p!offset + 232 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 92 && p!offset + 92 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 236 && p!offset + 236 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 328 <= q!offset && q!offset <= 328) && 400 <= #length[q!base])) || ((q!offset <= 12 && p!offset + 12 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 64 <= q!offset && q!offset <= 64) && 400 <= #length[q!base])) || ((p!offset + 192 <= q!offset && q!offset <= 192) && 400 <= #length[q!base])) || ((p!offset + 104 <= q!offset && q!offset <= 104) && 400 <= #length[q!base])) || ((q!offset <= 280 && p!offset + 280 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 316 <= q!offset && q!offset <= 316) && 400 <= #length[q!base])) || ((q!offset <= 152 && p!offset + 152 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 248 <= q!offset && q!offset <= 248) && 400 <= #length[q!base])) || ((q!offset <= 28 && p!offset + 28 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 68 <= q!offset && q!offset <= 68) && 400 <= #length[q!base])) || ((q!offset <= 4 && 400 <= #length[q!base]) && p!offset + 4 <= q!offset)) || ((p!offset + 204 <= q!offset && q!offset <= 204) && 400 <= #length[q!base])) || ((q!offset <= 380 && p!offset + 380 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 52 && p!offset + 52 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 172 <= q!offset && q!offset <= 172) && 400 <= #length[q!base])) || ((q!offset <= 56 && p!offset + 56 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 60 && p!offset + 60 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 100 && p!offset + 100 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 208 && p!offset + 208 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 220 <= q!offset && q!offset <= 220) && 400 <= #length[q!base])) || ((p!offset + 132 <= q!offset && q!offset <= 132) && 400 <= #length[q!base])) || ((q!offset <= 176 && p!offset + 176 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 116 && p!offset + 116 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 136 <= q!offset && q!offset <= 136) && 400 <= #length[q!base])) || ((q!offset <= 184 && p!offset + 184 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 20 && p!offset + 20 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 216 <= q!offset && q!offset <= 216) && 400 <= #length[q!base])) || ((p!offset + 376 <= q!offset && q!offset <= 376) && 400 <= #length[q!base])) || ((p!offset + 324 <= q!offset && q!offset <= 324) && 400 <= #length[q!base])) || ((p!offset + 72 <= q!offset && q!offset <= 72) && 400 <= #length[q!base])) || ((q!offset <= 76 && p!offset + 76 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 16 && p!offset + 16 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 84 && p!offset + 84 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 156 <= q!offset && q!offset <= 156) && 400 <= #length[q!base])) || ((p!offset + 364 <= q!offset && q!offset <= 364) && 400 <= #length[q!base])) || ((p!offset + 88 <= q!offset && 400 <= #length[q!base]) && q!offset <= 88)) || ((q!offset <= 168 && p!offset + 168 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 48 <= q!offset && q!offset <= 48) && 400 <= #length[q!base])) || ((q!offset <= 252 && p!offset + 252 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 264 <= q!offset && q!offset <= 264) && 400 <= #length[q!base])) || ((p!offset + 388 <= q!offset && q!offset <= 388) && 400 <= #length[q!base])) || ((q!offset <= 0 && 400 <= #length[q!base]) && p!offset == q!offset)) || ((p!offset + 40 <= q!offset && q!offset <= 40) && 400 <= #length[q!base])) || ((q!offset <= 256 && p!offset + 256 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 300 && 400 <= #length[q!base]) && p!offset + 300 <= q!offset)) || ((p!offset + 80 <= q!offset && q!offset <= 80) && 400 <= #length[q!base])) || ((q!offset <= 108 && 400 <= #length[q!base]) && p!offset + 108 <= q!offset)) || ((q!offset <= 212 && p!offset + 212 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 372 && p!offset + 372 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 96 <= q!offset && 400 <= #length[q!base]) && q!offset <= 96)) || ((p!offset + 272 <= q!offset && q!offset <= 272) && 400 <= #length[q!base])) || ((q!offset <= 292 && p!offset + 292 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 360 <= q!offset && q!offset <= 360) && 400 <= #length[q!base])) || ((q!offset <= 32 && p!offset + 32 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 24 <= q!offset && q!offset <= 24) && 400 <= #length[q!base]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 732.8s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 45.5s AutomataDifference, 0.0s DeadEndRemovalTime, 2.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 403 SDtfs, 7610 SDslu, 7951 SDs, 0 SdLazy, 28139 SolverSat, 355 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46154 GetRequests, 30803 SyntacticMatches, 2649 SemanticMatches, 12702 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1303267 ImplicationChecksByTransitivity, 626.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=405occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 101 MinimizatonAttempts, 100 StatesRemovedByMinimization, 100 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 102 NumberOfFragments, 1404 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 7 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 1.0s SsaConstructionTime, 14.1s SatisfiabilityAnalysisTime, 657.8s InterpolantComputationTime, 41204 NumberOfCodeBlocks, 41204 NumberOfCodeBlocksAsserted, 1884 NumberOfCheckSat, 61503 ConstructedInterpolants, 0 QuantifiedInterpolants, 126003756 SizeOfPredicates, 596 NumberOfNonLiveVariables, 37650 ConjunctsInSsa, 15943 ConjunctsInUnsatCore, 301 InterpolantComputations, 1 PerfectInterpolantSequences, 59603/2045250 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...