java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:10:18,185 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:10:18,187 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:10:18,205 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:10:18,205 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:10:18,207 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:10:18,208 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:10:18,211 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:10:18,213 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:10:18,215 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:10:18,216 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:10:18,216 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:10:18,218 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:10:18,219 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:10:18,222 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:10:18,230 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:10:18,231 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:10:18,234 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:10:18,238 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:10:18,241 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:10:18,243 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:10:18,244 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:10:18,246 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:10:18,248 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:10:18,248 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:10:18,249 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:10:18,251 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:10:18,252 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:10:18,253 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:10:18,254 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:10:18,254 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:10:18,256 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:10:18,257 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:10:18,257 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:10:18,258 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:10:18,258 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:10:18,259 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-25 15:10:18,288 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:10:18,288 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:10:18,289 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:10:18,289 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:10:18,289 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:10:18,290 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:10:18,290 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:10:18,290 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:10:18,292 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-25 15:10:18,292 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:10:18,292 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-25 15:10:18,292 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-25 15:10:18,292 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:10:18,293 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:10:18,293 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:10:18,296 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:10:18,296 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:10:18,296 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:10:18,296 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:10:18,297 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:10:18,297 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:10:18,297 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:10:18,297 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:10:18,297 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:10:18,297 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:10:18,299 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:10:18,299 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:10:18,299 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:10:18,299 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:10:18,299 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:10:18,300 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:10:18,300 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:10:18,300 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:10:18,300 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:10:18,301 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:10:18,301 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:10:18,301 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:10:18,301 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:10:18,301 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:10:18,302 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:10:18,351 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:10:18,365 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:10:18,371 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:10:18,372 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:10:18,373 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:10:18,375 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl [2019-02-25 15:10:18,375 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2019-02-25 15:10:18,425 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:10:18,426 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:10:18,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:10:18,428 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:10:18,428 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:10:18,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,458 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:10:18,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:10:18,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:10:18,470 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:10:18,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:10:18,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:10:18,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:10:18,493 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:10:18,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:10:18,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-25 15:10:18,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-25 15:10:18,833 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-25 15:10:18,834 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-02-25 15:10:18,836 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:10:18 BoogieIcfgContainer [2019-02-25 15:10:18,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:10:18,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:10:18,839 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:10:18,842 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:10:18,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/2) ... [2019-02-25 15:10:18,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@612373f4 and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:10:18, skipping insertion in model container [2019-02-25 15:10:18,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:10:18" (2/2) ... [2019-02-25 15:10:18,847 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2019-02-25 15:10:18,858 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:10:18,867 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-25 15:10:18,887 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-25 15:10:18,924 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:10:18,924 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:10:18,924 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:10:18,924 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:10:18,924 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:10:18,925 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:10:18,925 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:10:18,925 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:10:18,944 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-25 15:10:18,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:10:18,954 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:18,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:10:18,958 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:18,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:18,968 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-02-25 15:10:18,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:19,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:19,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:19,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:19,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:19,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:10:19,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-25 15:10:19,183 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:10:19,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:10:19,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:10:19,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:10:19,207 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-25 15:10:19,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:19,278 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-02-25 15:10:19,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:10:19,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-25 15:10:19,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:19,293 INFO L225 Difference]: With dead ends: 12 [2019-02-25 15:10:19,293 INFO L226 Difference]: Without dead ends: 7 [2019-02-25 15:10:19,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:10:19,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-25 15:10:19,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-25 15:10:19,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-25 15:10:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-02-25 15:10:19,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-02-25 15:10:19,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:19,335 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-02-25 15:10:19,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:10:19,335 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-25 15:10:19,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:10:19,336 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:19,336 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:10:19,336 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:19,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:19,337 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-02-25 15:10:19,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:19,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:19,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:19,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:19,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:19,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:10:19,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:19,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:19,457 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:10:19,459 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-02-25 15:10:19,524 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:10:19,525 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:10:19,710 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:10:19,712 INFO L272 AbstractInterpreter]: Visited 6 different actions 18 times. Merged at 4 different actions 9 times. Never widened. Performed 198 root evaluator evaluations with a maximum evaluation depth of 6. Performed 198 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:10:19,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:19,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:10:19,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:19,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:19,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:19,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:19,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-25 15:10:19,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:10:19,790 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:20,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:10:20,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:20,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-02-25 15:10:20,046 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:20,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:10:20,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:10:20,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:10:20,048 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-02-25 15:10:20,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:20,121 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-02-25 15:10:20,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:10:20,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-25 15:10:20,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:20,124 INFO L225 Difference]: With dead ends: 13 [2019-02-25 15:10:20,124 INFO L226 Difference]: Without dead ends: 9 [2019-02-25 15:10:20,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:10:20,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-25 15:10:20,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-25 15:10:20,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-25 15:10:20,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-02-25 15:10:20,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-02-25 15:10:20,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:20,130 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-02-25 15:10:20,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:10:20,130 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-02-25 15:10:20,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:10:20,130 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:20,130 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-02-25 15:10:20,131 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:20,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:20,132 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-02-25 15:10:20,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:20,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:20,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:20,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:20,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:20,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:10:20,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:20,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:20,215 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:20,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:20,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:20,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:20,226 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:20,226 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:20,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-25 15:10:20,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:20,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-25 15:10:20,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:20,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:10:20,276 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:20,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:10:20,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:20,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-02-25 15:10:20,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:20,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-25 15:10:20,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-25 15:10:20,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:10:20,467 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-02-25 15:10:20,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:20,640 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-02-25 15:10:20,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:10:20,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-02-25 15:10:20,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:20,642 INFO L225 Difference]: With dead ends: 16 [2019-02-25 15:10:20,642 INFO L226 Difference]: Without dead ends: 11 [2019-02-25 15:10:20,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 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-25 15:10:20,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-25 15:10:20,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-25 15:10:20,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-25 15:10:20,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-02-25 15:10:20,647 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-02-25 15:10:20,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:20,647 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-02-25 15:10:20,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-25 15:10:20,648 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-02-25 15:10:20,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-25 15:10:20,648 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:20,648 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-02-25 15:10:20,649 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:20,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:20,649 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-02-25 15:10:20,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:20,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:20,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:20,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:20,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:20,757 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-25 15:10:20,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:20,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:20,758 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:20,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:20,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:20,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:20,772 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:20,773 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:20,795 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:20,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:20,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-25 15:10:20,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-25 15:10:20,811 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:20,986 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-25 15:10:21,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:21,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-02-25 15:10:21,017 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:21,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:10:21,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:10:21,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:10:21,018 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-02-25 15:10:21,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:21,084 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-02-25 15:10:21,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:10:21,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-02-25 15:10:21,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:21,086 INFO L225 Difference]: With dead ends: 19 [2019-02-25 15:10:21,086 INFO L226 Difference]: Without dead ends: 13 [2019-02-25 15:10:21,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:10:21,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-25 15:10:21,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-25 15:10:21,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-25 15:10:21,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-02-25 15:10:21,090 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-02-25 15:10:21,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:21,091 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-02-25 15:10:21,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:10:21,091 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-02-25 15:10:21,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-25 15:10:21,092 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:21,092 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-02-25 15:10:21,092 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:21,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:21,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-02-25 15:10:21,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:21,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:21,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:21,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:21,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:21,230 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-25 15:10:21,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:21,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:21,231 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:21,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:21,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:21,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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:21,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:21,240 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:21,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-25 15:10:21,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:21,272 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-25 15:10:21,272 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:21,440 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-25 15:10:21,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:21,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-02-25 15:10:21,460 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:21,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-25 15:10:21,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-25 15:10:21,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:10:21,461 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-02-25 15:10:21,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:21,603 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-02-25 15:10:21,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:10:21,604 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-02-25 15:10:21,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:21,605 INFO L225 Difference]: With dead ends: 22 [2019-02-25 15:10:21,605 INFO L226 Difference]: Without dead ends: 15 [2019-02-25 15:10:21,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:10:21,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-25 15:10:21,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-25 15:10:21,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-25 15:10:21,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-02-25 15:10:21,609 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-02-25 15:10:21,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:21,609 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-02-25 15:10:21,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-25 15:10:21,610 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-02-25 15:10:21,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-02-25 15:10:21,610 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:21,610 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-02-25 15:10:21,611 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:21,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:21,611 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-02-25 15:10:21,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:21,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:21,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:21,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:21,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:21,932 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-25 15:10:21,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:21,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:21,933 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:21,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:21,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:21,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:21,951 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:21,951 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:21,974 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-25 15:10:21,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:21,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-25 15:10:21,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-25 15:10:21,984 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-25 15:10:22,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:22,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-02-25 15:10:22,215 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:22,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:10:22,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:10:22,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:10:22,216 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-02-25 15:10:22,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:22,288 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-02-25 15:10:22,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:10:22,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-02-25 15:10:22,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:22,289 INFO L225 Difference]: With dead ends: 25 [2019-02-25 15:10:22,289 INFO L226 Difference]: Without dead ends: 17 [2019-02-25 15:10:22,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:10:22,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-25 15:10:22,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-25 15:10:22,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-25 15:10:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-02-25 15:10:22,294 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-02-25 15:10:22,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:22,295 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-02-25 15:10:22,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:10:22,295 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-02-25 15:10:22,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-25 15:10:22,296 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:22,296 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-02-25 15:10:22,296 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:22,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:22,297 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2019-02-25 15:10:22,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:22,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:22,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:22,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:22,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:22,457 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-25 15:10:22,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:22,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:22,457 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:22,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:22,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:22,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:22,466 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:22,466 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:22,503 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:22,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:22,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-25 15:10:22,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:22,517 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-25 15:10:22,518 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-25 15:10:22,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:22,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-02-25 15:10:22,810 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:22,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:10:22,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:10:22,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:10:22,811 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-02-25 15:10:22,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:22,908 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-02-25 15:10:22,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:10:22,908 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-02-25 15:10:22,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:22,909 INFO L225 Difference]: With dead ends: 28 [2019-02-25 15:10:22,909 INFO L226 Difference]: Without dead ends: 19 [2019-02-25 15:10:22,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 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-25 15:10:22,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-25 15:10:22,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-25 15:10:22,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-25 15:10:22,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-02-25 15:10:22,914 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-02-25 15:10:22,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:22,915 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-02-25 15:10:22,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:10:22,915 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-02-25 15:10:22,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-25 15:10:22,916 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:22,916 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-02-25 15:10:22,916 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:22,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:22,916 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2019-02-25 15:10:22,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:22,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:22,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:22,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:22,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:23,102 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-25 15:10:23,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:23,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:23,103 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:23,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:23,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:23,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:23,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:23,113 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:23,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:10:23,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-25 15:10:23,150 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:23,288 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-25 15:10:23,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:23,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-02-25 15:10:23,309 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:23,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:10:23,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:10:23,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:10:23,311 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-02-25 15:10:23,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:23,357 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-02-25 15:10:23,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:10:23,359 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-02-25 15:10:23,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:23,359 INFO L225 Difference]: With dead ends: 31 [2019-02-25 15:10:23,359 INFO L226 Difference]: Without dead ends: 21 [2019-02-25 15:10:23,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:10:23,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-25 15:10:23,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-25 15:10:23,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-25 15:10:23,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-02-25 15:10:23,364 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-02-25 15:10:23,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:23,365 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-02-25 15:10:23,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:10:23,365 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-02-25 15:10:23,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-25 15:10:23,365 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:23,366 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-02-25 15:10:23,366 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:23,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:23,366 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2019-02-25 15:10:23,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:23,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:23,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:23,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:23,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:23,511 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-25 15:10:23,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:23,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:23,512 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:23,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:23,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:23,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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:23,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:23,528 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:23,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-02-25 15:10:23,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:23,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:10:23,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:23,566 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-25 15:10:23,567 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:23,783 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-25 15:10:23,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:23,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-02-25 15:10:23,804 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:23,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:10:23,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:10:23,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:10:23,805 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-02-25 15:10:24,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:24,051 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-02-25 15:10:24,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:10:24,051 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-02-25 15:10:24,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:24,052 INFO L225 Difference]: With dead ends: 34 [2019-02-25 15:10:24,052 INFO L226 Difference]: Without dead ends: 23 [2019-02-25 15:10:24,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:10:24,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-25 15:10:24,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-02-25 15:10:24,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-25 15:10:24,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-02-25 15:10:24,063 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-02-25 15:10:24,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:24,063 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-02-25 15:10:24,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:10:24,064 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-02-25 15:10:24,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-25 15:10:24,065 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:24,065 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-02-25 15:10:24,065 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:24,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:24,066 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2019-02-25 15:10:24,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:24,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:24,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:24,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:24,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:24,260 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-25 15:10:24,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:24,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:24,262 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:24,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:24,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:24,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:24,274 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:24,274 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:24,294 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:24,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:24,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:10:24,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:24,302 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-25 15:10:24,302 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:24,504 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-25 15:10:24,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:24,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-02-25 15:10:24,523 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:24,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:10:24,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:10:24,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-25 15:10:24,524 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-02-25 15:10:24,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:24,586 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-02-25 15:10:24,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-25 15:10:24,587 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-02-25 15:10:24,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:24,588 INFO L225 Difference]: With dead ends: 37 [2019-02-25 15:10:24,588 INFO L226 Difference]: Without dead ends: 25 [2019-02-25 15:10:24,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-25 15:10:24,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-25 15:10:24,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-02-25 15:10:24,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-25 15:10:24,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-02-25 15:10:24,592 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-02-25 15:10:24,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:24,592 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-02-25 15:10:24,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:10:24,593 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-02-25 15:10:24,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-25 15:10:24,593 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:24,593 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-02-25 15:10:24,594 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:24,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:24,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2019-02-25 15:10:24,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:24,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:24,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:24,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:24,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:24,911 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-25 15:10:24,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:24,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:24,912 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:24,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:24,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:24,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:24,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:24,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:24,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:10:24,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:24,959 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-25 15:10:24,959 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:25,488 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-25 15:10:25,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:25,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-02-25 15:10:25,508 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:25,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-25 15:10:25,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-25 15:10:25,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-25 15:10:25,509 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-02-25 15:10:25,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:25,564 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-02-25 15:10:25,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-25 15:10:25,566 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-02-25 15:10:25,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:25,566 INFO L225 Difference]: With dead ends: 40 [2019-02-25 15:10:25,567 INFO L226 Difference]: Without dead ends: 27 [2019-02-25 15:10:25,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-25 15:10:25,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-25 15:10:25,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-02-25 15:10:25,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-25 15:10:25,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-02-25 15:10:25,572 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-02-25 15:10:25,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:25,572 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-02-25 15:10:25,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-25 15:10:25,572 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-02-25 15:10:25,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-02-25 15:10:25,573 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:25,573 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-02-25 15:10:25,573 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:25,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:25,574 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2019-02-25 15:10:25,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:25,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:25,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:25,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:25,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:25,749 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-25 15:10:25,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:25,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:25,749 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:25,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:25,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:25,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:25,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:25,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:25,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-02-25 15:10:25,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:25,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:10:25,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-25 15:10:25,814 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-25 15:10:26,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:26,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-02-25 15:10:26,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:26,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-25 15:10:26,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-25 15:10:26,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-25 15:10:26,047 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2019-02-25 15:10:26,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:26,195 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-02-25 15:10:26,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-25 15:10:26,196 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-02-25 15:10:26,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:26,197 INFO L225 Difference]: With dead ends: 43 [2019-02-25 15:10:26,197 INFO L226 Difference]: Without dead ends: 29 [2019-02-25 15:10:26,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-25 15:10:26,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-25 15:10:26,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-02-25 15:10:26,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-25 15:10:26,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-02-25 15:10:26,202 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-02-25 15:10:26,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:26,202 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-02-25 15:10:26,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-25 15:10:26,202 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-02-25 15:10:26,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-25 15:10:26,203 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:26,203 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-02-25 15:10:26,203 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:26,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:26,204 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2019-02-25 15:10:26,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:26,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:26,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:26,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:26,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:26,347 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-25 15:10:26,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:26,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:26,347 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:26,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:26,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:26,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:26,367 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:26,367 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:26,412 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:26,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:26,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:10:26,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:26,421 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-25 15:10:26,422 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:26,670 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-25 15:10:26,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:26,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-02-25 15:10:26,689 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:26,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-25 15:10:26,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-25 15:10:26,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-25 15:10:26,691 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-02-25 15:10:26,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:26,805 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-02-25 15:10:26,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-25 15:10:26,806 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-02-25 15:10:26,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:26,806 INFO L225 Difference]: With dead ends: 46 [2019-02-25 15:10:26,806 INFO L226 Difference]: Without dead ends: 31 [2019-02-25 15:10:26,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 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-25 15:10:26,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-25 15:10:26,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-02-25 15:10:26,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-25 15:10:26,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-02-25 15:10:26,811 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-02-25 15:10:26,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:26,811 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-02-25 15:10:26,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-25 15:10:26,812 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-02-25 15:10:26,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-25 15:10:26,812 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:26,812 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-02-25 15:10:26,812 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:26,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:26,813 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2019-02-25 15:10:26,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:26,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:26,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:26,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:26,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:27,036 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-25 15:10:27,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:27,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:27,037 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:27,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:27,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:27,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:27,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:27,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:27,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:10:27,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:27,093 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-25 15:10:27,094 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:27,416 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-25 15:10:27,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:27,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-02-25 15:10:27,437 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:27,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-25 15:10:27,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-25 15:10:27,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-25 15:10:27,438 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-02-25 15:10:27,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:27,624 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-02-25 15:10:27,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-25 15:10:27,625 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-02-25 15:10:27,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:27,626 INFO L225 Difference]: With dead ends: 49 [2019-02-25 15:10:27,626 INFO L226 Difference]: Without dead ends: 33 [2019-02-25 15:10:27,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-25 15:10:27,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-25 15:10:27,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-02-25 15:10:27,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-25 15:10:27,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-02-25 15:10:27,631 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-02-25 15:10:27,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:27,631 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-02-25 15:10:27,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-25 15:10:27,632 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-02-25 15:10:27,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-25 15:10:27,632 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:27,632 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-02-25 15:10:27,633 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:27,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:27,633 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2019-02-25 15:10:27,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:27,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:27,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:27,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:27,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:27,801 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-25 15:10:27,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:27,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:27,801 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:27,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:27,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:27,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:27,812 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:27,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:27,852 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-25 15:10:27,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:27,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:10:27,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:27,863 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-25 15:10:27,863 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:28,280 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-25 15:10:28,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:28,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-02-25 15:10:28,301 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:28,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-25 15:10:28,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-25 15:10:28,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-25 15:10:28,302 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-02-25 15:10:28,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:28,360 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-02-25 15:10:28,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-25 15:10:28,361 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-02-25 15:10:28,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:28,362 INFO L225 Difference]: With dead ends: 52 [2019-02-25 15:10:28,362 INFO L226 Difference]: Without dead ends: 35 [2019-02-25 15:10:28,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-25 15:10:28,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-25 15:10:28,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-02-25 15:10:28,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-25 15:10:28,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-02-25 15:10:28,367 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-02-25 15:10:28,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:28,367 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-02-25 15:10:28,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-25 15:10:28,367 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-02-25 15:10:28,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-25 15:10:28,368 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:28,368 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-02-25 15:10:28,368 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:28,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:28,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2019-02-25 15:10:28,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:28,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:28,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:28,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:28,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:28,619 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-25 15:10:28,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:28,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:28,620 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:28,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:28,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:28,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:28,632 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:28,632 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:28,657 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:28,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:28,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:10:28,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:28,666 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-25 15:10:28,667 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:28,996 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-25 15:10:29,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:29,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-02-25 15:10:29,017 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:29,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-25 15:10:29,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-25 15:10:29,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-25 15:10:29,018 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-02-25 15:10:29,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:29,127 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-02-25 15:10:29,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-25 15:10:29,127 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-02-25 15:10:29,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:29,128 INFO L225 Difference]: With dead ends: 55 [2019-02-25 15:10:29,128 INFO L226 Difference]: Without dead ends: 37 [2019-02-25 15:10:29,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 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-25 15:10:29,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-25 15:10:29,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-02-25 15:10:29,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-25 15:10:29,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-02-25 15:10:29,134 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-02-25 15:10:29,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:29,134 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-02-25 15:10:29,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-25 15:10:29,134 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-02-25 15:10:29,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-25 15:10:29,135 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:29,135 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-02-25 15:10:29,135 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:29,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:29,136 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2019-02-25 15:10:29,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:29,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:29,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:29,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:29,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:29,701 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-25 15:10:29,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:29,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:29,701 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:29,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:29,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:29,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:29,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:29,712 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:29,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:10:29,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:29,748 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-25 15:10:29,748 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:30,560 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-25 15:10:30,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:30,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-02-25 15:10:30,579 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:30,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-25 15:10:30,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-25 15:10:30,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-25 15:10:30,581 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-02-25 15:10:30,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:30,675 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-02-25 15:10:30,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-25 15:10:30,676 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-02-25 15:10:30,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:30,676 INFO L225 Difference]: With dead ends: 58 [2019-02-25 15:10:30,676 INFO L226 Difference]: Without dead ends: 39 [2019-02-25 15:10:30,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-25 15:10:30,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-25 15:10:30,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-02-25 15:10:30,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-25 15:10:30,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-02-25 15:10:30,681 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-02-25 15:10:30,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:30,682 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-02-25 15:10:30,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-25 15:10:30,682 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-02-25 15:10:30,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-02-25 15:10:30,683 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:30,683 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-02-25 15:10:30,683 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:30,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:30,683 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2019-02-25 15:10:30,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:30,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:30,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:30,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:30,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:30,955 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-25 15:10:30,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:30,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:30,956 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:30,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:30,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:30,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:30,965 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:30,965 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:31,015 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-02-25 15:10:31,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:31,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:10:31,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:31,027 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-25 15:10:31,028 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:31,780 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-25 15:10:31,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:31,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-02-25 15:10:31,801 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:31,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-25 15:10:31,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-25 15:10:31,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:10:31,803 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-02-25 15:10:31,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:31,883 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-02-25 15:10:31,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-25 15:10:31,883 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-02-25 15:10:31,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:31,884 INFO L225 Difference]: With dead ends: 61 [2019-02-25 15:10:31,884 INFO L226 Difference]: Without dead ends: 41 [2019-02-25 15:10:31,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:10:31,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-25 15:10:31,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-02-25 15:10:31,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-25 15:10:31,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-02-25 15:10:31,890 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-02-25 15:10:31,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:31,891 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-02-25 15:10:31,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-25 15:10:31,891 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-02-25 15:10:31,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-25 15:10:31,892 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:31,892 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-02-25 15:10:31,892 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:31,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:31,892 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2019-02-25 15:10:31,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:31,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:31,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:31,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:31,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:32,367 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-25 15:10:32,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:32,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:32,368 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:32,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:32,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:32,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:32,386 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:32,386 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:32,428 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:32,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:32,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:10:32,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:32,442 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-25 15:10:32,442 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:32,955 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-25 15:10:32,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:32,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-02-25 15:10:32,974 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:32,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-25 15:10:32,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-25 15:10:32,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-25 15:10:32,976 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-02-25 15:10:33,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:33,151 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-02-25 15:10:33,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-25 15:10:33,152 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-02-25 15:10:33,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:33,152 INFO L225 Difference]: With dead ends: 64 [2019-02-25 15:10:33,152 INFO L226 Difference]: Without dead ends: 43 [2019-02-25 15:10:33,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-25 15:10:33,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-25 15:10:33,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-02-25 15:10:33,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-25 15:10:33,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-02-25 15:10:33,156 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-02-25 15:10:33,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:33,156 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-02-25 15:10:33,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-25 15:10:33,157 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-02-25 15:10:33,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-02-25 15:10:33,157 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:33,157 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-02-25 15:10:33,158 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:33,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:33,158 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2019-02-25 15:10:33,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:33,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:33,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:33,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:33,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:33,452 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-25 15:10:33,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:33,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:33,452 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:33,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:33,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:33,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:33,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:33,462 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:33,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-25 15:10:33,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:33,501 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-25 15:10:33,502 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:33,967 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-25 15:10:33,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:33,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-02-25 15:10:33,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:33,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-25 15:10:33,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-25 15:10:33,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-25 15:10:33,988 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-02-25 15:10:34,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:34,070 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-02-25 15:10:34,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-25 15:10:34,070 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-02-25 15:10:34,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:34,071 INFO L225 Difference]: With dead ends: 67 [2019-02-25 15:10:34,071 INFO L226 Difference]: Without dead ends: 45 [2019-02-25 15:10:34,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 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-25 15:10:34,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-25 15:10:34,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-02-25 15:10:34,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-25 15:10:34,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-02-25 15:10:34,077 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-02-25 15:10:34,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:34,077 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-02-25 15:10:34,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-25 15:10:34,077 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-02-25 15:10:34,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-25 15:10:34,078 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:34,078 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-02-25 15:10:34,078 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:34,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:34,079 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2019-02-25 15:10:34,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:34,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:34,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:34,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:34,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:34,425 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-25 15:10:34,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:34,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:34,426 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:34,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:34,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:34,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:34,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:34,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:34,511 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-25 15:10:34,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:34,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-25 15:10:34,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:34,522 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-25 15:10:34,522 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:35,173 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-25 15:10:35,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:35,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-02-25 15:10:35,192 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:35,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-25 15:10:35,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-25 15:10:35,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-25 15:10:35,194 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-02-25 15:10:35,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:35,275 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-02-25 15:10:35,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-25 15:10:35,276 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-02-25 15:10:35,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:35,277 INFO L225 Difference]: With dead ends: 70 [2019-02-25 15:10:35,277 INFO L226 Difference]: Without dead ends: 47 [2019-02-25 15:10:35,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-25 15:10:35,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-25 15:10:35,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-02-25 15:10:35,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-25 15:10:35,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-02-25 15:10:35,282 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-02-25 15:10:35,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:35,282 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-02-25 15:10:35,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-25 15:10:35,282 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-02-25 15:10:35,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-02-25 15:10:35,283 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:35,283 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-02-25 15:10:35,283 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:35,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:35,284 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2019-02-25 15:10:35,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:35,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:35,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:35,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:35,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:36,071 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-25 15:10:36,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:36,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:36,072 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:36,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:36,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:36,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:36,086 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:36,086 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:36,120 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:36,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:36,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 23 conjunts are in the unsatisfiable core [2019-02-25 15:10:36,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-25 15:10:36,131 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:36,766 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-25 15:10:36,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:36,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-02-25 15:10:36,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:36,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-25 15:10:36,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-25 15:10:36,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-25 15:10:36,787 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-02-25 15:10:36,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:36,871 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-02-25 15:10:36,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-25 15:10:36,873 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-02-25 15:10:36,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:36,874 INFO L225 Difference]: With dead ends: 73 [2019-02-25 15:10:36,874 INFO L226 Difference]: Without dead ends: 49 [2019-02-25 15:10:36,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-25 15:10:36,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-25 15:10:36,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-02-25 15:10:36,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-25 15:10:36,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-02-25 15:10:36,879 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-02-25 15:10:36,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:36,879 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-02-25 15:10:36,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-25 15:10:36,880 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-02-25 15:10:36,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-25 15:10:36,880 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:36,880 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-02-25 15:10:36,881 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:36,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:36,881 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2019-02-25 15:10:36,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:36,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:36,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:36,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:36,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:37,214 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-25 15:10:37,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:37,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:37,215 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:37,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:37,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:37,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:37,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:37,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:37,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 24 conjunts are in the unsatisfiable core [2019-02-25 15:10:37,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:37,272 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-25 15:10:37,272 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:37,895 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-25 15:10:37,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:37,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-02-25 15:10:37,914 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:37,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-25 15:10:37,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-25 15:10:37,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-25 15:10:37,917 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-02-25 15:10:38,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:38,046 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-02-25 15:10:38,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-25 15:10:38,049 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-02-25 15:10:38,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:38,050 INFO L225 Difference]: With dead ends: 76 [2019-02-25 15:10:38,050 INFO L226 Difference]: Without dead ends: 51 [2019-02-25 15:10:38,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-25 15:10:38,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-25 15:10:38,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-02-25 15:10:38,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-25 15:10:38,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-02-25 15:10:38,055 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-02-25 15:10:38,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:38,055 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-02-25 15:10:38,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-25 15:10:38,055 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-02-25 15:10:38,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-02-25 15:10:38,056 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:38,056 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-02-25 15:10:38,056 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:38,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:38,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2019-02-25 15:10:38,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:38,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:38,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:38,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:38,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:38,790 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-25 15:10:38,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:38,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:38,791 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:38,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:38,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:38,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:38,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:38,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:38,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-25 15:10:38,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:38,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2019-02-25 15:10:38,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:38,894 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-25 15:10:38,894 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:39,685 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-25 15:10:39,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:39,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-02-25 15:10:39,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:39,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-25 15:10:39,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-25 15:10:39,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:10:39,707 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-02-25 15:10:39,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:39,796 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-02-25 15:10:39,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-25 15:10:39,797 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-02-25 15:10:39,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:39,798 INFO L225 Difference]: With dead ends: 79 [2019-02-25 15:10:39,798 INFO L226 Difference]: Without dead ends: 53 [2019-02-25 15:10:39,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:10:39,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-25 15:10:39,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-02-25 15:10:39,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-25 15:10:39,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-02-25 15:10:39,803 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-02-25 15:10:39,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:39,803 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-02-25 15:10:39,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-25 15:10:39,803 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-02-25 15:10:39,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-25 15:10:39,804 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:39,804 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-02-25 15:10:39,804 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:39,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:39,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2019-02-25 15:10:39,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:39,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:39,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:39,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:39,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:40,186 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-25 15:10:40,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:40,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:40,187 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:40,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:40,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:40,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:40,202 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:40,202 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:40,249 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:40,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:40,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 26 conjunts are in the unsatisfiable core [2019-02-25 15:10:40,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-25 15:10:40,257 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:41,182 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-25 15:10:41,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:41,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-02-25 15:10:41,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:41,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-25 15:10:41,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-25 15:10:41,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-25 15:10:41,203 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-02-25 15:10:41,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:41,327 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-02-25 15:10:41,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-25 15:10:41,328 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-02-25 15:10:41,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:41,329 INFO L225 Difference]: With dead ends: 82 [2019-02-25 15:10:41,329 INFO L226 Difference]: Without dead ends: 55 [2019-02-25 15:10:41,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-25 15:10:41,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-25 15:10:41,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-02-25 15:10:41,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-25 15:10:41,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-02-25 15:10:41,333 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-02-25 15:10:41,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:41,334 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-02-25 15:10:41,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-25 15:10:41,334 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-02-25 15:10:41,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-02-25 15:10:41,335 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:41,335 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-02-25 15:10:41,335 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:41,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:41,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2019-02-25 15:10:41,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:41,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:41,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:41,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:41,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:41,979 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-25 15:10:41,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:41,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:41,980 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:41,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:41,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:41,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:41,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:41,988 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:42,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 27 conjunts are in the unsatisfiable core [2019-02-25 15:10:42,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-25 15:10:42,035 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:43,714 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-25 15:10:43,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:43,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-02-25 15:10:43,733 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:43,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-25 15:10:43,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-25 15:10:43,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-25 15:10:43,734 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-02-25 15:10:43,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:43,829 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-02-25 15:10:43,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-25 15:10:43,829 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-02-25 15:10:43,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:43,830 INFO L225 Difference]: With dead ends: 85 [2019-02-25 15:10:43,830 INFO L226 Difference]: Without dead ends: 57 [2019-02-25 15:10:43,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-25 15:10:43,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-25 15:10:43,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-02-25 15:10:43,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-25 15:10:43,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-02-25 15:10:43,835 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-02-25 15:10:43,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:43,835 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-02-25 15:10:43,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-25 15:10:43,836 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-02-25 15:10:43,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-25 15:10:43,836 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:43,836 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-02-25 15:10:43,836 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:43,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:43,837 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2019-02-25 15:10:43,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:43,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:43,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:43,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:43,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:44,649 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-25 15:10:44,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:44,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:44,649 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:44,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:44,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:44,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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:44,660 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:44,660 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:44,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-02-25 15:10:44,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:44,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 28 conjunts are in the unsatisfiable core [2019-02-25 15:10:44,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:44,772 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-25 15:10:44,772 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:45,739 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-25 15:10:45,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:45,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-02-25 15:10:45,758 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:45,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-25 15:10:45,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-25 15:10:45,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-25 15:10:45,760 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-02-25 15:10:45,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:45,885 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-02-25 15:10:45,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-25 15:10:45,885 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-02-25 15:10:45,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:45,886 INFO L225 Difference]: With dead ends: 88 [2019-02-25 15:10:45,886 INFO L226 Difference]: Without dead ends: 59 [2019-02-25 15:10:45,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-25 15:10:45,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-25 15:10:45,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-02-25 15:10:45,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-25 15:10:45,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-02-25 15:10:45,889 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-02-25 15:10:45,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:45,890 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-02-25 15:10:45,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-25 15:10:45,890 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-02-25 15:10:45,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-25 15:10:45,890 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:45,891 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-02-25 15:10:45,891 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:45,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:45,891 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2019-02-25 15:10:45,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:45,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:45,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:45,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:45,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:46,578 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-25 15:10:46,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:46,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:46,578 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:46,578 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:46,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:46,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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:46,587 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:46,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:46,632 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:46,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:46,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 29 conjunts are in the unsatisfiable core [2019-02-25 15:10:46,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:46,643 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-25 15:10:46,643 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:47,713 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-25 15:10:47,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:47,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-02-25 15:10:47,733 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:47,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-25 15:10:47,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-25 15:10:47,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-25 15:10:47,734 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-02-25 15:10:47,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:47,851 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-02-25 15:10:47,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-25 15:10:47,851 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-02-25 15:10:47,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:47,852 INFO L225 Difference]: With dead ends: 91 [2019-02-25 15:10:47,852 INFO L226 Difference]: Without dead ends: 61 [2019-02-25 15:10:47,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-25 15:10:47,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-25 15:10:47,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-02-25 15:10:47,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-25 15:10:47,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-02-25 15:10:47,856 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-02-25 15:10:47,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:47,856 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-02-25 15:10:47,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-25 15:10:47,856 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-02-25 15:10:47,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-25 15:10:47,857 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:47,857 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-02-25 15:10:47,857 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:47,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:47,857 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2019-02-25 15:10:47,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:47,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:47,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:47,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:47,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:48,270 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-25 15:10:48,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:48,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:48,271 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:48,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:48,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:48,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:48,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:48,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:48,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 30 conjunts are in the unsatisfiable core [2019-02-25 15:10:48,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:48,345 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-25 15:10:48,345 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:49,327 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-25 15:10:49,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:49,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-02-25 15:10:49,346 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:49,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-25 15:10:49,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-25 15:10:49,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-25 15:10:49,348 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-02-25 15:10:49,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:49,470 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-02-25 15:10:49,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-25 15:10:49,471 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-02-25 15:10:49,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:49,472 INFO L225 Difference]: With dead ends: 94 [2019-02-25 15:10:49,472 INFO L226 Difference]: Without dead ends: 63 [2019-02-25 15:10:49,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 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-25 15:10:49,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-25 15:10:49,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-02-25 15:10:49,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-25 15:10:49,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-02-25 15:10:49,476 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-02-25 15:10:49,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:49,476 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-02-25 15:10:49,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-25 15:10:49,477 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-02-25 15:10:49,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-25 15:10:49,477 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:49,477 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-02-25 15:10:49,478 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:49,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:49,478 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2019-02-25 15:10:49,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:49,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:49,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:49,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:49,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:49,970 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-25 15:10:49,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:49,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:49,971 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:49,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:49,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:49,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:49,980 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:49,980 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:50,148 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-25 15:10:50,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:50,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 31 conjunts are in the unsatisfiable core [2019-02-25 15:10:50,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-25 15:10:50,161 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:51,455 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-25 15:10:51,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:51,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-02-25 15:10:51,474 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:51,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-25 15:10:51,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-25 15:10:51,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-25 15:10:51,476 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-02-25 15:10:51,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:51,580 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-02-25 15:10:51,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-25 15:10:51,580 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-02-25 15:10:51,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:51,581 INFO L225 Difference]: With dead ends: 97 [2019-02-25 15:10:51,581 INFO L226 Difference]: Without dead ends: 65 [2019-02-25 15:10:51,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-25 15:10:51,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-25 15:10:51,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-02-25 15:10:51,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-25 15:10:51,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-02-25 15:10:51,584 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-02-25 15:10:51,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:51,584 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-02-25 15:10:51,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-25 15:10:51,584 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-02-25 15:10:51,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-25 15:10:51,585 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:51,585 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-02-25 15:10:51,585 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:51,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:51,585 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2019-02-25 15:10:51,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:51,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:51,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:51,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:51,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:52,680 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-25 15:10:52,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:52,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:52,680 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:52,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:52,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:52,681 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:52,690 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:52,690 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:52,740 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:52,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:52,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 32 conjunts are in the unsatisfiable core [2019-02-25 15:10:52,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:52,752 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-25 15:10:52,752 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:53,778 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-25 15:10:53,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:53,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-02-25 15:10:53,797 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:53,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-25 15:10:53,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-25 15:10:53,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-25 15:10:53,798 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-02-25 15:10:53,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:53,947 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2019-02-25 15:10:53,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-25 15:10:53,948 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-02-25 15:10:53,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:53,949 INFO L225 Difference]: With dead ends: 100 [2019-02-25 15:10:53,949 INFO L226 Difference]: Without dead ends: 67 [2019-02-25 15:10:53,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-25 15:10:53,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-25 15:10:53,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-02-25 15:10:53,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-25 15:10:53,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-02-25 15:10:53,952 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-02-25 15:10:53,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:53,952 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-02-25 15:10:53,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-25 15:10:53,953 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-02-25 15:10:53,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-25 15:10:53,953 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:53,953 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-02-25 15:10:53,953 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:53,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:53,954 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2019-02-25 15:10:53,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:53,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:53,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:53,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:53,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-25 15:10:54,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:54,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:54,470 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:54,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:54,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:54,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:54,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:54,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:54,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 33 conjunts are in the unsatisfiable core [2019-02-25 15:10:54,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:54,539 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-25 15:10:54,539 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:55,672 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-25 15:10:55,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:55,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-02-25 15:10:55,691 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:55,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-25 15:10:55,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-25 15:10:55,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-25 15:10:55,692 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-02-25 15:10:55,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:55,819 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-02-25 15:10:55,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-25 15:10:55,819 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-02-25 15:10:55,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:55,820 INFO L225 Difference]: With dead ends: 103 [2019-02-25 15:10:55,820 INFO L226 Difference]: Without dead ends: 69 [2019-02-25 15:10:55,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 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-25 15:10:55,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-25 15:10:55,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-02-25 15:10:55,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-25 15:10:55,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-02-25 15:10:55,824 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-02-25 15:10:55,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:55,825 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-02-25 15:10:55,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-25 15:10:55,825 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-02-25 15:10:55,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-25 15:10:55,825 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:55,825 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-02-25 15:10:55,826 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:55,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:55,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2019-02-25 15:10:55,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:55,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:55,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:55,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:55,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:56,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-25 15:10:56,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:56,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:56,593 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:56,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:56,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:56,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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:56,603 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:56,603 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:56,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-02-25 15:10:56,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:56,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-25 15:10:56,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:56,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-25 15:10:56,785 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:57,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-25 15:10:57,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:57,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-02-25 15:10:57,993 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:57,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-25 15:10:57,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-25 15:10:57,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-25 15:10:57,994 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-02-25 15:10:58,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:58,142 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2019-02-25 15:10:58,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-25 15:10:58,142 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-02-25 15:10:58,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:58,143 INFO L225 Difference]: With dead ends: 106 [2019-02-25 15:10:58,143 INFO L226 Difference]: Without dead ends: 71 [2019-02-25 15:10:58,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-25 15:10:58,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-25 15:10:58,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-02-25 15:10:58,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-25 15:10:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-02-25 15:10:58,147 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-02-25 15:10:58,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:58,147 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-02-25 15:10:58,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-25 15:10:58,147 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-02-25 15:10:58,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-02-25 15:10:58,148 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:58,148 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-02-25 15:10:58,148 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:58,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:58,149 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2019-02-25 15:10:58,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:58,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:58,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:58,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:58,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:58,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-25 15:10:58,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:58,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:58,659 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:58,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:58,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:58,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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:58,671 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:58,671 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:58,722 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:58,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:58,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 35 conjunts are in the unsatisfiable core [2019-02-25 15:10:58,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:58,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-25 15:10:58,734 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:00,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-25 15:11:00,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:00,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-02-25 15:11:00,086 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:00,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-25 15:11:00,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-25 15:11:00,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-25 15:11:00,087 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-02-25 15:11:00,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:00,251 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-02-25 15:11:00,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-25 15:11:00,252 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-02-25 15:11:00,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:00,252 INFO L225 Difference]: With dead ends: 109 [2019-02-25 15:11:00,252 INFO L226 Difference]: Without dead ends: 73 [2019-02-25 15:11:00,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 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-25 15:11:00,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-25 15:11:00,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-02-25 15:11:00,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-25 15:11:00,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-02-25 15:11:00,255 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-02-25 15:11:00,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:00,255 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-02-25 15:11:00,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-25 15:11:00,255 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-02-25 15:11:00,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-25 15:11:00,256 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:00,256 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-02-25 15:11:00,256 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:00,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:00,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2019-02-25 15:11:00,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:00,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:00,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:00,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:00,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:01,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-25 15:11:01,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:01,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:01,806 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:01,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:01,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:01,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-25 15:11:01,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:01,820 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:01,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 36 conjunts are in the unsatisfiable core [2019-02-25 15:11:01,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:01,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-25 15:11:01,883 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:03,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-25 15:11:03,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:03,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-02-25 15:11:03,277 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:03,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-25 15:11:03,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-25 15:11:03,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-25 15:11:03,278 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-02-25 15:11:03,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:03,503 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-02-25 15:11:03,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-25 15:11:03,504 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-02-25 15:11:03,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:03,505 INFO L225 Difference]: With dead ends: 112 [2019-02-25 15:11:03,505 INFO L226 Difference]: Without dead ends: 75 [2019-02-25 15:11:03,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-25 15:11:03,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-25 15:11:03,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-02-25 15:11:03,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-25 15:11:03,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-02-25 15:11:03,510 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-02-25 15:11:03,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:03,511 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-02-25 15:11:03,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-25 15:11:03,511 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-02-25 15:11:03,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-02-25 15:11:03,511 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:03,512 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-02-25 15:11:03,512 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:03,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:03,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2019-02-25 15:11:03,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:03,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:03,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:03,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:03,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:04,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-25 15:11:04,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:04,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:04,079 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:04,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:04,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:04,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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:04,088 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:04,088 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:04,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-02-25 15:11:04,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:04,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 37 conjunts are in the unsatisfiable core [2019-02-25 15:11:04,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:04,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-25 15:11:04,500 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:05,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-25 15:11:05,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:05,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-02-25 15:11:05,953 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:05,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-25 15:11:05,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-25 15:11:05,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-25 15:11:05,953 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-02-25 15:11:06,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:06,089 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2019-02-25 15:11:06,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-25 15:11:06,090 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-02-25 15:11:06,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:06,090 INFO L225 Difference]: With dead ends: 115 [2019-02-25 15:11:06,090 INFO L226 Difference]: Without dead ends: 77 [2019-02-25 15:11:06,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-25 15:11:06,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-25 15:11:06,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-02-25 15:11:06,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-25 15:11:06,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-02-25 15:11:06,093 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-02-25 15:11:06,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:06,094 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-02-25 15:11:06,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-25 15:11:06,094 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-02-25 15:11:06,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-25 15:11:06,094 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:06,094 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-02-25 15:11:06,094 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:06,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:06,095 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2019-02-25 15:11:06,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:06,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:06,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:06,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:06,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:06,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-25 15:11:06,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:06,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:06,953 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:06,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:06,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:06,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:06,963 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:06,963 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:07,022 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:07,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:07,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 38 conjunts are in the unsatisfiable core [2019-02-25 15:11:07,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:07,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-25 15:11:07,036 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-25 15:11:08,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:08,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-02-25 15:11:08,579 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:08,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-25 15:11:08,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-25 15:11:08,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-25 15:11:08,580 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-02-25 15:11:08,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:08,728 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2019-02-25 15:11:08,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-25 15:11:08,728 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-02-25 15:11:08,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:08,729 INFO L225 Difference]: With dead ends: 118 [2019-02-25 15:11:08,729 INFO L226 Difference]: Without dead ends: 79 [2019-02-25 15:11:08,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-25 15:11:08,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-25 15:11:08,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-02-25 15:11:08,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-25 15:11:08,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-02-25 15:11:08,733 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-02-25 15:11:08,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:08,734 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-02-25 15:11:08,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-25 15:11:08,734 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-02-25 15:11:08,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-02-25 15:11:08,734 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:08,734 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-02-25 15:11:08,735 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:08,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:08,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2019-02-25 15:11:08,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:08,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:08,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:08,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:08,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:09,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-25 15:11:09,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:09,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:09,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:09,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:09,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:09,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:09,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:09,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:09,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 39 conjunts are in the unsatisfiable core [2019-02-25 15:11:09,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:09,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-25 15:11:09,480 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:11,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-25 15:11:11,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:11,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-02-25 15:11:11,176 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:11,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-25 15:11:11,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-25 15:11:11,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-25 15:11:11,177 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-02-25 15:11:11,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:11,354 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-02-25 15:11:11,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-25 15:11:11,354 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-02-25 15:11:11,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:11,355 INFO L225 Difference]: With dead ends: 121 [2019-02-25 15:11:11,355 INFO L226 Difference]: Without dead ends: 81 [2019-02-25 15:11:11,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-25 15:11:11,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-25 15:11:11,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-02-25 15:11:11,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-25 15:11:11,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-02-25 15:11:11,358 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-02-25 15:11:11,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:11,358 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-02-25 15:11:11,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-25 15:11:11,358 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-02-25 15:11:11,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-25 15:11:11,359 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:11,359 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-02-25 15:11:11,359 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:11,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:11,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2019-02-25 15:11:11,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:11,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:11,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:11,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:11,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:12,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-25 15:11:12,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:12,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:12,192 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:12,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:12,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:12,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:12,201 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:12,201 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:12,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-25 15:11:12,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:12,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 40 conjunts are in the unsatisfiable core [2019-02-25 15:11:12,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:12,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-25 15:11:12,587 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:14,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-25 15:11:14,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:14,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-02-25 15:11:14,401 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:14,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-25 15:11:14,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-25 15:11:14,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:11:14,402 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-02-25 15:11:14,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:14,548 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2019-02-25 15:11:14,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-25 15:11:14,548 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-02-25 15:11:14,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:14,549 INFO L225 Difference]: With dead ends: 124 [2019-02-25 15:11:14,549 INFO L226 Difference]: Without dead ends: 83 [2019-02-25 15:11:14,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:11:14,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-25 15:11:14,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-02-25 15:11:14,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-25 15:11:14,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-02-25 15:11:14,553 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-02-25 15:11:14,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:14,553 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-02-25 15:11:14,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-25 15:11:14,553 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-02-25 15:11:14,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-02-25 15:11:14,553 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:14,554 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-02-25 15:11:14,554 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:14,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:14,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2019-02-25 15:11:14,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:14,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:14,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:14,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:14,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:15,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-25 15:11:15,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:15,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:15,298 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:15,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:15,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:15,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:15,306 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:15,306 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:15,363 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:15,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:15,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 41 conjunts are in the unsatisfiable core [2019-02-25 15:11:15,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:15,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-25 15:11:15,374 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:17,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-25 15:11:17,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:17,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-02-25 15:11:17,358 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:17,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-25 15:11:17,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-25 15:11:17,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-25 15:11:17,360 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-02-25 15:11:17,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:17,520 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2019-02-25 15:11:17,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-25 15:11:17,520 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-02-25 15:11:17,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:17,521 INFO L225 Difference]: With dead ends: 127 [2019-02-25 15:11:17,522 INFO L226 Difference]: Without dead ends: 85 [2019-02-25 15:11:17,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-25 15:11:17,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-25 15:11:17,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-02-25 15:11:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-25 15:11:17,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-02-25 15:11:17,526 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-02-25 15:11:17,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:17,526 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-02-25 15:11:17,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-25 15:11:17,526 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-02-25 15:11:17,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-25 15:11:17,527 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:17,527 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-02-25 15:11:17,527 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:17,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:17,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2019-02-25 15:11:17,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:17,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:17,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:17,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:17,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:18,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-25 15:11:18,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:18,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:18,269 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:18,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:18,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:18,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:18,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:18,278 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:18,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 42 conjunts are in the unsatisfiable core [2019-02-25 15:11:18,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-25 15:11:18,350 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:20,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-25 15:11:20,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:20,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-02-25 15:11:20,197 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:20,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-25 15:11:20,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-25 15:11:20,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-25 15:11:20,198 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-02-25 15:11:20,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:20,369 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-02-25 15:11:20,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-25 15:11:20,370 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-02-25 15:11:20,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:20,370 INFO L225 Difference]: With dead ends: 130 [2019-02-25 15:11:20,370 INFO L226 Difference]: Without dead ends: 87 [2019-02-25 15:11:20,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-25 15:11:20,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-25 15:11:20,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-02-25 15:11:20,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-25 15:11:20,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-02-25 15:11:20,375 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-02-25 15:11:20,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:20,375 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-02-25 15:11:20,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-25 15:11:20,375 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-02-25 15:11:20,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-25 15:11:20,376 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:20,376 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-02-25 15:11:20,376 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:20,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:20,376 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2019-02-25 15:11:20,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:20,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:20,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:20,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:20,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:21,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-25 15:11:21,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:21,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:21,181 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:21,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:21,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:21,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:21,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:21,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:21,515 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-25 15:11:21,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:21,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 43 conjunts are in the unsatisfiable core [2019-02-25 15:11:21,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:21,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-25 15:11:21,533 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-25 15:11:23,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:23,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-02-25 15:11:23,675 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:23,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-25 15:11:23,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-25 15:11:23,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:11:23,676 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-02-25 15:11:23,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:23,848 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-02-25 15:11:23,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-25 15:11:23,849 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-02-25 15:11:23,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:23,849 INFO L225 Difference]: With dead ends: 133 [2019-02-25 15:11:23,849 INFO L226 Difference]: Without dead ends: 89 [2019-02-25 15:11:23,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:11:23,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-25 15:11:23,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-02-25 15:11:23,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-25 15:11:23,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-02-25 15:11:23,853 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-02-25 15:11:23,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:23,853 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-02-25 15:11:23,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-25 15:11:23,854 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-02-25 15:11:23,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-25 15:11:23,854 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:23,854 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-02-25 15:11:23,855 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:23,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:23,855 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2019-02-25 15:11:23,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:23,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:23,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:23,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:23,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:25,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-25 15:11:25,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:25,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:25,630 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:25,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:25,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:25,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:25,638 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:25,638 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:25,699 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:25,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:25,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 44 conjunts are in the unsatisfiable core [2019-02-25 15:11:25,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-25 15:11:25,713 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:28,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-25 15:11:28,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:28,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-02-25 15:11:28,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:28,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-25 15:11:28,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-25 15:11:28,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-25 15:11:28,109 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-02-25 15:11:28,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:28,286 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-02-25 15:11:28,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-25 15:11:28,286 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-02-25 15:11:28,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:28,287 INFO L225 Difference]: With dead ends: 136 [2019-02-25 15:11:28,287 INFO L226 Difference]: Without dead ends: 91 [2019-02-25 15:11:28,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-25 15:11:28,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-25 15:11:28,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-02-25 15:11:28,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-25 15:11:28,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-02-25 15:11:28,290 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-02-25 15:11:28,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:28,290 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-02-25 15:11:28,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-25 15:11:28,291 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-02-25 15:11:28,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-25 15:11:28,291 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:28,291 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-02-25 15:11:28,291 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:28,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:28,292 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2019-02-25 15:11:28,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:28,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:28,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:28,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:28,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:29,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-25 15:11:29,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:29,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:29,171 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:29,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:29,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:29,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:29,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:29,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:29,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 45 conjunts are in the unsatisfiable core [2019-02-25 15:11:29,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-25 15:11:29,261 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:31,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-25 15:11:31,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:31,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-02-25 15:11:31,327 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:31,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-25 15:11:31,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-25 15:11:31,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-25 15:11:31,329 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-02-25 15:11:31,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:31,577 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2019-02-25 15:11:31,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-25 15:11:31,577 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-02-25 15:11:31,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:31,578 INFO L225 Difference]: With dead ends: 139 [2019-02-25 15:11:31,578 INFO L226 Difference]: Without dead ends: 93 [2019-02-25 15:11:31,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-25 15:11:31,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-25 15:11:31,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-02-25 15:11:31,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-25 15:11:31,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-02-25 15:11:31,581 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-02-25 15:11:31,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:31,582 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-02-25 15:11:31,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-25 15:11:31,582 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-02-25 15:11:31,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-25 15:11:31,582 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:31,582 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-02-25 15:11:31,582 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:31,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:31,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2019-02-25 15:11:31,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:31,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:31,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:31,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:31,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:32,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-25 15:11:32,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:32,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:32,675 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:32,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:32,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:32,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:32,684 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:32,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:33,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-02-25 15:11:33,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:33,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 46 conjunts are in the unsatisfiable core [2019-02-25 15:11:33,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:33,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-25 15:11:33,068 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:35,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-25 15:11:35,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:35,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-02-25 15:11:35,267 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:35,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-25 15:11:35,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-25 15:11:35,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-25 15:11:35,269 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-02-25 15:11:36,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:36,489 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-02-25 15:11:36,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-25 15:11:36,489 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-02-25 15:11:36,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:36,490 INFO L225 Difference]: With dead ends: 142 [2019-02-25 15:11:36,490 INFO L226 Difference]: Without dead ends: 95 [2019-02-25 15:11:36,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-25 15:11:36,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-25 15:11:36,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-02-25 15:11:36,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-25 15:11:36,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-02-25 15:11:36,495 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-02-25 15:11:36,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:36,495 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-02-25 15:11:36,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-25 15:11:36,495 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-02-25 15:11:36,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-02-25 15:11:36,496 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:36,496 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-02-25 15:11:36,496 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:36,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:36,496 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2019-02-25 15:11:36,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:36,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:36,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:36,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:36,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-25 15:11:37,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:37,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:37,728 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:37,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:37,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:37,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:37,749 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:37,749 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:37,821 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:37,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:37,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 47 conjunts are in the unsatisfiable core [2019-02-25 15:11:37,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:37,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-25 15:11:37,841 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:41,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-25 15:11:41,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:41,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-02-25 15:11:41,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:41,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-25 15:11:41,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-25 15:11:41,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-25 15:11:41,274 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-02-25 15:11:41,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:41,502 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2019-02-25 15:11:41,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-25 15:11:41,508 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-02-25 15:11:41,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:41,509 INFO L225 Difference]: With dead ends: 145 [2019-02-25 15:11:41,509 INFO L226 Difference]: Without dead ends: 97 [2019-02-25 15:11:41,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-25 15:11:41,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-25 15:11:41,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-02-25 15:11:41,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-25 15:11:41,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-02-25 15:11:41,513 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-02-25 15:11:41,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:41,513 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-02-25 15:11:41,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-25 15:11:41,513 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-02-25 15:11:41,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-25 15:11:41,514 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:41,514 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-02-25 15:11:41,514 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:41,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:41,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2019-02-25 15:11:41,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:41,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:41,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:41,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:41,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:43,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-25 15:11:43,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:43,057 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:43,057 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:43,057 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:43,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:43,057 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:43,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:43,066 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:43,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 48 conjunts are in the unsatisfiable core [2019-02-25 15:11:43,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:43,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-25 15:11:43,145 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:45,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-25 15:11:45,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:45,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-02-25 15:11:45,511 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:45,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-25 15:11:45,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-25 15:11:45,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-25 15:11:45,512 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-02-25 15:11:45,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:45,688 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2019-02-25 15:11:45,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-25 15:11:45,688 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-02-25 15:11:45,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:45,689 INFO L225 Difference]: With dead ends: 148 [2019-02-25 15:11:45,689 INFO L226 Difference]: Without dead ends: 99 [2019-02-25 15:11:45,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-25 15:11:45,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-25 15:11:45,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-02-25 15:11:45,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-02-25 15:11:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-02-25 15:11:45,693 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-02-25 15:11:45,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:45,693 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-02-25 15:11:45,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-25 15:11:45,694 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-02-25 15:11:45,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-02-25 15:11:45,694 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:45,694 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-02-25 15:11:45,694 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:45,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:45,695 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2019-02-25 15:11:45,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:45,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:45,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:45,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:45,696 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:46,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-25 15:11:46,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:46,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:46,884 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:46,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:46,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:46,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:46,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:46,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:47,388 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-25 15:11:47,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:47,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 49 conjunts are in the unsatisfiable core [2019-02-25 15:11:47,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-25 15:11:47,409 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:49,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-25 15:11:49,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:49,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-02-25 15:11:49,969 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:49,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-25 15:11:49,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-25 15:11:49,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-25 15:11:49,971 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-02-25 15:11:50,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:50,157 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2019-02-25 15:11:50,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-25 15:11:50,157 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-02-25 15:11:50,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:50,158 INFO L225 Difference]: With dead ends: 151 [2019-02-25 15:11:50,158 INFO L226 Difference]: Without dead ends: 101 [2019-02-25 15:11:50,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-25 15:11:50,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-25 15:11:50,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-02-25 15:11:50,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-25 15:11:50,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-02-25 15:11:50,161 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-02-25 15:11:50,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:50,161 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-02-25 15:11:50,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-25 15:11:50,162 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-02-25 15:11:50,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-25 15:11:50,162 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:50,162 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-02-25 15:11:50,163 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:50,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:50,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2019-02-25 15:11:50,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:50,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:50,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:50,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:50,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:51,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-25 15:11:51,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:51,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:51,180 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:51,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:51,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:51,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:51,189 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:51,189 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:51,260 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:51,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:51,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 50 conjunts are in the unsatisfiable core [2019-02-25 15:11:51,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:51,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-25 15:11:51,274 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:54,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-25 15:11:54,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:54,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-02-25 15:11:54,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:54,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-25 15:11:54,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-25 15:11:54,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-25 15:11:54,086 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-02-25 15:11:54,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:54,349 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-02-25 15:11:54,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-25 15:11:54,350 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-02-25 15:11:54,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:54,350 INFO L225 Difference]: With dead ends: 154 [2019-02-25 15:11:54,350 INFO L226 Difference]: Without dead ends: 103 [2019-02-25 15:11:54,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-25 15:11:54,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-25 15:11:54,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-02-25 15:11:54,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-25 15:11:54,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-02-25 15:11:54,354 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-02-25 15:11:54,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:54,355 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-02-25 15:11:54,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-25 15:11:54,355 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-02-25 15:11:54,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-02-25 15:11:54,355 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:54,355 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-02-25 15:11:54,356 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:54,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:54,356 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2019-02-25 15:11:54,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:54,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:54,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:54,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:54,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:55,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-25 15:11:55,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:55,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:55,355 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:55,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:55,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:55,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:55,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:55,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:55,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 51 conjunts are in the unsatisfiable core [2019-02-25 15:11:55,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-25 15:11:55,459 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:58,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-25 15:11:58,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:58,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-02-25 15:11:58,410 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:58,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-25 15:11:58,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-25 15:11:58,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-25 15:11:58,411 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-02-25 15:11:58,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:58,654 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2019-02-25 15:11:58,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-25 15:11:58,655 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-02-25 15:11:58,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:58,656 INFO L225 Difference]: With dead ends: 157 [2019-02-25 15:11:58,656 INFO L226 Difference]: Without dead ends: 105 [2019-02-25 15:11:58,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-25 15:11:58,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-25 15:11:58,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-02-25 15:11:58,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-25 15:11:58,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-02-25 15:11:58,659 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-02-25 15:11:58,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:58,659 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-02-25 15:11:58,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-25 15:11:58,660 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-02-25 15:11:58,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-25 15:11:58,660 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:58,660 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-02-25 15:11:58,661 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:58,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:58,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2019-02-25 15:11:58,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:58,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:58,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:58,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:58,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:59,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-25 15:11:59,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:59,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:59,652 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:59,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:59,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:59,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:59,663 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:59,663 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:12:00,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-02-25 15:12:00,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:00,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 52 conjunts are in the unsatisfiable core [2019-02-25 15:12:00,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:00,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-25 15:12:00,845 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:04,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-25 15:12:04,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:04,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-02-25 15:12:04,170 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:04,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-25 15:12:04,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-25 15:12:04,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-25 15:12:04,171 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-02-25 15:12:04,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:04,942 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-02-25 15:12:04,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-25 15:12:04,942 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-02-25 15:12:04,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:04,943 INFO L225 Difference]: With dead ends: 160 [2019-02-25 15:12:04,943 INFO L226 Difference]: Without dead ends: 107 [2019-02-25 15:12:04,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-25 15:12:04,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-25 15:12:04,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-02-25 15:12:04,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-25 15:12:04,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-02-25 15:12:04,948 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-02-25 15:12:04,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:04,949 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-02-25 15:12:04,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-25 15:12:04,949 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-02-25 15:12:04,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-02-25 15:12:04,949 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:04,949 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-02-25 15:12:04,950 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:04,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:04,950 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2019-02-25 15:12:04,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:04,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:04,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:04,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:04,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:06,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-25 15:12:06,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:06,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:06,121 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:06,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:06,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:06,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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:06,129 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:12:06,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:12:06,204 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:12:06,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:06,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 53 conjunts are in the unsatisfiable core [2019-02-25 15:12:06,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:06,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-25 15:12:06,221 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:09,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-25 15:12:09,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:09,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-02-25 15:12:09,444 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:09,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-25 15:12:09,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-25 15:12:09,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-25 15:12:09,446 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-02-25 15:12:09,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:09,686 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2019-02-25 15:12:09,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-25 15:12:09,687 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-02-25 15:12:09,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:09,687 INFO L225 Difference]: With dead ends: 163 [2019-02-25 15:12:09,688 INFO L226 Difference]: Without dead ends: 109 [2019-02-25 15:12:09,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-25 15:12:09,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-25 15:12:09,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-02-25 15:12:09,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-25 15:12:09,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-02-25 15:12:09,691 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-02-25 15:12:09,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:09,691 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-02-25 15:12:09,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-25 15:12:09,691 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-02-25 15:12:09,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-25 15:12:09,691 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:09,692 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-02-25 15:12:09,692 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:09,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:09,692 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2019-02-25 15:12:09,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:09,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:09,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:09,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:09,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:11,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-25 15:12:11,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:11,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:11,595 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:11,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:11,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:11,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:11,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:11,604 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:12:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:11,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 54 conjunts are in the unsatisfiable core [2019-02-25 15:12:11,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:11,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-25 15:12:11,701 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:14,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-25 15:12:14,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:14,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-02-25 15:12:14,987 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:14,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-25 15:12:14,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-25 15:12:14,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-25 15:12:14,988 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-02-25 15:12:15,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:15,232 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2019-02-25 15:12:15,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-25 15:12:15,233 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-02-25 15:12:15,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:15,234 INFO L225 Difference]: With dead ends: 166 [2019-02-25 15:12:15,234 INFO L226 Difference]: Without dead ends: 111 [2019-02-25 15:12:15,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-25 15:12:15,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-25 15:12:15,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-02-25 15:12:15,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-25 15:12:15,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-02-25 15:12:15,237 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-02-25 15:12:15,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:15,237 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-02-25 15:12:15,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-25 15:12:15,237 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-02-25 15:12:15,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-02-25 15:12:15,238 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:15,238 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-02-25 15:12:15,238 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:15,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:15,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2019-02-25 15:12:15,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:15,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:15,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:15,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:15,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-02-25 15:12:16,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:16,510 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:16,510 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:16,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:16,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:16,510 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:16,520 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:12:16,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:12:17,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-02-25 15:12:17,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:17,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 55 conjunts are in the unsatisfiable core [2019-02-25 15:12:17,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:17,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-02-25 15:12:17,694 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:20,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-02-25 15:12:20,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:20,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-02-25 15:12:20,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:20,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-25 15:12:20,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-25 15:12:20,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-25 15:12:20,949 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2019-02-25 15:12:21,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:21,238 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2019-02-25 15:12:21,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-25 15:12:21,238 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2019-02-25 15:12:21,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:21,239 INFO L225 Difference]: With dead ends: 169 [2019-02-25 15:12:21,239 INFO L226 Difference]: Without dead ends: 113 [2019-02-25 15:12:21,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-25 15:12:21,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-25 15:12:21,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-02-25 15:12:21,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-25 15:12:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-02-25 15:12:21,243 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2019-02-25 15:12:21,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:21,243 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-02-25 15:12:21,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-25 15:12:21,243 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-02-25 15:12:21,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-02-25 15:12:21,244 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:21,244 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2019-02-25 15:12:21,244 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:21,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:21,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 54 times [2019-02-25 15:12:21,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:21,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:21,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:21,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:21,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:22,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-02-25 15:12:22,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:22,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:22,827 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:22,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:22,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:22,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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:22,838 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:12:22,838 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:12:22,911 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:12:22,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:22,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 56 conjunts are in the unsatisfiable core [2019-02-25 15:12:22,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:22,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-02-25 15:12:22,927 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:26,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-02-25 15:12:26,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:26,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-02-25 15:12:26,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:26,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-02-25 15:12:26,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-02-25 15:12:26,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-25 15:12:26,243 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2019-02-25 15:12:26,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:26,482 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2019-02-25 15:12:26,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-25 15:12:26,483 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2019-02-25 15:12:26,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:26,484 INFO L225 Difference]: With dead ends: 172 [2019-02-25 15:12:26,484 INFO L226 Difference]: Without dead ends: 115 [2019-02-25 15:12:26,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-25 15:12:26,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-25 15:12:26,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-02-25 15:12:26,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-02-25 15:12:26,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-02-25 15:12:26,488 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2019-02-25 15:12:26,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:26,489 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-02-25 15:12:26,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-02-25 15:12:26,489 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-02-25 15:12:26,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-02-25 15:12:26,489 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:26,489 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1] [2019-02-25 15:12:26,490 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:26,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:26,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1244388821, now seen corresponding path program 55 times [2019-02-25 15:12:26,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:26,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:26,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:26,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:26,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:27,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-02-25 15:12:27,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:27,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:27,886 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:27,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:27,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:27,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:27,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:27,896 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:12:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:27,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 57 conjunts are in the unsatisfiable core [2019-02-25 15:12:27,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:28,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-02-25 15:12:28,003 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:31,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-02-25 15:12:31,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:31,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-02-25 15:12:31,342 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:31,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-25 15:12:31,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-25 15:12:31,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-25 15:12:31,343 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2019-02-25 15:12:31,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:31,776 INFO L93 Difference]: Finished difference Result 175 states and 178 transitions. [2019-02-25 15:12:31,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-25 15:12:31,776 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2019-02-25 15:12:31,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:31,777 INFO L225 Difference]: With dead ends: 175 [2019-02-25 15:12:31,777 INFO L226 Difference]: Without dead ends: 117 [2019-02-25 15:12:31,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-25 15:12:31,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-02-25 15:12:31,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-02-25 15:12:31,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-02-25 15:12:31,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-02-25 15:12:31,781 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2019-02-25 15:12:31,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:31,782 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-02-25 15:12:31,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-25 15:12:31,782 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-02-25 15:12:31,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-02-25 15:12:31,783 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:31,783 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1] [2019-02-25 15:12:31,783 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:31,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:31,783 INFO L82 PathProgramCache]: Analyzing trace with hash -464518326, now seen corresponding path program 56 times [2019-02-25 15:12:31,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:31,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:31,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:31,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:31,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:33,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-02-25 15:12:33,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:33,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:33,008 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:33,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:33,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:33,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:33,017 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:12:33,017 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:12:33,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-02-25 15:12:33,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:33,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 58 conjunts are in the unsatisfiable core [2019-02-25 15:12:33,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:33,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-02-25 15:12:33,855 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-02-25 15:12:37,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:37,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-02-25 15:12:37,382 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:37,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-25 15:12:37,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-25 15:12:37,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-25 15:12:37,383 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2019-02-25 15:12:37,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:37,708 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2019-02-25 15:12:37,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-25 15:12:37,708 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2019-02-25 15:12:37,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:37,709 INFO L225 Difference]: With dead ends: 178 [2019-02-25 15:12:37,709 INFO L226 Difference]: Without dead ends: 119 [2019-02-25 15:12:37,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-25 15:12:37,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-25 15:12:37,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-02-25 15:12:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-02-25 15:12:37,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-02-25 15:12:37,712 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2019-02-25 15:12:37,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:37,712 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-02-25 15:12:37,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-25 15:12:37,712 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-02-25 15:12:37,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-02-25 15:12:37,714 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:37,714 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1] [2019-02-25 15:12:37,714 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:37,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:37,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1327912501, now seen corresponding path program 57 times [2019-02-25 15:12:37,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:37,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:37,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:37,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:37,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:39,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-02-25 15:12:39,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:39,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:39,408 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:39,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:39,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:39,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:39,416 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:12:39,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:12:39,494 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:12:39,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:39,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 59 conjunts are in the unsatisfiable core [2019-02-25 15:12:39,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:39,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-02-25 15:12:39,519 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:42,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-02-25 15:12:42,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:42,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-02-25 15:12:42,993 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:42,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-25 15:12:42,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-25 15:12:42,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-25 15:12:42,995 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2019-02-25 15:12:43,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:43,290 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2019-02-25 15:12:43,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-25 15:12:43,290 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2019-02-25 15:12:43,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:43,291 INFO L225 Difference]: With dead ends: 181 [2019-02-25 15:12:43,291 INFO L226 Difference]: Without dead ends: 121 [2019-02-25 15:12:43,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-25 15:12:43,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-02-25 15:12:43,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-02-25 15:12:43,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-25 15:12:43,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-02-25 15:12:43,296 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2019-02-25 15:12:43,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:43,296 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-02-25 15:12:43,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-25 15:12:43,296 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-02-25 15:12:43,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-02-25 15:12:43,297 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:43,297 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1] [2019-02-25 15:12:43,297 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:43,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:43,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1186678166, now seen corresponding path program 58 times [2019-02-25 15:12:43,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:43,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:43,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:43,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:43,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:44,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-02-25 15:12:44,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:44,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:44,986 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:44,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:44,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:44,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:44,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:44,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:12:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:45,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 60 conjunts are in the unsatisfiable core [2019-02-25 15:12:45,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:45,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-02-25 15:12:45,100 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:48,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-02-25 15:12:48,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:48,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-02-25 15:12:48,979 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:48,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-02-25 15:12:48,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-02-25 15:12:48,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-25 15:12:48,980 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2019-02-25 15:12:49,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:49,352 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2019-02-25 15:12:49,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-25 15:12:49,352 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2019-02-25 15:12:49,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:49,353 INFO L225 Difference]: With dead ends: 184 [2019-02-25 15:12:49,353 INFO L226 Difference]: Without dead ends: 123 [2019-02-25 15:12:49,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-25 15:12:49,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-02-25 15:12:49,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-02-25 15:12:49,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-02-25 15:12:49,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-02-25 15:12:49,357 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2019-02-25 15:12:49,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:49,357 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-02-25 15:12:49,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-02-25 15:12:49,358 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-02-25 15:12:49,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-02-25 15:12:49,358 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:49,358 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1] [2019-02-25 15:12:49,359 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:49,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:49,359 INFO L82 PathProgramCache]: Analyzing trace with hash 737003157, now seen corresponding path program 59 times [2019-02-25 15:12:49,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:49,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:49,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:49,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:49,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:51,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-02-25 15:12:51,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:51,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:51,013 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:51,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:51,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:51,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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:51,024 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:12:51,024 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:12:52,046 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-02-25 15:12:52,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:52,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 61 conjunts are in the unsatisfiable core [2019-02-25 15:12:52,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:52,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-02-25 15:12:52,067 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:56,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-02-25 15:12:56,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:56,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-02-25 15:12:56,239 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:56,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-25 15:12:56,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-25 15:12:56,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-25 15:12:56,241 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2019-02-25 15:12:56,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:56,590 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2019-02-25 15:12:56,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-25 15:12:56,590 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2019-02-25 15:12:56,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:56,591 INFO L225 Difference]: With dead ends: 187 [2019-02-25 15:12:56,591 INFO L226 Difference]: Without dead ends: 125 [2019-02-25 15:12:56,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-25 15:12:56,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-02-25 15:12:56,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-02-25 15:12:56,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-02-25 15:12:56,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2019-02-25 15:12:56,596 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2019-02-25 15:12:56,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:56,596 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2019-02-25 15:12:56,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-25 15:12:56,596 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2019-02-25 15:12:56,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-02-25 15:12:56,597 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:56,597 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1] [2019-02-25 15:12:56,597 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:56,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:56,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1414379914, now seen corresponding path program 60 times [2019-02-25 15:12:56,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:56,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:56,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:56,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:56,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:58,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-02-25 15:12:58,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:58,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:58,102 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:58,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:58,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:58,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:58,110 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:12:58,111 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:12:58,192 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:12:58,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:58,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 62 conjunts are in the unsatisfiable core [2019-02-25 15:12:58,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-02-25 15:12:58,213 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-02-25 15:13:02,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:02,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-02-25 15:13:02,299 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:02,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-02-25 15:13:02,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-02-25 15:13:02,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-25 15:13:02,301 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2019-02-25 15:13:02,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:02,585 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2019-02-25 15:13:02,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-25 15:13:02,585 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2019-02-25 15:13:02,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:02,586 INFO L225 Difference]: With dead ends: 190 [2019-02-25 15:13:02,586 INFO L226 Difference]: Without dead ends: 127 [2019-02-25 15:13:02,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-25 15:13:02,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-02-25 15:13:02,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-02-25 15:13:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-02-25 15:13:02,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-02-25 15:13:02,590 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2019-02-25 15:13:02,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:02,590 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-02-25 15:13:02,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-02-25 15:13:02,590 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-02-25 15:13:02,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-02-25 15:13:02,591 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:02,591 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1] [2019-02-25 15:13:02,591 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:02,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:02,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1579405579, now seen corresponding path program 61 times [2019-02-25 15:13:02,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:02,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:02,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:13:02,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:02,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-02-25 15:13:04,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:04,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:04,390 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:04,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:04,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:04,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:13:04,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:13:04,399 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:13:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:04,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 63 conjunts are in the unsatisfiable core [2019-02-25 15:13:04,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:04,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-02-25 15:13:04,501 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:08,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-02-25 15:13:08,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:08,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-02-25 15:13:08,472 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:08,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-25 15:13:08,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-25 15:13:08,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-25 15:13:08,474 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2019-02-25 15:13:08,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:08,844 INFO L93 Difference]: Finished difference Result 193 states and 196 transitions. [2019-02-25 15:13:08,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-25 15:13:08,844 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2019-02-25 15:13:08,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:08,845 INFO L225 Difference]: With dead ends: 193 [2019-02-25 15:13:08,845 INFO L226 Difference]: Without dead ends: 129 [2019-02-25 15:13:08,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-25 15:13:08,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-02-25 15:13:08,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-02-25 15:13:08,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-02-25 15:13:08,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-02-25 15:13:08,849 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2019-02-25 15:13:08,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:08,849 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-02-25 15:13:08,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-25 15:13:08,849 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-02-25 15:13:08,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-02-25 15:13:08,850 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:08,850 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1] [2019-02-25 15:13:08,850 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:08,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:08,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1271856982, now seen corresponding path program 62 times [2019-02-25 15:13:08,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:08,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:08,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:13:08,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:08,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-02-25 15:13:10,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:10,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:10,560 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:10,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:10,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:10,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:13:10,570 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:13:10,570 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:13:11,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-02-25 15:13:11,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:13:11,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 64 conjunts are in the unsatisfiable core [2019-02-25 15:13:11,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:11,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-02-25 15:13:11,585 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:16,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-02-25 15:13:16,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:16,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-02-25 15:13:16,052 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:16,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-25 15:13:16,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-25 15:13:16,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-25 15:13:16,054 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2019-02-25 15:13:16,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:16,459 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2019-02-25 15:13:16,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-25 15:13:16,459 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2019-02-25 15:13:16,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:16,460 INFO L225 Difference]: With dead ends: 196 [2019-02-25 15:13:16,460 INFO L226 Difference]: Without dead ends: 131 [2019-02-25 15:13:16,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 192 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-25 15:13:16,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-02-25 15:13:16,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-02-25 15:13:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-02-25 15:13:16,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2019-02-25 15:13:16,464 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2019-02-25 15:13:16,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:16,465 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2019-02-25 15:13:16,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-25 15:13:16,465 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2019-02-25 15:13:16,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-02-25 15:13:16,465 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:16,466 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1] [2019-02-25 15:13:16,466 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:16,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:16,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1741393749, now seen corresponding path program 63 times [2019-02-25 15:13:16,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:16,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:16,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:13:16,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:16,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:18,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-02-25 15:13:18,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:18,051 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:18,051 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:18,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:18,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:18,051 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:13:18,061 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:13:18,061 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:13:18,149 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:13:18,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:13:18,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 65 conjunts are in the unsatisfiable core [2019-02-25 15:13:18,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:18,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-02-25 15:13:18,169 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:22,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-02-25 15:13:22,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:22,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-02-25 15:13:22,675 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:22,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-25 15:13:22,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-25 15:13:22,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-25 15:13:22,676 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2019-02-25 15:13:23,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:23,091 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2019-02-25 15:13:23,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-25 15:13:23,092 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2019-02-25 15:13:23,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:23,092 INFO L225 Difference]: With dead ends: 199 [2019-02-25 15:13:23,092 INFO L226 Difference]: Without dead ends: 133 [2019-02-25 15:13:23,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-25 15:13:23,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-02-25 15:13:23,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-02-25 15:13:23,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-25 15:13:23,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-02-25 15:13:23,096 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2019-02-25 15:13:23,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:23,096 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-02-25 15:13:23,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-25 15:13:23,096 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-02-25 15:13:23,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-02-25 15:13:23,097 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:23,097 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1] [2019-02-25 15:13:23,097 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:23,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:23,098 INFO L82 PathProgramCache]: Analyzing trace with hash 573870026, now seen corresponding path program 64 times [2019-02-25 15:13:23,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:23,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:23,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:13:23,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:23,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:24,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-02-25 15:13:24,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:24,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:24,965 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:24,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:24,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:24,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:13:24,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:13:24,974 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:13:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:25,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 66 conjunts are in the unsatisfiable core [2019-02-25 15:13:25,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:25,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-02-25 15:13:25,087 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:30,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-02-25 15:13:30,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:30,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-02-25 15:13:30,292 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:30,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-02-25 15:13:30,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-02-25 15:13:30,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-25 15:13:30,293 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2019-02-25 15:13:30,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:30,755 INFO L93 Difference]: Finished difference Result 202 states and 205 transitions. [2019-02-25 15:13:30,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-25 15:13:30,756 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2019-02-25 15:13:30,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:30,757 INFO L225 Difference]: With dead ends: 202 [2019-02-25 15:13:30,757 INFO L226 Difference]: Without dead ends: 135 [2019-02-25 15:13:30,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-25 15:13:30,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-25 15:13:30,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-02-25 15:13:30,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-02-25 15:13:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-02-25 15:13:30,761 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2019-02-25 15:13:30,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:30,761 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-02-25 15:13:30,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-02-25 15:13:30,762 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-02-25 15:13:30,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-02-25 15:13:30,762 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:30,762 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1] [2019-02-25 15:13:30,763 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:30,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:30,763 INFO L82 PathProgramCache]: Analyzing trace with hash -904534091, now seen corresponding path program 65 times [2019-02-25 15:13:30,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:30,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:30,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:13:30,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:30,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:33,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-02-25 15:13:33,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:33,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:33,054 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:33,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:33,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:33,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:13:33,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:13:33,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:13:36,065 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-02-25 15:13:36,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:13:36,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 67 conjunts are in the unsatisfiable core [2019-02-25 15:13:36,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:36,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-02-25 15:13:36,103 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:40,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-02-25 15:13:40,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:40,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-02-25 15:13:40,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:40,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-25 15:13:40,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-25 15:13:40,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-25 15:13:40,985 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2019-02-25 15:13:41,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:41,369 INFO L93 Difference]: Finished difference Result 205 states and 208 transitions. [2019-02-25 15:13:41,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-25 15:13:41,369 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2019-02-25 15:13:41,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:41,370 INFO L225 Difference]: With dead ends: 205 [2019-02-25 15:13:41,370 INFO L226 Difference]: Without dead ends: 137 [2019-02-25 15:13:41,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-25 15:13:41,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-02-25 15:13:41,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-02-25 15:13:41,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-02-25 15:13:41,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-02-25 15:13:41,373 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2019-02-25 15:13:41,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:41,373 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-02-25 15:13:41,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-25 15:13:41,374 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-02-25 15:13:41,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-02-25 15:13:41,374 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:41,374 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1] [2019-02-25 15:13:41,374 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:41,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:41,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1843501334, now seen corresponding path program 66 times [2019-02-25 15:13:41,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:41,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:41,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:13:41,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:41,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-02-25 15:13:43,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:43,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:43,014 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:43,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:43,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:43,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:13:43,024 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:13:43,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:13:43,119 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:13:43,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:13:43,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 68 conjunts are in the unsatisfiable core [2019-02-25 15:13:43,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:43,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-02-25 15:13:43,140 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:47,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-02-25 15:13:47,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:47,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-02-25 15:13:47,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:47,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-02-25 15:13:47,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-02-25 15:13:47,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-25 15:13:47,998 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2019-02-25 15:13:48,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:48,492 INFO L93 Difference]: Finished difference Result 208 states and 211 transitions. [2019-02-25 15:13:48,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-25 15:13:48,492 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2019-02-25 15:13:48,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:48,493 INFO L225 Difference]: With dead ends: 208 [2019-02-25 15:13:48,493 INFO L226 Difference]: Without dead ends: 139 [2019-02-25 15:13:48,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-25 15:13:48,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-02-25 15:13:48,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-02-25 15:13:48,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-02-25 15:13:48,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-02-25 15:13:48,497 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2019-02-25 15:13:48,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:48,497 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-02-25 15:13:48,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-02-25 15:13:48,497 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-02-25 15:13:48,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-02-25 15:13:48,498 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:48,498 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1] [2019-02-25 15:13:48,498 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:48,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:48,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1251293205, now seen corresponding path program 67 times [2019-02-25 15:13:48,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:48,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:48,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:13:48,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:48,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:50,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-02-25 15:13:50,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:50,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:50,472 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:50,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:50,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:50,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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:13:50,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:13:50,481 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:13:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:50,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 69 conjunts are in the unsatisfiable core [2019-02-25 15:13:50,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:50,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-02-25 15:13:50,592 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:55,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-02-25 15:13:55,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:55,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-02-25 15:13:55,644 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:55,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-25 15:13:55,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-25 15:13:55,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-25 15:13:55,645 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2019-02-25 15:13:56,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:56,154 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2019-02-25 15:13:56,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-25 15:13:56,154 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2019-02-25 15:13:56,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:56,155 INFO L225 Difference]: With dead ends: 211 [2019-02-25 15:13:56,155 INFO L226 Difference]: Without dead ends: 141 [2019-02-25 15:13:56,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-25 15:13:56,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-02-25 15:13:56,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-02-25 15:13:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-02-25 15:13:56,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-02-25 15:13:56,158 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2019-02-25 15:13:56,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:56,158 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-02-25 15:13:56,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-25 15:13:56,159 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-02-25 15:13:56,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-02-25 15:13:56,159 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:56,159 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1] [2019-02-25 15:13:56,159 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:56,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:56,160 INFO L82 PathProgramCache]: Analyzing trace with hash 36996618, now seen corresponding path program 68 times [2019-02-25 15:13:56,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:56,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:56,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:13:56,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:56,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:57,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-02-25 15:13:57,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:57,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:57,933 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:57,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:57,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:57,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:13:57,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:13:57,942 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:14:01,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-02-25 15:14:01,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:14:01,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 70 conjunts are in the unsatisfiable core [2019-02-25 15:14:01,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-02-25 15:14:01,225 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:06,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-02-25 15:14:06,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:06,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-02-25 15:14:06,419 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:06,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-25 15:14:06,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-25 15:14:06,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-25 15:14:06,420 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2019-02-25 15:14:06,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:06,943 INFO L93 Difference]: Finished difference Result 214 states and 217 transitions. [2019-02-25 15:14:06,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-25 15:14:06,943 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2019-02-25 15:14:06,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:06,944 INFO L225 Difference]: With dead ends: 214 [2019-02-25 15:14:06,944 INFO L226 Difference]: Without dead ends: 143 [2019-02-25 15:14:06,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-25 15:14:06,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-02-25 15:14:06,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-02-25 15:14:06,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-02-25 15:14:06,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-02-25 15:14:06,947 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2019-02-25 15:14:06,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:06,947 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-02-25 15:14:06,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-25 15:14:06,947 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-02-25 15:14:06,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-02-25 15:14:06,948 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:06,948 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1] [2019-02-25 15:14:06,948 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:06,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:06,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1084457077, now seen corresponding path program 69 times [2019-02-25 15:14:06,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:06,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:06,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:14:06,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:06,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:08,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-02-25 15:14:08,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:08,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:08,877 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:08,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:08,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:08,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:08,886 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:14:08,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:14:09,001 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:14:09,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:14:09,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 71 conjunts are in the unsatisfiable core [2019-02-25 15:14:09,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:09,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-02-25 15:14:09,022 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:14,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-02-25 15:14:14,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:14,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-02-25 15:14:14,449 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:14,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-25 15:14:14,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-25 15:14:14,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-25 15:14:14,451 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2019-02-25 15:14:14,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:14,958 INFO L93 Difference]: Finished difference Result 217 states and 220 transitions. [2019-02-25 15:14:14,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-25 15:14:14,958 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2019-02-25 15:14:14,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:14,959 INFO L225 Difference]: With dead ends: 217 [2019-02-25 15:14:14,959 INFO L226 Difference]: Without dead ends: 145 [2019-02-25 15:14:14,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-25 15:14:14,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-02-25 15:14:14,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-02-25 15:14:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-02-25 15:14:14,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-02-25 15:14:14,962 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2019-02-25 15:14:14,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:14,962 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-02-25 15:14:14,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-25 15:14:14,963 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-02-25 15:14:14,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-02-25 15:14:14,963 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:14,963 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1] [2019-02-25 15:14:14,964 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:14,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:14,964 INFO L82 PathProgramCache]: Analyzing trace with hash -616764118, now seen corresponding path program 70 times [2019-02-25 15:14:14,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:14,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:14,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:14:14,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:14,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:14,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-02-25 15:14:17,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:17,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:17,129 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:17,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:17,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:17,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:17,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:17,137 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:14:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:17,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 72 conjunts are in the unsatisfiable core [2019-02-25 15:14:17,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:17,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-02-25 15:14:17,257 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:22,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-02-25 15:14:22,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:22,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-02-25 15:14:22,670 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:22,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-02-25 15:14:22,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-02-25 15:14:22,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-25 15:14:22,672 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2019-02-25 15:14:23,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:23,102 INFO L93 Difference]: Finished difference Result 220 states and 223 transitions. [2019-02-25 15:14:23,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-25 15:14:23,102 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2019-02-25 15:14:23,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:23,103 INFO L225 Difference]: With dead ends: 220 [2019-02-25 15:14:23,103 INFO L226 Difference]: Without dead ends: 147 [2019-02-25 15:14:23,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-25 15:14:23,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-02-25 15:14:23,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-02-25 15:14:23,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-02-25 15:14:23,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-02-25 15:14:23,108 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2019-02-25 15:14:23,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:23,108 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-02-25 15:14:23,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-02-25 15:14:23,109 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-02-25 15:14:23,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-02-25 15:14:23,109 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:23,109 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1] [2019-02-25 15:14:23,110 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:23,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:23,110 INFO L82 PathProgramCache]: Analyzing trace with hash 2031796437, now seen corresponding path program 71 times [2019-02-25 15:14:23,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:23,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:23,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:23,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:23,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:24,992 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-02-25 15:14:24,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:24,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:24,992 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:24,992 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:24,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:24,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:25,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:14:25,001 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:14:27,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-02-25 15:14:27,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:14:27,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 73 conjunts are in the unsatisfiable core [2019-02-25 15:14:27,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:27,712 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-02-25 15:14:27,712 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:33,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-02-25 15:14:33,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:33,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-02-25 15:14:33,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:33,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-25 15:14:33,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-25 15:14:33,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-25 15:14:33,407 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2019-02-25 15:14:33,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:33,999 INFO L93 Difference]: Finished difference Result 223 states and 226 transitions. [2019-02-25 15:14:33,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-25 15:14:33,999 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2019-02-25 15:14:34,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:34,000 INFO L225 Difference]: With dead ends: 223 [2019-02-25 15:14:34,000 INFO L226 Difference]: Without dead ends: 149 [2019-02-25 15:14:34,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-25 15:14:34,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-02-25 15:14:34,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-02-25 15:14:34,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-02-25 15:14:34,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2019-02-25 15:14:34,004 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2019-02-25 15:14:34,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:34,004 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2019-02-25 15:14:34,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-25 15:14:34,004 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2019-02-25 15:14:34,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-02-25 15:14:34,005 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:34,005 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1] [2019-02-25 15:14:34,006 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:34,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:34,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1350409290, now seen corresponding path program 72 times [2019-02-25 15:14:34,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:34,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:34,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:14:34,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:34,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:36,691 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-02-25 15:14:36,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:36,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:36,692 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:36,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:36,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:36,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:36,699 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:14:36,700 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:14:36,798 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:14:36,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:14:36,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 74 conjunts are in the unsatisfiable core [2019-02-25 15:14:36,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:36,830 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-02-25 15:14:36,830 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:42,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-02-25 15:14:42,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:42,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-02-25 15:14:42,550 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:42,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-25 15:14:42,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-25 15:14:42,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-25 15:14:42,552 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2019-02-25 15:14:43,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:43,110 INFO L93 Difference]: Finished difference Result 226 states and 229 transitions. [2019-02-25 15:14:43,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-25 15:14:43,110 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2019-02-25 15:14:43,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:43,111 INFO L225 Difference]: With dead ends: 226 [2019-02-25 15:14:43,111 INFO L226 Difference]: Without dead ends: 151 [2019-02-25 15:14:43,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-25 15:14:43,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-02-25 15:14:43,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-02-25 15:14:43,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-02-25 15:14:43,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-02-25 15:14:43,115 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2019-02-25 15:14:43,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:43,115 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-02-25 15:14:43,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-25 15:14:43,115 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-02-25 15:14:43,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-02-25 15:14:43,116 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:43,116 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1] [2019-02-25 15:14:43,116 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:43,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:43,117 INFO L82 PathProgramCache]: Analyzing trace with hash -699074251, now seen corresponding path program 73 times [2019-02-25 15:14:43,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:43,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:43,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:14:43,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:43,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:45,316 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-02-25 15:14:45,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:45,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:45,317 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:45,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:45,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:45,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:45,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:45,325 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:14:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:45,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 75 conjunts are in the unsatisfiable core [2019-02-25 15:14:45,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:45,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-02-25 15:14:45,450 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:51,314 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-02-25 15:14:51,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:51,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-02-25 15:14:51,333 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:51,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-25 15:14:51,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-25 15:14:51,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-25 15:14:51,335 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2019-02-25 15:14:51,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:51,923 INFO L93 Difference]: Finished difference Result 229 states and 232 transitions. [2019-02-25 15:14:51,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-25 15:14:51,923 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2019-02-25 15:14:51,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:51,924 INFO L225 Difference]: With dead ends: 229 [2019-02-25 15:14:51,924 INFO L226 Difference]: Without dead ends: 153 [2019-02-25 15:14:51,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-25 15:14:51,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-02-25 15:14:51,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-02-25 15:14:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-02-25 15:14:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-02-25 15:14:51,928 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2019-02-25 15:14:51,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:51,928 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-02-25 15:14:51,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-25 15:14:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-02-25 15:14:51,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-02-25 15:14:51,928 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:51,929 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1] [2019-02-25 15:14:51,929 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:51,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:51,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1078160534, now seen corresponding path program 74 times [2019-02-25 15:14:51,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:51,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:51,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:51,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:51,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-02-25 15:14:54,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:54,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:54,022 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:54,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:54,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:54,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:54,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:14:54,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:14:56,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-02-25 15:14:56,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:14:56,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 76 conjunts are in the unsatisfiable core [2019-02-25 15:14:56,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:56,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-02-25 15:14:56,245 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:15:02,499 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-02-25 15:15:02,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:15:02,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-02-25 15:15:02,522 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:15:02,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-25 15:15:02,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-25 15:15:02,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-25 15:15:02,524 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2019-02-25 15:15:03,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:15:03,113 INFO L93 Difference]: Finished difference Result 232 states and 235 transitions. [2019-02-25 15:15:03,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-25 15:15:03,113 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2019-02-25 15:15:03,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:15:03,114 INFO L225 Difference]: With dead ends: 232 [2019-02-25 15:15:03,114 INFO L226 Difference]: Without dead ends: 155 [2019-02-25 15:15:03,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-25 15:15:03,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-02-25 15:15:03,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-02-25 15:15:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-02-25 15:15:03,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2019-02-25 15:15:03,117 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2019-02-25 15:15:03,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:15:03,118 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2019-02-25 15:15:03,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-25 15:15:03,118 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2019-02-25 15:15:03,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-02-25 15:15:03,118 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:15:03,118 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1] [2019-02-25 15:15:03,119 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:15:03,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:15:03,119 INFO L82 PathProgramCache]: Analyzing trace with hash -265541227, now seen corresponding path program 75 times [2019-02-25 15:15:03,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:15:03,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:03,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:15:03,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:03,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:15:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:05,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-02-25 15:15:05,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:05,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:05,288 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:05,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:05,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:05,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:15:05,296 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:15:05,297 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:15:05,403 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:15:05,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:15:05,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 77 conjunts are in the unsatisfiable core [2019-02-25 15:15:05,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:05,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-02-25 15:15:05,428 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:15:11,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-02-25 15:15:11,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:15:11,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-02-25 15:15:11,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:15:11,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-25 15:15:11,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-25 15:15:11,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-25 15:15:11,860 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2019-02-25 15:15:12,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:15:12,577 INFO L93 Difference]: Finished difference Result 235 states and 238 transitions. [2019-02-25 15:15:12,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-25 15:15:12,577 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2019-02-25 15:15:12,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:15:12,578 INFO L225 Difference]: With dead ends: 235 [2019-02-25 15:15:12,578 INFO L226 Difference]: Without dead ends: 157 [2019-02-25 15:15:12,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-25 15:15:12,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-02-25 15:15:12,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-02-25 15:15:12,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-02-25 15:15:12,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-02-25 15:15:12,582 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2019-02-25 15:15:12,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:15:12,582 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-02-25 15:15:12,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-25 15:15:12,582 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-02-25 15:15:12,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-02-25 15:15:12,583 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:15:12,583 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1] [2019-02-25 15:15:12,583 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:15:12,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:15:12,583 INFO L82 PathProgramCache]: Analyzing trace with hash 289395338, now seen corresponding path program 76 times [2019-02-25 15:15:12,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:15:12,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:12,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:15:12,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:12,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:15:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:14,685 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-02-25 15:15:14,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:14,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:14,685 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:14,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:14,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:14,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:15:14,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:15:14,693 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:15:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:14,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 78 conjunts are in the unsatisfiable core [2019-02-25 15:15:14,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:14,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-02-25 15:15:14,820 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:15:21,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-02-25 15:15:21,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:15:21,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-02-25 15:15:21,202 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:15:21,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-02-25 15:15:21,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-02-25 15:15:21,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-25 15:15:21,203 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2019-02-25 15:15:21,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:15:21,800 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2019-02-25 15:15:21,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-25 15:15:21,801 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2019-02-25 15:15:21,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:15:21,801 INFO L225 Difference]: With dead ends: 238 [2019-02-25 15:15:21,801 INFO L226 Difference]: Without dead ends: 159 [2019-02-25 15:15:21,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-25 15:15:21,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-02-25 15:15:21,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-02-25 15:15:21,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-02-25 15:15:21,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-02-25 15:15:21,805 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2019-02-25 15:15:21,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:15:21,805 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-02-25 15:15:21,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-02-25 15:15:21,806 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-02-25 15:15:21,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-02-25 15:15:21,806 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:15:21,806 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1] [2019-02-25 15:15:21,806 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:15:21,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:15:21,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1275440651, now seen corresponding path program 77 times [2019-02-25 15:15:21,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:15:21,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:21,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:15:21,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:21,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:15:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:24,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-02-25 15:15:24,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:24,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:24,263 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:24,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:24,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:24,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:15:24,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:15:24,272 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:15:28,623 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-02-25 15:15:28,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:15:28,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 79 conjunts are in the unsatisfiable core [2019-02-25 15:15:28,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:28,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-02-25 15:15:28,662 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:15:35,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-02-25 15:15:35,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:15:35,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-02-25 15:15:35,167 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:15:35,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-25 15:15:35,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-25 15:15:35,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-25 15:15:35,169 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2019-02-25 15:15:35,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:15:35,897 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2019-02-25 15:15:35,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-25 15:15:35,898 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2019-02-25 15:15:35,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:15:35,898 INFO L225 Difference]: With dead ends: 241 [2019-02-25 15:15:35,898 INFO L226 Difference]: Without dead ends: 161 [2019-02-25 15:15:35,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-25 15:15:35,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-02-25 15:15:35,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-02-25 15:15:35,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-02-25 15:15:35,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2019-02-25 15:15:35,903 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2019-02-25 15:15:35,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:15:35,904 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2019-02-25 15:15:35,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-25 15:15:35,904 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2019-02-25 15:15:35,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-02-25 15:15:35,905 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:15:35,905 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1] [2019-02-25 15:15:35,905 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:15:35,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:15:35,905 INFO L82 PathProgramCache]: Analyzing trace with hash 399333802, now seen corresponding path program 78 times [2019-02-25 15:15:35,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:15:35,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:35,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:15:35,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:35,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:15:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:38,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-02-25 15:15:38,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:38,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:38,482 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:38,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:38,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:38,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:15:38,491 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:15:38,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:15:38,598 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:15:38,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:15:38,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 80 conjunts are in the unsatisfiable core [2019-02-25 15:15:38,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:38,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-02-25 15:15:38,625 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:15:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-02-25 15:15:45,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:15:45,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-02-25 15:15:45,276 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:15:45,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-02-25 15:15:45,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-02-25 15:15:45,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-25 15:15:45,278 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2019-02-25 15:15:46,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:15:46,083 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2019-02-25 15:15:46,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-25 15:15:46,083 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2019-02-25 15:15:46,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:15:46,084 INFO L225 Difference]: With dead ends: 244 [2019-02-25 15:15:46,084 INFO L226 Difference]: Without dead ends: 163 [2019-02-25 15:15:46,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-25 15:15:46,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-02-25 15:15:46,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-02-25 15:15:46,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-02-25 15:15:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2019-02-25 15:15:46,089 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2019-02-25 15:15:46,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:15:46,089 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2019-02-25 15:15:46,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-02-25 15:15:46,089 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2019-02-25 15:15:46,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-02-25 15:15:46,090 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:15:46,090 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1] [2019-02-25 15:15:46,090 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:15:46,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:15:46,090 INFO L82 PathProgramCache]: Analyzing trace with hash 77165141, now seen corresponding path program 79 times [2019-02-25 15:15:46,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:15:46,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:46,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:15:46,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:46,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:15:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:48,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-02-25 15:15:48,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:48,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:48,698 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:48,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:48,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:48,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:15:48,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:15:48,707 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:15:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:48,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 81 conjunts are in the unsatisfiable core [2019-02-25 15:15:48,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:48,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-02-25 15:15:48,843 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:15:55,760 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-02-25 15:15:55,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:15:55,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-02-25 15:15:55,779 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:15:55,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-25 15:15:55,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-25 15:15:55,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-25 15:15:55,781 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2019-02-25 15:15:56,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:15:56,627 INFO L93 Difference]: Finished difference Result 247 states and 250 transitions. [2019-02-25 15:15:56,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-25 15:15:56,627 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2019-02-25 15:15:56,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:15:56,628 INFO L225 Difference]: With dead ends: 247 [2019-02-25 15:15:56,628 INFO L226 Difference]: Without dead ends: 165 [2019-02-25 15:15:56,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-25 15:15:56,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-02-25 15:15:56,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-02-25 15:15:56,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-02-25 15:15:56,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2019-02-25 15:15:56,631 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2019-02-25 15:15:56,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:15:56,632 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2019-02-25 15:15:56,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-25 15:15:56,632 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2019-02-25 15:15:56,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-02-25 15:15:56,632 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:15:56,633 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1] [2019-02-25 15:15:56,633 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:15:56,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:15:56,633 INFO L82 PathProgramCache]: Analyzing trace with hash -257218358, now seen corresponding path program 80 times [2019-02-25 15:15:56,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:15:56,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:56,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:15:56,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:56,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:15:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:59,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-02-25 15:15:59,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:59,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:59,290 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:59,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:59,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:59,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:15:59,299 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:15:59,299 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:16:02,303 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-02-25 15:16:02,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:16:02,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 82 conjunts are in the unsatisfiable core [2019-02-25 15:16:02,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:16:02,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-02-25 15:16:02,333 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:16:09,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-02-25 15:16:09,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:16:09,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-02-25 15:16:09,558 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:16:09,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-25 15:16:09,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-25 15:16:09,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-25 15:16:09,560 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 83 states. [2019-02-25 15:16:10,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:16:10,386 INFO L93 Difference]: Finished difference Result 250 states and 253 transitions. [2019-02-25 15:16:10,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-25 15:16:10,386 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2019-02-25 15:16:10,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:16:10,387 INFO L225 Difference]: With dead ends: 250 [2019-02-25 15:16:10,387 INFO L226 Difference]: Without dead ends: 167 [2019-02-25 15:16:10,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-25 15:16:10,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-02-25 15:16:10,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-02-25 15:16:10,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-02-25 15:16:10,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-02-25 15:16:10,391 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2019-02-25 15:16:10,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:16:10,391 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2019-02-25 15:16:10,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-25 15:16:10,391 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2019-02-25 15:16:10,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-02-25 15:16:10,392 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:16:10,392 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1] [2019-02-25 15:16:10,392 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:16:10,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:16:10,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1516473013, now seen corresponding path program 81 times [2019-02-25 15:16:10,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:16:10,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:10,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:16:10,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:10,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:16:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:12,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-02-25 15:16:12,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:12,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:16:12,936 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:16:12,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:16:12,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:12,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:16:12,945 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:16:12,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:16:13,056 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:16:13,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:16:13,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 83 conjunts are in the unsatisfiable core [2019-02-25 15:16:13,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:16:13,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-02-25 15:16:13,083 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:16:20,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-02-25 15:16:20,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:16:20,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-02-25 15:16:20,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:16:20,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-25 15:16:20,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-25 15:16:20,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-25 15:16:20,667 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2019-02-25 15:16:21,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:16:21,366 INFO L93 Difference]: Finished difference Result 253 states and 256 transitions. [2019-02-25 15:16:21,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-25 15:16:21,366 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2019-02-25 15:16:21,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:16:21,367 INFO L225 Difference]: With dead ends: 253 [2019-02-25 15:16:21,367 INFO L226 Difference]: Without dead ends: 169 [2019-02-25 15:16:21,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-25 15:16:21,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-02-25 15:16:21,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-02-25 15:16:21,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-02-25 15:16:21,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-02-25 15:16:21,370 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2019-02-25 15:16:21,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:16:21,371 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-02-25 15:16:21,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-25 15:16:21,371 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-02-25 15:16:21,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-02-25 15:16:21,371 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:16:21,371 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1] [2019-02-25 15:16:21,372 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:16:21,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:16:21,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1671380970, now seen corresponding path program 82 times [2019-02-25 15:16:21,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:16:21,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:21,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:16:21,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:21,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:16:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:24,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-02-25 15:16:24,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:24,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:16:24,186 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:16:24,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:16:24,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:24,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:16:24,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:16:24,196 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:16:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:24,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 84 conjunts are in the unsatisfiable core [2019-02-25 15:16:24,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:16:24,332 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-02-25 15:16:24,332 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:16:31,656 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-02-25 15:16:31,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:16:31,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-02-25 15:16:31,675 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:16:31,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-02-25 15:16:31,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-02-25 15:16:31,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-25 15:16:31,677 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 85 states. [2019-02-25 15:16:32,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:16:32,561 INFO L93 Difference]: Finished difference Result 256 states and 259 transitions. [2019-02-25 15:16:32,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-25 15:16:32,561 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2019-02-25 15:16:32,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:16:32,562 INFO L225 Difference]: With dead ends: 256 [2019-02-25 15:16:32,562 INFO L226 Difference]: Without dead ends: 171 [2019-02-25 15:16:32,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-25 15:16:32,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-02-25 15:16:32,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-02-25 15:16:32,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-02-25 15:16:32,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2019-02-25 15:16:32,565 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2019-02-25 15:16:32,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:16:32,565 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2019-02-25 15:16:32,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-02-25 15:16:32,565 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2019-02-25 15:16:32,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-02-25 15:16:32,566 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:16:32,566 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1] [2019-02-25 15:16:32,566 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:16:32,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:16:32,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1664260885, now seen corresponding path program 83 times [2019-02-25 15:16:32,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:16:32,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:32,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:16:32,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:32,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:16:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:35,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-02-25 15:16:35,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:35,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:16:35,332 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:16:35,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:16:35,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:35,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:16:35,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:16:35,341 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:16:43,913 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-02-25 15:16:43,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:16:43,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 85 conjunts are in the unsatisfiable core [2019-02-25 15:16:43,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:16:43,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-02-25 15:16:43,962 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:16:51,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-02-25 15:16:51,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:16:51,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-02-25 15:16:51,475 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:16:51,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-25 15:16:51,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-25 15:16:51,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-25 15:16:51,478 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2019-02-25 15:16:52,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:16:52,442 INFO L93 Difference]: Finished difference Result 259 states and 262 transitions. [2019-02-25 15:16:52,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-25 15:16:52,442 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2019-02-25 15:16:52,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:16:52,443 INFO L225 Difference]: With dead ends: 259 [2019-02-25 15:16:52,443 INFO L226 Difference]: Without dead ends: 173 [2019-02-25 15:16:52,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-25 15:16:52,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-02-25 15:16:52,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-02-25 15:16:52,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-02-25 15:16:52,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2019-02-25 15:16:52,446 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2019-02-25 15:16:52,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:16:52,446 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2019-02-25 15:16:52,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-25 15:16:52,447 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2019-02-25 15:16:52,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-02-25 15:16:52,447 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:16:52,447 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1] [2019-02-25 15:16:52,448 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:16:52,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:16:52,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1123000074, now seen corresponding path program 84 times [2019-02-25 15:16:52,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:16:52,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:52,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:16:52,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:52,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:16:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:55,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-02-25 15:16:55,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:55,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:16:55,085 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:16:55,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:16:55,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:55,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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:16:55,093 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:16:55,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:16:55,210 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:16:55,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:16:55,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 86 conjunts are in the unsatisfiable core [2019-02-25 15:16:55,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:16:55,237 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-02-25 15:16:55,237 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:17:02,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-02-25 15:17:02,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:17:02,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-02-25 15:17:02,944 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:17:02,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-02-25 15:17:02,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-02-25 15:17:02,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-25 15:17:02,946 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 87 states. [2019-02-25 15:17:03,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:17:03,933 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2019-02-25 15:17:03,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-25 15:17:03,933 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2019-02-25 15:17:03,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:17:03,934 INFO L225 Difference]: With dead ends: 262 [2019-02-25 15:17:03,934 INFO L226 Difference]: Without dead ends: 175 [2019-02-25 15:17:03,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-25 15:17:03,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-02-25 15:17:03,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-02-25 15:17:03,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-02-25 15:17:03,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-02-25 15:17:03,939 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2019-02-25 15:17:03,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:17:03,939 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-02-25 15:17:03,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-02-25 15:17:03,940 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-02-25 15:17:03,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-02-25 15:17:03,940 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:17:03,941 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1] [2019-02-25 15:17:03,943 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:17:03,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:17:03,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1570725003, now seen corresponding path program 85 times [2019-02-25 15:17:03,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:17:03,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:03,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:17:03,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:03,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:17:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:17:06,796 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-02-25 15:17:06,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:06,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:17:06,797 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:17:06,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:17:06,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:06,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:17:06,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:17:06,807 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:17:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:17:06,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 87 conjunts are in the unsatisfiable core [2019-02-25 15:17:06,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:17:06,951 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-02-25 15:17:06,951 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:17:14,531 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-02-25 15:17:14,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:17:14,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-02-25 15:17:14,549 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:17:14,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-25 15:17:14,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-25 15:17:14,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-25 15:17:14,551 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2019-02-25 15:17:15,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:17:15,564 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2019-02-25 15:17:15,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-25 15:17:15,565 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2019-02-25 15:17:15,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:17:15,566 INFO L225 Difference]: With dead ends: 265 [2019-02-25 15:17:15,566 INFO L226 Difference]: Without dead ends: 177 [2019-02-25 15:17:15,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-25 15:17:15,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-02-25 15:17:15,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-02-25 15:17:15,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-02-25 15:17:15,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2019-02-25 15:17:15,570 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2019-02-25 15:17:15,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:17:15,570 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2019-02-25 15:17:15,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-25 15:17:15,570 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2019-02-25 15:17:15,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-02-25 15:17:15,571 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:17:15,571 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1] [2019-02-25 15:17:15,571 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:17:15,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:17:15,572 INFO L82 PathProgramCache]: Analyzing trace with hash -882751958, now seen corresponding path program 86 times [2019-02-25 15:17:15,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:17:15,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:15,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:17:15,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:15,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:17:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:17:18,455 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-02-25 15:17:18,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:18,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:17:18,456 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:17:18,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:17:18,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:18,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:17:18,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:17:18,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:17:27,540 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-02-25 15:17:27,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:17:27,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 88 conjunts are in the unsatisfiable core [2019-02-25 15:17:27,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:17:27,602 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-02-25 15:17:27,603 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:17:36,001 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-02-25 15:17:36,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:17:36,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-02-25 15:17:36,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:17:36,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-25 15:17:36,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-25 15:17:36,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-25 15:17:36,028 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 89 states. [2019-02-25 15:17:36,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:17:36,886 INFO L93 Difference]: Finished difference Result 268 states and 271 transitions. [2019-02-25 15:17:36,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-25 15:17:36,886 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2019-02-25 15:17:36,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:17:36,887 INFO L225 Difference]: With dead ends: 268 [2019-02-25 15:17:36,887 INFO L226 Difference]: Without dead ends: 179 [2019-02-25 15:17:36,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-25 15:17:36,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-02-25 15:17:36,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-02-25 15:17:36,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-02-25 15:17:36,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2019-02-25 15:17:36,892 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2019-02-25 15:17:36,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:17:36,892 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2019-02-25 15:17:36,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-25 15:17:36,892 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2019-02-25 15:17:36,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-02-25 15:17:36,893 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:17:36,893 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1] [2019-02-25 15:17:36,893 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:17:36,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:17:36,893 INFO L82 PathProgramCache]: Analyzing trace with hash 281519061, now seen corresponding path program 87 times [2019-02-25 15:17:36,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:17:36,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:36,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:17:36,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:36,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:17:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:17:39,689 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-02-25 15:17:39,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:39,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:17:39,690 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:17:39,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:17:39,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:39,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:17:39,698 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:17:39,699 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:17:39,817 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:17:39,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:17:39,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 89 conjunts are in the unsatisfiable core [2019-02-25 15:17:39,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:17:39,846 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-02-25 15:17:39,846 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:17:48,359 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-02-25 15:17:48,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:17:48,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-02-25 15:17:48,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:17:48,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-25 15:17:48,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-25 15:17:48,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-25 15:17:48,380 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2019-02-25 15:17:49,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:17:49,477 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2019-02-25 15:17:49,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-02-25 15:17:49,477 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2019-02-25 15:17:49,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:17:49,478 INFO L225 Difference]: With dead ends: 271 [2019-02-25 15:17:49,478 INFO L226 Difference]: Without dead ends: 181 [2019-02-25 15:17:49,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-25 15:17:49,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-02-25 15:17:49,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-02-25 15:17:49,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-02-25 15:17:49,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2019-02-25 15:17:49,482 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2019-02-25 15:17:49,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:17:49,482 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2019-02-25 15:17:49,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-25 15:17:49,482 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2019-02-25 15:17:49,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-02-25 15:17:49,483 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:17:49,483 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1] [2019-02-25 15:17:49,483 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:17:49,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:17:49,483 INFO L82 PathProgramCache]: Analyzing trace with hash 71120202, now seen corresponding path program 88 times [2019-02-25 15:17:49,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:17:49,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:49,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:17:49,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:49,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:17:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:17:52,611 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-02-25 15:17:52,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:52,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:17:52,611 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:17:52,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:17:52,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:52,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:17:52,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:17:52,619 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:17:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:17:52,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 90 conjunts are in the unsatisfiable core [2019-02-25 15:17:52,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:17:52,789 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-02-25 15:17:52,789 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:18:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-02-25 15:18:01,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:18:01,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-02-25 15:18:01,468 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:18:01,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-25 15:18:01,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-25 15:18:01,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-25 15:18:01,470 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 91 states. [2019-02-25 15:18:02,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:18:02,393 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2019-02-25 15:18:02,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-25 15:18:02,393 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2019-02-25 15:18:02,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:18:02,394 INFO L225 Difference]: With dead ends: 274 [2019-02-25 15:18:02,394 INFO L226 Difference]: Without dead ends: 183 [2019-02-25 15:18:02,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-25 15:18:02,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-02-25 15:18:02,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-02-25 15:18:02,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-02-25 15:18:02,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-02-25 15:18:02,398 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2019-02-25 15:18:02,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:18:02,398 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2019-02-25 15:18:02,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-25 15:18:02,398 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2019-02-25 15:18:02,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-02-25 15:18:02,399 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:18:02,399 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1] [2019-02-25 15:18:02,399 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:18:02,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:18:02,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1128162251, now seen corresponding path program 89 times [2019-02-25 15:18:02,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:18:02,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:02,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:18:02,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:02,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:18:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:05,297 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-02-25 15:18:05,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:05,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:18:05,298 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:18:05,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:18:05,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:05,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:18:05,306 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:18:05,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:18:09,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-02-25 15:18:09,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:18:10,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 91 conjunts are in the unsatisfiable core [2019-02-25 15:18:10,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:18:10,029 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-02-25 15:18:10,029 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:18:18,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-02-25 15:18:18,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:18:18,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-02-25 15:18:18,884 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:18:18,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-25 15:18:18,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-25 15:18:18,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-25 15:18:18,886 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2019-02-25 15:18:19,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:18:19,780 INFO L93 Difference]: Finished difference Result 277 states and 280 transitions. [2019-02-25 15:18:19,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-25 15:18:19,780 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2019-02-25 15:18:19,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:18:19,781 INFO L225 Difference]: With dead ends: 277 [2019-02-25 15:18:19,781 INFO L226 Difference]: Without dead ends: 185 [2019-02-25 15:18:19,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 273 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-25 15:18:19,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-02-25 15:18:19,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-02-25 15:18:19,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-02-25 15:18:19,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2019-02-25 15:18:19,785 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2019-02-25 15:18:19,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:18:19,785 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2019-02-25 15:18:19,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-25 15:18:19,785 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2019-02-25 15:18:19,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-02-25 15:18:19,786 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:18:19,786 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1] [2019-02-25 15:18:19,786 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:18:19,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:18:19,787 INFO L82 PathProgramCache]: Analyzing trace with hash 524708970, now seen corresponding path program 90 times [2019-02-25 15:18:19,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:18:19,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:19,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:18:19,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:19,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:18:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:22,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-02-25 15:18:22,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:22,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:18:22,936 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:18:22,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:18:22,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:22,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:18:22,944 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:18:22,944 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:18:23,070 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:18:23,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:18:23,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 92 conjunts are in the unsatisfiable core [2019-02-25 15:18:23,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:18:23,099 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-02-25 15:18:23,099 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:18:32,096 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-02-25 15:18:32,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:18:32,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-02-25 15:18:32,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:18:32,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-02-25 15:18:32,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-02-25 15:18:32,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-25 15:18:32,117 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 93 states. [2019-02-25 15:18:33,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:18:33,078 INFO L93 Difference]: Finished difference Result 280 states and 283 transitions. [2019-02-25 15:18:33,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-25 15:18:33,078 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2019-02-25 15:18:33,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:18:33,079 INFO L225 Difference]: With dead ends: 280 [2019-02-25 15:18:33,079 INFO L226 Difference]: Without dead ends: 187 [2019-02-25 15:18:33,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-25 15:18:33,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-02-25 15:18:33,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-02-25 15:18:33,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-02-25 15:18:33,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2019-02-25 15:18:33,084 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2019-02-25 15:18:33,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:18:33,084 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2019-02-25 15:18:33,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-02-25 15:18:33,085 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2019-02-25 15:18:33,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-02-25 15:18:33,085 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:18:33,085 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1] [2019-02-25 15:18:33,086 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:18:33,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:18:33,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1781042325, now seen corresponding path program 91 times [2019-02-25 15:18:33,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:18:33,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:33,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:18:33,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:33,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:18:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:36,146 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-02-25 15:18:36,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:36,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:18:36,147 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:18:36,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:18:36,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:36,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:18:36,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:18:36,156 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:18:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:36,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 93 conjunts are in the unsatisfiable core [2019-02-25 15:18:36,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:18:36,312 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-02-25 15:18:36,312 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:18:45,525 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-02-25 15:18:45,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:18:45,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-02-25 15:18:45,544 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:18:45,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-25 15:18:45,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-25 15:18:45,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-25 15:18:45,547 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2019-02-25 15:18:46,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:18:46,802 INFO L93 Difference]: Finished difference Result 283 states and 286 transitions. [2019-02-25 15:18:46,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-02-25 15:18:46,802 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2019-02-25 15:18:46,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:18:46,803 INFO L225 Difference]: With dead ends: 283 [2019-02-25 15:18:46,803 INFO L226 Difference]: Without dead ends: 189 [2019-02-25 15:18:46,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-25 15:18:46,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-02-25 15:18:46,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-02-25 15:18:46,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-02-25 15:18:46,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2019-02-25 15:18:46,809 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2019-02-25 15:18:46,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:18:46,809 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2019-02-25 15:18:46,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-25 15:18:46,809 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2019-02-25 15:18:46,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-02-25 15:18:46,810 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:18:46,810 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1] [2019-02-25 15:18:46,810 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:18:46,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:18:46,811 INFO L82 PathProgramCache]: Analyzing trace with hash -658248822, now seen corresponding path program 92 times [2019-02-25 15:18:46,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:18:46,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:46,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:18:46,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:46,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:18:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:50,049 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-02-25 15:18:50,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:50,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:18:50,050 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:18:50,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:18:50,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:50,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:18:50,058 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:18:50,059 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:18:55,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-02-25 15:18:55,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:18:55,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 94 conjunts are in the unsatisfiable core [2019-02-25 15:18:55,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:18:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-02-25 15:18:55,142 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:19:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-02-25 15:19:04,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:19:04,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-02-25 15:19:04,567 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:19:04,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-25 15:19:04,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-25 15:19:04,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-25 15:19:04,569 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 95 states. [2019-02-25 15:19:05,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:19:05,643 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2019-02-25 15:19:05,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-25 15:19:05,643 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2019-02-25 15:19:05,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:19:05,644 INFO L225 Difference]: With dead ends: 286 [2019-02-25 15:19:05,645 INFO L226 Difference]: Without dead ends: 191 [2019-02-25 15:19:05,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-25 15:19:05,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-02-25 15:19:05,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-02-25 15:19:05,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-02-25 15:19:05,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2019-02-25 15:19:05,650 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2019-02-25 15:19:05,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:19:05,650 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2019-02-25 15:19:05,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-25 15:19:05,650 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2019-02-25 15:19:05,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-02-25 15:19:05,651 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:19:05,651 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1] [2019-02-25 15:19:05,651 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:19:05,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:19:05,652 INFO L82 PathProgramCache]: Analyzing trace with hash 844526837, now seen corresponding path program 93 times [2019-02-25 15:19:05,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:19:05,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:05,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:19:05,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:05,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:19:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:19:09,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-02-25 15:19:09,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:09,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:19:09,124 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:19:09,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:19:09,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:09,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:19:09,134 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:19:09,134 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:19:09,266 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:19:09,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:19:09,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 95 conjunts are in the unsatisfiable core [2019-02-25 15:19:09,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:19:09,297 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-02-25 15:19:09,298 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:19:18,901 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-02-25 15:19:18,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:19:18,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-02-25 15:19:18,920 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:19:18,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-25 15:19:18,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-25 15:19:18,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-25 15:19:18,923 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2019-02-25 15:19:20,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:19:20,218 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2019-02-25 15:19:20,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-02-25 15:19:20,219 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2019-02-25 15:19:20,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:19:20,219 INFO L225 Difference]: With dead ends: 289 [2019-02-25 15:19:20,219 INFO L226 Difference]: Without dead ends: 193 [2019-02-25 15:19:20,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-25 15:19:20,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-02-25 15:19:20,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-02-25 15:19:20,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-02-25 15:19:20,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2019-02-25 15:19:20,224 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2019-02-25 15:19:20,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:19:20,224 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2019-02-25 15:19:20,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-25 15:19:20,224 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2019-02-25 15:19:20,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-02-25 15:19:20,225 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:19:20,225 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1] [2019-02-25 15:19:20,225 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:19:20,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:19:20,225 INFO L82 PathProgramCache]: Analyzing trace with hash -679759190, now seen corresponding path program 94 times [2019-02-25 15:19:20,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:19:20,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:20,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:19:20,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:20,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:19:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:19:23,735 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-02-25 15:19:23,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:23,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:19:23,735 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:19:23,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:19:23,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:23,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:19:23,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:19:23,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:19:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:19:23,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 96 conjunts are in the unsatisfiable core [2019-02-25 15:19:23,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:19:23,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-02-25 15:19:23,906 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:19:33,673 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-02-25 15:19:33,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:19:33,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-02-25 15:19:33,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:19:33,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-02-25 15:19:33,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-02-25 15:19:33,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-25 15:19:33,694 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 97 states. [2019-02-25 15:19:35,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:19:35,044 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2019-02-25 15:19:35,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-25 15:19:35,044 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2019-02-25 15:19:35,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:19:35,045 INFO L225 Difference]: With dead ends: 292 [2019-02-25 15:19:35,045 INFO L226 Difference]: Without dead ends: 195 [2019-02-25 15:19:35,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-25 15:19:35,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-02-25 15:19:35,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-02-25 15:19:35,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-02-25 15:19:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2019-02-25 15:19:35,048 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2019-02-25 15:19:35,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:19:35,049 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2019-02-25 15:19:35,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-02-25 15:19:35,049 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2019-02-25 15:19:35,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-02-25 15:19:35,049 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:19:35,049 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1] [2019-02-25 15:19:35,049 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:19:35,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:19:35,050 INFO L82 PathProgramCache]: Analyzing trace with hash 606426453, now seen corresponding path program 95 times [2019-02-25 15:19:35,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:19:35,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:35,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:19:35,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:35,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:19:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:19:38,608 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-02-25 15:19:38,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:38,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:19:38,608 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:19:38,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:19:38,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:38,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:19:38,618 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:19:38,618 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:19:44,523 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-02-25 15:19:44,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:19:44,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 97 conjunts are in the unsatisfiable core [2019-02-25 15:19:44,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:19:44,560 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-02-25 15:19:44,560 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:19:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-02-25 15:19:54,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:19:54,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-02-25 15:19:54,643 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:19:54,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-25 15:19:54,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-25 15:19:54,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-25 15:19:54,646 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2019-02-25 15:19:56,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:19:56,212 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-02-25 15:19:56,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-02-25 15:19:56,212 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2019-02-25 15:19:56,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:19:56,213 INFO L225 Difference]: With dead ends: 295 [2019-02-25 15:19:56,213 INFO L226 Difference]: Without dead ends: 197 [2019-02-25 15:19:56,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 291 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-25 15:19:56,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-02-25 15:19:56,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-02-25 15:19:56,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-02-25 15:19:56,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2019-02-25 15:19:56,218 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2019-02-25 15:19:56,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:19:56,218 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2019-02-25 15:19:56,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-25 15:19:56,218 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2019-02-25 15:19:56,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-02-25 15:19:56,219 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:19:56,219 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1] [2019-02-25 15:19:56,219 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:19:56,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:19:56,220 INFO L82 PathProgramCache]: Analyzing trace with hash 213107146, now seen corresponding path program 96 times [2019-02-25 15:19:56,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:19:56,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:56,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:19:56,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:56,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:19:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:19:59,787 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-02-25 15:19:59,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:59,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:19:59,787 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:19:59,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:19:59,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:59,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:19:59,797 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:19:59,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:19:59,938 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:19:59,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:19:59,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 98 conjunts are in the unsatisfiable core [2019-02-25 15:19:59,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:19:59,971 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-02-25 15:19:59,971 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-02-25 15:20:10,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:10,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-02-25 15:20:10,474 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:10,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-02-25 15:20:10,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-02-25 15:20:10,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-25 15:20:10,476 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 99 states. [2019-02-25 15:20:11,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:11,961 INFO L93 Difference]: Finished difference Result 298 states and 301 transitions. [2019-02-25 15:20:11,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-25 15:20:11,961 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2019-02-25 15:20:11,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:11,962 INFO L225 Difference]: With dead ends: 298 [2019-02-25 15:20:11,962 INFO L226 Difference]: Without dead ends: 199 [2019-02-25 15:20:11,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-25 15:20:11,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-02-25 15:20:11,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-02-25 15:20:11,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-02-25 15:20:11,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2019-02-25 15:20:11,965 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2019-02-25 15:20:11,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:11,966 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2019-02-25 15:20:11,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-02-25 15:20:11,966 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2019-02-25 15:20:11,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-02-25 15:20:11,966 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:11,966 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1] [2019-02-25 15:20:11,967 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:11,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:11,967 INFO L82 PathProgramCache]: Analyzing trace with hash -470864459, now seen corresponding path program 97 times [2019-02-25 15:20:11,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:11,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:11,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:20:11,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:11,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:15,779 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-02-25 15:20:15,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:15,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:15,780 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:20:15,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:20:15,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:15,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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:15,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:15,788 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:20:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:15,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 99 conjunts are in the unsatisfiable core [2019-02-25 15:20:15,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:15,954 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-02-25 15:20:15,954 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:26,212 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-02-25 15:20:26,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:26,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-02-25 15:20:26,231 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:26,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-25 15:20:26,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-25 15:20:26,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-25 15:20:26,233 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2019-02-25 15:20:27,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:27,449 INFO L93 Difference]: Finished difference Result 301 states and 304 transitions. [2019-02-25 15:20:27,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-02-25 15:20:27,450 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2019-02-25 15:20:27,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:27,450 INFO L225 Difference]: With dead ends: 301 [2019-02-25 15:20:27,451 INFO L226 Difference]: Without dead ends: 201 [2019-02-25 15:20:27,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-25 15:20:27,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-02-25 15:20:27,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-02-25 15:20:27,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-02-25 15:20:27,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2019-02-25 15:20:27,455 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2019-02-25 15:20:27,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:27,455 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2019-02-25 15:20:27,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-25 15:20:27,455 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2019-02-25 15:20:27,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-02-25 15:20:27,456 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:27,456 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1] [2019-02-25 15:20:27,456 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:27,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:27,456 INFO L82 PathProgramCache]: Analyzing trace with hash 338827498, now seen corresponding path program 98 times [2019-02-25 15:20:27,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:27,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:27,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:27,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:27,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:31,265 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-02-25 15:20:31,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:31,265 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:31,266 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:20:31,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:20:31,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:31,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:31,273 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:20:31,274 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:20:46,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-02-25 15:20:46,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:20:46,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 100 conjunts are in the unsatisfiable core [2019-02-25 15:20:46,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:46,146 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-02-25 15:20:46,147 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:56,711 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-02-25 15:20:56,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:56,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-02-25 15:20:56,740 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:56,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-25 15:20:56,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-25 15:20:56,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-25 15:20:56,742 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 101 states. [2019-02-25 15:20:58,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:58,338 INFO L93 Difference]: Finished difference Result 304 states and 307 transitions. [2019-02-25 15:20:58,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-02-25 15:20:58,338 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2019-02-25 15:20:58,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:58,339 INFO L225 Difference]: With dead ends: 304 [2019-02-25 15:20:58,339 INFO L226 Difference]: Without dead ends: 203 [2019-02-25 15:20:58,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-25 15:20:58,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-02-25 15:20:58,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-02-25 15:20:58,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-02-25 15:20:58,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2019-02-25 15:20:58,343 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2019-02-25 15:20:58,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:58,343 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2019-02-25 15:20:58,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-25 15:20:58,343 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2019-02-25 15:20:58,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-02-25 15:20:58,343 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:58,344 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1] [2019-02-25 15:20:58,344 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:58,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:58,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1267596821, now seen corresponding path program 99 times [2019-02-25 15:20:58,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:58,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:58,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:20:58,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:58,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:02,279 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-02-25 15:21:02,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:02,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:02,280 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:21:02,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:21:02,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:02,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:02,293 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:21:02,294 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:21:02,427 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:21:02,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:21:02,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 101 conjunts are in the unsatisfiable core [2019-02-25 15:21:02,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:02,461 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-02-25 15:21:02,461 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:13,134 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-02-25 15:21:13,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:13,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-02-25 15:21:13,154 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:13,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-25 15:21:13,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-25 15:21:13,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-25 15:21:13,157 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2019-02-25 15:21:14,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:14,790 INFO L93 Difference]: Finished difference Result 307 states and 310 transitions. [2019-02-25 15:21:14,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-02-25 15:21:14,790 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2019-02-25 15:21:14,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:14,791 INFO L225 Difference]: With dead ends: 307 [2019-02-25 15:21:14,791 INFO L226 Difference]: Without dead ends: 205 [2019-02-25 15:21:14,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-25 15:21:14,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-02-25 15:21:14,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-02-25 15:21:14,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-02-25 15:21:14,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2019-02-25 15:21:14,795 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2019-02-25 15:21:14,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:14,796 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2019-02-25 15:21:14,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-25 15:21:14,796 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2019-02-25 15:21:14,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-02-25 15:21:14,796 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:14,796 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1] [2019-02-25 15:21:14,797 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:14,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:14,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1807960054, now seen corresponding path program 100 times [2019-02-25 15:21:14,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:14,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:14,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:21:14,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:14,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-02-25 15:21:18,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:18,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:18,612 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:21:18,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:21:18,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:18,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:18,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:18,625 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:18,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 102 conjunts are in the unsatisfiable core [2019-02-25 15:21:18,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:18,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-02-25 15:21:18,795 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:29,812 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-02-25 15:21:29,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:29,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-02-25 15:21:29,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:29,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-02-25 15:21:29,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-02-25 15:21:29,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-25 15:21:29,834 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 103 states. [2019-02-25 15:21:31,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:31,376 INFO L93 Difference]: Finished difference Result 310 states and 313 transitions. [2019-02-25 15:21:31,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-25 15:21:31,376 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2019-02-25 15:21:31,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:31,377 INFO L225 Difference]: With dead ends: 310 [2019-02-25 15:21:31,377 INFO L226 Difference]: Without dead ends: 207 [2019-02-25 15:21:31,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-25 15:21:31,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-02-25 15:21:31,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-02-25 15:21:31,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-02-25 15:21:31,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-02-25 15:21:31,383 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2019-02-25 15:21:31,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:31,383 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2019-02-25 15:21:31,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-02-25 15:21:31,384 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2019-02-25 15:21:31,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-02-25 15:21:31,384 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:31,385 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1] [2019-02-25 15:21:31,385 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:31,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:31,385 INFO L82 PathProgramCache]: Analyzing trace with hash 173786741, now seen corresponding path program 101 times [2019-02-25 15:21:31,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:31,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:31,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:31,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:31,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:35,060 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-02-25 15:21:35,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:35,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:35,060 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:21:35,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:21:35,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:35,060 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-25 15:21:35,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:21:35,070 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:21:53,595 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-02-25 15:21:53,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:21:53,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 103 conjunts are in the unsatisfiable core [2019-02-25 15:21:53,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-02-25 15:21:53,677 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:22:04,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-02-25 15:22:04,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:22:04,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-02-25 15:22:04,627 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:22:04,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-25 15:22:04,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-25 15:22:04,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-25 15:22:04,631 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2019-02-25 15:22:06,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:22:06,399 INFO L93 Difference]: Finished difference Result 313 states and 316 transitions. [2019-02-25 15:22:06,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-02-25 15:22:06,400 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2019-02-25 15:22:06,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:22:06,401 INFO L225 Difference]: With dead ends: 313 [2019-02-25 15:22:06,401 INFO L226 Difference]: Without dead ends: 209 [2019-02-25 15:22:06,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-25 15:22:06,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-02-25 15:22:06,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-02-25 15:22:06,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-02-25 15:22:06,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2019-02-25 15:22:06,407 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2019-02-25 15:22:06,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:22:06,407 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2019-02-25 15:22:06,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-25 15:22:06,407 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2019-02-25 15:22:06,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-02-25 15:22:06,408 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:22:06,408 INFO L402 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1] [2019-02-25 15:22:06,409 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:22:06,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:06,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1650876630, now seen corresponding path program 102 times [2019-02-25 15:22:06,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:22:06,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:06,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:22:06,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:06,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:22:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:10,453 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-02-25 15:22:10,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:10,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:22:10,453 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:22:10,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:22:10,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:10,454 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-25 15:22:10,461 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:22:10,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:22:10,605 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:22:10,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:22:10,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 104 conjunts are in the unsatisfiable core [2019-02-25 15:22:10,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:22:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-02-25 15:22:10,639 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:22:21,994 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-02-25 15:22:22,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:22:22,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-02-25 15:22:22,013 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:22:22,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-02-25 15:22:22,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-02-25 15:22:22,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-25 15:22:22,015 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 105 states. [2019-02-25 15:22:23,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:22:23,469 INFO L93 Difference]: Finished difference Result 316 states and 319 transitions. [2019-02-25 15:22:23,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-02-25 15:22:23,469 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2019-02-25 15:22:23,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:22:23,470 INFO L225 Difference]: With dead ends: 316 [2019-02-25 15:22:23,470 INFO L226 Difference]: Without dead ends: 211 [2019-02-25 15:22:23,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-25 15:22:23,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-02-25 15:22:23,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-02-25 15:22:23,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-02-25 15:22:23,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2019-02-25 15:22:23,475 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2019-02-25 15:22:23,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:22:23,478 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2019-02-25 15:22:23,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-02-25 15:22:23,478 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2019-02-25 15:22:23,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-02-25 15:22:23,479 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:22:23,479 INFO L402 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1] [2019-02-25 15:22:23,479 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:22:23,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:23,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1160939221, now seen corresponding path program 103 times [2019-02-25 15:22:23,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:22:23,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:23,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:22:23,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:23,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:22:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:27,527 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-02-25 15:22:27,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:27,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:22:27,528 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:22:27,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:22:27,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:27,528 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-25 15:22:27,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:27,537 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:22:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:27,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 105 conjunts are in the unsatisfiable core [2019-02-25 15:22:27,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:22:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-02-25 15:22:27,719 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:22:39,451 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-02-25 15:22:39,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:22:39,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-02-25 15:22:39,470 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:22:39,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-25 15:22:39,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-25 15:22:39,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-25 15:22:39,473 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 106 states. [2019-02-25 15:22:41,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:22:41,183 INFO L93 Difference]: Finished difference Result 319 states and 322 transitions. [2019-02-25 15:22:41,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-02-25 15:22:41,183 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2019-02-25 15:22:41,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:22:41,184 INFO L225 Difference]: With dead ends: 319 [2019-02-25 15:22:41,184 INFO L226 Difference]: Without dead ends: 213 [2019-02-25 15:22:41,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-25 15:22:41,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-02-25 15:22:41,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-02-25 15:22:41,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-25 15:22:41,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2019-02-25 15:22:41,189 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2019-02-25 15:22:41,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:22:41,189 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2019-02-25 15:22:41,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-25 15:22:41,190 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2019-02-25 15:22:41,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-02-25 15:22:41,191 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:22:41,191 INFO L402 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1, 1] [2019-02-25 15:22:41,191 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:22:41,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:41,191 INFO L82 PathProgramCache]: Analyzing trace with hash 193908298, now seen corresponding path program 104 times [2019-02-25 15:22:41,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:22:41,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:41,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:41,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:41,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:22:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:45,428 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-02-25 15:22:45,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:45,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:22:45,428 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:22:45,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:22:45,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:45,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:22:45,444 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:22:45,444 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:22:53,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-02-25 15:22:53,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:22:53,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 1055 conjuncts, 106 conjunts are in the unsatisfiable core [2019-02-25 15:22:53,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:22:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-02-25 15:22:53,748 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:05,570 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-02-25 15:23:05,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:05,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-02-25 15:23:05,599 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:05,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-25 15:23:05,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-25 15:23:05,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-02-25 15:23:05,602 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 107 states. [2019-02-25 15:23:07,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:07,081 INFO L93 Difference]: Finished difference Result 322 states and 325 transitions. [2019-02-25 15:23:07,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-02-25 15:23:07,082 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 212 [2019-02-25 15:23:07,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:07,083 INFO L225 Difference]: With dead ends: 322 [2019-02-25 15:23:07,083 INFO L226 Difference]: Without dead ends: 215 [2019-02-25 15:23:07,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-02-25 15:23:07,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-02-25 15:23:07,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-02-25 15:23:07,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-02-25 15:23:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2019-02-25 15:23:07,087 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 212 [2019-02-25 15:23:07,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:07,087 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2019-02-25 15:23:07,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-25 15:23:07,087 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2019-02-25 15:23:07,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-02-25 15:23:07,087 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:07,088 INFO L402 BasicCegarLoop]: trace histogram [105, 105, 1, 1, 1, 1] [2019-02-25 15:23:07,088 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:07,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:07,088 INFO L82 PathProgramCache]: Analyzing trace with hash 913063733, now seen corresponding path program 105 times [2019-02-25 15:23:07,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:07,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:07,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:23:07,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:07,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat