java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-15 11:11:25,102 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 11:11:25,104 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 11:11:25,116 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 11:11:25,116 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 11:11:25,117 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 11:11:25,119 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 11:11:25,121 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 11:11:25,123 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 11:11:25,124 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 11:11:25,125 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 11:11:25,125 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 11:11:25,126 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 11:11:25,127 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 11:11:25,128 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 11:11:25,129 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 11:11:25,130 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 11:11:25,132 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 11:11:25,134 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 11:11:25,136 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 11:11:25,137 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 11:11:25,139 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 11:11:25,141 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 11:11:25,142 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 11:11:25,142 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 11:11:25,143 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 11:11:25,144 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 11:11:25,145 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 11:11:25,146 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 11:11:25,147 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 11:11:25,147 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 11:11:25,148 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 11:11:25,148 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 11:11:25,149 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 11:11:25,150 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 11:11:25,151 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 11:11:25,151 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-15 11:11:25,175 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 11:11:25,176 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 11:11:25,177 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 11:11:25,177 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 11:11:25,177 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 11:11:25,177 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 11:11:25,178 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 11:11:25,178 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 11:11:25,178 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 11:11:25,178 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-15 11:11:25,178 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-15 11:11:25,179 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 11:11:25,179 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 11:11:25,179 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 11:11:25,180 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 11:11:25,180 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 11:11:25,180 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 11:11:25,180 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 11:11:25,180 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 11:11:25,181 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 11:11:25,181 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 11:11:25,181 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 11:11:25,181 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 11:11:25,181 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 11:11:25,182 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 11:11:25,182 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 11:11:25,182 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 11:11:25,182 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 11:11:25,182 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 11:11:25,183 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 11:11:25,183 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 11:11:25,183 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 11:11:25,183 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 11:11:25,183 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 11:11:25,184 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 11:11:25,184 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 11:11:25,184 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 11:11:25,184 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 11:11:25,184 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 11:11:25,238 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 11:11:25,255 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 11:11:25,262 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 11:11:25,264 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 11:11:25,265 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 11:11:25,266 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl [2019-02-15 11:11:25,266 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl' [2019-02-15 11:11:25,307 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 11:11:25,308 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 11:11:25,309 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 11:11:25,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 11:11:25,309 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 11:11:25,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,337 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 11:11:25,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 11:11:25,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 11:11:25,345 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 11:11:25,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 11:11:25,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 11:11:25,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 11:11:25,366 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 11:11:25,367 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (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-15 11:11:25,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-15 11:11:25,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-15 11:11:25,633 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-15 11:11:25,634 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-02-15 11:11:25,635 INFO L202 PluginConnector]: Adding new model array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:11:25 BoogieIcfgContainer [2019-02-15 11:11:25,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 11:11:25,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 11:11:25,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 11:11:25,641 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 11:11:25,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/2) ... [2019-02-15 11:11:25,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b947051 and model type array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:11:25, skipping insertion in model container [2019-02-15 11:11:25,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:11:25" (2/2) ... [2019-02-15 11:11:25,645 INFO L112 eAbstractionObserver]: Analyzing ICFG array1.i_3.bpl [2019-02-15 11:11:25,657 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 11:11:25,665 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-15 11:11:25,685 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-15 11:11:25,723 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 11:11:25,724 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 11:11:25,724 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 11:11:25,724 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 11:11:25,724 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 11:11:25,725 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 11:11:25,726 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 11:11:25,726 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 11:11:25,745 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-15 11:11:25,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:11:25,760 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:25,761 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:11:25,764 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:25,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:25,776 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-02-15 11:11:25,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:25,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:25,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:25,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:25,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:25,999 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-15 11:11:26,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:11:26,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-15 11:11:26,002 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:11:26,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 11:11:26,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 11:11:26,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:11:26,030 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-15 11:11:26,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:26,107 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-02-15 11:11:26,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:11:26,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-15 11:11:26,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:26,123 INFO L225 Difference]: With dead ends: 9 [2019-02-15 11:11:26,123 INFO L226 Difference]: Without dead ends: 5 [2019-02-15 11:11:26,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:11:26,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-15 11:11:26,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-15 11:11:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-15 11:11:26,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-15 11:11:26,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-15 11:11:26,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:26,161 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-15 11:11:26,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 11:11:26,161 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-15 11:11:26,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:11:26,162 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:26,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:11:26,162 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:26,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:26,163 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-02-15 11:11:26,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:26,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:26,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:26,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:26,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:26,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:26,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:26,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:26,245 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:11:26,247 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-02-15 11:11:26,304 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:11:26,305 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:11:27,634 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:11:27,635 INFO L272 AbstractInterpreter]: Visited 4 different actions 20 times. Merged at 1 different actions 8 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 11:11:27,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:27,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:11:27,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:27,645 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-15 11:11:27,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:27,662 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:27,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:27,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:27,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:27,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:27,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:27,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-02-15 11:11:28,000 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:28,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:11:28,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:11:28,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-15 11:11:28,002 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-02-15 11:11:28,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:28,062 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-15 11:11:28,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:11:28,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-15 11:11:28,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:28,063 INFO L225 Difference]: With dead ends: 8 [2019-02-15 11:11:28,063 INFO L226 Difference]: Without dead ends: 6 [2019-02-15 11:11:28,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-15 11:11:28,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-02-15 11:11:28,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-02-15 11:11:28,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-15 11:11:28,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-02-15 11:11:28,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-02-15 11:11:28,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:28,068 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-02-15 11:11:28,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:11:28,068 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-15 11:11:28,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:11:28,069 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:28,069 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-15 11:11:28,069 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:28,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:28,070 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-02-15 11:11:28,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:28,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:28,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:28,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:28,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:28,276 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-15 11:11:28,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:28,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:28,277 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:28,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:28,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:28,277 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-15 11:11:28,289 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:28,289 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:28,308 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-15 11:11:28,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:28,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:28,313 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-15 11:11:28,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:28,396 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-15 11:11:28,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:28,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-02-15 11:11:28,418 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:28,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-15 11:11:28,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-15 11:11:28,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:11:28,419 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-02-15 11:11:28,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:28,461 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-02-15 11:11:28,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:11:28,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-02-15 11:11:28,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:28,462 INFO L225 Difference]: With dead ends: 9 [2019-02-15 11:11:28,462 INFO L226 Difference]: Without dead ends: 7 [2019-02-15 11:11:28,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:11:28,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-15 11:11:28,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-15 11:11:28,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-15 11:11:28,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-02-15 11:11:28,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-02-15 11:11:28,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:28,465 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-02-15 11:11:28,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-15 11:11:28,466 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-15 11:11:28,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:11:28,466 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:28,466 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-02-15 11:11:28,467 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:28,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:28,467 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-02-15 11:11:28,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:28,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:28,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:28,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:28,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:28,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:28,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:28,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:28,847 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:28,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:28,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:28,848 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-15 11:11:28,857 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:11:28,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:11:28,872 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:11:28,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:28,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:28,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:28,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:29,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:29,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:29,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-02-15 11:11:29,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:29,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 11:11:29,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 11:11:29,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:11:29,060 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-02-15 11:11:29,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:29,096 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-02-15 11:11:29,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:11:29,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-02-15 11:11:29,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:29,098 INFO L225 Difference]: With dead ends: 10 [2019-02-15 11:11:29,098 INFO L226 Difference]: Without dead ends: 8 [2019-02-15 11:11:29,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:11:29,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-15 11:11:29,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-02-15 11:11:29,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-15 11:11:29,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-15 11:11:29,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-02-15 11:11:29,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:29,105 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-15 11:11:29,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 11:11:29,105 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-15 11:11:29,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:11:29,106 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:29,106 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-02-15 11:11:29,106 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:29,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:29,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-02-15 11:11:29,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:29,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:29,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:29,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:29,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:29,627 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-15 11:11:29,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:29,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:29,628 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:29,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:29,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:29,628 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-15 11:11:29,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:29,646 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:29,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:29,677 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-15 11:11:29,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:29,847 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-15 11:11:29,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:29,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-02-15 11:11:29,868 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:29,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 11:11:29,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 11:11:29,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:11:29,869 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-02-15 11:11:29,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:29,998 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-02-15 11:11:29,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:11:29,999 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-15 11:11:29,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:30,000 INFO L225 Difference]: With dead ends: 11 [2019-02-15 11:11:30,000 INFO L226 Difference]: Without dead ends: 9 [2019-02-15 11:11:30,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:11:30,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-15 11:11:30,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-15 11:11:30,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-15 11:11:30,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-02-15 11:11:30,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-02-15 11:11:30,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:30,005 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-02-15 11:11:30,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 11:11:30,005 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-02-15 11:11:30,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:11:30,006 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:30,008 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-02-15 11:11:30,008 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:30,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:30,009 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-02-15 11:11:30,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:30,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:30,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:30,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:30,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:30,159 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:30,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:30,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:30,159 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:30,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:30,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:30,160 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-15 11:11:30,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:30,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:30,203 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-15 11:11:30,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:30,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:30,208 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:30,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:30,656 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:30,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:30,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-02-15 11:11:30,676 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:30,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:11:30,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:11:30,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:11:30,677 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-02-15 11:11:30,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:30,702 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-02-15 11:11:30,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:11:30,703 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-02-15 11:11:30,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:30,704 INFO L225 Difference]: With dead ends: 12 [2019-02-15 11:11:30,704 INFO L226 Difference]: Without dead ends: 10 [2019-02-15 11:11:30,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:11:30,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-15 11:11:30,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-02-15 11:11:30,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-15 11:11:30,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-02-15 11:11:30,707 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-02-15 11:11:30,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:30,707 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-02-15 11:11:30,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:11:30,707 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-02-15 11:11:30,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:11:30,708 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:30,708 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-02-15 11:11:30,708 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:30,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:30,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-02-15 11:11:30,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:30,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:30,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:30,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:30,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:30,849 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-15 11:11:30,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:30,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:30,850 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:30,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:30,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:30,850 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-15 11:11:30,859 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:11:30,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:11:30,868 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:11:30,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:30,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:30,875 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-15 11:11:30,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:31,099 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-15 11:11:31,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:31,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-02-15 11:11:31,121 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:31,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 11:11:31,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 11:11:31,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:11:31,122 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-02-15 11:11:31,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:31,171 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-02-15 11:11:31,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:11:31,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-02-15 11:11:31,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:31,172 INFO L225 Difference]: With dead ends: 13 [2019-02-15 11:11:31,172 INFO L226 Difference]: Without dead ends: 11 [2019-02-15 11:11:31,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:11:31,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-15 11:11:31,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-15 11:11:31,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-15 11:11:31,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-02-15 11:11:31,175 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-02-15 11:11:31,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:31,175 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-02-15 11:11:31,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 11:11:31,176 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-02-15 11:11:31,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-15 11:11:31,176 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:31,176 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-02-15 11:11:31,177 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:31,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:31,177 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-02-15 11:11:31,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:31,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:31,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:31,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:31,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:31,323 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:31,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:31,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:31,324 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:31,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:31,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:31,325 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-15 11:11:31,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:31,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:31,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:31,355 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:31,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:31,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:31,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-02-15 11:11:31,614 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:31,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:11:31,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:11:31,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:11:31,615 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-02-15 11:11:31,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:31,645 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-02-15 11:11:31,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:11:31,648 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-02-15 11:11:31,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:31,649 INFO L225 Difference]: With dead ends: 14 [2019-02-15 11:11:31,649 INFO L226 Difference]: Without dead ends: 12 [2019-02-15 11:11:31,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:11:31,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-15 11:11:31,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-15 11:11:31,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-15 11:11:31,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-02-15 11:11:31,653 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-02-15 11:11:31,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:31,653 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-02-15 11:11:31,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:11:31,653 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-02-15 11:11:31,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-15 11:11:31,654 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:31,654 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-02-15 11:11:31,654 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:31,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:31,655 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-02-15 11:11:31,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:31,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:31,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:31,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:31,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:31,776 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-15 11:11:31,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:31,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:31,777 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:31,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:31,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:31,777 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-15 11:11:31,786 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:31,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:31,798 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-02-15 11:11:31,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:31,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:31,805 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-15 11:11:31,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:31,995 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-15 11:11:32,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:32,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-02-15 11:11:32,016 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:32,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:11:32,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:11:32,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-15 11:11:32,018 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-02-15 11:11:32,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:32,044 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-02-15 11:11:32,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:11:32,044 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-02-15 11:11:32,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:32,045 INFO L225 Difference]: With dead ends: 15 [2019-02-15 11:11:32,045 INFO L226 Difference]: Without dead ends: 13 [2019-02-15 11:11:32,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-15 11:11:32,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-15 11:11:32,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-15 11:11:32,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-15 11:11:32,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-02-15 11:11:32,048 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-02-15 11:11:32,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:32,048 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-02-15 11:11:32,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:11:32,048 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-02-15 11:11:32,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-15 11:11:32,049 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:32,049 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-02-15 11:11:32,049 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:32,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:32,049 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-02-15 11:11:32,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:32,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:32,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:32,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:32,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:32,160 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:32,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:32,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:32,160 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:32,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:32,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:32,161 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-15 11:11:32,172 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:11:32,172 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:11:32,192 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:11:32,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:32,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:32,198 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:32,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:32,625 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:32,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:32,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-02-15 11:11:32,646 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:32,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:11:32,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:11:32,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-15 11:11:32,647 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-02-15 11:11:32,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:32,710 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-02-15 11:11:32,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-15 11:11:32,710 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-02-15 11:11:32,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:32,711 INFO L225 Difference]: With dead ends: 16 [2019-02-15 11:11:32,711 INFO L226 Difference]: Without dead ends: 14 [2019-02-15 11:11:32,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-15 11:11:32,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-15 11:11:32,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-02-15 11:11:32,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-15 11:11:32,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-02-15 11:11:32,716 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-02-15 11:11:32,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:32,716 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-02-15 11:11:32,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:11:32,716 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-02-15 11:11:32,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-02-15 11:11:32,717 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:32,717 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-02-15 11:11:32,717 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:32,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:32,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-02-15 11:11:32,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:32,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:32,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:32,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:32,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:32,830 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-15 11:11:32,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:32,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:32,830 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:32,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:32,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:32,831 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-15 11:11:32,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:32,841 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:32,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:32,859 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-15 11:11:32,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:33,104 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-15 11:11:33,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:33,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-02-15 11:11:33,125 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:33,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 11:11:33,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 11:11:33,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-15 11:11:33,128 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-02-15 11:11:33,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:33,199 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-02-15 11:11:33,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-15 11:11:33,199 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-02-15 11:11:33,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:33,200 INFO L225 Difference]: With dead ends: 17 [2019-02-15 11:11:33,200 INFO L226 Difference]: Without dead ends: 15 [2019-02-15 11:11:33,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-15 11:11:33,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-15 11:11:33,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-15 11:11:33,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-15 11:11:33,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-02-15 11:11:33,205 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-02-15 11:11:33,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:33,205 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-02-15 11:11:33,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 11:11:33,206 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-02-15 11:11:33,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-02-15 11:11:33,206 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:33,206 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-02-15 11:11:33,207 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:33,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:33,207 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-02-15 11:11:33,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:33,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:33,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:33,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:33,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:33,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:33,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:33,531 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:33,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:33,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:33,532 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-15 11:11:33,548 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:33,548 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:33,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-02-15 11:11:33,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:33,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:33,610 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:33,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:34,120 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:34,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:34,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-02-15 11:11:34,142 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:34,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-15 11:11:34,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-15 11:11:34,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-15 11:11:34,143 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-02-15 11:11:34,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:34,184 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-02-15 11:11:34,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-15 11:11:34,185 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-02-15 11:11:34,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:34,185 INFO L225 Difference]: With dead ends: 18 [2019-02-15 11:11:34,185 INFO L226 Difference]: Without dead ends: 16 [2019-02-15 11:11:34,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-15 11:11:34,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-15 11:11:34,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-02-15 11:11:34,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-15 11:11:34,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-02-15 11:11:34,188 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-02-15 11:11:34,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:34,189 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-02-15 11:11:34,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-15 11:11:34,189 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-02-15 11:11:34,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-02-15 11:11:34,189 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:34,189 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-02-15 11:11:34,190 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:34,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:34,190 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-02-15 11:11:34,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:34,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:34,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:34,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:34,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:34,345 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-15 11:11:34,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:34,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:34,346 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:34,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:34,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:34,346 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-15 11:11:34,357 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:11:34,357 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:11:34,368 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:11:34,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:34,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:34,376 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-15 11:11:34,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:34,635 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-15 11:11:34,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:34,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-02-15 11:11:34,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:34,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-15 11:11:34,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-15 11:11:34,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-15 11:11:34,657 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-02-15 11:11:34,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:34,722 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-02-15 11:11:34,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-15 11:11:34,722 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-02-15 11:11:34,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:34,723 INFO L225 Difference]: With dead ends: 19 [2019-02-15 11:11:34,723 INFO L226 Difference]: Without dead ends: 17 [2019-02-15 11:11:34,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-15 11:11:34,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-15 11:11:34,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-15 11:11:34,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-15 11:11:34,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-02-15 11:11:34,728 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-02-15 11:11:34,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:34,728 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-02-15 11:11:34,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-15 11:11:34,728 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-02-15 11:11:34,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-15 11:11:34,729 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:34,729 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-02-15 11:11:34,729 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:34,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:34,730 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-02-15 11:11:34,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:34,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:34,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:34,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:34,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:34,895 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:34,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:34,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:34,896 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:34,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:34,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:34,896 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-15 11:11:34,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:34,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:34,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:34,925 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:34,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:35,442 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:35,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:35,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-02-15 11:11:35,462 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:35,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-15 11:11:35,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-15 11:11:35,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-15 11:11:35,463 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-02-15 11:11:35,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:35,493 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-02-15 11:11:35,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-15 11:11:35,497 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-02-15 11:11:35,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:35,498 INFO L225 Difference]: With dead ends: 20 [2019-02-15 11:11:35,498 INFO L226 Difference]: Without dead ends: 18 [2019-02-15 11:11:35,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-15 11:11:35,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-02-15 11:11:35,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-02-15 11:11:35,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-15 11:11:35,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-02-15 11:11:35,504 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-02-15 11:11:35,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:35,504 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-02-15 11:11:35,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-15 11:11:35,504 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-02-15 11:11:35,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-02-15 11:11:35,505 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:35,505 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-02-15 11:11:35,505 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:35,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:35,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-02-15 11:11:35,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:35,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:35,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:35,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:35,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:35,779 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-15 11:11:35,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:35,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:35,779 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:35,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:35,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:35,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 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-15 11:11:35,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:35,788 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:35,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-15 11:11:35,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:35,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:35,920 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-15 11:11:35,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:36,819 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-15 11:11:36,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:36,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-02-15 11:11:36,838 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:36,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-15 11:11:36,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-15 11:11:36,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-15 11:11:36,839 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-02-15 11:11:36,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:36,869 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-02-15 11:11:36,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-15 11:11:36,870 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-02-15 11:11:36,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:36,871 INFO L225 Difference]: With dead ends: 21 [2019-02-15 11:11:36,871 INFO L226 Difference]: Without dead ends: 19 [2019-02-15 11:11:36,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-15 11:11:36,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-15 11:11:36,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-15 11:11:36,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-15 11:11:36,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-02-15 11:11:36,875 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-02-15 11:11:36,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:36,876 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-02-15 11:11:36,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-15 11:11:36,876 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-02-15 11:11:36,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-15 11:11:36,877 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:36,877 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-02-15 11:11:36,877 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:36,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:36,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-02-15 11:11:36,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:36,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:36,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:36,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:36,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:37,141 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:37,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:37,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:37,142 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:37,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:37,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:37,142 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-15 11:11:37,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:11:37,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:11:37,165 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:11:37,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:37,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:37,174 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:37,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:37,519 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:37,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:37,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-02-15 11:11:37,540 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:37,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-15 11:11:37,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-15 11:11:37,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-15 11:11:37,541 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-02-15 11:11:37,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:37,585 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-02-15 11:11:37,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-15 11:11:37,586 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-02-15 11:11:37,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:37,587 INFO L225 Difference]: With dead ends: 22 [2019-02-15 11:11:37,587 INFO L226 Difference]: Without dead ends: 20 [2019-02-15 11:11:37,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-15 11:11:37,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-15 11:11:37,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-02-15 11:11:37,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-15 11:11:37,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-02-15 11:11:37,593 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-02-15 11:11:37,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:37,593 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-02-15 11:11:37,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-15 11:11:37,594 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-02-15 11:11:37,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-02-15 11:11:37,594 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:37,595 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-02-15 11:11:37,595 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:37,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:37,595 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-02-15 11:11:37,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:37,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:37,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:37,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:37,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:38,471 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-15 11:11:38,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:38,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:38,473 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:38,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:38,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:38,473 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-15 11:11:38,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:38,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:38,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:38,520 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-15 11:11:38,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:39,338 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-15 11:11:39,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:39,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-02-15 11:11:39,360 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:39,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-15 11:11:39,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-15 11:11:39,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-15 11:11:39,361 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-02-15 11:11:39,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:39,388 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-02-15 11:11:39,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-15 11:11:39,389 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-02-15 11:11:39,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:39,390 INFO L225 Difference]: With dead ends: 23 [2019-02-15 11:11:39,390 INFO L226 Difference]: Without dead ends: 21 [2019-02-15 11:11:39,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-15 11:11:39,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-15 11:11:39,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-15 11:11:39,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-15 11:11:39,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-02-15 11:11:39,394 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-02-15 11:11:39,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:39,394 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-02-15 11:11:39,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-15 11:11:39,394 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-02-15 11:11:39,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-15 11:11:39,395 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:39,395 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-02-15 11:11:39,395 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:39,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:39,395 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-02-15 11:11:39,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:39,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:39,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:39,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:39,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:39,606 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:39,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:39,606 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:39,607 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:39,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:39,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:39,607 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-15 11:11:39,616 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:39,616 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:39,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-02-15 11:11:39,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:39,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:39,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:40,540 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:40,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:40,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-02-15 11:11:40,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:40,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-15 11:11:40,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-15 11:11:40,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-15 11:11:40,562 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-02-15 11:11:40,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:40,590 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-02-15 11:11:40,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-15 11:11:40,591 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-02-15 11:11:40,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:40,592 INFO L225 Difference]: With dead ends: 24 [2019-02-15 11:11:40,592 INFO L226 Difference]: Without dead ends: 22 [2019-02-15 11:11:40,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-15 11:11:40,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-02-15 11:11:40,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-02-15 11:11:40,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-15 11:11:40,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-02-15 11:11:40,598 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-02-15 11:11:40,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:40,598 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-02-15 11:11:40,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-15 11:11:40,598 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-02-15 11:11:40,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-02-15 11:11:40,599 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:40,599 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-02-15 11:11:40,599 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:40,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:40,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-02-15 11:11:40,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:40,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:40,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:40,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:40,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:41,461 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-15 11:11:41,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:41,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:41,462 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:41,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:41,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:41,462 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-15 11:11:41,471 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:11:41,471 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:11:41,485 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:11:41,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:41,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:41,494 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-15 11:11:41,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:42,105 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-15 11:11:42,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:42,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-02-15 11:11:42,125 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:42,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-15 11:11:42,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-15 11:11:42,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-15 11:11:42,127 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-02-15 11:11:42,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:42,161 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-02-15 11:11:42,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-15 11:11:42,162 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-02-15 11:11:42,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:42,163 INFO L225 Difference]: With dead ends: 25 [2019-02-15 11:11:42,163 INFO L226 Difference]: Without dead ends: 23 [2019-02-15 11:11:42,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-15 11:11:42,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-15 11:11:42,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-02-15 11:11:42,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-15 11:11:42,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-02-15 11:11:42,168 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-02-15 11:11:42,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:42,168 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-02-15 11:11:42,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-15 11:11:42,168 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-02-15 11:11:42,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-15 11:11:42,169 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:42,169 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-02-15 11:11:42,169 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:42,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:42,170 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-02-15 11:11:42,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:42,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:42,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:42,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:42,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:42,461 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:42,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:42,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:42,462 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:42,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:42,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:42,462 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-15 11:11:42,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:42,472 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:42,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:42,493 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:42,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:43,037 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:43,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:43,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-02-15 11:11:43,058 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:43,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-15 11:11:43,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-15 11:11:43,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-15 11:11:43,059 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-02-15 11:11:43,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:43,123 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-02-15 11:11:43,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-15 11:11:43,124 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-02-15 11:11:43,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:43,125 INFO L225 Difference]: With dead ends: 26 [2019-02-15 11:11:43,125 INFO L226 Difference]: Without dead ends: 24 [2019-02-15 11:11:43,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-15 11:11:43,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-15 11:11:43,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-02-15 11:11:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-15 11:11:43,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-02-15 11:11:43,129 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-02-15 11:11:43,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:43,129 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-02-15 11:11:43,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-15 11:11:43,129 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-02-15 11:11:43,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-02-15 11:11:43,130 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:43,130 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-02-15 11:11:43,130 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:43,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:43,131 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-02-15 11:11:43,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:43,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:43,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:43,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:43,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:43,433 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-15 11:11:43,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:43,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:43,434 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:43,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:43,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:43,434 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-15 11:11:43,443 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:43,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:43,471 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-15 11:11:43,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:43,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:43,478 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-15 11:11:43,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:43,990 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-15 11:11:44,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:44,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-02-15 11:11:44,011 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:44,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-15 11:11:44,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-15 11:11:44,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-15 11:11:44,013 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-02-15 11:11:44,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:44,074 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-02-15 11:11:44,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-15 11:11:44,075 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-02-15 11:11:44,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:44,077 INFO L225 Difference]: With dead ends: 27 [2019-02-15 11:11:44,077 INFO L226 Difference]: Without dead ends: 25 [2019-02-15 11:11:44,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-15 11:11:44,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-15 11:11:44,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-02-15 11:11:44,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-15 11:11:44,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-02-15 11:11:44,081 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-02-15 11:11:44,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:44,081 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-02-15 11:11:44,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-15 11:11:44,082 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-02-15 11:11:44,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-15 11:11:44,082 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:44,082 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-02-15 11:11:44,083 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:44,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:44,083 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-02-15 11:11:44,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:44,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:44,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:44,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:44,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:44,577 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:44,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:44,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:44,578 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:44,578 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:44,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:44,578 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-15 11:11:44,588 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:11:44,588 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:11:44,606 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:11:44,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:44,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:44,616 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:44,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:45,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:45,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-02-15 11:11:45,357 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:45,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-15 11:11:45,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-15 11:11:45,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-15 11:11:45,358 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-02-15 11:11:45,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:45,437 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-02-15 11:11:45,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-15 11:11:45,441 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-02-15 11:11:45,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:45,441 INFO L225 Difference]: With dead ends: 28 [2019-02-15 11:11:45,441 INFO L226 Difference]: Without dead ends: 26 [2019-02-15 11:11:45,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-15 11:11:45,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-15 11:11:45,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-02-15 11:11:45,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-15 11:11:45,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-02-15 11:11:45,446 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-02-15 11:11:45,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:45,446 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-02-15 11:11:45,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-15 11:11:45,446 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-02-15 11:11:45,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-02-15 11:11:45,447 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:45,447 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-02-15 11:11:45,447 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:45,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:45,447 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-02-15 11:11:45,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:45,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:45,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:45,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:45,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:46,118 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-15 11:11:46,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:46,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:46,119 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:46,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:46,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:46,119 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-15 11:11:46,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:46,129 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:46,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:46,152 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-15 11:11:46,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:46,983 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-15 11:11:47,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:47,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-02-15 11:11:47,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:47,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-15 11:11:47,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-15 11:11:47,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-15 11:11:47,004 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-02-15 11:11:47,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:47,040 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-02-15 11:11:47,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-15 11:11:47,041 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-02-15 11:11:47,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:47,041 INFO L225 Difference]: With dead ends: 29 [2019-02-15 11:11:47,041 INFO L226 Difference]: Without dead ends: 27 [2019-02-15 11:11:47,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-15 11:11:47,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-15 11:11:47,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-02-15 11:11:47,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-15 11:11:47,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-02-15 11:11:47,047 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-02-15 11:11:47,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:47,047 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-02-15 11:11:47,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-15 11:11:47,048 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-02-15 11:11:47,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-02-15 11:11:47,048 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:47,048 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-02-15 11:11:47,048 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:47,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:47,049 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-02-15 11:11:47,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:47,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:47,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:47,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:47,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:47,426 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:47,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:47,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:47,427 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:47,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:47,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:47,427 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-15 11:11:47,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:47,436 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:47,472 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-15 11:11:47,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:47,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:47,480 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:47,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:48,204 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:48,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:48,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-02-15 11:11:48,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:48,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-15 11:11:48,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-15 11:11:48,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-15 11:11:48,228 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-02-15 11:11:48,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:48,272 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-02-15 11:11:48,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-15 11:11:48,273 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-02-15 11:11:48,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:48,273 INFO L225 Difference]: With dead ends: 30 [2019-02-15 11:11:48,274 INFO L226 Difference]: Without dead ends: 28 [2019-02-15 11:11:48,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-15 11:11:48,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-15 11:11:48,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-02-15 11:11:48,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-15 11:11:48,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-02-15 11:11:48,280 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-02-15 11:11:48,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:48,281 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-02-15 11:11:48,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-15 11:11:48,281 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-02-15 11:11:48,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-15 11:11:48,282 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:48,282 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-02-15 11:11:48,282 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:48,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:48,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-02-15 11:11:48,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:48,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:48,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:48,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:48,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:48,692 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-15 11:11:48,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:48,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:48,693 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:48,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:48,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:48,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 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-15 11:11:48,704 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:11:48,704 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:11:48,721 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:11:48,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:48,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:48,731 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-15 11:11:48,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:49,680 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-15 11:11:49,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:49,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-02-15 11:11:49,700 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:49,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-15 11:11:49,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-15 11:11:49,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-15 11:11:49,702 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-02-15 11:11:49,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:49,757 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-02-15 11:11:49,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-15 11:11:49,758 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-02-15 11:11:49,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:49,758 INFO L225 Difference]: With dead ends: 31 [2019-02-15 11:11:49,758 INFO L226 Difference]: Without dead ends: 29 [2019-02-15 11:11:49,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-15 11:11:49,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-15 11:11:49,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-02-15 11:11:49,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-15 11:11:49,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-02-15 11:11:49,764 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-02-15 11:11:49,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:49,764 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-02-15 11:11:49,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-15 11:11:49,765 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-02-15 11:11:49,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-15 11:11:49,765 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:49,765 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-02-15 11:11:49,766 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:49,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:49,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-02-15 11:11:49,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:49,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:49,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:49,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:49,767 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:50,083 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:50,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:50,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:50,084 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:50,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:50,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:50,085 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-15 11:11:50,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:50,095 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:50,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:50,123 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:50,123 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:51,023 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:51,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:51,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-02-15 11:11:51,042 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:51,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-15 11:11:51,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-15 11:11:51,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-15 11:11:51,044 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-02-15 11:11:51,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:51,106 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-02-15 11:11:51,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-15 11:11:51,107 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-02-15 11:11:51,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:51,107 INFO L225 Difference]: With dead ends: 32 [2019-02-15 11:11:51,107 INFO L226 Difference]: Without dead ends: 30 [2019-02-15 11:11:51,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-15 11:11:51,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-02-15 11:11:51,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-02-15 11:11:51,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-15 11:11:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-02-15 11:11:51,113 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-02-15 11:11:51,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:51,113 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-02-15 11:11:51,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-15 11:11:51,113 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-02-15 11:11:51,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-02-15 11:11:51,114 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:51,114 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-02-15 11:11:51,114 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:51,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:51,114 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-02-15 11:11:51,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:51,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:51,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:51,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:51,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:51,870 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-15 11:11:51,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:51,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:51,871 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:51,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:51,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:51,871 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-15 11:11:51,880 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:51,880 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:51,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-02-15 11:11:51,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:51,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:51,934 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-15 11:11:51,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:53,163 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-15 11:11:53,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:53,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-02-15 11:11:53,182 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:53,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-15 11:11:53,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-15 11:11:53,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-15 11:11:53,184 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-02-15 11:11:53,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:53,424 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-02-15 11:11:53,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-15 11:11:53,425 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-02-15 11:11:53,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:53,426 INFO L225 Difference]: With dead ends: 33 [2019-02-15 11:11:53,426 INFO L226 Difference]: Without dead ends: 31 [2019-02-15 11:11:53,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-15 11:11:53,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-15 11:11:53,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-02-15 11:11:53,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-15 11:11:53,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-02-15 11:11:53,431 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-02-15 11:11:53,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:53,431 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-02-15 11:11:53,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-15 11:11:53,432 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-02-15 11:11:53,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-15 11:11:53,432 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:53,432 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-02-15 11:11:53,433 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:53,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:53,433 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-02-15 11:11:53,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:53,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:53,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:53,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:53,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:54,766 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:54,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:54,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:54,767 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:54,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:54,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:54,767 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-15 11:11:54,776 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:11:54,777 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:11:54,796 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:11:54,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:54,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:54,806 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:54,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:55,734 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:55,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:55,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-02-15 11:11:55,753 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:55,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-15 11:11:55,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-15 11:11:55,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-15 11:11:55,755 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-02-15 11:11:55,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:55,788 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-02-15 11:11:55,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-15 11:11:55,797 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-02-15 11:11:55,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:55,798 INFO L225 Difference]: With dead ends: 34 [2019-02-15 11:11:55,798 INFO L226 Difference]: Without dead ends: 32 [2019-02-15 11:11:55,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-15 11:11:55,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-15 11:11:55,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-02-15 11:11:55,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-15 11:11:55,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-02-15 11:11:55,802 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-02-15 11:11:55,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:55,802 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-02-15 11:11:55,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-15 11:11:55,803 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-02-15 11:11:55,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-02-15 11:11:55,803 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:55,803 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-02-15 11:11:55,803 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:55,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:55,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-02-15 11:11:55,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:55,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:55,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:55,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:55,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:56,231 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-15 11:11:56,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:56,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:56,232 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:56,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:56,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:56,232 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-15 11:11:56,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:56,243 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:56,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:56,269 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-15 11:11:56,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:57,206 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-15 11:11:57,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:57,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-02-15 11:11:57,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:57,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-15 11:11:57,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-15 11:11:57,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-15 11:11:57,228 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-02-15 11:11:57,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:57,302 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-02-15 11:11:57,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-15 11:11:57,303 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-02-15 11:11:57,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:57,303 INFO L225 Difference]: With dead ends: 35 [2019-02-15 11:11:57,304 INFO L226 Difference]: Without dead ends: 33 [2019-02-15 11:11:57,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-15 11:11:57,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-15 11:11:57,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-02-15 11:11:57,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-15 11:11:57,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-02-15 11:11:57,308 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-02-15 11:11:57,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:57,308 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-02-15 11:11:57,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-15 11:11:57,309 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-02-15 11:11:57,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-15 11:11:57,309 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:57,309 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-02-15 11:11:57,310 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:57,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:57,310 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-02-15 11:11:57,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:57,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:57,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:57,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:57,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:57,972 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:57,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:57,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:57,973 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:57,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:57,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:57,974 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-15 11:11:57,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:57,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:58,036 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-15 11:11:58,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:58,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:58,046 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:58,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:59,009 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:59,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:59,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-02-15 11:11:59,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:59,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-15 11:11:59,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-15 11:11:59,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-15 11:11:59,032 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-02-15 11:11:59,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:59,085 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-02-15 11:11:59,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-15 11:11:59,086 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-02-15 11:11:59,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:59,086 INFO L225 Difference]: With dead ends: 36 [2019-02-15 11:11:59,086 INFO L226 Difference]: Without dead ends: 34 [2019-02-15 11:11:59,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-15 11:11:59,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-02-15 11:11:59,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-02-15 11:11:59,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-15 11:11:59,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-02-15 11:11:59,090 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-02-15 11:11:59,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:59,090 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-02-15 11:11:59,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-15 11:11:59,091 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-02-15 11:11:59,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-02-15 11:11:59,091 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:59,091 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-02-15 11:11:59,091 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:59,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:59,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-02-15 11:11:59,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:59,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:59,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:59,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:59,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:59,989 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-15 11:11:59,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:59,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:59,990 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:59,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:59,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:59,990 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-15 11:12:00,008 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:00,008 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:00,030 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:00,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:00,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:00,040 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-15 11:12:00,040 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:01,074 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-15 11:12:01,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:01,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-02-15 11:12:01,093 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:01,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-15 11:12:01,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-15 11:12:01,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-15 11:12:01,094 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-02-15 11:12:01,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:01,180 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-02-15 11:12:01,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-15 11:12:01,180 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-02-15 11:12:01,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:01,181 INFO L225 Difference]: With dead ends: 37 [2019-02-15 11:12:01,181 INFO L226 Difference]: Without dead ends: 35 [2019-02-15 11:12:01,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-15 11:12:01,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-15 11:12:01,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-02-15 11:12:01,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-15 11:12:01,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-02-15 11:12:01,185 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-02-15 11:12:01,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:01,185 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-02-15 11:12:01,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-15 11:12:01,185 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-02-15 11:12:01,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-15 11:12:01,185 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:01,185 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-02-15 11:12:01,186 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:01,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:01,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-02-15 11:12:01,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:01,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:01,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:01,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:01,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:01,649 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:01,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:01,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:01,650 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:01,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:01,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:01,650 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-15 11:12:01,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:01,660 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:01,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:01,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:02,850 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:02,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:02,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-02-15 11:12:02,870 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:02,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-15 11:12:02,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-15 11:12:02,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-15 11:12:02,872 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-02-15 11:12:02,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:02,939 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-02-15 11:12:02,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-15 11:12:02,940 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-02-15 11:12:02,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:02,941 INFO L225 Difference]: With dead ends: 38 [2019-02-15 11:12:02,941 INFO L226 Difference]: Without dead ends: 36 [2019-02-15 11:12:02,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-15 11:12:02,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-15 11:12:02,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-02-15 11:12:02,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-15 11:12:02,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-02-15 11:12:02,945 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-02-15 11:12:02,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:02,945 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-02-15 11:12:02,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-15 11:12:02,945 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-02-15 11:12:02,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-02-15 11:12:02,946 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:02,946 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-02-15 11:12:02,946 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:02,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:02,946 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-02-15 11:12:02,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:02,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:02,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:02,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:02,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:03,515 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-15 11:12:03,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:03,516 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:03,516 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:03,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:03,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:03,517 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-15 11:12:03,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:03,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:03,587 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-02-15 11:12:03,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:03,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:03,597 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-15 11:12:03,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:05,180 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-15 11:12:05,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:05,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-02-15 11:12:05,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:05,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-15 11:12:05,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-15 11:12:05,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-15 11:12:05,202 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-02-15 11:12:05,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:05,268 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-02-15 11:12:05,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-15 11:12:05,268 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-02-15 11:12:05,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:05,269 INFO L225 Difference]: With dead ends: 39 [2019-02-15 11:12:05,269 INFO L226 Difference]: Without dead ends: 37 [2019-02-15 11:12:05,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-15 11:12:05,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-15 11:12:05,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-02-15 11:12:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-15 11:12:05,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-02-15 11:12:05,274 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-02-15 11:12:05,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:05,274 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-02-15 11:12:05,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-15 11:12:05,274 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-02-15 11:12:05,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-15 11:12:05,275 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:05,275 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-02-15 11:12:05,275 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:05,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:05,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-02-15 11:12:05,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:05,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:05,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:05,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:05,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:05,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:05,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:05,781 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:05,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:05,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:05,781 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-15 11:12:05,791 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:05,791 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:05,816 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:05,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:05,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:05,827 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:05,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:07,084 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:07,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:07,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-02-15 11:12:07,104 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:07,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-15 11:12:07,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-15 11:12:07,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-15 11:12:07,106 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-02-15 11:12:07,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:07,211 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-02-15 11:12:07,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-15 11:12:07,212 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-02-15 11:12:07,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:07,213 INFO L225 Difference]: With dead ends: 40 [2019-02-15 11:12:07,213 INFO L226 Difference]: Without dead ends: 38 [2019-02-15 11:12:07,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-15 11:12:07,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-15 11:12:07,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-02-15 11:12:07,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-15 11:12:07,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-02-15 11:12:07,216 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-02-15 11:12:07,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:07,216 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-02-15 11:12:07,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-15 11:12:07,216 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-02-15 11:12:07,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-02-15 11:12:07,216 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:07,217 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-02-15 11:12:07,218 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:07,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:07,218 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-02-15 11:12:07,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:07,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:07,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:07,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:07,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:07,806 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-15 11:12:07,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:07,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:07,806 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:07,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:07,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:07,807 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-15 11:12:07,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:07,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:07,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:07,864 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-15 11:12:07,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:09,317 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-15 11:12:09,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:09,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-02-15 11:12:09,336 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:09,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-15 11:12:09,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-15 11:12:09,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-15 11:12:09,337 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-02-15 11:12:09,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:09,407 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-02-15 11:12:09,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-15 11:12:09,408 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-02-15 11:12:09,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:09,408 INFO L225 Difference]: With dead ends: 41 [2019-02-15 11:12:09,409 INFO L226 Difference]: Without dead ends: 39 [2019-02-15 11:12:09,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-15 11:12:09,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-15 11:12:09,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-02-15 11:12:09,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-15 11:12:09,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-02-15 11:12:09,412 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-02-15 11:12:09,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:09,413 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-02-15 11:12:09,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-15 11:12:09,413 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-02-15 11:12:09,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-02-15 11:12:09,413 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:09,414 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-02-15 11:12:09,414 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:09,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:09,414 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-02-15 11:12:09,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:09,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:09,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:09,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:09,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:10,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:10,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:10,259 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:10,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:10,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:10,259 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-15 11:12:10,267 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:10,267 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:10,341 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-02-15 11:12:10,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:10,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:10,353 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:10,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:11,852 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:11,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:11,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-02-15 11:12:11,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:11,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-15 11:12:11,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-15 11:12:11,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-15 11:12:11,873 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-02-15 11:12:11,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:11,924 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-02-15 11:12:11,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-15 11:12:11,925 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-02-15 11:12:11,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:11,925 INFO L225 Difference]: With dead ends: 42 [2019-02-15 11:12:11,925 INFO L226 Difference]: Without dead ends: 40 [2019-02-15 11:12:11,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-15 11:12:11,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-15 11:12:11,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-02-15 11:12:11,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-15 11:12:11,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-02-15 11:12:11,929 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-02-15 11:12:11,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:11,929 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-02-15 11:12:11,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-15 11:12:11,930 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-02-15 11:12:11,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-02-15 11:12:11,930 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:11,930 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-02-15 11:12:11,930 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:11,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:11,931 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-02-15 11:12:11,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:11,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:11,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:11,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:11,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:12,501 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-15 11:12:12,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:12,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:12,502 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:12,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:12,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:12,502 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-15 11:12:12,511 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:12,511 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:12,535 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:12,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:12,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:12,545 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-15 11:12:12,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:13,989 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-15 11:12:14,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:14,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-02-15 11:12:14,010 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:14,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-15 11:12:14,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-15 11:12:14,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-15 11:12:14,011 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-02-15 11:12:14,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:14,067 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-02-15 11:12:14,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-15 11:12:14,067 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-02-15 11:12:14,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:14,068 INFO L225 Difference]: With dead ends: 43 [2019-02-15 11:12:14,068 INFO L226 Difference]: Without dead ends: 41 [2019-02-15 11:12:14,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-15 11:12:14,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-15 11:12:14,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-02-15 11:12:14,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-15 11:12:14,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-02-15 11:12:14,071 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-02-15 11:12:14,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:14,071 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-02-15 11:12:14,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-15 11:12:14,072 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-02-15 11:12:14,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-15 11:12:14,072 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:14,072 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-02-15 11:12:14,072 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:14,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:14,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-02-15 11:12:14,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:14,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:14,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:14,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:14,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:15,680 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:15,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:15,681 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:15,681 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:15,681 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:15,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:15,682 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-15 11:12:15,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:15,689 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:15,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:15,723 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:15,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:17,275 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:17,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:17,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-02-15 11:12:17,294 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:17,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-15 11:12:17,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-15 11:12:17,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-15 11:12:17,295 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-02-15 11:12:17,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:17,361 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-02-15 11:12:17,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-15 11:12:17,361 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-02-15 11:12:17,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:17,362 INFO L225 Difference]: With dead ends: 44 [2019-02-15 11:12:17,362 INFO L226 Difference]: Without dead ends: 42 [2019-02-15 11:12:17,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-15 11:12:17,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-02-15 11:12:17,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-02-15 11:12:17,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-15 11:12:17,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-02-15 11:12:17,365 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-02-15 11:12:17,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:17,366 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-02-15 11:12:17,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-15 11:12:17,366 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-02-15 11:12:17,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-02-15 11:12:17,367 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:17,367 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-02-15 11:12:17,367 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:17,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:17,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-02-15 11:12:17,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:17,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:17,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:17,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:17,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:18,032 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-15 11:12:18,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:18,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:18,033 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:18,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:18,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:18,033 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-15 11:12:18,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:18,041 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:18,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-15 11:12:18,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:18,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:18,138 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-15 11:12:18,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:20,015 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-15 11:12:20,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:20,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-02-15 11:12:20,036 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:20,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-15 11:12:20,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-15 11:12:20,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-15 11:12:20,037 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-02-15 11:12:20,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:20,126 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-02-15 11:12:20,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-15 11:12:20,127 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-02-15 11:12:20,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:20,127 INFO L225 Difference]: With dead ends: 45 [2019-02-15 11:12:20,127 INFO L226 Difference]: Without dead ends: 43 [2019-02-15 11:12:20,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-15 11:12:20,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-15 11:12:20,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-02-15 11:12:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-15 11:12:20,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-02-15 11:12:20,130 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-02-15 11:12:20,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:20,130 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-02-15 11:12:20,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-15 11:12:20,130 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-02-15 11:12:20,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-02-15 11:12:20,131 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:20,131 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-02-15 11:12:20,131 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:20,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:20,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-02-15 11:12:20,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:20,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:20,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:20,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:20,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:20,997 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:20,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:20,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:20,997 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:20,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:20,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:20,998 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-15 11:12:21,006 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:21,006 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:21,034 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:21,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:21,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:21,043 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:21,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:22,740 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:22,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:22,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-02-15 11:12:22,759 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:22,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-15 11:12:22,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-15 11:12:22,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-15 11:12:22,760 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-02-15 11:12:22,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:22,832 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-02-15 11:12:22,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-15 11:12:22,833 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-02-15 11:12:22,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:22,834 INFO L225 Difference]: With dead ends: 46 [2019-02-15 11:12:22,834 INFO L226 Difference]: Without dead ends: 44 [2019-02-15 11:12:22,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-15 11:12:22,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-15 11:12:22,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-02-15 11:12:22,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-02-15 11:12:22,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-02-15 11:12:22,837 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-02-15 11:12:22,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:22,837 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-02-15 11:12:22,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-15 11:12:22,837 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-02-15 11:12:22,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-02-15 11:12:22,838 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:22,838 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-02-15 11:12:22,838 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:22,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:22,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-02-15 11:12:22,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:22,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:22,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:22,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:22,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:23,622 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-15 11:12:23,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:23,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:23,623 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:23,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:23,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:23,624 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-15 11:12:23,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:23,632 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:23,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:23,685 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-15 11:12:23,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:26,058 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-15 11:12:26,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:26,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-02-15 11:12:26,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:26,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-15 11:12:26,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-15 11:12:26,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-15 11:12:26,079 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-02-15 11:12:26,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:26,208 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-02-15 11:12:26,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-15 11:12:26,210 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-02-15 11:12:26,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:26,210 INFO L225 Difference]: With dead ends: 47 [2019-02-15 11:12:26,211 INFO L226 Difference]: Without dead ends: 45 [2019-02-15 11:12:26,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-15 11:12:26,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-15 11:12:26,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-02-15 11:12:26,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-15 11:12:26,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-02-15 11:12:26,213 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-02-15 11:12:26,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:26,214 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-02-15 11:12:26,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-15 11:12:26,214 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-02-15 11:12:26,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-15 11:12:26,214 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:26,214 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-02-15 11:12:26,214 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:26,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:26,215 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-02-15 11:12:26,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:26,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:26,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:26,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:26,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:27,008 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:27,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:27,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:27,009 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:27,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:27,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:27,009 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-15 11:12:27,018 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:27,018 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:27,133 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-15 11:12:27,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:27,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:27,144 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:27,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:29,101 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:29,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:29,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-02-15 11:12:29,122 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:29,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-15 11:12:29,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-15 11:12:29,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-15 11:12:29,123 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-02-15 11:12:29,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:29,206 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-02-15 11:12:29,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-15 11:12:29,207 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-02-15 11:12:29,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:29,207 INFO L225 Difference]: With dead ends: 48 [2019-02-15 11:12:29,207 INFO L226 Difference]: Without dead ends: 46 [2019-02-15 11:12:29,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-15 11:12:29,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-02-15 11:12:29,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-02-15 11:12:29,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-15 11:12:29,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-02-15 11:12:29,210 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-02-15 11:12:29,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:29,210 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-02-15 11:12:29,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-15 11:12:29,210 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-02-15 11:12:29,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-02-15 11:12:29,210 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:29,211 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-02-15 11:12:29,211 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:29,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:29,211 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-02-15 11:12:29,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:29,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:29,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:29,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:29,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:30,562 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-15 11:12:30,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:30,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:30,563 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:30,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:30,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:30,564 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-15 11:12:30,575 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:30,575 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:30,604 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:30,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:30,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:30,615 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-15 11:12:30,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:32,596 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-15 11:12:32,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:32,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-02-15 11:12:32,615 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:32,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-15 11:12:32,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-15 11:12:32,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-15 11:12:32,617 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-02-15 11:12:32,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:32,671 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-02-15 11:12:32,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-15 11:12:32,671 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-02-15 11:12:32,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:32,672 INFO L225 Difference]: With dead ends: 49 [2019-02-15 11:12:32,672 INFO L226 Difference]: Without dead ends: 47 [2019-02-15 11:12:32,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-15 11:12:32,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-15 11:12:32,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-02-15 11:12:32,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-15 11:12:32,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-02-15 11:12:32,675 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-02-15 11:12:32,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:32,676 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-02-15 11:12:32,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-15 11:12:32,676 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-02-15 11:12:32,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-02-15 11:12:32,676 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:32,676 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-02-15 11:12:32,677 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:32,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:32,677 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-02-15 11:12:32,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:32,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:32,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:32,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:32,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:33,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:33,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:33,676 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:33,676 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:33,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:33,676 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-15 11:12:33,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:33,685 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:33,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:33,724 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:33,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:36,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:36,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-02-15 11:12:36,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:36,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-15 11:12:36,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-15 11:12:36,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-15 11:12:36,127 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-02-15 11:12:36,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:36,216 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-02-15 11:12:36,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-15 11:12:36,217 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-02-15 11:12:36,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:36,217 INFO L225 Difference]: With dead ends: 50 [2019-02-15 11:12:36,217 INFO L226 Difference]: Without dead ends: 48 [2019-02-15 11:12:36,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-15 11:12:36,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-15 11:12:36,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-02-15 11:12:36,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-15 11:12:36,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-02-15 11:12:36,220 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-02-15 11:12:36,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:36,221 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-02-15 11:12:36,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-15 11:12:36,221 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-02-15 11:12:36,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-02-15 11:12:36,221 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:36,221 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-02-15 11:12:36,222 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:36,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:36,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-02-15 11:12:36,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:36,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:36,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:36,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:36,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:37,061 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-15 11:12:37,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:37,062 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:37,062 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:37,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:37,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:37,062 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-15 11:12:37,071 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:37,071 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:37,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-02-15 11:12:37,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:37,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:37,205 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-15 11:12:37,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:39,416 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-15 11:12:39,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:39,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-02-15 11:12:39,437 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:39,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-15 11:12:39,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-15 11:12:39,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-15 11:12:39,439 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-02-15 11:12:39,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:39,531 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-02-15 11:12:39,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-15 11:12:39,532 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-02-15 11:12:39,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:39,533 INFO L225 Difference]: With dead ends: 51 [2019-02-15 11:12:39,533 INFO L226 Difference]: Without dead ends: 49 [2019-02-15 11:12:39,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-15 11:12:39,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-15 11:12:39,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-02-15 11:12:39,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-15 11:12:39,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-02-15 11:12:39,536 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-02-15 11:12:39,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:39,536 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-02-15 11:12:39,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-15 11:12:39,536 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-02-15 11:12:39,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-15 11:12:39,537 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:39,537 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-02-15 11:12:39,537 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:39,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:39,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-02-15 11:12:39,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:39,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:39,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:39,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:39,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:40,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:40,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:40,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:40,715 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:40,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:40,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:40,716 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-15 11:12:40,725 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:40,725 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:40,781 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:40,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:40,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:40,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:40,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:43,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:43,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-02-15 11:12:43,118 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:43,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-15 11:12:43,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-15 11:12:43,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-15 11:12:43,119 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-02-15 11:12:43,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:43,392 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-02-15 11:12:43,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-15 11:12:43,393 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-02-15 11:12:43,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:43,394 INFO L225 Difference]: With dead ends: 52 [2019-02-15 11:12:43,394 INFO L226 Difference]: Without dead ends: 50 [2019-02-15 11:12:43,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-15 11:12:43,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-15 11:12:43,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-02-15 11:12:43,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-15 11:12:43,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-02-15 11:12:43,396 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-02-15 11:12:43,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:43,396 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-02-15 11:12:43,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-15 11:12:43,396 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-02-15 11:12:43,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-02-15 11:12:43,397 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:43,397 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-02-15 11:12:43,397 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:43,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:43,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-02-15 11:12:43,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:43,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:43,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:43,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:43,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:44,423 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-15 11:12:44,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:44,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:44,424 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:44,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:44,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:44,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 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-15 11:12:44,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:44,438 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:44,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:44,479 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-15 11:12:44,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:47,172 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-15 11:12:47,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:47,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-02-15 11:12:47,191 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:47,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-15 11:12:47,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-15 11:12:47,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-15 11:12:47,193 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-02-15 11:12:47,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:47,291 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-02-15 11:12:47,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-15 11:12:47,291 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-02-15 11:12:47,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:47,292 INFO L225 Difference]: With dead ends: 53 [2019-02-15 11:12:47,292 INFO L226 Difference]: Without dead ends: 51 [2019-02-15 11:12:47,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-15 11:12:47,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-15 11:12:47,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-02-15 11:12:47,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-15 11:12:47,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-02-15 11:12:47,296 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-02-15 11:12:47,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:47,296 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-02-15 11:12:47,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-15 11:12:47,296 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-02-15 11:12:47,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-02-15 11:12:47,297 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:47,297 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-02-15 11:12:47,297 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:47,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:47,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-02-15 11:12:47,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:47,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:47,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:47,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:47,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:48,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:48,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:48,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:48,373 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:48,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:48,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:48,374 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-15 11:12:48,383 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:48,383 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:48,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-15 11:12:48,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:48,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:48,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:48,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:51,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:51,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:51,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-02-15 11:12:51,535 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:51,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-15 11:12:51,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-15 11:12:51,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-15 11:12:51,537 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-02-15 11:12:51,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:51,600 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-02-15 11:12:51,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-15 11:12:51,601 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-02-15 11:12:51,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:51,602 INFO L225 Difference]: With dead ends: 54 [2019-02-15 11:12:51,602 INFO L226 Difference]: Without dead ends: 52 [2019-02-15 11:12:51,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-15 11:12:51,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-15 11:12:51,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-02-15 11:12:51,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-15 11:12:51,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-02-15 11:12:51,606 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-02-15 11:12:51,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:51,607 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-02-15 11:12:51,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-15 11:12:51,607 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-02-15 11:12:51,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-15 11:12:51,607 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:51,607 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-02-15 11:12:51,608 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:51,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:51,608 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-02-15 11:12:51,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:51,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:51,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:51,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:51,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:52,599 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-15 11:12:52,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:52,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:52,600 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:52,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:52,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:52,601 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-15 11:12:52,610 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:52,610 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:52,643 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:52,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:52,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:52,654 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-15 11:12:52,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:55,223 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-15 11:12:55,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:55,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-02-15 11:12:55,252 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:55,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-15 11:12:55,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-15 11:12:55,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-15 11:12:55,254 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-02-15 11:12:55,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:55,394 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-02-15 11:12:55,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-15 11:12:55,395 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-02-15 11:12:55,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:55,396 INFO L225 Difference]: With dead ends: 55 [2019-02-15 11:12:55,396 INFO L226 Difference]: Without dead ends: 53 [2019-02-15 11:12:55,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-15 11:12:55,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-15 11:12:55,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-02-15 11:12:55,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-15 11:12:55,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-02-15 11:12:55,398 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-02-15 11:12:55,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:55,399 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-02-15 11:12:55,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-15 11:12:55,399 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-02-15 11:12:55,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-15 11:12:55,399 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:55,399 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-02-15 11:12:55,399 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:55,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:55,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-02-15 11:12:55,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:55,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:55,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:55,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:55,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:56,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:56,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:56,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:56,949 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:56,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:56,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:56,950 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-15 11:12:56,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:56,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:56,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:57,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:59,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:59,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-02-15 11:12:59,736 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:59,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-15 11:12:59,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-15 11:12:59,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-15 11:12:59,738 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-02-15 11:12:59,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:59,800 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-02-15 11:12:59,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-15 11:12:59,800 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-02-15 11:12:59,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:59,801 INFO L225 Difference]: With dead ends: 56 [2019-02-15 11:12:59,801 INFO L226 Difference]: Without dead ends: 54 [2019-02-15 11:12:59,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-15 11:12:59,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-15 11:12:59,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-02-15 11:12:59,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-02-15 11:12:59,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-02-15 11:12:59,805 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-02-15 11:12:59,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:59,805 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-02-15 11:12:59,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-15 11:12:59,805 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-02-15 11:12:59,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-02-15 11:12:59,806 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:59,806 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-02-15 11:12:59,806 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:59,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:59,806 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-02-15 11:12:59,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:59,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:59,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:59,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:59,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:01,204 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-15 11:13:01,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:01,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:01,205 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:01,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:01,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:01,205 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-15 11:13:01,215 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:13:01,215 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:13:01,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-02-15 11:13:01,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:01,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:01,434 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-15 11:13:01,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:04,218 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-15 11:13:04,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:04,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-02-15 11:13:04,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:04,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-15 11:13:04,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-15 11:13:04,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-15 11:13:04,250 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-02-15 11:13:04,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:04,404 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-02-15 11:13:04,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-15 11:13:04,404 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-02-15 11:13:04,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:04,405 INFO L225 Difference]: With dead ends: 57 [2019-02-15 11:13:04,405 INFO L226 Difference]: Without dead ends: 55 [2019-02-15 11:13:04,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-15 11:13:04,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-15 11:13:04,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-02-15 11:13:04,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-15 11:13:04,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-02-15 11:13:04,408 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-02-15 11:13:04,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:04,408 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-02-15 11:13:04,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-15 11:13:04,408 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-02-15 11:13:04,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-02-15 11:13:04,409 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:04,409 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-02-15 11:13:04,409 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:04,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:04,409 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-02-15 11:13:04,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:04,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:04,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:04,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:04,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:05,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:05,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:05,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:05,469 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:05,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:05,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:05,470 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-15 11:13:05,481 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:13:05,481 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:13:05,516 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:13:05,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:05,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:05,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:05,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:08,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:08,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:08,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-02-15 11:13:08,610 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:08,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-15 11:13:08,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-15 11:13:08,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-15 11:13:08,613 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-02-15 11:13:08,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:08,713 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-02-15 11:13:08,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-15 11:13:08,713 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-02-15 11:13:08,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:08,714 INFO L225 Difference]: With dead ends: 58 [2019-02-15 11:13:08,714 INFO L226 Difference]: Without dead ends: 56 [2019-02-15 11:13:08,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-15 11:13:08,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-15 11:13:08,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-02-15 11:13:08,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-15 11:13:08,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-02-15 11:13:08,718 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-02-15 11:13:08,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:08,718 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-02-15 11:13:08,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-15 11:13:08,718 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-02-15 11:13:08,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-15 11:13:08,719 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:08,719 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-02-15 11:13:08,719 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:08,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:08,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-02-15 11:13:08,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:08,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:08,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:08,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:08,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:09,854 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-15 11:13:09,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:09,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:09,854 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:09,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:09,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:09,855 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-15 11:13:09,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:09,865 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:13:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:09,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:09,908 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-15 11:13:09,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:13,229 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-15 11:13:13,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:13,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-02-15 11:13:13,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:13,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-15 11:13:13,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-15 11:13:13,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-15 11:13:13,249 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-02-15 11:13:13,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:13,352 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-02-15 11:13:13,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-15 11:13:13,352 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-02-15 11:13:13,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:13,353 INFO L225 Difference]: With dead ends: 59 [2019-02-15 11:13:13,353 INFO L226 Difference]: Without dead ends: 57 [2019-02-15 11:13:13,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-15 11:13:13,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-15 11:13:13,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-02-15 11:13:13,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-15 11:13:13,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-02-15 11:13:13,356 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-02-15 11:13:13,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:13,356 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-02-15 11:13:13,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-15 11:13:13,356 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-02-15 11:13:13,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-15 11:13:13,357 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:13,357 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-02-15 11:13:13,357 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:13,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:13,357 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-02-15 11:13:13,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:13,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:13,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:13,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:13,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:14,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:14,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:14,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:14,575 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:14,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:14,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:14,575 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-15 11:13:14,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:13:14,584 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:13:14,806 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-02-15 11:13:14,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:14,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:14,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:14,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:18,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:18,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:18,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-02-15 11:13:18,264 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:18,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-15 11:13:18,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-15 11:13:18,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-15 11:13:18,266 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-02-15 11:13:18,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:18,341 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-02-15 11:13:18,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-15 11:13:18,342 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-02-15 11:13:18,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:18,343 INFO L225 Difference]: With dead ends: 60 [2019-02-15 11:13:18,343 INFO L226 Difference]: Without dead ends: 58 [2019-02-15 11:13:18,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-15 11:13:18,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-15 11:13:18,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-02-15 11:13:18,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-15 11:13:18,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-02-15 11:13:18,346 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-02-15 11:13:18,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:18,346 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-02-15 11:13:18,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-15 11:13:18,347 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-02-15 11:13:18,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-02-15 11:13:18,347 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:18,347 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-02-15 11:13:18,347 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:18,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:18,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-02-15 11:13:18,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:18,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:18,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:18,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:18,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:19,631 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-15 11:13:19,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:19,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:19,632 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:19,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:19,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:19,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 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-15 11:13:19,644 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:13:19,645 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:13:19,682 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:13:19,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:19,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:19,692 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-15 11:13:19,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:23,094 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-15 11:13:23,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:23,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-02-15 11:13:23,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:23,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-02-15 11:13:23,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-02-15 11:13:23,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-15 11:13:23,116 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-02-15 11:13:23,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:23,212 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-02-15 11:13:23,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-15 11:13:23,212 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-02-15 11:13:23,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:23,213 INFO L225 Difference]: With dead ends: 61 [2019-02-15 11:13:23,213 INFO L226 Difference]: Without dead ends: 59 [2019-02-15 11:13:23,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-15 11:13:23,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-15 11:13:23,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-02-15 11:13:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-15 11:13:23,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-02-15 11:13:23,216 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-02-15 11:13:23,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:23,216 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-02-15 11:13:23,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-02-15 11:13:23,216 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-02-15 11:13:23,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-15 11:13:23,217 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:23,217 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-02-15 11:13:23,217 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:23,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:23,218 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-02-15 11:13:23,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:23,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:23,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:23,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:23,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:24,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:24,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:24,593 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:24,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:24,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:24,594 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-15 11:13:24,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:24,604 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:13:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:24,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:24,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:24,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:28,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:28,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:28,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-02-15 11:13:28,148 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:28,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-15 11:13:28,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-15 11:13:28,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-15 11:13:28,149 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-02-15 11:13:28,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:28,262 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-02-15 11:13:28,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-15 11:13:28,262 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-02-15 11:13:28,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:28,263 INFO L225 Difference]: With dead ends: 62 [2019-02-15 11:13:28,263 INFO L226 Difference]: Without dead ends: 60 [2019-02-15 11:13:28,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-15 11:13:28,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-15 11:13:28,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-02-15 11:13:28,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-02-15 11:13:28,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-02-15 11:13:28,267 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-02-15 11:13:28,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:28,267 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-02-15 11:13:28,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-15 11:13:28,267 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-02-15 11:13:28,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-02-15 11:13:28,267 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:28,267 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-02-15 11:13:28,268 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:28,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:28,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-02-15 11:13:28,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:28,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:28,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:28,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:28,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:29,511 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-15 11:13:29,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:29,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:29,512 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:29,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:29,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:29,512 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-15 11:13:29,523 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:13:29,523 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:13:29,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-02-15 11:13:29,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:29,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:29,779 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-15 11:13:29,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:33,590 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-15 11:13:33,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:33,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-02-15 11:13:33,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:33,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-15 11:13:33,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-15 11:13:33,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-15 11:13:33,613 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-02-15 11:13:33,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:33,691 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-02-15 11:13:33,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-15 11:13:33,692 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-02-15 11:13:33,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:33,693 INFO L225 Difference]: With dead ends: 63 [2019-02-15 11:13:33,693 INFO L226 Difference]: Without dead ends: 61 [2019-02-15 11:13:33,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-15 11:13:33,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-15 11:13:33,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-02-15 11:13:33,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-15 11:13:33,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-02-15 11:13:33,697 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-02-15 11:13:33,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:33,698 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-02-15 11:13:33,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-15 11:13:33,698 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-02-15 11:13:33,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-15 11:13:33,698 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:33,698 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-02-15 11:13:33,699 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:33,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:33,699 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-02-15 11:13:33,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:33,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:33,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:33,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:33,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:35,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:35,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:35,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:35,078 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:35,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:35,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:35,079 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-15 11:13:35,088 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:13:35,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:13:35,126 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:13:35,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:35,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:35,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:35,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:39,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:39,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-02-15 11:13:39,192 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:39,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-15 11:13:39,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-15 11:13:39,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-15 11:13:39,194 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-02-15 11:13:39,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:39,300 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-02-15 11:13:39,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-15 11:13:39,300 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-02-15 11:13:39,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:39,301 INFO L225 Difference]: With dead ends: 64 [2019-02-15 11:13:39,301 INFO L226 Difference]: Without dead ends: 62 [2019-02-15 11:13:39,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-15 11:13:39,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-02-15 11:13:39,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-02-15 11:13:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-02-15 11:13:39,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-02-15 11:13:39,304 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-02-15 11:13:39,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:39,304 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-02-15 11:13:39,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-15 11:13:39,304 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-02-15 11:13:39,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-02-15 11:13:39,304 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:39,304 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-02-15 11:13:39,305 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:39,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:39,305 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-02-15 11:13:39,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:39,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:39,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:39,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:39,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:40,648 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-15 11:13:40,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:40,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:40,649 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:40,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:40,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:40,649 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-15 11:13:40,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:40,661 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:13:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:40,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:40,718 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-15 11:13:40,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:44,787 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-15 11:13:44,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:44,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-02-15 11:13:44,808 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:44,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-02-15 11:13:44,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-02-15 11:13:44,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-15 11:13:44,810 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-02-15 11:13:44,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:44,905 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-02-15 11:13:44,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-15 11:13:44,905 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-02-15 11:13:44,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:44,906 INFO L225 Difference]: With dead ends: 65 [2019-02-15 11:13:44,906 INFO L226 Difference]: Without dead ends: 63 [2019-02-15 11:13:44,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-15 11:13:44,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-15 11:13:44,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-02-15 11:13:44,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-15 11:13:44,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-02-15 11:13:44,909 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-02-15 11:13:44,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:44,909 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-02-15 11:13:44,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-02-15 11:13:44,909 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-02-15 11:13:44,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-15 11:13:44,909 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:44,909 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-02-15 11:13:44,910 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:44,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:44,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-02-15 11:13:44,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:44,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:44,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:44,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:44,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:46,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:46,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:46,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:46,385 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:46,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:46,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:46,385 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-15 11:13:46,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:13:46,395 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:13:46,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-02-15 11:13:46,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:46,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:46,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:46,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:50,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:50,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:50,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-02-15 11:13:50,885 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:50,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-15 11:13:50,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-15 11:13:50,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-15 11:13:50,887 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-02-15 11:13:50,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:50,968 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-02-15 11:13:50,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-15 11:13:50,968 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-02-15 11:13:50,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:50,969 INFO L225 Difference]: With dead ends: 66 [2019-02-15 11:13:50,969 INFO L226 Difference]: Without dead ends: 64 [2019-02-15 11:13:50,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-15 11:13:50,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-02-15 11:13:50,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-02-15 11:13:50,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-15 11:13:50,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-02-15 11:13:50,972 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-02-15 11:13:50,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:50,972 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-02-15 11:13:50,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-15 11:13:50,972 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-02-15 11:13:50,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-02-15 11:13:50,973 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:50,973 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-02-15 11:13:50,973 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:50,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:50,974 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-02-15 11:13:50,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:50,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:50,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:50,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:50,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:52,837 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-15 11:13:52,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:52,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:52,838 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:52,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:52,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:52,838 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-15 11:13:52,849 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:13:52,849 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:13:52,890 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:13:52,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:52,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:52,904 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-15 11:13:52,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:56,876 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-15 11:13:56,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:56,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-02-15 11:13:56,895 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:56,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-02-15 11:13:56,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-02-15 11:13:56,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-15 11:13:56,896 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-02-15 11:13:57,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:57,010 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-02-15 11:13:57,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-15 11:13:57,010 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-02-15 11:13:57,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:57,011 INFO L225 Difference]: With dead ends: 67 [2019-02-15 11:13:57,011 INFO L226 Difference]: Without dead ends: 65 [2019-02-15 11:13:57,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-15 11:13:57,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-15 11:13:57,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-02-15 11:13:57,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-15 11:13:57,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-02-15 11:13:57,014 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-02-15 11:13:57,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:57,015 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-02-15 11:13:57,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-02-15 11:13:57,015 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-02-15 11:13:57,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-15 11:13:57,015 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:57,015 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-02-15 11:13:57,015 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:57,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:57,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-02-15 11:13:57,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:57,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:57,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:57,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:57,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:58,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:58,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:58,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:58,769 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:58,770 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:58,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:58,770 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-15 11:13:58,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:58,779 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:13:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:58,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:58,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:58,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:03,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:03,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:03,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-02-15 11:14:03,159 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:03,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-15 11:14:03,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-15 11:14:03,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-15 11:14:03,161 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-02-15 11:14:03,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:03,302 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-02-15 11:14:03,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-15 11:14:03,303 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-02-15 11:14:03,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:03,304 INFO L225 Difference]: With dead ends: 68 [2019-02-15 11:14:03,304 INFO L226 Difference]: Without dead ends: 66 [2019-02-15 11:14:03,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-15 11:14:03,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-02-15 11:14:03,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-02-15 11:14:03,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-15 11:14:03,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-02-15 11:14:03,306 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-02-15 11:14:03,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:03,306 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-02-15 11:14:03,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-15 11:14:03,307 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-02-15 11:14:03,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-02-15 11:14:03,307 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:03,307 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-02-15 11:14:03,307 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:03,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:03,307 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-02-15 11:14:03,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:03,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:03,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:14:03,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:03,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:04,852 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-15 11:14:04,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:04,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:04,853 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:04,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:04,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:04,853 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-15 11:14:04,863 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:14:04,863 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:14:05,214 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-02-15 11:14:05,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:14:05,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:05,228 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-15 11:14:05,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:09,795 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-15 11:14:09,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:09,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-02-15 11:14:09,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:09,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-15 11:14:09,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-15 11:14:09,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-15 11:14:09,817 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-02-15 11:14:09,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:09,935 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-02-15 11:14:09,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-15 11:14:09,936 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-02-15 11:14:09,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:09,936 INFO L225 Difference]: With dead ends: 69 [2019-02-15 11:14:09,936 INFO L226 Difference]: Without dead ends: 67 [2019-02-15 11:14:09,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-15 11:14:09,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-15 11:14:09,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-02-15 11:14:09,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-15 11:14:09,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-02-15 11:14:09,940 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-02-15 11:14:09,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:09,940 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-02-15 11:14:09,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-15 11:14:09,940 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-02-15 11:14:09,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-15 11:14:09,941 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:09,941 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-02-15 11:14:09,941 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:09,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:09,941 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-02-15 11:14:09,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:09,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:09,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:14:09,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:09,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:12,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:12,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:12,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:12,252 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:12,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:12,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:12,252 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-15 11:14:12,263 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:14:12,263 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:14:12,331 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:14:12,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:14:12,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:12,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:12,346 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:16,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:16,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:16,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-02-15 11:14:16,904 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:16,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-15 11:14:16,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-15 11:14:16,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-15 11:14:16,906 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-02-15 11:14:17,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:17,026 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-02-15 11:14:17,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-15 11:14:17,032 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-02-15 11:14:17,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:17,033 INFO L225 Difference]: With dead ends: 70 [2019-02-15 11:14:17,033 INFO L226 Difference]: Without dead ends: 68 [2019-02-15 11:14:17,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-15 11:14:17,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-15 11:14:17,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-02-15 11:14:17,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-15 11:14:17,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-02-15 11:14:17,036 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-02-15 11:14:17,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:17,037 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-02-15 11:14:17,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-15 11:14:17,037 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-02-15 11:14:17,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-02-15 11:14:17,037 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:17,038 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-02-15 11:14:17,038 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:17,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:17,038 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-02-15 11:14:17,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:17,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:17,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:14:17,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:17,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:18,917 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-15 11:14:18,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:18,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:18,918 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:18,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:18,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:18,918 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-15 11:14:18,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:14:18,929 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:14:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:18,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:18,988 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-15 11:14:18,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:24,007 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-15 11:14:24,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:24,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-02-15 11:14:24,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:24,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-02-15 11:14:24,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-02-15 11:14:24,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-15 11:14:24,028 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-02-15 11:14:24,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:24,121 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-02-15 11:14:24,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-15 11:14:24,121 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-02-15 11:14:24,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:24,122 INFO L225 Difference]: With dead ends: 71 [2019-02-15 11:14:24,122 INFO L226 Difference]: Without dead ends: 69 [2019-02-15 11:14:24,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-15 11:14:24,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-15 11:14:24,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-02-15 11:14:24,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-15 11:14:24,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-02-15 11:14:24,126 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-02-15 11:14:24,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:24,126 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-02-15 11:14:24,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-02-15 11:14:24,126 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-02-15 11:14:24,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-15 11:14:24,127 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:24,127 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-02-15 11:14:24,127 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:24,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:24,127 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-02-15 11:14:24,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:24,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:24,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:14:24,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:24,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:26,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:26,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:26,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:26,309 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:26,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:26,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:26,310 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-15 11:14:26,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:14:26,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:14:26,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-02-15 11:14:26,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:14:26,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:26,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:26,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:31,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:31,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:31,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-02-15 11:14:31,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:31,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-15 11:14:31,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-15 11:14:31,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-15 11:14:31,833 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-02-15 11:14:31,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:31,938 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-02-15 11:14:31,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-15 11:14:31,939 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-02-15 11:14:31,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:31,939 INFO L225 Difference]: With dead ends: 72 [2019-02-15 11:14:31,940 INFO L226 Difference]: Without dead ends: 70 [2019-02-15 11:14:31,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-15 11:14:31,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-15 11:14:31,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-02-15 11:14:31,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-02-15 11:14:31,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-02-15 11:14:31,943 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-02-15 11:14:31,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:31,944 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-02-15 11:14:31,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-15 11:14:31,944 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-02-15 11:14:31,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-02-15 11:14:31,944 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:31,945 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-02-15 11:14:31,945 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:31,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:31,945 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-02-15 11:14:31,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:31,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:31,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:14:31,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:31,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:33,936 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-15 11:14:33,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:33,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:33,936 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:33,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:33,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:33,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:14:33,953 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:14:33,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:14:33,997 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:14:33,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:14:34,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:34,011 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-15 11:14:34,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:38,950 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-15 11:14:38,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:38,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-02-15 11:14:38,970 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:38,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-02-15 11:14:38,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-02-15 11:14:38,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-15 11:14:38,972 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-02-15 11:14:39,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:39,307 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-02-15 11:14:39,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-15 11:14:39,307 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-02-15 11:14:39,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:39,308 INFO L225 Difference]: With dead ends: 73 [2019-02-15 11:14:39,308 INFO L226 Difference]: Without dead ends: 71 [2019-02-15 11:14:39,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-15 11:14:39,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-15 11:14:39,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-02-15 11:14:39,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-15 11:14:39,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-02-15 11:14:39,312 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-02-15 11:14:39,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:39,313 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-02-15 11:14:39,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-02-15 11:14:39,313 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-02-15 11:14:39,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-02-15 11:14:39,313 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:39,314 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-02-15 11:14:39,314 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:39,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:39,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-02-15 11:14:39,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:39,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:39,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:14:39,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:39,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:41,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:41,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:41,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:41,013 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:41,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:41,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:41,013 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-15 11:14:41,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:14:41,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:14:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:41,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:41,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:41,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:46,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:46,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:46,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-02-15 11:14:46,153 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:46,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-15 11:14:46,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-15 11:14:46,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-15 11:14:46,155 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-02-15 11:14:46,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:46,251 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-02-15 11:14:46,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-15 11:14:46,252 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-02-15 11:14:46,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:46,253 INFO L225 Difference]: With dead ends: 74 [2019-02-15 11:14:46,253 INFO L226 Difference]: Without dead ends: 72 [2019-02-15 11:14:46,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-15 11:14:46,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-15 11:14:46,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-02-15 11:14:46,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-02-15 11:14:46,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-02-15 11:14:46,256 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-02-15 11:14:46,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:46,256 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-02-15 11:14:46,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-15 11:14:46,256 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-02-15 11:14:46,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-02-15 11:14:46,257 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:46,257 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-02-15 11:14:46,257 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:46,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:46,257 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-02-15 11:14:46,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:46,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:46,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:14:46,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:46,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:48,010 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-15 11:14:48,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:48,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:48,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:48,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:48,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:48,011 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-15 11:14:48,019 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:14:48,019 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:14:48,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-02-15 11:14:48,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:14:48,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:48,499 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-15 11:14:48,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:54,016 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-15 11:14:54,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:54,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-02-15 11:14:54,037 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:54,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-15 11:14:54,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-15 11:14:54,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-15 11:14:54,039 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-02-15 11:14:54,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:54,251 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-02-15 11:14:54,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-15 11:14:54,252 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-02-15 11:14:54,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:54,252 INFO L225 Difference]: With dead ends: 75 [2019-02-15 11:14:54,252 INFO L226 Difference]: Without dead ends: 73 [2019-02-15 11:14:54,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-15 11:14:54,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-15 11:14:54,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-02-15 11:14:54,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-15 11:14:54,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-02-15 11:14:54,256 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-02-15 11:14:54,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:54,256 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-02-15 11:14:54,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-15 11:14:54,257 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-02-15 11:14:54,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-15 11:14:54,257 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:54,257 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-02-15 11:14:54,258 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:54,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:54,258 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-02-15 11:14:54,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:54,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:54,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:14:54,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:54,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:56,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:56,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:56,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:56,081 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:56,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:56,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:56,081 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-15 11:14:56,090 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:14:56,090 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:14:56,147 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:14:56,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:14:56,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:56,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:01,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:01,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-02-15 11:15:01,515 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:01,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-15 11:15:01,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-15 11:15:01,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-15 11:15:01,516 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-02-15 11:15:01,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:01,709 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-02-15 11:15:01,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-15 11:15:01,709 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-02-15 11:15:01,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:01,710 INFO L225 Difference]: With dead ends: 76 [2019-02-15 11:15:01,710 INFO L226 Difference]: Without dead ends: 74 [2019-02-15 11:15:01,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-15 11:15:01,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-02-15 11:15:01,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-02-15 11:15:01,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-15 11:15:01,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-02-15 11:15:01,714 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-02-15 11:15:01,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:01,714 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-02-15 11:15:01,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-15 11:15:01,715 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-02-15 11:15:01,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-02-15 11:15:01,715 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:01,715 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-02-15 11:15:01,715 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:01,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:01,716 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-02-15 11:15:01,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:01,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:01,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:15:01,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:01,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:03,576 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-15 11:15:03,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:03,577 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:03,577 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:03,577 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:03,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:03,577 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-15 11:15:03,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:15:03,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:15:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:03,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:03,650 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-15 11:15:03,650 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:09,722 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-15 11:15:09,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:09,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-02-15 11:15:09,741 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:09,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-02-15 11:15:09,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-02-15 11:15:09,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-15 11:15:09,744 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-02-15 11:15:09,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:09,909 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-02-15 11:15:09,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-15 11:15:09,910 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-02-15 11:15:09,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:09,910 INFO L225 Difference]: With dead ends: 77 [2019-02-15 11:15:09,911 INFO L226 Difference]: Without dead ends: 75 [2019-02-15 11:15:09,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-15 11:15:09,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-15 11:15:09,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-02-15 11:15:09,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-15 11:15:09,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-02-15 11:15:09,916 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-02-15 11:15:09,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:09,916 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-02-15 11:15:09,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-02-15 11:15:09,916 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-02-15 11:15:09,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-02-15 11:15:09,917 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:09,917 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-02-15 11:15:09,917 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:09,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:09,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-02-15 11:15:09,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:09,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:09,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:15:09,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:09,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:12,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:12,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:12,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:12,121 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:12,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:12,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:12,121 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-15 11:15:12,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:15:12,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:15:12,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-02-15 11:15:12,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:15:12,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:12,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:12,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:18,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:18,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:18,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-02-15 11:15:18,478 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:18,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-15 11:15:18,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-15 11:15:18,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-15 11:15:18,480 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-02-15 11:15:18,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:18,629 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-02-15 11:15:18,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-15 11:15:18,629 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-02-15 11:15:18,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:18,643 INFO L225 Difference]: With dead ends: 78 [2019-02-15 11:15:18,643 INFO L226 Difference]: Without dead ends: 76 [2019-02-15 11:15:18,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-15 11:15:18,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-15 11:15:18,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-02-15 11:15:18,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-15 11:15:18,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-02-15 11:15:18,647 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-02-15 11:15:18,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:18,647 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-02-15 11:15:18,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-15 11:15:18,647 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-02-15 11:15:18,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-02-15 11:15:18,648 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:18,648 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-02-15 11:15:18,648 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:18,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:18,649 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-02-15 11:15:18,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:18,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:18,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:15:18,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:18,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:20,827 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-15 11:15:20,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:20,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:20,828 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:20,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:20,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:20,828 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-15 11:15:20,837 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:15:20,837 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:15:20,885 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:15:20,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:15:20,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:20,926 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-15 11:15:20,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:26,801 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-15 11:15:26,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:26,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-02-15 11:15:26,819 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:26,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-15 11:15:26,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-15 11:15:26,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-15 11:15:26,821 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-02-15 11:15:26,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:26,979 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-02-15 11:15:26,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-15 11:15:26,979 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-02-15 11:15:26,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:26,980 INFO L225 Difference]: With dead ends: 79 [2019-02-15 11:15:26,980 INFO L226 Difference]: Without dead ends: 77 [2019-02-15 11:15:26,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-15 11:15:26,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-15 11:15:26,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-02-15 11:15:26,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-15 11:15:26,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-02-15 11:15:26,984 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-02-15 11:15:26,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:26,984 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-02-15 11:15:26,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-15 11:15:26,984 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-02-15 11:15:26,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-15 11:15:26,985 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:26,985 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-02-15 11:15:26,985 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:26,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:26,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-02-15 11:15:26,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:26,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:26,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:15:26,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:26,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:29,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:29,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:29,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:29,250 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:29,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:29,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:29,250 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-15 11:15:29,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:15:29,259 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:15:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:29,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:29,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:29,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:35,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:35,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:35,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-02-15 11:15:35,721 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:35,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-15 11:15:35,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-15 11:15:35,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-15 11:15:35,723 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-02-15 11:15:35,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:35,877 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-02-15 11:15:35,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-15 11:15:35,878 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-02-15 11:15:35,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:35,878 INFO L225 Difference]: With dead ends: 80 [2019-02-15 11:15:35,878 INFO L226 Difference]: Without dead ends: 78 [2019-02-15 11:15:35,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-15 11:15:35,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-02-15 11:15:35,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-02-15 11:15:35,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-15 11:15:35,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-02-15 11:15:35,882 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-02-15 11:15:35,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:35,882 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-02-15 11:15:35,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-15 11:15:35,882 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-02-15 11:15:35,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-02-15 11:15:35,882 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:35,882 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-02-15 11:15:35,883 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:35,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:35,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-02-15 11:15:35,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:35,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:35,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:15:35,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:35,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:37,978 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-15 11:15:37,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:37,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:37,979 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:37,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:37,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:37,979 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-15 11:15:37,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:15:37,987 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:15:38,601 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-02-15 11:15:38,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:15:38,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:38,619 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-15 11:15:38,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:45,240 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-15 11:15:45,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:45,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-02-15 11:15:45,262 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:45,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-15 11:15:45,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-15 11:15:45,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-15 11:15:45,264 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-02-15 11:15:45,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:45,369 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-02-15 11:15:45,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-15 11:15:45,370 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-02-15 11:15:45,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:45,371 INFO L225 Difference]: With dead ends: 81 [2019-02-15 11:15:45,371 INFO L226 Difference]: Without dead ends: 79 [2019-02-15 11:15:45,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-15 11:15:45,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-15 11:15:45,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-02-15 11:15:45,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-15 11:15:45,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-02-15 11:15:45,375 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-02-15 11:15:45,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:45,376 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-02-15 11:15:45,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-15 11:15:45,376 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-02-15 11:15:45,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-02-15 11:15:45,376 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:45,377 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-02-15 11:15:45,377 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:45,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:45,377 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-02-15 11:15:45,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:45,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:45,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:15:45,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:45,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:47,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:47,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:47,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:47,579 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:47,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:47,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:47,579 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-15 11:15:47,589 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:15:47,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:15:47,639 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:15:47,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:15:47,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:47,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:47,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:54,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:54,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:54,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-02-15 11:15:54,088 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:54,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-15 11:15:54,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-15 11:15:54,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-15 11:15:54,090 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-02-15 11:15:54,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:54,208 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-02-15 11:15:54,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-15 11:15:54,209 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-02-15 11:15:54,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:54,209 INFO L225 Difference]: With dead ends: 82 [2019-02-15 11:15:54,209 INFO L226 Difference]: Without dead ends: 80 [2019-02-15 11:15:54,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-15 11:15:54,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-15 11:15:54,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-02-15 11:15:54,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-15 11:15:54,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-02-15 11:15:54,212 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-02-15 11:15:54,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:54,212 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-02-15 11:15:54,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-15 11:15:54,213 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-02-15 11:15:54,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-02-15 11:15:54,213 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:54,213 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-02-15 11:15:54,213 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:54,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:54,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-02-15 11:15:54,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:54,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:54,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:15:54,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:54,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:56,668 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-15 11:15:56,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:56,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:56,669 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:56,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:56,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:56,669 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-15 11:15:56,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:15:56,679 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:15:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:56,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:56,743 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-15 11:15:56,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:16:03,449 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-15 11:16:03,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:16:03,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-02-15 11:16:03,469 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:16:03,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-02-15 11:16:03,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-02-15 11:16:03,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-15 11:16:03,471 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-02-15 11:16:03,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:16:03,852 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-02-15 11:16:03,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-15 11:16:03,852 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-02-15 11:16:03,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:16:03,853 INFO L225 Difference]: With dead ends: 83 [2019-02-15 11:16:03,853 INFO L226 Difference]: Without dead ends: 81 [2019-02-15 11:16:03,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-15 11:16:03,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-15 11:16:03,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-02-15 11:16:03,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-15 11:16:03,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-02-15 11:16:03,855 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-02-15 11:16:03,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:16:03,856 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-02-15 11:16:03,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-02-15 11:16:03,856 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-02-15 11:16:03,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-15 11:16:03,856 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:16:03,856 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-02-15 11:16:03,856 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:16:03,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:16:03,857 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-02-15 11:16:03,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:16:03,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:03,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:16:03,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:03,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:16:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:06,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:06,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:06,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:16:06,323 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:16:06,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:16:06,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:06,324 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-15 11:16:06,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:16:06,334 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:16:07,073 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-02-15 11:16:07,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:16:07,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:16:07,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:07,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:16:14,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:14,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:16:14,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-02-15 11:16:14,039 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:16:14,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-15 11:16:14,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-15 11:16:14,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-15 11:16:14,041 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-02-15 11:16:14,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:16:14,648 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-02-15 11:16:14,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-15 11:16:14,649 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-02-15 11:16:14,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:16:14,649 INFO L225 Difference]: With dead ends: 84 [2019-02-15 11:16:14,650 INFO L226 Difference]: Without dead ends: 82 [2019-02-15 11:16:14,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-15 11:16:14,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-15 11:16:14,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-02-15 11:16:14,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-02-15 11:16:14,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-02-15 11:16:14,653 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-02-15 11:16:14,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:16:14,653 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-02-15 11:16:14,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-15 11:16:14,653 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-02-15 11:16:14,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-02-15 11:16:14,653 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:16:14,653 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-02-15 11:16:14,654 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:16:14,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:16:14,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-02-15 11:16:14,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:16:14,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:14,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:16:14,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:14,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:16:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:17,525 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-15 11:16:17,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:17,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:16:17,525 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:16:17,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:16:17,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:17,526 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-15 11:16:17,536 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:16:17,536 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:16:17,599 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:16:17,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:16:17,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:16:17,625 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-15 11:16:17,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:16:24,795 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-15 11:16:24,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:16:24,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-02-15 11:16:24,814 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:16:24,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-02-15 11:16:24,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-02-15 11:16:24,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-15 11:16:24,817 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-02-15 11:16:24,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:16:24,979 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-02-15 11:16:24,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-15 11:16:24,979 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-02-15 11:16:24,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:16:24,980 INFO L225 Difference]: With dead ends: 85 [2019-02-15 11:16:24,980 INFO L226 Difference]: Without dead ends: 83 [2019-02-15 11:16:24,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-15 11:16:24,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-15 11:16:24,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-02-15 11:16:24,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-15 11:16:24,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-02-15 11:16:24,984 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-02-15 11:16:24,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:16:24,984 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-02-15 11:16:24,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-02-15 11:16:24,984 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-02-15 11:16:24,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-02-15 11:16:24,985 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:16:24,985 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-02-15 11:16:24,985 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:16:24,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:16:24,986 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-02-15 11:16:24,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:16:24,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:24,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:16:24,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:24,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:16:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:27,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:27,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:27,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:16:27,677 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:16:27,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:16:27,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:27,677 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-15 11:16:27,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:16:27,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:16:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:27,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:16:27,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:27,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:16:30,152 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-02-15 11:16:34,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:34,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:16:34,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-02-15 11:16:34,990 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:16:34,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-15 11:16:34,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-15 11:16:34,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-15 11:16:34,992 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-02-15 11:16:35,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:16:35,119 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-02-15 11:16:35,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-15 11:16:35,119 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-02-15 11:16:35,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:16:35,120 INFO L225 Difference]: With dead ends: 86 [2019-02-15 11:16:35,120 INFO L226 Difference]: Without dead ends: 84 [2019-02-15 11:16:35,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-15 11:16:35,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-02-15 11:16:35,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-02-15 11:16:35,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-15 11:16:35,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-02-15 11:16:35,125 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-02-15 11:16:35,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:16:35,125 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-02-15 11:16:35,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-15 11:16:35,125 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-02-15 11:16:35,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-02-15 11:16:35,125 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:16:35,126 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-02-15 11:16:35,126 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:16:35,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:16:35,126 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-02-15 11:16:35,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:16:35,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:35,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:16:35,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:35,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:16:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:37,904 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-15 11:16:37,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:37,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:16:37,905 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:16:37,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:16:37,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:37,905 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-15 11:16:37,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:16:37,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:16:38,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-02-15 11:16:38,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:16:38,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:16:38,752 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-15 11:16:38,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:16:46,042 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-15 11:16:46,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:16:46,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-02-15 11:16:46,065 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:16:46,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-15 11:16:46,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-15 11:16:46,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-15 11:16:46,067 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-02-15 11:16:46,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:16:46,308 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-02-15 11:16:46,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-15 11:16:46,309 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-02-15 11:16:46,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:16:46,309 INFO L225 Difference]: With dead ends: 87 [2019-02-15 11:16:46,309 INFO L226 Difference]: Without dead ends: 85 [2019-02-15 11:16:46,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-15 11:16:46,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-15 11:16:46,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-02-15 11:16:46,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-15 11:16:46,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-02-15 11:16:46,312 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-02-15 11:16:46,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:16:46,312 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-02-15 11:16:46,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-15 11:16:46,313 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-02-15 11:16:46,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-15 11:16:46,313 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:16:46,313 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-02-15 11:16:46,313 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:16:46,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:16:46,313 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-02-15 11:16:46,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:16:46,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:46,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:16:46,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:46,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:16:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:48,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:48,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:48,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:16:48,867 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:16:48,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:16:48,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:48,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 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-15 11:16:48,876 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:16:48,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:16:48,929 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:16:48,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:16:48,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:16:48,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:48,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:16:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:57,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:16:57,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-02-15 11:16:57,678 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:16:57,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-15 11:16:57,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-15 11:16:57,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-15 11:16:57,681 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-02-15 11:16:57,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:16:57,861 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-02-15 11:16:57,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-15 11:16:57,861 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-02-15 11:16:57,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:16:57,862 INFO L225 Difference]: With dead ends: 88 [2019-02-15 11:16:57,862 INFO L226 Difference]: Without dead ends: 86 [2019-02-15 11:16:57,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-15 11:16:57,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-02-15 11:16:57,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-02-15 11:16:57,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-02-15 11:16:57,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-02-15 11:16:57,865 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-02-15 11:16:57,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:16:57,865 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-02-15 11:16:57,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-15 11:16:57,866 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-02-15 11:16:57,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-02-15 11:16:57,866 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:16:57,866 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-02-15 11:16:57,866 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:16:57,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:16:57,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-02-15 11:16:57,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:16:57,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:57,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:16:57,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:57,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:16:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:17:00,341 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-15 11:17:00,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:00,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:17:00,342 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:17:00,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:17:00,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:00,342 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-15 11:17:00,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:17:00,352 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:17:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:17:00,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:17:00,428 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-15 11:17:00,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:17:08,284 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-15 11:17:08,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:17:08,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-02-15 11:17:08,303 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:17:08,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-02-15 11:17:08,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-02-15 11:17:08,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-15 11:17:08,305 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-02-15 11:17:08,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:17:08,550 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-02-15 11:17:08,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-15 11:17:08,550 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-02-15 11:17:08,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:17:08,551 INFO L225 Difference]: With dead ends: 89 [2019-02-15 11:17:08,551 INFO L226 Difference]: Without dead ends: 87 [2019-02-15 11:17:08,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-15 11:17:08,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-15 11:17:08,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-02-15 11:17:08,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-15 11:17:08,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-02-15 11:17:08,555 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-02-15 11:17:08,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:17:08,556 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-02-15 11:17:08,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-02-15 11:17:08,556 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-02-15 11:17:08,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-15 11:17:08,556 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:17:08,556 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-02-15 11:17:08,557 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:17:08,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:17:08,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-02-15 11:17:08,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:17:08,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:08,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:17:08,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:08,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:17:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:17:11,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:11,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:11,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:17:11,113 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:17:11,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:17:11,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:11,114 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-15 11:17:11,123 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:17:11,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:17:12,090 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-02-15 11:17:12,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:17:12,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:17:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:12,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:17:19,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:19,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:17:19,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-02-15 11:17:19,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:17:19,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-15 11:17:19,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-15 11:17:19,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-15 11:17:19,876 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-02-15 11:17:20,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:17:20,025 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-02-15 11:17:20,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-15 11:17:20,025 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-02-15 11:17:20,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:17:20,026 INFO L225 Difference]: With dead ends: 90 [2019-02-15 11:17:20,026 INFO L226 Difference]: Without dead ends: 88 [2019-02-15 11:17:20,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-15 11:17:20,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-02-15 11:17:20,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-02-15 11:17:20,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-02-15 11:17:20,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-02-15 11:17:20,029 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-02-15 11:17:20,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:17:20,029 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-02-15 11:17:20,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-15 11:17:20,029 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-02-15 11:17:20,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-02-15 11:17:20,029 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:17:20,029 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-02-15 11:17:20,030 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:17:20,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:17:20,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2019-02-15 11:17:20,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:17:20,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:20,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:17:20,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:20,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:17:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:17:22,868 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-15 11:17:22,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:22,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:17:22,869 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:17:22,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:17:22,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:22,869 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-15 11:17:22,877 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:17:22,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:17:22,934 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:17:22,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:17:22,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:17:22,951 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-15 11:17:22,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:17:30,862 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-15 11:17:30,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:17:30,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-02-15 11:17:30,881 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:17:30,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-02-15 11:17:30,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-02-15 11:17:30,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-15 11:17:30,883 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-02-15 11:17:31,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:17:31,048 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-02-15 11:17:31,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-15 11:17:31,048 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-02-15 11:17:31,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:17:31,049 INFO L225 Difference]: With dead ends: 91 [2019-02-15 11:17:31,049 INFO L226 Difference]: Without dead ends: 89 [2019-02-15 11:17:31,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-15 11:17:31,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-15 11:17:31,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-02-15 11:17:31,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-15 11:17:31,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-02-15 11:17:31,054 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-02-15 11:17:31,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:17:31,054 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-02-15 11:17:31,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-02-15 11:17:31,054 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-02-15 11:17:31,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-15 11:17:31,055 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:17:31,055 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-02-15 11:17:31,055 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:17:31,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:17:31,056 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2019-02-15 11:17:31,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:17:31,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:31,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:17:31,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:31,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:17:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:17:33,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:33,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:33,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:17:33,974 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:17:33,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:17:33,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:33,975 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-15 11:17:33,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:17:33,985 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:17:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:17:34,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:17:34,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:34,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:17:42,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:42,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:17:42,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-02-15 11:17:42,285 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:17:42,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-15 11:17:42,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-15 11:17:42,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-15 11:17:42,287 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-02-15 11:17:42,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:17:42,627 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-02-15 11:17:42,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-15 11:17:42,627 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-02-15 11:17:42,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:17:42,628 INFO L225 Difference]: With dead ends: 92 [2019-02-15 11:17:42,628 INFO L226 Difference]: Without dead ends: 90 [2019-02-15 11:17:42,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-15 11:17:42,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-15 11:17:42,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-02-15 11:17:42,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-02-15 11:17:42,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-02-15 11:17:42,631 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-02-15 11:17:42,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:17:42,632 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-02-15 11:17:42,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-15 11:17:42,632 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-02-15 11:17:42,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-02-15 11:17:42,632 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:17:42,633 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-02-15 11:17:42,633 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:17:42,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:17:42,633 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2019-02-15 11:17:42,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:17:42,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:42,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:17:42,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:42,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:17:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:17:45,411 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-15 11:17:45,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:45,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:17:45,411 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:17:45,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:17:45,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:45,412 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-15 11:17:45,420 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:17:45,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:17:46,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-02-15 11:17:46,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:17:46,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:17:46,490 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-15 11:17:46,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:17:55,048 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-15 11:17:55,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:17:55,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-02-15 11:17:55,070 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:17:55,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-15 11:17:55,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-15 11:17:55,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-15 11:17:55,073 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-02-15 11:17:55,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:17:55,292 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-02-15 11:17:55,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-15 11:17:55,292 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-02-15 11:17:55,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:17:55,293 INFO L225 Difference]: With dead ends: 93 [2019-02-15 11:17:55,293 INFO L226 Difference]: Without dead ends: 91 [2019-02-15 11:17:55,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-15 11:17:55,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-15 11:17:55,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-02-15 11:17:55,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-15 11:17:55,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-02-15 11:17:55,296 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-02-15 11:17:55,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:17:55,296 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-02-15 11:17:55,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-15 11:17:55,297 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-02-15 11:17:55,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-15 11:17:55,297 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:17:55,297 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-02-15 11:17:55,297 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:17:55,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:17:55,298 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2019-02-15 11:17:55,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:17:55,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:55,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:17:55,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:55,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:17:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:17:58,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:58,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:58,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:17:58,486 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:17:58,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:17:58,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:58,486 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-15 11:17:58,497 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:17:58,497 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:17:58,554 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:17:58,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:17:58,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:17:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:58,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:18:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:07,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:18:07,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-02-15 11:18:07,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:18:07,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-15 11:18:07,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-15 11:18:07,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-15 11:18:07,029 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-02-15 11:18:07,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:18:07,175 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-02-15 11:18:07,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-02-15 11:18:07,176 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-02-15 11:18:07,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:18:07,177 INFO L225 Difference]: With dead ends: 94 [2019-02-15 11:18:07,177 INFO L226 Difference]: Without dead ends: 92 [2019-02-15 11:18:07,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-15 11:18:07,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-02-15 11:18:07,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-02-15 11:18:07,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-15 11:18:07,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-02-15 11:18:07,181 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-02-15 11:18:07,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:18:07,181 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-02-15 11:18:07,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-15 11:18:07,181 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-02-15 11:18:07,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-02-15 11:18:07,182 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:18:07,182 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-02-15 11:18:07,182 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:18:07,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:18:07,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2019-02-15 11:18:07,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:18:07,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:07,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:18:07,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:07,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:18:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:18:10,412 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-15 11:18:10,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:10,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:18:10,413 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:18:10,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:18:10,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:10,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 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-15 11:18:10,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:18:10,422 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:18:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:18:10,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:18:10,496 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-15 11:18:10,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:18:19,459 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-15 11:18:19,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:18:19,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-02-15 11:18:19,478 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:18:19,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-15 11:18:19,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-15 11:18:19,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-15 11:18:19,480 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-02-15 11:18:19,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:18:19,716 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-02-15 11:18:19,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-15 11:18:19,717 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-02-15 11:18:19,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:18:19,717 INFO L225 Difference]: With dead ends: 95 [2019-02-15 11:18:19,717 INFO L226 Difference]: Without dead ends: 93 [2019-02-15 11:18:19,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-15 11:18:19,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-15 11:18:19,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-02-15 11:18:19,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-15 11:18:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-02-15 11:18:19,720 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-02-15 11:18:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:18:19,721 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-02-15 11:18:19,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-15 11:18:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-02-15 11:18:19,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-15 11:18:19,721 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:18:19,721 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-02-15 11:18:19,721 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:18:19,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:18:19,722 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2019-02-15 11:18:19,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:18:19,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:19,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:18:19,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:19,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:18:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:18:22,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:22,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:22,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:18:22,621 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:18:22,621 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:18:22,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:22,621 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-15 11:18:22,643 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:18:22,644 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:18:23,857 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-02-15 11:18:23,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:18:23,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:18:23,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:23,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:18:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:32,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:18:32,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-02-15 11:18:32,775 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:18:32,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-15 11:18:32,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-15 11:18:32,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-15 11:18:32,777 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-02-15 11:18:32,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:18:32,920 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-02-15 11:18:32,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-15 11:18:32,921 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-02-15 11:18:32,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:18:32,922 INFO L225 Difference]: With dead ends: 96 [2019-02-15 11:18:32,922 INFO L226 Difference]: Without dead ends: 94 [2019-02-15 11:18:32,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-15 11:18:32,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-15 11:18:32,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-02-15 11:18:32,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-02-15 11:18:32,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-02-15 11:18:32,925 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-02-15 11:18:32,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:18:32,926 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-02-15 11:18:32,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-15 11:18:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-02-15 11:18:32,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-02-15 11:18:32,926 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:18:32,926 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-02-15 11:18:32,927 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:18:32,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:18:32,927 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2019-02-15 11:18:32,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:18:32,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:32,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:18:32,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:32,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:18:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:18:36,144 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-15 11:18:36,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:36,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:18:36,145 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:18:36,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:18:36,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:36,145 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-15 11:18:36,170 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:18:36,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:18:36,228 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:18:36,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:18:36,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:18:36,248 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-15 11:18:36,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:18:45,500 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-15 11:18:45,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:18:45,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-02-15 11:18:45,520 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:18:45,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-02-15 11:18:45,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-02-15 11:18:45,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-15 11:18:45,522 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-02-15 11:18:45,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:18:45,763 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-02-15 11:18:45,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-15 11:18:45,764 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-02-15 11:18:45,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:18:45,764 INFO L225 Difference]: With dead ends: 97 [2019-02-15 11:18:45,765 INFO L226 Difference]: Without dead ends: 95 [2019-02-15 11:18:45,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-15 11:18:45,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-15 11:18:45,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-02-15 11:18:45,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-15 11:18:45,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-02-15 11:18:45,768 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-02-15 11:18:45,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:18:45,769 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-02-15 11:18:45,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-02-15 11:18:45,769 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-02-15 11:18:45,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-02-15 11:18:45,769 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:18:45,770 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-02-15 11:18:45,770 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:18:45,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:18:45,770 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2019-02-15 11:18:45,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:18:45,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:45,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:18:45,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:45,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:18:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:18:48,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:48,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:48,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:18:48,816 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:18:48,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:18:48,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:48,816 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-15 11:18:48,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:18:48,827 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:18:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:18:48,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:18:48,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:48,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:18:58,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:58,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:18:58,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-02-15 11:18:58,556 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:18:58,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-15 11:18:58,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-15 11:18:58,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-15 11:18:58,559 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-02-15 11:18:58,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:18:58,781 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-02-15 11:18:58,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-02-15 11:18:58,781 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-02-15 11:18:58,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:18:58,782 INFO L225 Difference]: With dead ends: 98 [2019-02-15 11:18:58,782 INFO L226 Difference]: Without dead ends: 96 [2019-02-15 11:18:58,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-15 11:18:58,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-02-15 11:18:58,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-02-15 11:18:58,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-15 11:18:58,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-02-15 11:18:58,785 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-02-15 11:18:58,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:18:58,785 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-02-15 11:18:58,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-15 11:18:58,785 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-02-15 11:18:58,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-02-15 11:18:58,786 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:18:58,786 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-02-15 11:18:58,786 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:18:58,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:18:58,786 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2019-02-15 11:18:58,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:18:58,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:58,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:18:58,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:58,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:18:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:19:02,150 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-15 11:19:02,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:02,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:19:02,150 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:19:02,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:19:02,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:02,151 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-15 11:19:02,158 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:19:02,159 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:19:03,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-02-15 11:19:03,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:19:03,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:19:03,492 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-15 11:19:03,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:19:13,178 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-15 11:19:13,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:19:13,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-02-15 11:19:13,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:19:13,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-15 11:19:13,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-15 11:19:13,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-15 11:19:13,203 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-02-15 11:19:13,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:19:13,362 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-02-15 11:19:13,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-15 11:19:13,363 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-02-15 11:19:13,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:19:13,363 INFO L225 Difference]: With dead ends: 99 [2019-02-15 11:19:13,363 INFO L226 Difference]: Without dead ends: 97 [2019-02-15 11:19:13,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-15 11:19:13,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-15 11:19:13,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-02-15 11:19:13,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-15 11:19:13,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-02-15 11:19:13,367 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-02-15 11:19:13,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:19:13,367 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-02-15 11:19:13,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-15 11:19:13,367 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-02-15 11:19:13,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-15 11:19:13,368 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:19:13,368 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-02-15 11:19:13,368 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:19:13,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:19:13,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2019-02-15 11:19:13,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:19:13,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:13,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:19:13,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:13,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:19:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:19:16,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:16,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:16,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:19:16,947 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:19:16,947 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:19:16,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:16,947 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-15 11:19:16,957 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:19:16,957 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:19:17,018 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:19:17,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:19:17,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:19:17,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:17,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:19:26,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:27,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:19:27,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-02-15 11:19:27,007 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:19:27,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-15 11:19:27,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-15 11:19:27,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-15 11:19:27,010 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-02-15 11:19:27,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:19:27,177 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-02-15 11:19:27,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-02-15 11:19:27,177 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-02-15 11:19:27,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:19:27,178 INFO L225 Difference]: With dead ends: 100 [2019-02-15 11:19:27,178 INFO L226 Difference]: Without dead ends: 98 [2019-02-15 11:19:27,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-15 11:19:27,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-15 11:19:27,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-02-15 11:19:27,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-15 11:19:27,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-02-15 11:19:27,181 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-02-15 11:19:27,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:19:27,181 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-02-15 11:19:27,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-15 11:19:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-02-15 11:19:27,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-02-15 11:19:27,182 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:19:27,182 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-02-15 11:19:27,182 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:19:27,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:19:27,183 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2019-02-15 11:19:27,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:19:27,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:27,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:19:27,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:27,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:19:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:19:30,748 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-15 11:19:30,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:30,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:19:30,749 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:19:30,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:19:30,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:30,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 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-15 11:19:30,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:19:30,760 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:19:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:19:30,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:19:30,839 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-15 11:19:30,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:19:40,880 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-15 11:19:40,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:19:40,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-02-15 11:19:40,900 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:19:40,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-02-15 11:19:40,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-02-15 11:19:40,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-15 11:19:40,902 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-02-15 11:19:41,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:19:41,057 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-02-15 11:19:41,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-15 11:19:41,057 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-02-15 11:19:41,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:19:41,058 INFO L225 Difference]: With dead ends: 101 [2019-02-15 11:19:41,058 INFO L226 Difference]: Without dead ends: 99 [2019-02-15 11:19:41,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-15 11:19:41,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-15 11:19:41,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-02-15 11:19:41,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-02-15 11:19:41,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-02-15 11:19:41,062 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-02-15 11:19:41,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:19:41,062 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-02-15 11:19:41,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-02-15 11:19:41,062 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-02-15 11:19:41,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-02-15 11:19:41,063 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:19:41,063 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-02-15 11:19:41,063 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:19:41,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:19:41,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2019-02-15 11:19:41,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:19:41,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:41,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:19:41,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:41,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:19:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:19:44,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:44,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:44,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:19:44,324 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:19:44,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:19:44,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:44,324 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-15 11:19:44,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:19:44,334 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:19:45,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-02-15 11:19:45,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:19:45,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:19:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:45,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:19:56,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:56,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:19:56,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-02-15 11:19:56,187 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:19:56,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-15 11:19:56,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-15 11:19:56,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-15 11:19:56,190 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-02-15 11:19:56,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:19:56,360 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-02-15 11:19:56,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-02-15 11:19:56,361 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-02-15 11:19:56,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:19:56,361 INFO L225 Difference]: With dead ends: 102 [2019-02-15 11:19:56,361 INFO L226 Difference]: Without dead ends: 100 [2019-02-15 11:19:56,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-15 11:19:56,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-02-15 11:19:56,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-02-15 11:19:56,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-15 11:19:56,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-02-15 11:19:56,365 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-02-15 11:19:56,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:19:56,366 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-02-15 11:19:56,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-15 11:19:56,366 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-02-15 11:19:56,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-02-15 11:19:56,367 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:19:56,367 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-02-15 11:19:56,367 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:19:56,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:19:56,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2019-02-15 11:19:56,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:19:56,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:56,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:19:56,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:56,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:19:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:19:59,780 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-15 11:19:59,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:59,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:19:59,780 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:19:59,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:19:59,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:59,781 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-15 11:19:59,789 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:19:59,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:19:59,853 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:19:59,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:19:59,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:19:59,873 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-15 11:19:59,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:20:10,679 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-15 11:20:10,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:20:10,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-02-15 11:20:10,698 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:20:10,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-02-15 11:20:10,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-02-15 11:20:10,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-15 11:20:10,700 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-02-15 11:20:10,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:20:10,941 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-02-15 11:20:10,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-15 11:20:10,941 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-02-15 11:20:10,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:20:10,942 INFO L225 Difference]: With dead ends: 103 [2019-02-15 11:20:10,942 INFO L226 Difference]: Without dead ends: 101 [2019-02-15 11:20:10,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-15 11:20:10,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-15 11:20:10,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-02-15 11:20:10,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-15 11:20:10,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-02-15 11:20:10,946 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-02-15 11:20:10,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:20:10,946 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-02-15 11:20:10,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-02-15 11:20:10,946 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-02-15 11:20:10,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-15 11:20:10,947 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:20:10,947 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-02-15 11:20:10,947 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:20:10,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:20:10,947 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2019-02-15 11:20:10,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:20:10,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:10,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:20:10,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:10,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:20:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:20:14,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:20:14,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:20:14,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:20:14,593 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:20:14,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:20:14,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:20:14,593 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-15 11:20:14,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:20:14,602 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:20:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:20:14,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:20:14,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:20:14,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:20:25,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:20:25,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:20:25,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-02-15 11:20:25,361 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:20:25,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-15 11:20:25,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-15 11:20:25,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-15 11:20:25,364 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-02-15 11:20:25,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:20:25,672 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-02-15 11:20:25,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-02-15 11:20:25,673 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-02-15 11:20:25,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:20:25,673 INFO L225 Difference]: With dead ends: 104 [2019-02-15 11:20:25,674 INFO L226 Difference]: Without dead ends: 102 [2019-02-15 11:20:25,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-15 11:20:25,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-02-15 11:20:25,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-02-15 11:20:25,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-02-15 11:20:25,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-02-15 11:20:25,678 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-02-15 11:20:25,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:20:25,678 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-02-15 11:20:25,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-15 11:20:25,678 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-02-15 11:20:25,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-02-15 11:20:25,678 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:20:25,679 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-02-15 11:20:25,679 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:20:25,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:20:25,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2019-02-15 11:20:25,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:20:25,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:25,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:20:25,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:25,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:20:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:20:29,564 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-15 11:20:29,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:20:29,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:20:29,564 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:20:29,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:20:29,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:20:29,565 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-15 11:20:29,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:20:29,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:20:31,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-02-15 11:20:31,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:20:31,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:20:31,295 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-15 11:20:31,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:20:42,471 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-15 11:20:42,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:20:42,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-02-15 11:20:42,493 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:20:42,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-15 11:20:42,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-15 11:20:42,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-15 11:20:42,496 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-02-15 11:20:42,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:20:42,742 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-02-15 11:20:42,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-02-15 11:20:42,743 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-02-15 11:20:42,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:20:42,743 INFO L225 Difference]: With dead ends: 105 [2019-02-15 11:20:42,743 INFO L226 Difference]: Without dead ends: 103 [2019-02-15 11:20:42,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-15 11:20:42,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-15 11:20:42,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-02-15 11:20:42,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-15 11:20:42,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-02-15 11:20:42,746 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-02-15 11:20:42,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:20:42,747 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-02-15 11:20:42,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-15 11:20:42,747 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-02-15 11:20:42,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-02-15 11:20:42,747 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:20:42,747 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-02-15 11:20:42,748 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:20:42,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:20:42,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2019-02-15 11:20:42,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:20:42,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:42,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:20:42,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:42,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:20:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:20:46,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:20:46,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:20:46,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:20:46,269 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:20:46,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:20:46,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:20:46,270 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-15 11:20:46,278 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:20:46,279 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:20:46,339 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:20:46,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:20:46,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:20:46,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:20:46,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:20:57,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:20:57,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:20:57,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-02-15 11:20:57,580 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:20:57,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-15 11:20:57,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-15 11:20:57,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-15 11:20:57,583 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-02-15 11:20:57,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:20:57,862 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-02-15 11:20:57,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-02-15 11:20:57,863 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-02-15 11:20:57,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:20:57,864 INFO L225 Difference]: With dead ends: 106 [2019-02-15 11:20:57,864 INFO L226 Difference]: Without dead ends: 104 [2019-02-15 11:20:57,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-15 11:20:57,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-02-15 11:20:57,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-02-15 11:20:57,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-02-15 11:20:57,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-02-15 11:20:57,869 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-02-15 11:20:57,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:20:57,869 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-02-15 11:20:57,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-15 11:20:57,870 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-02-15 11:20:57,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-02-15 11:20:57,870 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:20:57,870 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-02-15 11:20:57,871 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:20:57,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:20:57,871 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2019-02-15 11:20:57,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:20:57,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:57,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:20:57,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:57,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:20:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:21:01,562 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-15 11:21:01,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:01,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:21:01,563 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:21:01,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:21:01,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:01,563 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-15 11:21:01,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:21:01,572 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:21:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:21:01,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:21:01,658 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-15 11:21:01,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:21:13,199 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-15 11:21:13,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:21:13,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-02-15 11:21:13,220 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:21:13,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-02-15 11:21:13,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-02-15 11:21:13,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-15 11:21:13,222 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-02-15 11:21:13,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:21:13,403 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-02-15 11:21:13,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-15 11:21:13,404 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-02-15 11:21:13,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:21:13,405 INFO L225 Difference]: With dead ends: 107 [2019-02-15 11:21:13,406 INFO L226 Difference]: Without dead ends: 105 [2019-02-15 11:21:13,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-15 11:21:13,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-15 11:21:13,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-02-15 11:21:13,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-15 11:21:13,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-02-15 11:21:13,411 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-02-15 11:21:13,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:21:13,411 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-02-15 11:21:13,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-02-15 11:21:13,411 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-02-15 11:21:13,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-15 11:21:13,412 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:21:13,412 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-02-15 11:21:13,412 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:21:13,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:21:13,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2019-02-15 11:21:13,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:21:13,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:21:13,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:21:13,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:21:13,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:21:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:21:17,197 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:21:17,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:17,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:21:17,197 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:21:17,198 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:21:17,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:17,198 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 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:21:17,207 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:21:17,207 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:21:19,151 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-02-15 11:21:19,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:21:19,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:21:19,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:21:19,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:21:30,625 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:21:30,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:21:30,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-02-15 11:21:30,648 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:21:30,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-15 11:21:30,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-15 11:21:30,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-15 11:21:30,652 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-02-15 11:21:31,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:21:31,007 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-02-15 11:21:31,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-02-15 11:21:31,007 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-02-15 11:21:31,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:21:31,008 INFO L225 Difference]: With dead ends: 108 [2019-02-15 11:21:31,009 INFO L226 Difference]: Without dead ends: 106 [2019-02-15 11:21:31,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-15 11:21:31,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-15 11:21:31,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-02-15 11:21:31,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-02-15 11:21:31,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-02-15 11:21:31,014 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-02-15 11:21:31,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:21:31,014 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-02-15 11:21:31,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-15 11:21:31,014 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-02-15 11:21:31,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-02-15 11:21:31,015 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:21:31,015 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-02-15 11:21:31,015 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:21:31,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:21:31,016 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2019-02-15 11:21:31,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:21:31,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:21:31,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:21:31,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:21:31,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:21:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:21:35,008 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-15 11:21:35,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:35,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:21:35,009 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:21:35,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:21:35,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:35,009 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 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:21:35,017 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:21:35,018 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:21:35,085 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:21:35,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:21:35,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:21:35,117 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-15 11:21:35,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:21:46,814 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-15 11:21:46,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:21:46,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-02-15 11:21:46,834 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:21:46,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-02-15 11:21:46,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-02-15 11:21:46,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-15 11:21:46,838 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-02-15 11:21:47,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:21:47,150 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-02-15 11:21:47,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-02-15 11:21:47,151 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-02-15 11:21:47,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:21:47,151 INFO L225 Difference]: With dead ends: 109 [2019-02-15 11:21:47,151 INFO L226 Difference]: Without dead ends: 107 [2019-02-15 11:21:47,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-15 11:21:47,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-15 11:21:47,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-02-15 11:21:47,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-15 11:21:47,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-02-15 11:21:47,157 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-02-15 11:21:47,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:21:47,157 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-02-15 11:21:47,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-02-15 11:21:47,157 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-02-15 11:21:47,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-02-15 11:21:47,158 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:21:47,158 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-02-15 11:21:47,158 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:21:47,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:21:47,158 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2019-02-15 11:21:47,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:21:47,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:21:47,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:21:47,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:21:47,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:21:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:21:51,326 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:21:51,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:51,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:21:51,326 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:21:51,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:21:51,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:51,327 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 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:21:51,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:21:51,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:21:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:21:51,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:21:51,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:21:51,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:22:03,292 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:22:03,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:22:03,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-02-15 11:22:03,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:22:03,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-15 11:22:03,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-15 11:22:03,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-15 11:22:03,315 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-02-15 11:22:03,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:22:03,561 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-02-15 11:22:03,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-02-15 11:22:03,566 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-02-15 11:22:03,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:22:03,567 INFO L225 Difference]: With dead ends: 110 [2019-02-15 11:22:03,567 INFO L226 Difference]: Without dead ends: 108 [2019-02-15 11:22:03,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-15 11:22:03,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-02-15 11:22:03,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-02-15 11:22:03,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-15 11:22:03,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-02-15 11:22:03,571 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-02-15 11:22:03,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:22:03,572 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-02-15 11:22:03,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-15 11:22:03,572 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-02-15 11:22:03,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-02-15 11:22:03,572 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:22:03,573 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-02-15 11:22:03,573 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:22:03,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:22:03,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2019-02-15 11:22:03,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:22:03,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:03,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:22:03,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:03,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:22:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:22:07,660 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-15 11:22:07,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:07,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:22:07,660 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:22:07,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:22:07,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:07,660 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 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:22:07,668 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:22:07,668 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:22:09,787 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-02-15 11:22:09,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:22:09,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:22:09,823 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-15 11:22:09,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:22:22,026 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-15 11:22:22,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:22:22,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-02-15 11:22:22,049 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:22:22,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-15 11:22:22,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-15 11:22:22,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-02-15 11:22:22,052 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-02-15 11:22:22,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:22:22,292 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-02-15 11:22:22,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-02-15 11:22:22,292 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-02-15 11:22:22,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:22:22,293 INFO L225 Difference]: With dead ends: 111 [2019-02-15 11:22:22,293 INFO L226 Difference]: Without dead ends: 109 [2019-02-15 11:22:22,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-02-15 11:22:22,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-15 11:22:22,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-02-15 11:22:22,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-15 11:22:22,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-02-15 11:22:22,297 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-02-15 11:22:22,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:22:22,298 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-02-15 11:22:22,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-15 11:22:22,298 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-02-15 11:22:22,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-15 11:22:22,299 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:22:22,299 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-02-15 11:22:22,299 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:22:22,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:22:22,299 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2019-02-15 11:22:22,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:22:22,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:22,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:22:22,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:22,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:22:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:22:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:22:26,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:26,493 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:22:26,493 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:22:26,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:22:26,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:26,493 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 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:22:26,501 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:22:26,501 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:22:26,569 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:22:26,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:22:26,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:22:26,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:22:26,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:22:39,085 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:22:39,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:22:39,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2019-02-15 11:22:39,106 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:22:39,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-02-15 11:22:39,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-02-15 11:22:39,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-02-15 11:22:39,109 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-02-15 11:22:39,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:22:39,372 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-02-15 11:22:39,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-02-15 11:22:39,373 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-02-15 11:22:39,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:22:39,373 INFO L225 Difference]: With dead ends: 112 [2019-02-15 11:22:39,373 INFO L226 Difference]: Without dead ends: 110 [2019-02-15 11:22:39,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-02-15 11:22:39,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-15 11:22:39,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-02-15 11:22:39,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-02-15 11:22:39,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-02-15 11:22:39,377 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-02-15 11:22:39,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:22:39,378 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-02-15 11:22:39,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-02-15 11:22:39,378 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-02-15 11:22:39,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-02-15 11:22:39,378 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:22:39,378 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-02-15 11:22:39,379 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:22:39,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:22:39,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2019-02-15 11:22:39,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:22:39,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:39,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:22:39,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:39,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:22:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:22:43,537 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-15 11:22:43,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:43,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:22:43,538 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:22:43,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:22:43,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:43,538 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 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:22:43,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:22:43,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:22:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:22:43,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:22:43,635 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-15 11:22:43,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:22:56,162 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-15 11:22:56,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:22:56,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2019-02-15 11:22:56,182 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:22:56,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-02-15 11:22:56,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-02-15 11:22:56,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-02-15 11:22:56,185 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-02-15 11:22:56,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:22:56,466 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-02-15 11:22:56,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-02-15 11:22:56,466 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-02-15 11:22:56,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:22:56,467 INFO L225 Difference]: With dead ends: 113 [2019-02-15 11:22:56,467 INFO L226 Difference]: Without dead ends: 111 [2019-02-15 11:22:56,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-02-15 11:22:56,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-15 11:22:56,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-02-15 11:22:56,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-15 11:22:56,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-02-15 11:22:56,471 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-02-15 11:22:56,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:22:56,471 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-02-15 11:22:56,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-02-15 11:22:56,471 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-02-15 11:22:56,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-02-15 11:22:56,472 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:22:56,472 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-02-15 11:22:56,472 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:22:56,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:22:56,473 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2019-02-15 11:22:56,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:22:56,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:56,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:22:56,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:56,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:22:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:23:00,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:23:00,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:23:00,837 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:23:00,837 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:23:00,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:23:00,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:23:00,838 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 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:23:00,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:23:00,847 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:23:03,273 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2019-02-15 11:23:03,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:23:03,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:23:03,299 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:23:03,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:23:16,297 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:23:16,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:23:16,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2019-02-15 11:23:16,321 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:23:16,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-02-15 11:23:16,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-02-15 11:23:16,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-02-15 11:23:16,324 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-02-15 11:23:16,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:23:16,662 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-02-15 11:23:16,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-02-15 11:23:16,663 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-02-15 11:23:16,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:23:16,663 INFO L225 Difference]: With dead ends: 114 [2019-02-15 11:23:16,663 INFO L226 Difference]: Without dead ends: 112 [2019-02-15 11:23:16,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-02-15 11:23:16,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-02-15 11:23:16,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-02-15 11:23:16,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-15 11:23:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-02-15 11:23:16,666 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-02-15 11:23:16,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:23:16,667 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-02-15 11:23:16,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-02-15 11:23:16,667 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-02-15 11:23:16,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-02-15 11:23:16,667 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:23:16,667 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-02-15 11:23:16,667 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:23:16,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:23:16,668 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2019-02-15 11:23:16,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:23:16,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:23:16,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:23:16,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:23:16,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:23:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:23:21,161 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-15 11:23:21,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:23:21,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:23:21,162 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:23:21,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:23:21,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:23:21,162 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 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:23:21,171 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:23:21,171 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:23:21,241 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:23:21,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:23:21,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:23:21,265 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-15 11:23:21,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:23:34,376 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-15 11:23:34,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:23:34,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2019-02-15 11:23:34,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:23:34,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-02-15 11:23:34,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-02-15 11:23:34,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-02-15 11:23:34,399 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-02-15 11:23:34,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:23:34,683 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-02-15 11:23:34,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-02-15 11:23:34,684 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-02-15 11:23:34,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:23:34,685 INFO L225 Difference]: With dead ends: 115 [2019-02-15 11:23:34,685 INFO L226 Difference]: Without dead ends: 113 [2019-02-15 11:23:34,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-02-15 11:23:34,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-15 11:23:34,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-02-15 11:23:34,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-15 11:23:34,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-02-15 11:23:34,690 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-02-15 11:23:34,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:23:34,691 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-02-15 11:23:34,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-02-15 11:23:34,691 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-02-15 11:23:34,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-02-15 11:23:34,691 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:23:34,692 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-02-15 11:23:34,692 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:23:34,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:23:34,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2019-02-15 11:23:34,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:23:34,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:23:34,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:23:34,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:23:34,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:23:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:23:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:23:39,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:23:39,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:23:39,387 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:23:39,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:23:39,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:23:39,388 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 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:23:39,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:23:39,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:23:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:23:39,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:23:39,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:23:39,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:23:53,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:23:53,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:23:53,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2019-02-15 11:23:53,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:23:53,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-02-15 11:23:53,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-02-15 11:23:53,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-02-15 11:23:53,131 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-02-15 11:23:53,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:23:53,356 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-02-15 11:23:53,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-02-15 11:23:53,356 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-02-15 11:23:53,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:23:53,357 INFO L225 Difference]: With dead ends: 116 [2019-02-15 11:23:53,357 INFO L226 Difference]: Without dead ends: 114 [2019-02-15 11:23:53,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-02-15 11:23:53,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-02-15 11:23:53,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-02-15 11:23:53,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-02-15 11:23:53,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-02-15 11:23:53,362 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-02-15 11:23:53,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:23:53,362 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-02-15 11:23:53,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-02-15 11:23:53,362 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-02-15 11:23:53,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-02-15 11:23:53,363 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:23:53,363 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-02-15 11:23:53,363 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:23:53,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:23:53,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2019-02-15 11:23:53,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:23:53,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:23:53,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:23:53,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:23:53,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:23:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:23:58,048 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-15 11:23:58,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:23:58,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:23:58,048 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:23:58,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:23:58,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:23:58,048 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 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:23:58,076 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:23:58,076 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:24:00,725 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-02-15 11:24:00,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:24:00,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:24:00,758 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-15 11:24:00,758 INFO L316 TraceCheckSpWp]: Computing backward predicates...