java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:49:22,066 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:49:22,068 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:49:22,080 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:49:22,080 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:49:22,081 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:49:22,083 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:49:22,085 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:49:22,086 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:49:22,087 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:49:22,088 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:49:22,088 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:49:22,089 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:49:22,090 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:49:22,091 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:49:22,092 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:49:22,093 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:49:22,095 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:49:22,098 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:49:22,100 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:49:22,101 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:49:22,102 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:49:22,105 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:49:22,105 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:49:22,105 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:49:22,107 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:49:22,108 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:49:22,108 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:49:22,109 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:49:22,110 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:49:22,111 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:49:22,111 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:49:22,112 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:49:22,112 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:49:22,113 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:49:22,114 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:49:22,114 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-25 15:49:22,127 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:49:22,128 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:49:22,129 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:49:22,129 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:49:22,129 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:49:22,129 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:49:22,129 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:49:22,130 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:49:22,130 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:49:22,130 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-25 15:49:22,130 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-25 15:49:22,130 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:49:22,130 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:49:22,131 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:49:22,131 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:49:22,131 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:49:22,132 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:49:22,132 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:49:22,132 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:49:22,132 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:49:22,132 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:49:22,133 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:49:22,133 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:49:22,133 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:49:22,133 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:49:22,133 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:49:22,134 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:49:22,134 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:49:22,134 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:49:22,134 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:49:22,134 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:49:22,135 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:49:22,135 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:49:22,135 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:49:22,135 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:49:22,135 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:49:22,136 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:49:22,136 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:49:22,136 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:49:22,167 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:49:22,183 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:49:22,189 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:49:22,191 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:49:22,191 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:49:22,192 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl [2019-02-25 15:49:22,193 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl' [2019-02-25 15:49:22,232 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:49:22,233 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:49:22,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:49:22,234 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:49:22,234 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:49:22,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:49:22" (1/1) ... [2019-02-25 15:49:22,263 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:49:22" (1/1) ... [2019-02-25 15:49:22,270 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-25 15:49:22,271 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-25 15:49:22,271 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-25 15:49:22,286 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:49:22,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:49:22,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:49:22,287 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:49:22,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:49:22" (1/1) ... [2019-02-25 15:49:22,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:49:22" (1/1) ... [2019-02-25 15:49:22,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:49:22" (1/1) ... [2019-02-25 15:49:22,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:49:22" (1/1) ... [2019-02-25 15:49:22,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:49:22" (1/1) ... [2019-02-25 15:49:22,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:49:22" (1/1) ... [2019-02-25 15:49:22,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:49:22" (1/1) ... [2019-02-25 15:49:22,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:49:22,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:49:22,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:49:22,312 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:49:22,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:49:22" (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:49:22,385 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-25 15:49:22,385 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-25 15:49:22,385 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-02-25 15:49:22,672 INFO L278 CfgBuilder]: Using library mode [2019-02-25 15:49:22,673 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-02-25 15:49:22,674 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:49:22 BoogieIcfgContainer [2019-02-25 15:49:22,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:49:22,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:49:22,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:49:22,684 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:49:22,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:49:22" (1/2) ... [2019-02-25 15:49:22,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35553cb and model type PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:49:22, skipping insertion in model container [2019-02-25 15:49:22,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:49:22" (2/2) ... [2019-02-25 15:49:22,690 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified02.bpl [2019-02-25 15:49:22,714 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:49:22,734 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-25 15:49:22,760 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-25 15:49:22,815 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:49:22,816 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:49:22,816 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:49:22,816 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:49:22,816 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:49:22,817 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:49:22,822 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:49:22,822 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:49:22,852 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-02-25 15:49:22,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:49:22,858 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:22,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:49:22,862 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:22,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:22,873 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-02-25 15:49:22,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:22,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:22,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:22,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:22,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:23,083 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:49:23,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:49:23,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:49:23,085 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:49:23,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:49:23,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:49:23,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:49:23,101 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-02-25 15:49:23,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:23,155 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-02-25 15:49:23,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:49:23,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-25 15:49:23,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:23,170 INFO L225 Difference]: With dead ends: 17 [2019-02-25 15:49:23,170 INFO L226 Difference]: Without dead ends: 10 [2019-02-25 15:49:23,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:49:23,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-25 15:49:23,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-02-25 15:49:23,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-25 15:49:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-02-25 15:49:23,210 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2019-02-25 15:49:23,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:23,210 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-02-25 15:49:23,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:49:23,211 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-02-25 15:49:23,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:49:23,211 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:23,212 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-02-25 15:49:23,212 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:23,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:23,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times [2019-02-25 15:49:23,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:23,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:23,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:23,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:23,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:23,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:23,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:23,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:23,330 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-25 15:49:23,332 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [8], [9], [13] [2019-02-25 15:49:23,392 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:49:23,392 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:49:33,477 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:49:33,479 INFO L272 AbstractInterpreter]: Visited 6 different actions 71 times. Merged at 5 different actions 65 times. Widened at 1 different actions 9 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:49:33,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:33,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:49:33,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:33,490 INFO 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:49:33,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:33,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:49:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:33,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:49:33,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:33,612 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:33,613 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:33,721 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:33,722 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:34,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:34,002 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:34,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:34,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:34,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:49:34,281 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:34,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:49:34,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:49:34,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:49:34,284 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2019-02-25 15:49:34,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:34,496 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-02-25 15:49:34,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:49:34,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-02-25 15:49:34,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:34,498 INFO L225 Difference]: With dead ends: 15 [2019-02-25 15:49:34,498 INFO L226 Difference]: Without dead ends: 14 [2019-02-25 15:49:34,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:49:34,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-25 15:49:34,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-02-25 15:49:34,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-25 15:49:34,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-02-25 15:49:34,503 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2019-02-25 15:49:34,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:34,503 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-02-25 15:49:34,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:49:34,504 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-02-25 15:49:34,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-25 15:49:34,505 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:34,505 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2019-02-25 15:49:34,505 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:34,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:34,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times [2019-02-25 15:49:34,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:34,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:34,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:34,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:34,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:34,714 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:34,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:34,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:34,715 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:34,716 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:49:34,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:34,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:49:34,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:49:34,733 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:49:34,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:49:34,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:34,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:49:34,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:34,806 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:34,807 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:34,900 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:34,901 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:35,168 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:35,169 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:35,222 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:35,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:35,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:49:35,242 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:35,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:49:35,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:49:35,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:49:35,243 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2019-02-25 15:49:35,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:35,385 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-02-25 15:49:35,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:49:35,386 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-02-25 15:49:35,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:35,386 INFO L225 Difference]: With dead ends: 19 [2019-02-25 15:49:35,386 INFO L226 Difference]: Without dead ends: 18 [2019-02-25 15:49:35,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:49:35,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-02-25 15:49:35,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-02-25 15:49:35,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-25 15:49:35,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-02-25 15:49:35,392 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2019-02-25 15:49:35,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:35,393 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-02-25 15:49:35,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:49:35,393 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-02-25 15:49:35,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-25 15:49:35,393 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:35,393 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2019-02-25 15:49:35,394 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:35,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:35,394 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times [2019-02-25 15:49:35,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:35,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:35,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:35,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:35,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:35,546 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:35,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:35,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:35,547 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:35,547 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:49:35,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:35,547 INFO 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:49:35,564 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:49:35,564 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:49:35,589 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:49:35,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:35,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:49:35,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:35,595 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:35,595 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:35,608 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:35,609 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:35,861 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:35,862 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:35,990 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:36,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:36,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:49:36,010 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:36,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:49:36,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:49:36,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:49:36,011 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-02-25 15:49:36,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:36,361 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-02-25 15:49:36,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:49:36,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-02-25 15:49:36,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:36,362 INFO L225 Difference]: With dead ends: 23 [2019-02-25 15:49:36,362 INFO L226 Difference]: Without dead ends: 22 [2019-02-25 15:49:36,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:49:36,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-02-25 15:49:36,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-02-25 15:49:36,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-25 15:49:36,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-02-25 15:49:36,367 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2019-02-25 15:49:36,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:36,368 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-02-25 15:49:36,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:49:36,368 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-02-25 15:49:36,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-25 15:49:36,369 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:36,369 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2019-02-25 15:49:36,369 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:36,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:36,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times [2019-02-25 15:49:36,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:36,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:36,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:36,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:36,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:36,473 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:36,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:36,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:36,474 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:36,474 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:49:36,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:36,475 INFO 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:49:36,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:36,485 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:49:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:36,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-25 15:49:36,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:36,516 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:36,517 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:36,549 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:36,550 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:36,648 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:36,648 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:36,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:36,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:49:36,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:36,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:49:36,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:49:36,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:49:36,740 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-02-25 15:49:36,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:36,803 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-02-25 15:49:36,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:49:36,809 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-02-25 15:49:36,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:36,810 INFO L225 Difference]: With dead ends: 27 [2019-02-25 15:49:36,810 INFO L226 Difference]: Without dead ends: 26 [2019-02-25 15:49:36,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:49:36,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-25 15:49:36,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-02-25 15:49:36,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-25 15:49:36,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-02-25 15:49:36,815 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2019-02-25 15:49:36,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:36,815 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-02-25 15:49:36,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:49:36,815 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-02-25 15:49:36,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-25 15:49:36,816 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:36,816 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2019-02-25 15:49:36,816 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:36,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:36,817 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times [2019-02-25 15:49:36,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:36,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:36,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:36,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:36,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:36,970 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:36,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:36,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:36,970 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:36,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:49:36,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:36,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 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:49:36,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:49:36,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:49:36,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-25 15:49:36,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:36,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 25 conjunts are in the unsatisfiable core [2019-02-25 15:49:37,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:37,010 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:37,011 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:37,034 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:37,034 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:37,204 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:37,205 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:37,318 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:37,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:37,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-25 15:49:37,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:37,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-25 15:49:37,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-25 15:49:37,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:49:37,339 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2019-02-25 15:49:37,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:37,445 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-02-25 15:49:37,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:49:37,446 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-02-25 15:49:37,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:37,447 INFO L225 Difference]: With dead ends: 31 [2019-02-25 15:49:37,447 INFO L226 Difference]: Without dead ends: 30 [2019-02-25 15:49:37,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:49:37,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-02-25 15:49:37,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-02-25 15:49:37,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-25 15:49:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-02-25 15:49:37,453 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2019-02-25 15:49:37,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:37,453 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-02-25 15:49:37,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-25 15:49:37,453 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-02-25 15:49:37,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-25 15:49:37,454 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:37,454 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2019-02-25 15:49:37,455 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:37,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:37,455 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times [2019-02-25 15:49:37,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:37,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:37,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:37,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:37,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:37,582 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:37,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:37,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:37,583 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:37,583 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:49:37,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:37,583 INFO 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:49:37,592 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:49:37,592 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:49:37,606 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:49:37,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:37,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 28 conjunts are in the unsatisfiable core [2019-02-25 15:49:37,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:37,613 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:37,614 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:37,654 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:37,654 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:37,753 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:37,754 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:37,896 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:37,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:37,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-02-25 15:49:37,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:37,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-25 15:49:37,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-25 15:49:37,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-02-25 15:49:37,928 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2019-02-25 15:49:38,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:38,012 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-02-25 15:49:38,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:49:38,014 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-02-25 15:49:38,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:38,015 INFO L225 Difference]: With dead ends: 35 [2019-02-25 15:49:38,015 INFO L226 Difference]: Without dead ends: 34 [2019-02-25 15:49:38,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-02-25 15:49:38,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-02-25 15:49:38,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-02-25 15:49:38,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-25 15:49:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-02-25 15:49:38,021 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2019-02-25 15:49:38,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:38,022 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-02-25 15:49:38,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-25 15:49:38,022 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-02-25 15:49:38,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-25 15:49:38,024 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:38,024 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2019-02-25 15:49:38,024 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:38,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:38,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times [2019-02-25 15:49:38,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:38,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:38,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:38,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:38,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:38,151 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:38,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:38,151 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:38,151 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:38,151 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:49:38,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:38,152 INFO 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:49:38,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:38,163 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:49:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:38,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 31 conjunts are in the unsatisfiable core [2019-02-25 15:49:38,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:38,186 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:38,187 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:38,198 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:38,199 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:38,331 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:38,332 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:38,481 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:38,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:38,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-02-25 15:49:38,502 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:38,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-25 15:49:38,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-25 15:49:38,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-02-25 15:49:38,503 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2019-02-25 15:49:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:38,697 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-02-25 15:49:38,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:49:38,699 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-02-25 15:49:38,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:38,701 INFO L225 Difference]: With dead ends: 39 [2019-02-25 15:49:38,701 INFO L226 Difference]: Without dead ends: 38 [2019-02-25 15:49:38,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-02-25 15:49:38,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-25 15:49:38,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-02-25 15:49:38,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-25 15:49:38,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-02-25 15:49:38,708 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2019-02-25 15:49:38,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:38,709 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-02-25 15:49:38,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-25 15:49:38,709 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-02-25 15:49:38,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-25 15:49:38,710 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:38,710 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2019-02-25 15:49:38,710 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:38,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:38,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times [2019-02-25 15:49:38,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:38,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:38,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:38,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:38,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:38,836 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:38,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:38,837 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:38,837 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:38,837 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:49:38,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:38,837 INFO 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:49:38,846 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:49:38,846 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:49:38,870 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-25 15:49:38,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:38,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-25 15:49:38,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:38,881 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:38,882 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:38,890 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:38,891 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:39,000 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:39,000 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:39,322 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:39,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:39,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-02-25 15:49:39,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:39,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-25 15:49:39,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-25 15:49:39,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-02-25 15:49:39,355 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2019-02-25 15:49:39,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:39,473 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-02-25 15:49:39,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:49:39,473 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-02-25 15:49:39,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:39,474 INFO L225 Difference]: With dead ends: 43 [2019-02-25 15:49:39,475 INFO L226 Difference]: Without dead ends: 42 [2019-02-25 15:49:39,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-02-25 15:49:39,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-02-25 15:49:39,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-02-25 15:49:39,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-25 15:49:39,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-02-25 15:49:39,482 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2019-02-25 15:49:39,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:39,482 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-02-25 15:49:39,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-25 15:49:39,482 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-02-25 15:49:39,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-25 15:49:39,483 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:39,483 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2019-02-25 15:49:39,484 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:39,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:39,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times [2019-02-25 15:49:39,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:39,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:39,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:39,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:39,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:39,711 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:39,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:39,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:39,712 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:39,712 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:49:39,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:39,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:49:39,721 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:49:39,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:49:39,764 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:49:39,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:39,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 37 conjunts are in the unsatisfiable core [2019-02-25 15:49:39,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:39,785 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:39,785 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:39,825 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:39,826 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:40,033 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:40,235 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:40,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:40,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-02-25 15:49:40,254 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:40,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-25 15:49:40,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-25 15:49:40,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-02-25 15:49:40,256 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2019-02-25 15:49:40,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:40,337 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-02-25 15:49:40,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-25 15:49:40,338 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-02-25 15:49:40,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:40,339 INFO L225 Difference]: With dead ends: 47 [2019-02-25 15:49:40,339 INFO L226 Difference]: Without dead ends: 46 [2019-02-25 15:49:40,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-02-25 15:49:40,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-02-25 15:49:40,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-02-25 15:49:40,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-25 15:49:40,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-02-25 15:49:40,346 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2019-02-25 15:49:40,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:40,346 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-02-25 15:49:40,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-25 15:49:40,347 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-02-25 15:49:40,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-25 15:49:40,348 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:40,348 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2019-02-25 15:49:40,348 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:40,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:40,348 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times [2019-02-25 15:49:40,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:40,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:40,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:40,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:40,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:40,686 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:40,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:40,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:40,687 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:40,687 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:49:40,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:40,688 INFO 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:49:40,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:40,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:49:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:40,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 40 conjunts are in the unsatisfiable core [2019-02-25 15:49:40,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:40,723 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:40,724 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:40,735 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:40,735 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:40,918 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:40,918 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:41,103 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:41,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:41,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-02-25 15:49:41,124 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:41,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-25 15:49:41,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-25 15:49:41,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-02-25 15:49:41,126 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2019-02-25 15:49:41,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:41,249 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-02-25 15:49:41,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-25 15:49:41,249 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-02-25 15:49:41,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:41,250 INFO L225 Difference]: With dead ends: 51 [2019-02-25 15:49:41,251 INFO L226 Difference]: Without dead ends: 50 [2019-02-25 15:49:41,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-02-25 15:49:41,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-25 15:49:41,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-02-25 15:49:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-25 15:49:41,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-02-25 15:49:41,257 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2019-02-25 15:49:41,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:41,257 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-02-25 15:49:41,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-25 15:49:41,258 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-02-25 15:49:41,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-25 15:49:41,258 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:41,259 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2019-02-25 15:49:41,259 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:41,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:41,259 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times [2019-02-25 15:49:41,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:41,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:41,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:41,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:41,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:41,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:41,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:41,453 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:41,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:49:41,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:41,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 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:49:41,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:49:41,464 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:49:41,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-02-25 15:49:41,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:41,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 43 conjunts are in the unsatisfiable core [2019-02-25 15:49:41,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:41,508 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:41,509 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:41,520 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:41,521 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:41,714 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:41,714 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:41,970 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:41,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:41,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-02-25 15:49:41,991 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:41,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-25 15:49:41,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-25 15:49:41,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:49:41,992 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2019-02-25 15:49:42,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:42,090 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-02-25 15:49:42,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-25 15:49:42,091 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-02-25 15:49:42,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:42,092 INFO L225 Difference]: With dead ends: 55 [2019-02-25 15:49:42,093 INFO L226 Difference]: Without dead ends: 54 [2019-02-25 15:49:42,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:49:42,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-25 15:49:42,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-02-25 15:49:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-25 15:49:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-02-25 15:49:42,099 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2019-02-25 15:49:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:42,100 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-02-25 15:49:42,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-25 15:49:42,100 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-02-25 15:49:42,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-25 15:49:42,101 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:42,101 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2019-02-25 15:49:42,101 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:42,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:42,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times [2019-02-25 15:49:42,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:42,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:42,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:42,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:42,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:42,540 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:42,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:42,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:42,540 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:42,540 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:49:42,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:42,541 INFO 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:49:42,551 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:49:42,551 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:49:42,570 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:49:42,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:42,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 46 conjunts are in the unsatisfiable core [2019-02-25 15:49:42,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:42,580 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:42,581 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:42,590 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:42,590 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:42,821 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:42,821 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:43,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:43,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-02-25 15:49:43,175 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:43,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-25 15:49:43,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-25 15:49:43,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-02-25 15:49:43,176 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2019-02-25 15:49:43,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:43,287 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-02-25 15:49:43,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-25 15:49:43,287 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2019-02-25 15:49:43,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:43,288 INFO L225 Difference]: With dead ends: 59 [2019-02-25 15:49:43,288 INFO L226 Difference]: Without dead ends: 58 [2019-02-25 15:49:43,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-02-25 15:49:43,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-25 15:49:43,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-02-25 15:49:43,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-25 15:49:43,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-02-25 15:49:43,295 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2019-02-25 15:49:43,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:43,295 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-02-25 15:49:43,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-25 15:49:43,295 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-02-25 15:49:43,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-25 15:49:43,296 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:43,296 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2019-02-25 15:49:43,297 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:43,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:43,297 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times [2019-02-25 15:49:43,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:43,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:43,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:43,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:43,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:44,237 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:44,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:44,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:44,238 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:44,238 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:49:44,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:44,238 INFO 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:49:44,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:44,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:49:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:44,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 49 conjunts are in the unsatisfiable core [2019-02-25 15:49:44,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:44,279 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:44,279 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:44,287 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:44,288 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:44,472 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:45,351 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:45,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:45,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-02-25 15:49:45,371 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:45,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-25 15:49:45,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-25 15:49:45,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-02-25 15:49:45,372 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2019-02-25 15:49:45,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:45,536 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-02-25 15:49:45,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-25 15:49:45,537 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2019-02-25 15:49:45,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:45,538 INFO L225 Difference]: With dead ends: 63 [2019-02-25 15:49:45,538 INFO L226 Difference]: Without dead ends: 62 [2019-02-25 15:49:45,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-02-25 15:49:45,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-02-25 15:49:45,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-02-25 15:49:45,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-25 15:49:45,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-02-25 15:49:45,545 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2019-02-25 15:49:45,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:45,545 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-02-25 15:49:45,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-25 15:49:45,546 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-02-25 15:49:45,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-25 15:49:45,546 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:45,547 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2019-02-25 15:49:45,547 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:45,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:45,547 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times [2019-02-25 15:49:45,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:45,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:45,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:45,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:45,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:45,933 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:45,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:45,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:45,934 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:45,934 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:49:45,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:45,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 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:49:45,944 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:49:45,944 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:49:45,978 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-25 15:49:45,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:45,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 52 conjunts are in the unsatisfiable core [2019-02-25 15:49:45,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:45,987 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:45,987 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:45,993 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:45,994 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:46,342 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:46,342 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:46,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:46,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-02-25 15:49:46,699 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:46,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-25 15:49:46,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-25 15:49:46,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-02-25 15:49:46,702 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2019-02-25 15:49:46,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:46,892 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-02-25 15:49:46,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-25 15:49:46,892 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2019-02-25 15:49:46,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:46,893 INFO L225 Difference]: With dead ends: 67 [2019-02-25 15:49:46,893 INFO L226 Difference]: Without dead ends: 66 [2019-02-25 15:49:46,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-02-25 15:49:46,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-02-25 15:49:46,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-02-25 15:49:46,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-25 15:49:46,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-02-25 15:49:46,903 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2019-02-25 15:49:46,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:46,903 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-02-25 15:49:46,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-25 15:49:46,903 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-02-25 15:49:46,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-25 15:49:46,905 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:46,905 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2019-02-25 15:49:46,905 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:46,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:46,906 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times [2019-02-25 15:49:46,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:46,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:46,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:46,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:46,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:47,673 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:47,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:47,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:47,674 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:47,674 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:49:47,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:47,674 INFO 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:49:47,684 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:49:47,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:49:47,709 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:49:47,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:47,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 55 conjunts are in the unsatisfiable core [2019-02-25 15:49:47,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:47,720 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:47,720 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:47,725 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:47,726 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:47,945 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:47,946 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:48,297 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:48,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:48,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-02-25 15:49:48,317 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:48,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-25 15:49:48,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-25 15:49:48,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:49:48,319 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2019-02-25 15:49:48,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:48,447 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-02-25 15:49:48,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-25 15:49:48,448 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2019-02-25 15:49:48,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:48,449 INFO L225 Difference]: With dead ends: 71 [2019-02-25 15:49:48,449 INFO L226 Difference]: Without dead ends: 70 [2019-02-25 15:49:48,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:49:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-25 15:49:48,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-02-25 15:49:48,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-25 15:49:48,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-02-25 15:49:48,457 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2019-02-25 15:49:48,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:48,457 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-02-25 15:49:48,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-25 15:49:48,457 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-02-25 15:49:48,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-25 15:49:48,458 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:48,458 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2019-02-25 15:49:48,459 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:48,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:48,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times [2019-02-25 15:49:48,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:48,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:48,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:48,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:48,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:48,756 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:48,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:48,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:48,757 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:48,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:49:48,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:48,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:49:48,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:48,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:49:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:48,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 58 conjunts are in the unsatisfiable core [2019-02-25 15:49:48,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:48,815 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:48,816 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:48,868 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:48,869 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:50,481 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:51,203 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:51,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:51,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-02-25 15:49:51,222 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:51,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-25 15:49:51,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-25 15:49:51,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-02-25 15:49:51,224 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2019-02-25 15:49:51,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:51,353 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-02-25 15:49:51,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-25 15:49:51,355 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2019-02-25 15:49:51,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:51,356 INFO L225 Difference]: With dead ends: 75 [2019-02-25 15:49:51,356 INFO L226 Difference]: Without dead ends: 74 [2019-02-25 15:49:51,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-02-25 15:49:51,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-02-25 15:49:51,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-02-25 15:49:51,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-25 15:49:51,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-02-25 15:49:51,363 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2019-02-25 15:49:51,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:51,364 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-02-25 15:49:51,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-25 15:49:51,364 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-02-25 15:49:51,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-25 15:49:51,365 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:51,365 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2019-02-25 15:49:51,365 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:51,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:51,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times [2019-02-25 15:49:51,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:51,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:51,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:51,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:51,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:51,682 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:51,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:51,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:51,683 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:51,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:49:51,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:51,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:49:51,692 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:49:51,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:49:51,731 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-25 15:49:51,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:51,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 61 conjunts are in the unsatisfiable core [2019-02-25 15:49:51,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:51,743 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:51,743 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:51,752 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:51,752 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:52,010 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:52,010 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:52,673 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:52,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:52,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-02-25 15:49:52,697 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:52,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-25 15:49:52,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-25 15:49:52,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-02-25 15:49:52,699 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2019-02-25 15:49:52,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:52,810 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-02-25 15:49:52,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-25 15:49:52,811 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2019-02-25 15:49:52,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:52,812 INFO L225 Difference]: With dead ends: 79 [2019-02-25 15:49:52,812 INFO L226 Difference]: Without dead ends: 78 [2019-02-25 15:49:52,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-02-25 15:49:52,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-02-25 15:49:52,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-02-25 15:49:52,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-25 15:49:52,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-02-25 15:49:52,817 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2019-02-25 15:49:52,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:52,818 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-02-25 15:49:52,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-25 15:49:52,818 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-02-25 15:49:52,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-25 15:49:52,819 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:52,819 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2019-02-25 15:49:52,819 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:52,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:52,820 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times [2019-02-25 15:49:52,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:52,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:52,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:52,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:52,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:53,154 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:53,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:53,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:53,154 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:53,154 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:49:53,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:53,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:49:53,164 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:49:53,164 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:49:53,188 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:49:53,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:53,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 64 conjunts are in the unsatisfiable core [2019-02-25 15:49:53,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:53,194 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:53,195 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:53,202 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:53,202 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:53,575 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:53,575 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:54,059 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:54,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:54,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-02-25 15:49:54,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:54,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-25 15:49:54,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-25 15:49:54,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-02-25 15:49:54,081 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2019-02-25 15:49:54,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:54,224 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-02-25 15:49:54,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-25 15:49:54,225 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2019-02-25 15:49:54,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:54,226 INFO L225 Difference]: With dead ends: 83 [2019-02-25 15:49:54,226 INFO L226 Difference]: Without dead ends: 82 [2019-02-25 15:49:54,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-02-25 15:49:54,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-25 15:49:54,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-02-25 15:49:54,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-25 15:49:54,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-02-25 15:49:54,232 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2019-02-25 15:49:54,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:54,233 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-02-25 15:49:54,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-25 15:49:54,233 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-02-25 15:49:54,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-25 15:49:54,234 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:54,234 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2019-02-25 15:49:54,234 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:54,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:54,234 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times [2019-02-25 15:49:54,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:54,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:54,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:54,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:54,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:54,583 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:54,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:54,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:54,583 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:54,583 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:49:54,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:54,584 INFO 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:49:54,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:54,598 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:49:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:54,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 67 conjunts are in the unsatisfiable core [2019-02-25 15:49:54,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:54,629 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:54,629 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:54,638 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:54,638 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:55,004 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:55,004 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:55,583 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:55,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:55,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-02-25 15:49:55,602 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:55,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-25 15:49:55,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-25 15:49:55,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-02-25 15:49:55,605 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2019-02-25 15:49:55,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:55,758 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-02-25 15:49:55,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-25 15:49:55,759 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2019-02-25 15:49:55,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:55,760 INFO L225 Difference]: With dead ends: 87 [2019-02-25 15:49:55,760 INFO L226 Difference]: Without dead ends: 86 [2019-02-25 15:49:55,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-02-25 15:49:55,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-02-25 15:49:55,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-02-25 15:49:55,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-25 15:49:55,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-02-25 15:49:55,766 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2019-02-25 15:49:55,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:55,767 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-02-25 15:49:55,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-25 15:49:55,767 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-02-25 15:49:55,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-25 15:49:55,768 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:55,768 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2019-02-25 15:49:55,768 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:55,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:55,768 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times [2019-02-25 15:49:55,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:55,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:55,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:55,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:55,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:56,377 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:56,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:56,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:56,378 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:56,378 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:49:56,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:56,378 INFO 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:49:56,387 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:49:56,387 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:49:56,439 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-02-25 15:49:56,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:56,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 70 conjunts are in the unsatisfiable core [2019-02-25 15:49:56,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:56,449 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:56,450 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:56,465 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:56,465 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:56,832 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:56,832 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:57,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:57,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-02-25 15:49:57,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:57,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-25 15:49:57,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-25 15:49:57,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-02-25 15:49:57,779 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2019-02-25 15:49:57,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:57,947 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-02-25 15:49:57,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-25 15:49:57,947 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2019-02-25 15:49:57,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:57,948 INFO L225 Difference]: With dead ends: 91 [2019-02-25 15:49:57,949 INFO L226 Difference]: Without dead ends: 90 [2019-02-25 15:49:57,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-02-25 15:49:57,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-25 15:49:57,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-02-25 15:49:57,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-25 15:49:57,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-02-25 15:49:57,954 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2019-02-25 15:49:57,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:57,954 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-02-25 15:49:57,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-25 15:49:57,954 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-02-25 15:49:57,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-25 15:49:57,955 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:57,955 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2019-02-25 15:49:57,955 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:57,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:57,955 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times [2019-02-25 15:49:57,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:57,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:57,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:57,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:57,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:58,302 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:58,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:58,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:58,303 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:58,303 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:49:58,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:58,303 INFO 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:49:58,313 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:49:58,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:49:58,340 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:49:58,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:58,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 73 conjunts are in the unsatisfiable core [2019-02-25 15:49:58,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:58,347 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:58,347 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:58,358 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:58,358 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:58,755 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:58,756 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:59,408 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:59,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:59,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-02-25 15:49:59,428 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:59,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-25 15:49:59,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-25 15:49:59,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-02-25 15:49:59,430 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2019-02-25 15:49:59,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:59,605 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-02-25 15:49:59,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-25 15:49:59,609 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2019-02-25 15:49:59,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:59,610 INFO L225 Difference]: With dead ends: 95 [2019-02-25 15:49:59,610 INFO L226 Difference]: Without dead ends: 94 [2019-02-25 15:49:59,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-02-25 15:49:59,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-25 15:49:59,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-02-25 15:49:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-25 15:49:59,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-02-25 15:49:59,614 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2019-02-25 15:49:59,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:59,615 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-02-25 15:49:59,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-25 15:49:59,615 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-02-25 15:49:59,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-25 15:49:59,616 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:59,616 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2019-02-25 15:49:59,616 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:59,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:59,616 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times [2019-02-25 15:49:59,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:59,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:59,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:59,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:59,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:00,273 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:00,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:00,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:00,274 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:00,274 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:50:00,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:00,274 INFO 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:50:00,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:50:00,284 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:50:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:00,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 76 conjunts are in the unsatisfiable core [2019-02-25 15:50:00,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:00,320 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:00,320 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:00,328 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:00,329 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:00,794 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:00,795 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:01,912 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:01,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:01,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-02-25 15:50:01,932 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:01,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-25 15:50:01,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-25 15:50:01,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-02-25 15:50:01,934 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2019-02-25 15:50:02,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:02,083 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-02-25 15:50:02,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-25 15:50:02,084 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2019-02-25 15:50:02,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:02,085 INFO L225 Difference]: With dead ends: 99 [2019-02-25 15:50:02,085 INFO L226 Difference]: Without dead ends: 98 [2019-02-25 15:50:02,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-02-25 15:50:02,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-25 15:50:02,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-02-25 15:50:02,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-25 15:50:02,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-02-25 15:50:02,091 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2019-02-25 15:50:02,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:02,091 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-02-25 15:50:02,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-25 15:50:02,092 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-02-25 15:50:02,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-25 15:50:02,092 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:02,092 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2019-02-25 15:50:02,092 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:02,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:02,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times [2019-02-25 15:50:02,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:02,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:02,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:50:02,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:02,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:02,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:02,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:02,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:02,636 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:02,636 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:50:02,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:02,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:50:02,650 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:50:02,650 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:50:02,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-25 15:50:02,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:50:02,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 79 conjunts are in the unsatisfiable core [2019-02-25 15:50:02,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:02,736 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:02,737 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:02,784 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:02,784 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:03,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:03,367 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:04,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:04,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:04,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-02-25 15:50:04,394 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:04,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-25 15:50:04,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-25 15:50:04,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-02-25 15:50:04,396 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2019-02-25 15:50:04,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:04,618 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-02-25 15:50:04,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-25 15:50:04,618 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2019-02-25 15:50:04,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:04,620 INFO L225 Difference]: With dead ends: 103 [2019-02-25 15:50:04,620 INFO L226 Difference]: Without dead ends: 102 [2019-02-25 15:50:04,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-02-25 15:50:04,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-02-25 15:50:04,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-02-25 15:50:04,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-25 15:50:04,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-02-25 15:50:04,625 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2019-02-25 15:50:04,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:04,626 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-02-25 15:50:04,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-25 15:50:04,626 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-02-25 15:50:04,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-25 15:50:04,626 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:04,626 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2019-02-25 15:50:04,627 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:04,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:04,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times [2019-02-25 15:50:04,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:04,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:04,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:50:04,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:04,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:05,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:05,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:05,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:05,055 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:05,055 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:50:05,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:05,056 INFO 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:50:05,065 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:50:05,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:50:05,109 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:50:05,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:50:05,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 82 conjunts are in the unsatisfiable core [2019-02-25 15:50:05,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:05,119 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:05,119 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:05,142 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:05,142 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:05,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:05,602 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:06,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:06,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:06,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-02-25 15:50:06,924 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:06,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-25 15:50:06,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-25 15:50:06,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-02-25 15:50:06,925 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2019-02-25 15:50:07,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:07,127 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-02-25 15:50:07,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-25 15:50:07,128 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2019-02-25 15:50:07,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:07,129 INFO L225 Difference]: With dead ends: 107 [2019-02-25 15:50:07,129 INFO L226 Difference]: Without dead ends: 106 [2019-02-25 15:50:07,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-02-25 15:50:07,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-25 15:50:07,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-02-25 15:50:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-25 15:50:07,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-02-25 15:50:07,135 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2019-02-25 15:50:07,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:07,135 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-02-25 15:50:07,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-25 15:50:07,135 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-02-25 15:50:07,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-25 15:50:07,136 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:07,136 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2019-02-25 15:50:07,136 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:07,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:07,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times [2019-02-25 15:50:07,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:07,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:07,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:50:07,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:07,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:08,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:08,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:08,624 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:08,624 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:50:08,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:08,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:50:08,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:50:08,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:50:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:08,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 85 conjunts are in the unsatisfiable core [2019-02-25 15:50:08,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:08,678 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:08,678 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:08,691 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:08,692 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:09,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:09,228 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:10,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:10,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-02-25 15:50:10,166 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:10,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-25 15:50:10,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-25 15:50:10,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:50:10,169 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2019-02-25 15:50:10,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:10,382 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-02-25 15:50:10,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-25 15:50:10,382 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2019-02-25 15:50:10,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:10,383 INFO L225 Difference]: With dead ends: 111 [2019-02-25 15:50:10,383 INFO L226 Difference]: Without dead ends: 110 [2019-02-25 15:50:10,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:50:10,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-25 15:50:10,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-02-25 15:50:10,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-25 15:50:10,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-02-25 15:50:10,388 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2019-02-25 15:50:10,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:10,388 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-02-25 15:50:10,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-25 15:50:10,389 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-02-25 15:50:10,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-25 15:50:10,389 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:10,389 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2019-02-25 15:50:10,389 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:10,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:10,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times [2019-02-25 15:50:10,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:10,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:10,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:50:10,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:10,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:10,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:10,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:10,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:10,951 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:10,951 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:50:10,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:10,952 INFO 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:50:10,960 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:50:10,960 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:50:11,036 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-25 15:50:11,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:50:11,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 88 conjunts are in the unsatisfiable core [2019-02-25 15:50:11,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:11,044 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:11,044 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:11,053 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:11,053 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:11,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:11,792 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:12,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:12,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:12,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-02-25 15:50:12,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:12,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-25 15:50:12,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-25 15:50:12,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-02-25 15:50:12,833 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2019-02-25 15:50:13,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:13,020 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-02-25 15:50:13,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-25 15:50:13,021 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2019-02-25 15:50:13,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:13,022 INFO L225 Difference]: With dead ends: 115 [2019-02-25 15:50:13,022 INFO L226 Difference]: Without dead ends: 114 [2019-02-25 15:50:13,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-02-25 15:50:13,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-02-25 15:50:13,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-02-25 15:50:13,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-25 15:50:13,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-02-25 15:50:13,028 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2019-02-25 15:50:13,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:13,028 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-02-25 15:50:13,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-25 15:50:13,029 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-02-25 15:50:13,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-02-25 15:50:13,029 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:13,030 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2019-02-25 15:50:13,030 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:13,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:13,030 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times [2019-02-25 15:50:13,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:13,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:13,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:50:13,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:13,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:13,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:13,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:13,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:13,564 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:13,564 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:50:13,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:13,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:50:13,574 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:50:13,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:50:13,607 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:50:13,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:50:13,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 91 conjunts are in the unsatisfiable core [2019-02-25 15:50:13,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:13,631 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:13,631 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:13,643 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:13,643 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:14,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:14,285 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:15,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:15,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:15,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-02-25 15:50:15,303 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:15,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-25 15:50:15,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-25 15:50:15,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:50:15,305 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2019-02-25 15:50:15,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:15,499 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-02-25 15:50:15,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-25 15:50:15,500 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2019-02-25 15:50:15,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:15,501 INFO L225 Difference]: With dead ends: 119 [2019-02-25 15:50:15,501 INFO L226 Difference]: Without dead ends: 118 [2019-02-25 15:50:15,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:50:15,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-02-25 15:50:15,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-02-25 15:50:15,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-02-25 15:50:15,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-02-25 15:50:15,508 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2019-02-25 15:50:15,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:15,508 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-02-25 15:50:15,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-25 15:50:15,508 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-02-25 15:50:15,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-02-25 15:50:15,509 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:15,509 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2019-02-25 15:50:15,509 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:15,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:15,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times [2019-02-25 15:50:15,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:15,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:15,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:50:15,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:15,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:16,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:16,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:16,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:16,092 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:16,092 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:50:16,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:16,092 INFO 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:50:16,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:50:16,101 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:50:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:16,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 94 conjunts are in the unsatisfiable core [2019-02-25 15:50:16,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:16,143 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:16,143 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:16,151 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:16,151 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:17,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:17,238 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:18,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:18,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:18,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-02-25 15:50:18,374 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:18,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-25 15:50:18,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-25 15:50:18,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-02-25 15:50:18,376 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2019-02-25 15:50:18,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:18,596 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-02-25 15:50:18,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-25 15:50:18,596 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2019-02-25 15:50:18,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:18,598 INFO L225 Difference]: With dead ends: 123 [2019-02-25 15:50:18,598 INFO L226 Difference]: Without dead ends: 122 [2019-02-25 15:50:18,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-02-25 15:50:18,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-02-25 15:50:18,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-02-25 15:50:18,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-25 15:50:18,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-02-25 15:50:18,604 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2019-02-25 15:50:18,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:18,605 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-02-25 15:50:18,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-25 15:50:18,605 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-02-25 15:50:18,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-02-25 15:50:18,606 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:18,606 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2019-02-25 15:50:18,606 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:18,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:18,606 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times [2019-02-25 15:50:18,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:18,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:18,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:50:18,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:18,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:19,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:19,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:19,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:19,170 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:19,170 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:50:19,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:19,171 INFO 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:50:19,179 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:50:19,179 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:50:19,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-02-25 15:50:19,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:50:19,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 97 conjunts are in the unsatisfiable core [2019-02-25 15:50:19,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:19,283 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:19,284 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:19,339 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:19,340 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:20,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:20,015 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:21,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:21,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:21,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-02-25 15:50:21,198 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:21,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-25 15:50:21,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-25 15:50:21,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-02-25 15:50:21,201 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2019-02-25 15:50:21,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:21,422 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-02-25 15:50:21,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-25 15:50:21,422 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2019-02-25 15:50:21,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:21,423 INFO L225 Difference]: With dead ends: 127 [2019-02-25 15:50:21,423 INFO L226 Difference]: Without dead ends: 126 [2019-02-25 15:50:21,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-02-25 15:50:21,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-02-25 15:50:21,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-02-25 15:50:21,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-02-25 15:50:21,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-02-25 15:50:21,428 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2019-02-25 15:50:21,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:21,428 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-02-25 15:50:21,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-25 15:50:21,428 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-02-25 15:50:21,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-02-25 15:50:21,429 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:21,429 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2019-02-25 15:50:21,429 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:21,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:21,429 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times [2019-02-25 15:50:21,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:21,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:21,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:50:21,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:21,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:22,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:22,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:22,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:22,095 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:22,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:50:22,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:22,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:50:22,106 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:50:22,106 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:50:22,146 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:50:22,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:50:22,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 100 conjunts are in the unsatisfiable core [2019-02-25 15:50:22,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:22,154 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:22,154 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:22,162 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:22,162 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:22,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:22,863 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:24,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:24,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:24,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-02-25 15:50:24,121 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:24,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-25 15:50:24,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-25 15:50:24,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-02-25 15:50:24,123 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2019-02-25 15:50:24,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:24,358 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-02-25 15:50:24,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-25 15:50:24,359 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2019-02-25 15:50:24,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:24,360 INFO L225 Difference]: With dead ends: 131 [2019-02-25 15:50:24,360 INFO L226 Difference]: Without dead ends: 130 [2019-02-25 15:50:24,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3782 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-02-25 15:50:24,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-02-25 15:50:24,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-02-25 15:50:24,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-02-25 15:50:24,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-02-25 15:50:24,366 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2019-02-25 15:50:24,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:24,366 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-02-25 15:50:24,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-25 15:50:24,366 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-02-25 15:50:24,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-02-25 15:50:24,367 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:24,367 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2019-02-25 15:50:24,367 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:24,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:24,368 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times [2019-02-25 15:50:24,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:24,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:24,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:50:24,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:24,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:25,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:25,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:25,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:25,078 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:25,078 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:50:25,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:25,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 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:50:25,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:50:25,088 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:50:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:25,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 103 conjunts are in the unsatisfiable core [2019-02-25 15:50:25,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:25,132 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:25,132 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:25,140 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:25,140 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:25,863 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:27,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:27,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-02-25 15:50:27,495 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:27,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-25 15:50:27,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-25 15:50:27,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-02-25 15:50:27,497 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2019-02-25 15:50:27,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:27,716 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-02-25 15:50:27,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-25 15:50:27,717 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2019-02-25 15:50:27,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:27,718 INFO L225 Difference]: With dead ends: 135 [2019-02-25 15:50:27,719 INFO L226 Difference]: Without dead ends: 134 [2019-02-25 15:50:27,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-02-25 15:50:27,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-02-25 15:50:27,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-02-25 15:50:27,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-25 15:50:27,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-02-25 15:50:27,725 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2019-02-25 15:50:27,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:27,725 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-02-25 15:50:27,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-25 15:50:27,725 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-02-25 15:50:27,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-02-25 15:50:27,726 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:27,726 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2019-02-25 15:50:27,726 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:27,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:27,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times [2019-02-25 15:50:27,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:27,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:27,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:50:27,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:27,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:28,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:28,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:28,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:28,416 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:28,416 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:50:28,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:28,416 INFO 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:50:28,424 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:50:28,424 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:50:28,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-02-25 15:50:28,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:50:28,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 106 conjunts are in the unsatisfiable core [2019-02-25 15:50:28,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:28,561 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:28,561 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:28,570 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:28,570 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:29,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:29,580 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:31,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:31,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:31,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-02-25 15:50:31,137 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:31,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-25 15:50:31,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-25 15:50:31,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-02-25 15:50:31,138 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2019-02-25 15:50:31,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:31,373 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-02-25 15:50:31,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-25 15:50:31,374 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2019-02-25 15:50:31,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:31,375 INFO L225 Difference]: With dead ends: 139 [2019-02-25 15:50:31,375 INFO L226 Difference]: Without dead ends: 138 [2019-02-25 15:50:31,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-02-25 15:50:31,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-02-25 15:50:31,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-02-25 15:50:31,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-02-25 15:50:31,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-02-25 15:50:31,380 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2019-02-25 15:50:31,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:31,381 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-02-25 15:50:31,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-25 15:50:31,381 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-02-25 15:50:31,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-02-25 15:50:31,381 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:31,382 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2019-02-25 15:50:31,382 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:31,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:31,382 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times [2019-02-25 15:50:31,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:31,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:31,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:50:31,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:31,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:32,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:32,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:32,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:32,310 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:32,311 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:50:32,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:32,311 INFO 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:50:32,319 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:50:32,320 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:50:32,359 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:50:32,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:50:32,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 109 conjunts are in the unsatisfiable core [2019-02-25 15:50:32,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:32,396 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:32,397 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:32,481 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:32,481 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:34,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:34,218 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:35,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:35,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:35,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-02-25 15:50:35,768 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:35,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-25 15:50:35,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-25 15:50:35,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-02-25 15:50:35,770 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2019-02-25 15:50:36,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:36,111 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-02-25 15:50:36,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-25 15:50:36,112 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2019-02-25 15:50:36,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:36,113 INFO L225 Difference]: With dead ends: 143 [2019-02-25 15:50:36,113 INFO L226 Difference]: Without dead ends: 142 [2019-02-25 15:50:36,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-02-25 15:50:36,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-02-25 15:50:36,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-02-25 15:50:36,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-02-25 15:50:36,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-02-25 15:50:36,119 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2019-02-25 15:50:36,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:36,120 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-02-25 15:50:36,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-25 15:50:36,120 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-02-25 15:50:36,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-02-25 15:50:36,121 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:36,121 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2019-02-25 15:50:36,121 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:36,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:36,122 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times [2019-02-25 15:50:36,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:36,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:36,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:50:36,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:36,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:39,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:39,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:39,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:39,636 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:39,636 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:50:39,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:39,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:50:39,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:50:39,645 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:50:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:39,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 112 conjunts are in the unsatisfiable core [2019-02-25 15:50:39,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:39,693 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:39,693 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:39,703 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:39,704 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:40,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:40,616 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:42,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:42,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:42,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-02-25 15:50:42,409 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:42,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-25 15:50:42,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-25 15:50:42,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-02-25 15:50:42,411 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2019-02-25 15:50:42,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:42,836 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-02-25 15:50:42,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-25 15:50:42,837 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2019-02-25 15:50:42,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:42,838 INFO L225 Difference]: With dead ends: 147 [2019-02-25 15:50:42,838 INFO L226 Difference]: Without dead ends: 146 [2019-02-25 15:50:42,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-02-25 15:50:42,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-02-25 15:50:42,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-02-25 15:50:42,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-02-25 15:50:42,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-02-25 15:50:42,845 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2019-02-25 15:50:42,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:42,845 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-02-25 15:50:42,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-25 15:50:42,846 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-02-25 15:50:42,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-02-25 15:50:42,846 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:42,847 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2019-02-25 15:50:42,847 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:42,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:42,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times [2019-02-25 15:50:42,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:42,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:42,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:50:42,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:42,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:43,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:43,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:43,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:43,647 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:43,647 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:50:43,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:43,648 INFO 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:50:43,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:50:43,655 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:50:43,776 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-02-25 15:50:43,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:50:43,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 115 conjunts are in the unsatisfiable core [2019-02-25 15:50:43,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:43,784 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:43,784 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:43,793 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:43,793 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:44,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:44,628 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:46,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:46,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:46,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-02-25 15:50:46,335 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:46,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-25 15:50:46,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-25 15:50:46,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-02-25 15:50:46,338 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2019-02-25 15:50:46,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:46,758 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-02-25 15:50:46,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-25 15:50:46,758 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2019-02-25 15:50:46,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:46,760 INFO L225 Difference]: With dead ends: 151 [2019-02-25 15:50:46,760 INFO L226 Difference]: Without dead ends: 150 [2019-02-25 15:50:46,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5112 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-02-25 15:50:46,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-02-25 15:50:46,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-02-25 15:50:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-02-25 15:50:46,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-02-25 15:50:46,766 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2019-02-25 15:50:46,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:46,767 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2019-02-25 15:50:46,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-25 15:50:46,767 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2019-02-25 15:50:46,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-02-25 15:50:46,768 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:46,768 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2019-02-25 15:50:46,768 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:46,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:46,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times [2019-02-25 15:50:46,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:46,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:46,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:50:46,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:46,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:47,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:47,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:47,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:47,954 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:47,954 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:50:47,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:47,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:50:47,972 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:50:47,972 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:50:48,030 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:50:48,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:50:48,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 118 conjunts are in the unsatisfiable core [2019-02-25 15:50:48,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:48,055 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:48,056 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:48,156 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:48,157 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:49,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:49,284 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:51,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:51,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:51,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-02-25 15:50:51,081 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:51,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-25 15:50:51,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-25 15:50:51,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-02-25 15:50:51,084 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2019-02-25 15:50:51,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:51,415 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-02-25 15:50:51,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-25 15:50:51,415 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2019-02-25 15:50:51,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:51,417 INFO L225 Difference]: With dead ends: 155 [2019-02-25 15:50:51,417 INFO L226 Difference]: Without dead ends: 154 [2019-02-25 15:50:51,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5402 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-02-25 15:50:51,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-02-25 15:50:51,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-02-25 15:50:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-02-25 15:50:51,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-02-25 15:50:51,424 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2019-02-25 15:50:51,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:51,425 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2019-02-25 15:50:51,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-25 15:50:51,425 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2019-02-25 15:50:51,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-02-25 15:50:51,426 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:51,426 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2019-02-25 15:50:51,426 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:51,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:51,427 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times [2019-02-25 15:50:51,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:51,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:51,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:50:51,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:51,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:53,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:53,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:53,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:53,893 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:53,893 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:50:53,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:53,893 INFO 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:50:53,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:50:53,902 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:50:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:53,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 121 conjunts are in the unsatisfiable core [2019-02-25 15:50:53,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:53,955 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:53,955 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:53,965 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:53,965 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:55,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:55,097 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:56,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:56,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:56,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-02-25 15:50:56,999 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:57,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-25 15:50:57,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-25 15:50:57,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-02-25 15:50:57,002 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2019-02-25 15:50:57,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:57,270 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-02-25 15:50:57,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-25 15:50:57,270 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2019-02-25 15:50:57,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:57,271 INFO L225 Difference]: With dead ends: 159 [2019-02-25 15:50:57,271 INFO L226 Difference]: Without dead ends: 158 [2019-02-25 15:50:57,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5700 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-02-25 15:50:57,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-02-25 15:50:57,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-02-25 15:50:57,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-02-25 15:50:57,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-02-25 15:50:57,278 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2019-02-25 15:50:57,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:57,278 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-02-25 15:50:57,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-25 15:50:57,279 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-02-25 15:50:57,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-02-25 15:50:57,279 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:57,280 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2019-02-25 15:50:57,280 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:57,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:57,280 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times [2019-02-25 15:50:57,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:57,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:57,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:50:57,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:57,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:58,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:58,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:58,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:58,771 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:58,771 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:50:58,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:58,771 INFO 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:50:58,781 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:50:58,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:50:58,901 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-02-25 15:50:58,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:50:58,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 124 conjunts are in the unsatisfiable core [2019-02-25 15:50:58,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:58,913 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:58,913 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:58,921 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:58,921 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:59,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:59,952 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:02,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:02,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:02,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-02-25 15:51:02,051 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:02,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-25 15:51:02,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-25 15:51:02,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-02-25 15:51:02,052 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2019-02-25 15:51:02,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:02,392 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2019-02-25 15:51:02,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-25 15:51:02,393 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2019-02-25 15:51:02,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:02,394 INFO L225 Difference]: With dead ends: 163 [2019-02-25 15:51:02,395 INFO L226 Difference]: Without dead ends: 162 [2019-02-25 15:51:02,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6006 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-02-25 15:51:02,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-02-25 15:51:02,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-02-25 15:51:02,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-02-25 15:51:02,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-02-25 15:51:02,401 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2019-02-25 15:51:02,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:02,401 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-02-25 15:51:02,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-25 15:51:02,402 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-02-25 15:51:02,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-02-25 15:51:02,402 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:02,403 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2019-02-25 15:51:02,403 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:02,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:02,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times [2019-02-25 15:51:02,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:02,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:02,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:51:02,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:02,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:03,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:03,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:03,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:03,345 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:51:03,345 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:51:03,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:03,345 INFO 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:51:03,355 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:51:03,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:51:03,401 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:51:03,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:51:03,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 127 conjunts are in the unsatisfiable core [2019-02-25 15:51:03,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:03,420 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:51:03,421 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:03,427 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:03,428 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:51:04,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:04,467 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:06,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:06,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:06,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-02-25 15:51:06,599 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:06,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-25 15:51:06,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-25 15:51:06,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-02-25 15:51:06,602 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2019-02-25 15:51:07,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:07,061 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-02-25 15:51:07,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-25 15:51:07,061 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2019-02-25 15:51:07,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:07,063 INFO L225 Difference]: With dead ends: 167 [2019-02-25 15:51:07,063 INFO L226 Difference]: Without dead ends: 166 [2019-02-25 15:51:07,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-02-25 15:51:07,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-02-25 15:51:07,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-02-25 15:51:07,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-02-25 15:51:07,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2019-02-25 15:51:07,069 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2019-02-25 15:51:07,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:07,069 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2019-02-25 15:51:07,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-25 15:51:07,069 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2019-02-25 15:51:07,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-02-25 15:51:07,070 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:07,070 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2019-02-25 15:51:07,070 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:07,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:07,070 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times [2019-02-25 15:51:07,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:07,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:07,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:51:07,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:07,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:08,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:08,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:08,251 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:51:08,251 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:51:08,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:08,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:51:08,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:08,260 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:08,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 130 conjunts are in the unsatisfiable core [2019-02-25 15:51:08,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:08,325 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:51:08,326 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:08,354 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:08,355 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:51:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:09,411 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:11,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:11,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:11,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-02-25 15:51:11,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:11,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-25 15:51:11,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-25 15:51:11,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-02-25 15:51:11,584 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2019-02-25 15:51:11,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:11,873 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-02-25 15:51:11,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-25 15:51:11,873 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2019-02-25 15:51:11,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:11,874 INFO L225 Difference]: With dead ends: 171 [2019-02-25 15:51:11,874 INFO L226 Difference]: Without dead ends: 170 [2019-02-25 15:51:11,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6642 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-02-25 15:51:11,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-02-25 15:51:11,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-02-25 15:51:11,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-02-25 15:51:11,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-02-25 15:51:11,881 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2019-02-25 15:51:11,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:11,881 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-02-25 15:51:11,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-25 15:51:11,882 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-02-25 15:51:11,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-02-25 15:51:11,882 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:11,883 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2019-02-25 15:51:11,883 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:11,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:11,883 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times [2019-02-25 15:51:11,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:11,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:11,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:11,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:11,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:13,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:13,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:13,126 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:51:13,127 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:51:13,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:13,127 INFO 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:51:13,136 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:51:13,136 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:51:13,275 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-02-25 15:51:13,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:51:13,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 133 conjunts are in the unsatisfiable core [2019-02-25 15:51:13,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:13,297 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:51:13,298 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:13,396 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:13,396 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:51:14,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:14,573 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:16,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:16,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:16,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-02-25 15:51:16,835 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:16,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-25 15:51:16,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-25 15:51:16,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-02-25 15:51:16,838 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2019-02-25 15:51:17,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:17,131 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-02-25 15:51:17,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-25 15:51:17,132 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2019-02-25 15:51:17,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:17,133 INFO L225 Difference]: With dead ends: 175 [2019-02-25 15:51:17,133 INFO L226 Difference]: Without dead ends: 174 [2019-02-25 15:51:17,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6972 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-02-25 15:51:17,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-02-25 15:51:17,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-02-25 15:51:17,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-02-25 15:51:17,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-02-25 15:51:17,140 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2019-02-25 15:51:17,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:17,140 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2019-02-25 15:51:17,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-25 15:51:17,140 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2019-02-25 15:51:17,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-02-25 15:51:17,141 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:17,141 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2019-02-25 15:51:17,141 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:17,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:17,142 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times [2019-02-25 15:51:17,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:17,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:17,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:51:17,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:17,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:18,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:18,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:18,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:18,836 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:51:18,836 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:51:18,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:18,837 INFO 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:51:18,847 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:51:18,847 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:51:18,895 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:51:18,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:51:18,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 136 conjunts are in the unsatisfiable core [2019-02-25 15:51:18,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:18,904 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:51:18,904 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:18,911 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:18,911 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:51:20,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:20,080 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:22,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:22,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-02-25 15:51:22,549 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:22,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-25 15:51:22,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-25 15:51:22,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-02-25 15:51:22,552 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2019-02-25 15:51:23,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:23,172 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-02-25 15:51:23,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-25 15:51:23,173 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2019-02-25 15:51:23,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:23,174 INFO L225 Difference]: With dead ends: 179 [2019-02-25 15:51:23,174 INFO L226 Difference]: Without dead ends: 178 [2019-02-25 15:51:23,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7310 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-02-25 15:51:23,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-02-25 15:51:23,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-02-25 15:51:23,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-02-25 15:51:23,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-02-25 15:51:23,179 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2019-02-25 15:51:23,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:23,179 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-02-25 15:51:23,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-25 15:51:23,179 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-02-25 15:51:23,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-02-25 15:51:23,180 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:23,180 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2019-02-25 15:51:23,180 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:23,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:23,181 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times [2019-02-25 15:51:23,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:23,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:23,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:51:23,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:23,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:25,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:25,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:25,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:25,553 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:51:25,553 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:51:25,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:25,553 INFO 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:51:25,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:25,562 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:25,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 139 conjunts are in the unsatisfiable core [2019-02-25 15:51:25,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:25,624 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:51:25,625 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:25,635 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:25,635 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:51:26,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:26,821 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:29,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:29,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:29,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-02-25 15:51:29,524 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:29,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-25 15:51:29,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-25 15:51:29,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-02-25 15:51:29,526 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2019-02-25 15:51:29,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:29,820 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-02-25 15:51:29,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-25 15:51:29,821 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2019-02-25 15:51:29,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:29,822 INFO L225 Difference]: With dead ends: 183 [2019-02-25 15:51:29,822 INFO L226 Difference]: Without dead ends: 182 [2019-02-25 15:51:29,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-02-25 15:51:29,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-02-25 15:51:29,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-02-25 15:51:29,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-02-25 15:51:29,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-02-25 15:51:29,826 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2019-02-25 15:51:29,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:29,826 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-02-25 15:51:29,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-25 15:51:29,826 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-02-25 15:51:29,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-02-25 15:51:29,827 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:29,827 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2019-02-25 15:51:29,827 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:29,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:29,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times [2019-02-25 15:51:29,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:29,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:29,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:29,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:29,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:31,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:31,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:31,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:31,099 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:51:31,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:51:31,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:31,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:51:31,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:51:31,109 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:51:31,259 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-02-25 15:51:31,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:51:31,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 142 conjunts are in the unsatisfiable core [2019-02-25 15:51:31,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:31,268 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:51:31,269 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:31,278 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:31,278 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:51:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:32,516 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:35,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:35,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:35,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-02-25 15:51:35,509 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:35,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-25 15:51:35,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-25 15:51:35,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-02-25 15:51:35,511 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2019-02-25 15:51:35,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:35,865 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2019-02-25 15:51:35,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-25 15:51:35,865 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2019-02-25 15:51:35,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:35,867 INFO L225 Difference]: With dead ends: 187 [2019-02-25 15:51:35,867 INFO L226 Difference]: Without dead ends: 186 [2019-02-25 15:51:35,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8010 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-02-25 15:51:35,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-02-25 15:51:35,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-02-25 15:51:35,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-02-25 15:51:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2019-02-25 15:51:35,874 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2019-02-25 15:51:35,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:35,874 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2019-02-25 15:51:35,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-25 15:51:35,874 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2019-02-25 15:51:35,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-02-25 15:51:35,875 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:35,875 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2019-02-25 15:51:35,875 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:35,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:35,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times [2019-02-25 15:51:35,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:35,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:35,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:51:35,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:35,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:37,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:37,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:37,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:37,518 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:51:37,518 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:51:37,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:37,518 INFO 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:51:37,527 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:51:37,527 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:51:37,580 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:51:37,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:51:37,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 145 conjunts are in the unsatisfiable core [2019-02-25 15:51:37,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:37,589 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:51:37,589 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:37,597 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:37,597 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:51:39,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:39,251 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:41,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:42,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:42,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-02-25 15:51:42,009 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:42,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-25 15:51:42,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-25 15:51:42,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-02-25 15:51:42,011 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2019-02-25 15:51:42,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:42,355 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-02-25 15:51:42,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-25 15:51:42,355 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2019-02-25 15:51:42,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:42,357 INFO L225 Difference]: With dead ends: 191 [2019-02-25 15:51:42,357 INFO L226 Difference]: Without dead ends: 190 [2019-02-25 15:51:42,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-02-25 15:51:42,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-02-25 15:51:42,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-02-25 15:51:42,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-02-25 15:51:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2019-02-25 15:51:42,362 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2019-02-25 15:51:42,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:42,363 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2019-02-25 15:51:42,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-25 15:51:42,363 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2019-02-25 15:51:42,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-02-25 15:51:42,363 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:42,364 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2019-02-25 15:51:42,364 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:42,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:42,364 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times [2019-02-25 15:51:42,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:42,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:42,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:51:42,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:42,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:44,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:44,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:44,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:44,324 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:51:44,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:51:44,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:44,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:51:44,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:44,333 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:44,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 148 conjunts are in the unsatisfiable core [2019-02-25 15:51:44,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:44,396 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:51:44,396 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:44,413 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:44,414 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:51:46,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:46,594 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:50,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:50,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:50,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-02-25 15:51:50,123 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:50,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-25 15:51:50,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-25 15:51:50,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-02-25 15:51:50,126 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2019-02-25 15:51:50,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:50,503 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-02-25 15:51:50,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-25 15:51:50,504 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2019-02-25 15:51:50,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:50,505 INFO L225 Difference]: With dead ends: 195 [2019-02-25 15:51:50,506 INFO L226 Difference]: Without dead ends: 194 [2019-02-25 15:51:50,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8742 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-02-25 15:51:50,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-02-25 15:51:50,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-02-25 15:51:50,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-02-25 15:51:50,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-02-25 15:51:50,512 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2019-02-25 15:51:50,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:50,512 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-02-25 15:51:50,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-25 15:51:50,512 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-02-25 15:51:50,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-02-25 15:51:50,513 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:50,513 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2019-02-25 15:51:50,513 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:50,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:50,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times [2019-02-25 15:51:50,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:50,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:50,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:50,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:50,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:51,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:51,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:51,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:51,752 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:51:51,752 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:51:51,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:51,752 INFO 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:51:51,761 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:51:51,762 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:51:51,940 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-02-25 15:51:51,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:51:51,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 151 conjunts are in the unsatisfiable core [2019-02-25 15:51:51,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:51,966 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:51:51,967 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:52,062 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:52,062 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:51:53,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:53,454 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:56,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:56,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:56,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-02-25 15:51:56,621 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:56,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-25 15:51:56,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-25 15:51:56,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-02-25 15:51:56,623 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2019-02-25 15:51:56,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:56,995 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2019-02-25 15:51:56,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-25 15:51:56,995 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2019-02-25 15:51:56,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:56,996 INFO L225 Difference]: With dead ends: 199 [2019-02-25 15:51:56,996 INFO L226 Difference]: Without dead ends: 198 [2019-02-25 15:51:56,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9120 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-02-25 15:51:56,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-02-25 15:51:57,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-02-25 15:51:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-02-25 15:51:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-02-25 15:51:57,003 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2019-02-25 15:51:57,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:57,003 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-02-25 15:51:57,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-25 15:51:57,003 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-02-25 15:51:57,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-02-25 15:51:57,004 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:57,005 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2019-02-25 15:51:57,005 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:57,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:57,005 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times [2019-02-25 15:51:57,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:57,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:57,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:51:57,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:57,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:58,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:58,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:58,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:58,238 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:51:58,238 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:51:58,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:58,238 INFO 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:51:58,247 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:51:58,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:51:58,302 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:51:58,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:51:58,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 154 conjunts are in the unsatisfiable core [2019-02-25 15:51:58,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:58,312 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:51:58,312 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:58,323 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:58,323 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:52:00,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:00,040 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:03,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:03,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-02-25 15:52:03,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:03,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-25 15:52:03,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-25 15:52:03,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-02-25 15:52:03,118 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2019-02-25 15:52:03,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:03,504 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-02-25 15:52:03,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-25 15:52:03,504 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2019-02-25 15:52:03,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:03,505 INFO L225 Difference]: With dead ends: 203 [2019-02-25 15:52:03,505 INFO L226 Difference]: Without dead ends: 202 [2019-02-25 15:52:03,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9506 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-02-25 15:52:03,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-02-25 15:52:03,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-02-25 15:52:03,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-02-25 15:52:03,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-02-25 15:52:03,510 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2019-02-25 15:52:03,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:03,510 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-02-25 15:52:03,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-25 15:52:03,511 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-02-25 15:52:03,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-02-25 15:52:03,511 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:03,511 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2019-02-25 15:52:03,512 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:03,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:03,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times [2019-02-25 15:52:03,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:03,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:03,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:03,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:03,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:05,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:05,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:05,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:05,132 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:05,132 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:52:05,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:05,132 INFO 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:52:05,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:05,141 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:05,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 157 conjunts are in the unsatisfiable core [2019-02-25 15:52:05,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:05,201 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:52:05,201 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,218 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,218 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:52:06,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:06,780 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:10,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:10,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:10,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-02-25 15:52:10,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:10,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-25 15:52:10,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-25 15:52:10,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-02-25 15:52:10,380 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2019-02-25 15:52:10,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:10,718 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-02-25 15:52:10,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-25 15:52:10,718 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2019-02-25 15:52:10,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:10,720 INFO L225 Difference]: With dead ends: 207 [2019-02-25 15:52:10,721 INFO L226 Difference]: Without dead ends: 206 [2019-02-25 15:52:10,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9900 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-02-25 15:52:10,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-02-25 15:52:10,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-02-25 15:52:10,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-02-25 15:52:10,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-02-25 15:52:10,727 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2019-02-25 15:52:10,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:10,727 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-02-25 15:52:10,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-25 15:52:10,728 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-02-25 15:52:10,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-02-25 15:52:10,729 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:10,729 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2019-02-25 15:52:10,729 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:10,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:10,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times [2019-02-25 15:52:10,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:10,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:10,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:10,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:10,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:12,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:12,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:12,213 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:12,213 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:12,214 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:52:12,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:12,214 INFO 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:52:12,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:52:12,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:52:12,413 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-02-25 15:52:12,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:12,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 160 conjunts are in the unsatisfiable core [2019-02-25 15:52:12,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:12,422 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:52:12,423 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:12,433 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:12,433 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:52:14,006 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:14,006 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:17,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:17,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2019-02-25 15:52:17,493 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:17,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-25 15:52:17,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-25 15:52:17,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-02-25 15:52:17,496 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2019-02-25 15:52:17,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:17,927 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-02-25 15:52:17,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-25 15:52:17,927 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2019-02-25 15:52:17,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:17,929 INFO L225 Difference]: With dead ends: 211 [2019-02-25 15:52:17,929 INFO L226 Difference]: Without dead ends: 210 [2019-02-25 15:52:17,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 304 SyntacticMatches, 2 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10397 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-02-25 15:52:17,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-02-25 15:52:17,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-02-25 15:52:17,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-02-25 15:52:17,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2019-02-25 15:52:17,936 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2019-02-25 15:52:17,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:17,936 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2019-02-25 15:52:17,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-25 15:52:17,937 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2019-02-25 15:52:17,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-02-25 15:52:17,938 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:17,938 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2019-02-25 15:52:17,938 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:17,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:17,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times [2019-02-25 15:52:17,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:17,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:17,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:17,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:17,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:19,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:19,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:19,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:19,625 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:19,625 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:52:19,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:19,625 INFO 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:52:19,634 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:52:19,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:52:19,713 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:52:19,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:19,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 163 conjunts are in the unsatisfiable core [2019-02-25 15:52:19,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:19,742 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:52:19,743 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:19,821 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:19,822 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:52:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:21,701 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:25,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:25,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:25,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 152 [2019-02-25 15:52:25,385 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:25,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-25 15:52:25,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-25 15:52:25,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-02-25 15:52:25,387 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2019-02-25 15:52:25,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:25,841 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-02-25 15:52:25,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-25 15:52:25,842 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2019-02-25 15:52:25,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:25,844 INFO L225 Difference]: With dead ends: 215 [2019-02-25 15:52:25,844 INFO L226 Difference]: Without dead ends: 214 [2019-02-25 15:52:25,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 310 SyntacticMatches, 4 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10894 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-02-25 15:52:25,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-02-25 15:52:25,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-02-25 15:52:25,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-25 15:52:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2019-02-25 15:52:25,850 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2019-02-25 15:52:25,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:25,850 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2019-02-25 15:52:25,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-25 15:52:25,851 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2019-02-25 15:52:25,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-02-25 15:52:25,852 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:25,852 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2019-02-25 15:52:25,852 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:25,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:25,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times [2019-02-25 15:52:25,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:25,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:25,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:25,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:25,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:27,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:27,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:27,285 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:27,285 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:52:27,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:27,285 INFO 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:52:27,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:27,294 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:27,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 166 conjunts are in the unsatisfiable core [2019-02-25 15:52:27,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:27,373 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:52:27,374 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:27,403 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:27,403 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:52:29,090 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:29,090 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:32,614 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:32,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:32,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 153 [2019-02-25 15:52:32,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:32,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-02-25 15:52:32,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-02-25 15:52:32,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-02-25 15:52:32,636 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2019-02-25 15:52:33,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:33,010 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-02-25 15:52:33,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-25 15:52:33,010 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2019-02-25 15:52:33,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:33,012 INFO L225 Difference]: With dead ends: 219 [2019-02-25 15:52:33,012 INFO L226 Difference]: Without dead ends: 218 [2019-02-25 15:52:33,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 316 SyntacticMatches, 6 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11391 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-02-25 15:52:33,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-02-25 15:52:33,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-02-25 15:52:33,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-02-25 15:52:33,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-02-25 15:52:33,018 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2019-02-25 15:52:33,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:33,018 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-02-25 15:52:33,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-02-25 15:52:33,018 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-02-25 15:52:33,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-02-25 15:52:33,019 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:33,019 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2019-02-25 15:52:33,020 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:33,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:33,020 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times [2019-02-25 15:52:33,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:33,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:33,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:33,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:33,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:34,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:34,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:34,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:34,947 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:34,947 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:52:34,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:34,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:52:34,956 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:52:34,956 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:52:35,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-02-25 15:52:35,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:35,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 169 conjunts are in the unsatisfiable core [2019-02-25 15:52:35,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:35,178 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:52:35,178 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,186 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,186 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:52:36,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:36,903 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:40,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:40,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:40,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 154 [2019-02-25 15:52:40,507 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:40,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-02-25 15:52:40,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-02-25 15:52:40,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-02-25 15:52:40,509 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2019-02-25 15:52:40,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:40,905 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2019-02-25 15:52:40,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-25 15:52:40,905 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2019-02-25 15:52:40,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:40,907 INFO L225 Difference]: With dead ends: 223 [2019-02-25 15:52:40,907 INFO L226 Difference]: Without dead ends: 222 [2019-02-25 15:52:40,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 322 SyntacticMatches, 8 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11888 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-02-25 15:52:40,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-02-25 15:52:40,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-02-25 15:52:40,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-02-25 15:52:40,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-02-25 15:52:40,912 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2019-02-25 15:52:40,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:40,912 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-02-25 15:52:40,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-02-25 15:52:40,912 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-02-25 15:52:40,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-02-25 15:52:40,913 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:40,913 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2019-02-25 15:52:40,914 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:40,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:40,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times [2019-02-25 15:52:40,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:40,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:40,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:40,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:40,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:42,404 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:42,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:42,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:42,404 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:42,405 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:52:42,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:42,405 INFO 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:52:42,415 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:52:42,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:52:42,482 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:52:42,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:42,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 172 conjunts are in the unsatisfiable core [2019-02-25 15:52:42,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:42,491 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:52:42,491 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,501 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,501 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:52:44,328 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:44,328 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:48,000 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:48,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:48,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 155 [2019-02-25 15:52:48,019 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:48,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-02-25 15:52:48,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-02-25 15:52:48,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-02-25 15:52:48,022 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2019-02-25 15:52:48,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:48,528 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2019-02-25 15:52:48,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-25 15:52:48,529 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2019-02-25 15:52:48,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:48,531 INFO L225 Difference]: With dead ends: 227 [2019-02-25 15:52:48,531 INFO L226 Difference]: Without dead ends: 226 [2019-02-25 15:52:48,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 328 SyntacticMatches, 10 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12385 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-02-25 15:52:48,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-02-25 15:52:48,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-02-25 15:52:48,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-02-25 15:52:48,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2019-02-25 15:52:48,538 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2019-02-25 15:52:48,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:48,538 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2019-02-25 15:52:48,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-02-25 15:52:48,538 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2019-02-25 15:52:48,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-02-25 15:52:48,539 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:48,540 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2019-02-25 15:52:48,540 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:48,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:48,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times [2019-02-25 15:52:48,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:48,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:48,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:48,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:48,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:50,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:50,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:50,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:50,342 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:50,342 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:52:50,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:50,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:52:50,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:50,352 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:50,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 175 conjunts are in the unsatisfiable core [2019-02-25 15:52:50,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:50,420 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:52:50,420 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:50,431 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:50,431 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:52:52,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:52,330 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:55,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:55,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:55,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 156 [2019-02-25 15:52:55,952 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:55,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-02-25 15:52:55,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-02-25 15:52:55,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-02-25 15:52:55,954 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2019-02-25 15:52:56,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:56,435 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-02-25 15:52:56,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-25 15:52:56,435 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2019-02-25 15:52:56,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:56,437 INFO L225 Difference]: With dead ends: 231 [2019-02-25 15:52:56,437 INFO L226 Difference]: Without dead ends: 230 [2019-02-25 15:52:56,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 334 SyntacticMatches, 12 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12882 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-02-25 15:52:56,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-02-25 15:52:56,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-02-25 15:52:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-02-25 15:52:56,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-02-25 15:52:56,444 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2019-02-25 15:52:56,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:56,444 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-02-25 15:52:56,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-02-25 15:52:56,444 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-02-25 15:52:56,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-02-25 15:52:56,445 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:56,446 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2019-02-25 15:52:56,446 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:56,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:56,446 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times [2019-02-25 15:52:56,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:56,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:56,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:56,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:56,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:58,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:58,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:58,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:58,016 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:58,016 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:52:58,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:58,016 INFO 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:52:58,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:52:58,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:52:58,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-02-25 15:52:58,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:58,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 178 conjunts are in the unsatisfiable core [2019-02-25 15:52:58,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:58,272 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:52:58,272 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:58,280 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:58,280 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:53:00,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:00,354 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:03,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:04,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:04,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 157 [2019-02-25 15:53:04,011 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:04,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-02-25 15:53:04,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-02-25 15:53:04,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-02-25 15:53:04,013 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2019-02-25 15:53:04,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:04,498 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-02-25 15:53:04,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-25 15:53:04,498 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2019-02-25 15:53:04,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:04,500 INFO L225 Difference]: With dead ends: 235 [2019-02-25 15:53:04,500 INFO L226 Difference]: Without dead ends: 234 [2019-02-25 15:53:04,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 340 SyntacticMatches, 14 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13379 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-02-25 15:53:04,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-02-25 15:53:04,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-02-25 15:53:04,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-02-25 15:53:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2019-02-25 15:53:04,506 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2019-02-25 15:53:04,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:04,506 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2019-02-25 15:53:04,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-02-25 15:53:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2019-02-25 15:53:04,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-02-25 15:53:04,508 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:04,508 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2019-02-25 15:53:04,508 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:04,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:04,508 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times [2019-02-25 15:53:04,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:04,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:04,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:53:04,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:04,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:06,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:06,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:06,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:06,457 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:53:06,458 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:53:06,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:06,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 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:53:06,466 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:53:06,466 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:53:06,535 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:53:06,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:53:06,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 181 conjunts are in the unsatisfiable core [2019-02-25 15:53:06,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:06,548 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:53:06,548 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:06,557 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:06,558 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:53:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:08,674 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:12,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:12,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:12,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 158 [2019-02-25 15:53:12,523 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:12,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-02-25 15:53:12,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-02-25 15:53:12,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-02-25 15:53:12,526 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2019-02-25 15:53:13,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:13,001 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2019-02-25 15:53:13,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-25 15:53:13,002 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2019-02-25 15:53:13,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:13,004 INFO L225 Difference]: With dead ends: 239 [2019-02-25 15:53:13,004 INFO L226 Difference]: Without dead ends: 238 [2019-02-25 15:53:13,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 346 SyntacticMatches, 16 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13876 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-02-25 15:53:13,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-02-25 15:53:13,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2019-02-25 15:53:13,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-02-25 15:53:13,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-02-25 15:53:13,009 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2019-02-25 15:53:13,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:13,009 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2019-02-25 15:53:13,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-02-25 15:53:13,009 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2019-02-25 15:53:13,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-02-25 15:53:13,010 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:13,010 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2019-02-25 15:53:13,011 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:13,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:13,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times [2019-02-25 15:53:13,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:13,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:13,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:53:13,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:13,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:14,852 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:14,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:14,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:14,853 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:53:14,853 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:53:14,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:14,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:14,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:14,863 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:14,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 184 conjunts are in the unsatisfiable core [2019-02-25 15:53:14,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:14,937 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:53:14,937 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:14,946 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:14,946 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:53:17,309 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:17,309 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:20,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:20,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:20,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 159 [2019-02-25 15:53:20,829 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:20,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-02-25 15:53:20,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-02-25 15:53:20,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-02-25 15:53:20,831 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2019-02-25 15:53:21,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:21,311 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2019-02-25 15:53:21,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-25 15:53:21,312 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2019-02-25 15:53:21,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:21,313 INFO L225 Difference]: With dead ends: 243 [2019-02-25 15:53:21,313 INFO L226 Difference]: Without dead ends: 242 [2019-02-25 15:53:21,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 352 SyntacticMatches, 18 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14373 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-02-25 15:53:21,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-02-25 15:53:21,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-02-25 15:53:21,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-02-25 15:53:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-02-25 15:53:21,317 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2019-02-25 15:53:21,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:21,318 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-02-25 15:53:21,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-02-25 15:53:21,318 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-02-25 15:53:21,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-02-25 15:53:21,319 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:21,319 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2019-02-25 15:53:21,319 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:21,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:21,320 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times [2019-02-25 15:53:21,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:21,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:21,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:21,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:21,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:23,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:23,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:23,170 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:53:23,170 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:53:23,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:23,170 INFO 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:53:23,179 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:53:23,180 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:53:23,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-02-25 15:53:23,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:53:23,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 187 conjunts are in the unsatisfiable core [2019-02-25 15:53:23,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:23,462 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:53:23,462 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:23,471 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:23,472 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:53:25,635 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:25,635 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:29,471 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:29,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:29,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 160 [2019-02-25 15:53:29,492 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:29,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-02-25 15:53:29,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-02-25 15:53:29,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-02-25 15:53:29,494 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2019-02-25 15:53:29,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:29,977 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2019-02-25 15:53:29,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-25 15:53:29,978 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2019-02-25 15:53:29,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:29,979 INFO L225 Difference]: With dead ends: 247 [2019-02-25 15:53:29,979 INFO L226 Difference]: Without dead ends: 246 [2019-02-25 15:53:29,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 358 SyntacticMatches, 20 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14870 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-02-25 15:53:29,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-02-25 15:53:29,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2019-02-25 15:53:29,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-02-25 15:53:29,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2019-02-25 15:53:29,984 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2019-02-25 15:53:29,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:29,985 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2019-02-25 15:53:29,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-02-25 15:53:29,985 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2019-02-25 15:53:29,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-02-25 15:53:29,986 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:29,986 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2019-02-25 15:53:29,986 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:29,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:29,987 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times [2019-02-25 15:53:29,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:29,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:29,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:53:29,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:29,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:32,182 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:32,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:32,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:32,182 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:53:32,182 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:53:32,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:32,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:32,215 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:53:32,215 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:53:32,302 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:53:32,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:53:32,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 190 conjunts are in the unsatisfiable core [2019-02-25 15:53:32,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:32,328 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:53:32,328 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:32,338 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:32,339 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:53:34,518 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:34,518 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:38,403 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:38,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:38,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 161 [2019-02-25 15:53:38,422 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:38,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-02-25 15:53:38,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-02-25 15:53:38,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-02-25 15:53:38,425 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2019-02-25 15:53:38,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:38,956 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2019-02-25 15:53:38,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-25 15:53:38,957 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2019-02-25 15:53:38,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:38,957 INFO L225 Difference]: With dead ends: 251 [2019-02-25 15:53:38,958 INFO L226 Difference]: Without dead ends: 250 [2019-02-25 15:53:38,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 364 SyntacticMatches, 22 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15367 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-02-25 15:53:38,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-02-25 15:53:38,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2019-02-25 15:53:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-02-25 15:53:38,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2019-02-25 15:53:38,965 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2019-02-25 15:53:38,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:38,965 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2019-02-25 15:53:38,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-02-25 15:53:38,965 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2019-02-25 15:53:38,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-02-25 15:53:38,966 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:38,967 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2019-02-25 15:53:38,967 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:38,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:38,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times [2019-02-25 15:53:38,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:38,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:38,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:53:38,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:38,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:40,880 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:40,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:40,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:40,880 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:53:40,881 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:53:40,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:40,881 INFO 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:53:40,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:40,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:40,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 193 conjunts are in the unsatisfiable core [2019-02-25 15:53:40,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:40,964 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:53:40,964 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,978 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,978 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:53:43,536 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:43,536 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:47,462 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:47,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:47,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 162 [2019-02-25 15:53:47,483 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:47,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-02-25 15:53:47,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-02-25 15:53:47,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-02-25 15:53:47,485 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2019-02-25 15:53:47,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:47,939 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-02-25 15:53:47,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-25 15:53:47,940 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2019-02-25 15:53:47,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:47,942 INFO L225 Difference]: With dead ends: 255 [2019-02-25 15:53:47,942 INFO L226 Difference]: Without dead ends: 254 [2019-02-25 15:53:47,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 370 SyntacticMatches, 24 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15864 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-02-25 15:53:47,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-02-25 15:53:47,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-02-25 15:53:47,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-02-25 15:53:47,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-02-25 15:53:47,947 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2019-02-25 15:53:47,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:47,948 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-02-25 15:53:47,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-02-25 15:53:47,948 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-02-25 15:53:47,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-02-25 15:53:47,948 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:47,949 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2019-02-25 15:53:47,949 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:47,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:47,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times [2019-02-25 15:53:47,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:47,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:47,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:47,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:47,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:49,877 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:49,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:49,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:49,878 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:53:49,878 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:53:49,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:49,879 INFO 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:53:49,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:53:49,888 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:53:50,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-02-25 15:53:50,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:53:50,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 196 conjunts are in the unsatisfiable core [2019-02-25 15:53:50,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:50,180 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:53:50,180 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:50,190 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:50,190 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:53:52,760 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:52,760 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:56,902 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:56,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:56,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 163 [2019-02-25 15:53:56,922 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:56,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-02-25 15:53:56,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-02-25 15:53:56,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-02-25 15:53:56,924 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2019-02-25 15:53:57,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:57,367 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2019-02-25 15:53:57,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-25 15:53:57,368 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2019-02-25 15:53:57,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:57,369 INFO L225 Difference]: With dead ends: 259 [2019-02-25 15:53:57,369 INFO L226 Difference]: Without dead ends: 258 [2019-02-25 15:53:57,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 376 SyntacticMatches, 26 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16361 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-02-25 15:53:57,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-02-25 15:53:57,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-02-25 15:53:57,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-02-25 15:53:57,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-02-25 15:53:57,374 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2019-02-25 15:53:57,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:57,374 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2019-02-25 15:53:57,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-02-25 15:53:57,374 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2019-02-25 15:53:57,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-02-25 15:53:57,375 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:57,375 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2019-02-25 15:53:57,376 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:57,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:57,376 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times [2019-02-25 15:53:57,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:57,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:57,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:53:57,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:57,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:59,317 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:59,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:59,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:59,318 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:53:59,318 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:53:59,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:59,318 INFO 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:53:59,328 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:53:59,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:53:59,407 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:53:59,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:53:59,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 199 conjunts are in the unsatisfiable core [2019-02-25 15:53:59,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:59,418 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:53:59,418 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:59,431 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:59,431 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:54:02,035 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:02,036 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:05,641 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:05,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:05,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 164 [2019-02-25 15:54:05,660 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:05,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-02-25 15:54:05,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-02-25 15:54:05,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-02-25 15:54:05,662 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2019-02-25 15:54:06,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:06,147 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2019-02-25 15:54:06,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-25 15:54:06,148 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2019-02-25 15:54:06,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:06,149 INFO L225 Difference]: With dead ends: 263 [2019-02-25 15:54:06,149 INFO L226 Difference]: Without dead ends: 262 [2019-02-25 15:54:06,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 382 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16858 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-02-25 15:54:06,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-02-25 15:54:06,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2019-02-25 15:54:06,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-02-25 15:54:06,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-02-25 15:54:06,154 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2019-02-25 15:54:06,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:06,154 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-02-25 15:54:06,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-02-25 15:54:06,155 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-02-25 15:54:06,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-02-25 15:54:06,156 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:06,156 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2019-02-25 15:54:06,156 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:06,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:06,157 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times [2019-02-25 15:54:06,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:06,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:06,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:54:06,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:06,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:08,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:08,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:08,452 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:54:08,452 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:54:08,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:08,452 INFO 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:54:08,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:08,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:08,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 202 conjunts are in the unsatisfiable core [2019-02-25 15:54:08,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:08,543 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:54:08,544 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:08,558 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:08,558 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:54:11,045 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:11,045 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:14,984 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:15,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:15,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 165 [2019-02-25 15:54:15,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:15,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-02-25 15:54:15,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-02-25 15:54:15,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-02-25 15:54:15,006 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2019-02-25 15:54:15,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:15,514 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2019-02-25 15:54:15,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-25 15:54:15,515 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2019-02-25 15:54:15,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:15,516 INFO L225 Difference]: With dead ends: 267 [2019-02-25 15:54:15,516 INFO L226 Difference]: Without dead ends: 266 [2019-02-25 15:54:15,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 388 SyntacticMatches, 30 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17355 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-02-25 15:54:15,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-02-25 15:54:15,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-02-25 15:54:15,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-02-25 15:54:15,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-02-25 15:54:15,522 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2019-02-25 15:54:15,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:15,522 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2019-02-25 15:54:15,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-02-25 15:54:15,523 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2019-02-25 15:54:15,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-02-25 15:54:15,524 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:15,524 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2019-02-25 15:54:15,524 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:15,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:15,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times [2019-02-25 15:54:15,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:15,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:15,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:15,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:15,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:17,816 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:17,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:17,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:17,817 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:54:17,817 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:54:17,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:17,817 INFO 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:54:17,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:54:17,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:54:18,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-02-25 15:54:18,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:54:18,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 205 conjunts are in the unsatisfiable core [2019-02-25 15:54:18,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:18,174 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:54:18,175 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,183 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,184 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:54:20,706 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:20,707 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:24,567 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:24,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:24,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 166 [2019-02-25 15:54:24,598 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:24,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-02-25 15:54:24,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-02-25 15:54:24,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-02-25 15:54:24,600 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2019-02-25 15:54:25,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:25,187 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2019-02-25 15:54:25,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-25 15:54:25,187 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2019-02-25 15:54:25,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:25,189 INFO L225 Difference]: With dead ends: 271 [2019-02-25 15:54:25,189 INFO L226 Difference]: Without dead ends: 270 [2019-02-25 15:54:25,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 394 SyntacticMatches, 32 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17852 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-02-25 15:54:25,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-02-25 15:54:25,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2019-02-25 15:54:25,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-02-25 15:54:25,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2019-02-25 15:54:25,195 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2019-02-25 15:54:25,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:25,196 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2019-02-25 15:54:25,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-02-25 15:54:25,196 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2019-02-25 15:54:25,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-02-25 15:54:25,197 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:25,197 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2019-02-25 15:54:25,198 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:25,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:25,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times [2019-02-25 15:54:25,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:25,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:25,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:54:25,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:25,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:27,358 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:27,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:27,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:27,359 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:54:27,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:54:27,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:27,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:54:27,368 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:54:27,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:54:27,459 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:54:27,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:54:27,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 208 conjunts are in the unsatisfiable core [2019-02-25 15:54:27,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:27,468 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:54:27,468 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:27,479 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:27,479 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:54:30,098 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:30,098 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:33,862 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:33,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:33,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 167 [2019-02-25 15:54:33,881 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:33,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-02-25 15:54:33,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-02-25 15:54:33,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-02-25 15:54:33,884 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2019-02-25 15:54:34,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:34,397 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-02-25 15:54:34,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-25 15:54:34,397 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2019-02-25 15:54:34,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:34,399 INFO L225 Difference]: With dead ends: 275 [2019-02-25 15:54:34,399 INFO L226 Difference]: Without dead ends: 274 [2019-02-25 15:54:34,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 400 SyntacticMatches, 34 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18349 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-02-25 15:54:34,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-02-25 15:54:34,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2019-02-25 15:54:34,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-02-25 15:54:34,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2019-02-25 15:54:34,405 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2019-02-25 15:54:34,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:34,405 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2019-02-25 15:54:34,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-02-25 15:54:34,405 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2019-02-25 15:54:34,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-02-25 15:54:34,406 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:34,406 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2019-02-25 15:54:34,406 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:34,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:34,406 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times [2019-02-25 15:54:34,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:34,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:34,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:54:34,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:34,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:36,640 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:36,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:36,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:36,640 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:54:36,640 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:54:36,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:36,641 INFO 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:54:36,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:36,648 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:36,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 211 conjunts are in the unsatisfiable core [2019-02-25 15:54:36,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:36,732 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:54:36,732 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:36,743 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:36,743 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:54:39,544 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:39,544 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:43,388 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:43,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:43,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 168 [2019-02-25 15:54:43,409 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:43,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-02-25 15:54:43,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-02-25 15:54:43,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-02-25 15:54:43,411 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2019-02-25 15:54:44,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:44,033 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2019-02-25 15:54:44,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-25 15:54:44,034 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2019-02-25 15:54:44,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:44,035 INFO L225 Difference]: With dead ends: 279 [2019-02-25 15:54:44,035 INFO L226 Difference]: Without dead ends: 278 [2019-02-25 15:54:44,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 406 SyntacticMatches, 36 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18846 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-02-25 15:54:44,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-02-25 15:54:44,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-02-25 15:54:44,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-02-25 15:54:44,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-02-25 15:54:44,042 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2019-02-25 15:54:44,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:44,042 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-02-25 15:54:44,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-02-25 15:54:44,042 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-02-25 15:54:44,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-02-25 15:54:44,044 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:44,044 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2019-02-25 15:54:44,044 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:44,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:44,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times [2019-02-25 15:54:44,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:44,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:44,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:44,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:44,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:46,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:46,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:46,289 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:54:46,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:54:46,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:46,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 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:54:46,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:54:46,297 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:54:46,640 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-02-25 15:54:46,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:54:46,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 214 conjunts are in the unsatisfiable core [2019-02-25 15:54:46,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:46,649 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:54:46,649 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,662 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,663 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:54:49,535 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:49,536 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:53,487 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:53,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:53,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 169 [2019-02-25 15:54:53,506 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:53,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-02-25 15:54:53,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-02-25 15:54:53,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-02-25 15:54:53,509 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2019-02-25 15:54:54,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:54,046 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2019-02-25 15:54:54,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-25 15:54:54,047 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2019-02-25 15:54:54,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:54,048 INFO L225 Difference]: With dead ends: 283 [2019-02-25 15:54:54,049 INFO L226 Difference]: Without dead ends: 282 [2019-02-25 15:54:54,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 412 SyntacticMatches, 38 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19343 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-02-25 15:54:54,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-02-25 15:54:54,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2019-02-25 15:54:54,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-02-25 15:54:54,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-02-25 15:54:54,055 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2019-02-25 15:54:54,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:54,055 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-02-25 15:54:54,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-02-25 15:54:54,056 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-02-25 15:54:54,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-02-25 15:54:54,057 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:54,057 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2019-02-25 15:54:54,057 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:54,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:54,058 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times [2019-02-25 15:54:54,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:54,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:54,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:54:54,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:54,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:56,469 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:56,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:56,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:56,469 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:54:56,470 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:54:56,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:56,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:54:56,479 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:54:56,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:54:56,565 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:54:56,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:54:56,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 217 conjunts are in the unsatisfiable core [2019-02-25 15:54:56,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:56,575 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:54:56,575 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:56,586 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:56,586 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:54:59,606 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:59,607 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:03,539 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:03,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:03,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 170 [2019-02-25 15:55:03,559 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:03,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-02-25 15:55:03,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-02-25 15:55:03,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-02-25 15:55:03,562 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2019-02-25 15:55:04,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:04,128 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2019-02-25 15:55:04,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-25 15:55:04,128 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2019-02-25 15:55:04,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:04,130 INFO L225 Difference]: With dead ends: 287 [2019-02-25 15:55:04,130 INFO L226 Difference]: Without dead ends: 286 [2019-02-25 15:55:04,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 418 SyntacticMatches, 40 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19840 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-02-25 15:55:04,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-02-25 15:55:04,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2019-02-25 15:55:04,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-02-25 15:55:04,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2019-02-25 15:55:04,135 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2019-02-25 15:55:04,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:04,135 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2019-02-25 15:55:04,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-02-25 15:55:04,135 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2019-02-25 15:55:04,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-02-25 15:55:04,136 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:04,136 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2019-02-25 15:55:04,136 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:04,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:04,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times [2019-02-25 15:55:04,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:04,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:04,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:55:04,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:04,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:06,547 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:06,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:06,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:06,547 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:55:06,547 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:55:06,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:06,547 INFO 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:55:06,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:06,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:06,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 220 conjunts are in the unsatisfiable core [2019-02-25 15:55:06,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:06,639 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:55:06,639 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,648 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,648 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:55:09,566 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:09,566 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:13,756 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:13,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:13,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 171 [2019-02-25 15:55:13,775 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:13,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-02-25 15:55:13,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-02-25 15:55:13,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-02-25 15:55:13,777 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2019-02-25 15:55:14,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:14,339 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-02-25 15:55:14,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-25 15:55:14,339 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2019-02-25 15:55:14,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:14,341 INFO L225 Difference]: With dead ends: 291 [2019-02-25 15:55:14,341 INFO L226 Difference]: Without dead ends: 290 [2019-02-25 15:55:14,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 424 SyntacticMatches, 42 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20337 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-02-25 15:55:14,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-02-25 15:55:14,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-02-25 15:55:14,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-02-25 15:55:14,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2019-02-25 15:55:14,347 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2019-02-25 15:55:14,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:14,347 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2019-02-25 15:55:14,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-02-25 15:55:14,347 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2019-02-25 15:55:14,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-02-25 15:55:14,349 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:14,349 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2019-02-25 15:55:14,349 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:14,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:14,349 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times [2019-02-25 15:55:14,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:14,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:14,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:14,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:14,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:16,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:16,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:16,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:16,844 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:55:16,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:55:16,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:16,845 INFO 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:55:16,852 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:55:16,852 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:55:17,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-02-25 15:55:17,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:55:17,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 223 conjunts are in the unsatisfiable core [2019-02-25 15:55:17,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:17,229 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:55:17,229 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:17,237 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:17,237 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:55:20,236 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:20,237 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:24,110 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:24,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:24,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 172 [2019-02-25 15:55:24,129 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:24,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-02-25 15:55:24,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-02-25 15:55:24,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-02-25 15:55:24,132 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2019-02-25 15:55:24,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:24,751 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-02-25 15:55:24,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-25 15:55:24,751 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2019-02-25 15:55:24,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:24,753 INFO L225 Difference]: With dead ends: 295 [2019-02-25 15:55:24,753 INFO L226 Difference]: Without dead ends: 294 [2019-02-25 15:55:24,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 430 SyntacticMatches, 44 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20834 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-02-25 15:55:24,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-02-25 15:55:24,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-02-25 15:55:24,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-02-25 15:55:24,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2019-02-25 15:55:24,758 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2019-02-25 15:55:24,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:24,758 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2019-02-25 15:55:24,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-02-25 15:55:24,759 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2019-02-25 15:55:24,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-02-25 15:55:24,759 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:24,760 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2019-02-25 15:55:24,760 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:24,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:24,760 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times [2019-02-25 15:55:24,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:24,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:24,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:55:24,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:24,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:27,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:27,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:27,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:27,289 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:55:27,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:55:27,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:27,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 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:55:27,298 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:55:27,298 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:55:27,393 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:55:27,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:55:27,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 226 conjunts are in the unsatisfiable core [2019-02-25 15:55:27,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:27,419 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:55:27,420 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:27,433 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:27,433 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:55:30,489 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:30,489 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:34,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:34,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:34,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 173 [2019-02-25 15:55:34,500 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:34,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-02-25 15:55:34,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-02-25 15:55:34,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-02-25 15:55:34,502 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2019-02-25 15:55:35,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:35,170 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2019-02-25 15:55:35,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-25 15:55:35,171 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2019-02-25 15:55:35,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:35,173 INFO L225 Difference]: With dead ends: 299 [2019-02-25 15:55:35,173 INFO L226 Difference]: Without dead ends: 298 [2019-02-25 15:55:35,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 436 SyntacticMatches, 46 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21331 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-02-25 15:55:35,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-02-25 15:55:35,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2019-02-25 15:55:35,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-02-25 15:55:35,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-02-25 15:55:35,179 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2019-02-25 15:55:35,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:35,180 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2019-02-25 15:55:35,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-02-25 15:55:35,180 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2019-02-25 15:55:35,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-02-25 15:55:35,181 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:35,181 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2019-02-25 15:55:35,181 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:35,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:35,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times [2019-02-25 15:55:35,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:35,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:35,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:55:35,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:35,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:37,843 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:37,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:37,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:37,843 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:55:37,843 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:55:37,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:37,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:55:37,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:37,852 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:37,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 229 conjunts are in the unsatisfiable core [2019-02-25 15:55:37,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:37,945 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:55:37,945 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:37,956 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:37,956 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:55:41,030 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:41,030 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:44,967 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:44,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:44,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 174 [2019-02-25 15:55:44,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:44,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-02-25 15:55:44,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-02-25 15:55:44,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-02-25 15:55:44,989 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2019-02-25 15:55:45,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:45,524 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2019-02-25 15:55:45,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-25 15:55:45,525 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2019-02-25 15:55:45,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:45,526 INFO L225 Difference]: With dead ends: 303 [2019-02-25 15:55:45,527 INFO L226 Difference]: Without dead ends: 302 [2019-02-25 15:55:45,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 442 SyntacticMatches, 48 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21828 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-02-25 15:55:45,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-02-25 15:55:45,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-02-25 15:55:45,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-02-25 15:55:45,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-02-25 15:55:45,533 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2019-02-25 15:55:45,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:45,533 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-02-25 15:55:45,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-02-25 15:55:45,534 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-02-25 15:55:45,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-02-25 15:55:45,534 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:45,535 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2019-02-25 15:55:45,535 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:45,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:45,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times [2019-02-25 15:55:45,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:45,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:45,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:45,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:45,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:48,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:48,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:48,181 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:55:48,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:55:48,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:48,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 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:55:48,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:55:48,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:55:48,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-02-25 15:55:48,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:55:48,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 232 conjunts are in the unsatisfiable core [2019-02-25 15:55:48,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:48,595 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:55:48,595 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:48,605 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:48,605 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:55:51,801 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:51,801 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:55,685 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:55,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:55,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 175 [2019-02-25 15:55:55,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:55,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-02-25 15:55:55,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-02-25 15:55:55,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-02-25 15:55:55,709 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2019-02-25 15:55:56,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:56,354 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2019-02-25 15:55:56,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-25 15:55:56,355 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2019-02-25 15:55:56,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:56,357 INFO L225 Difference]: With dead ends: 307 [2019-02-25 15:55:56,357 INFO L226 Difference]: Without dead ends: 306 [2019-02-25 15:55:56,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 673 GetRequests, 448 SyntacticMatches, 50 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22325 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-02-25 15:55:56,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-02-25 15:55:56,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-02-25 15:55:56,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-02-25 15:55:56,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2019-02-25 15:55:56,365 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2019-02-25 15:55:56,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:56,365 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2019-02-25 15:55:56,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-02-25 15:55:56,365 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2019-02-25 15:55:56,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-02-25 15:55:56,366 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:56,367 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2019-02-25 15:55:56,367 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:56,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:56,367 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times [2019-02-25 15:55:56,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:56,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:56,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:55:56,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:56,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:59,099 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:59,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:59,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:59,100 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:55:59,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:55:59,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:59,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:55:59,109 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:55:59,109 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:55:59,197 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:55:59,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:55:59,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 235 conjunts are in the unsatisfiable core [2019-02-25 15:55:59,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:59,207 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:55:59,207 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:59,216 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:59,216 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:56:02,498 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:02,498 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:56:06,413 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:06,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:56:06,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 176 [2019-02-25 15:56:06,432 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:56:06,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-02-25 15:56:06,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-02-25 15:56:06,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-02-25 15:56:06,434 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. [2019-02-25 15:56:07,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:56:07,066 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2019-02-25 15:56:07,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-25 15:56:07,066 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 304 [2019-02-25 15:56:07,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:56:07,068 INFO L225 Difference]: With dead ends: 311 [2019-02-25 15:56:07,068 INFO L226 Difference]: Without dead ends: 310 [2019-02-25 15:56:07,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 454 SyntacticMatches, 52 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22822 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-02-25 15:56:07,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-02-25 15:56:07,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2019-02-25 15:56:07,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-02-25 15:56:07,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2019-02-25 15:56:07,074 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304 [2019-02-25 15:56:07,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:56:07,075 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2019-02-25 15:56:07,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-02-25 15:56:07,075 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2019-02-25 15:56:07,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-02-25 15:56:07,076 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:56:07,076 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1] [2019-02-25 15:56:07,076 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:56:07,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:07,076 INFO L82 PathProgramCache]: Analyzing trace with hash -789644462, now seen corresponding path program 76 times [2019-02-25 15:56:07,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:56:07,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:07,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:56:07,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:07,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:56:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:09,807 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:09,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:09,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:56:09,808 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:56:09,808 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:56:09,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:09,808 INFO 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:56:09,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:56:09,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:56:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:09,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 238 conjunts are in the unsatisfiable core [2019-02-25 15:56:09,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:56:09,912 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:56:09,912 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:09,920 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:09,921 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:56:13,186 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:13,186 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:56:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:17,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:56:17,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 177 [2019-02-25 15:56:17,074 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:56:17,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-02-25 15:56:17,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-02-25 15:56:17,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-02-25 15:56:17,077 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 156 states. [2019-02-25 15:56:17,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:56:17,665 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-02-25 15:56:17,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-25 15:56:17,666 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 308 [2019-02-25 15:56:17,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:56:17,667 INFO L225 Difference]: With dead ends: 315 [2019-02-25 15:56:17,667 INFO L226 Difference]: Without dead ends: 314 [2019-02-25 15:56:17,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 460 SyntacticMatches, 54 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23319 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-02-25 15:56:17,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-02-25 15:56:17,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 313. [2019-02-25 15:56:17,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-02-25 15:56:17,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2019-02-25 15:56:17,672 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 308 [2019-02-25 15:56:17,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:56:17,672 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2019-02-25 15:56:17,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-02-25 15:56:17,672 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2019-02-25 15:56:17,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-02-25 15:56:17,673 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:56:17,674 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1] [2019-02-25 15:56:17,674 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:56:17,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:17,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2140213899, now seen corresponding path program 77 times [2019-02-25 15:56:17,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:56:17,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:17,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:56:17,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:17,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:56:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:20,386 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:20,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:20,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:56:20,387 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:56:20,387 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:56:20,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:20,387 INFO 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:56:20,396 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:56:20,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:56:20,807 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-02-25 15:56:20,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:56:20,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 241 conjunts are in the unsatisfiable core [2019-02-25 15:56:20,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:56:20,821 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:56:20,821 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:20,840 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:20,840 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:56:24,196 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:24,196 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:56:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:28,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:56:28,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 178 [2019-02-25 15:56:28,103 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:56:28,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-02-25 15:56:28,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-02-25 15:56:28,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-02-25 15:56:28,105 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 158 states. [2019-02-25 15:56:28,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:56:28,701 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2019-02-25 15:56:28,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-25 15:56:28,702 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 312 [2019-02-25 15:56:28,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:56:28,703 INFO L225 Difference]: With dead ends: 319 [2019-02-25 15:56:28,704 INFO L226 Difference]: Without dead ends: 318 [2019-02-25 15:56:28,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 466 SyntacticMatches, 56 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23816 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-02-25 15:56:28,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-02-25 15:56:28,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2019-02-25 15:56:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-02-25 15:56:28,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2019-02-25 15:56:28,710 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 312 [2019-02-25 15:56:28,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:56:28,710 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2019-02-25 15:56:28,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-02-25 15:56:28,710 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2019-02-25 15:56:28,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-02-25 15:56:28,711 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:56:28,711 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 1, 1] [2019-02-25 15:56:28,711 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:56:28,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:28,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1416815940, now seen corresponding path program 78 times [2019-02-25 15:56:28,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:56:28,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:28,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:56:28,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:28,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:56:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:31,477 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:31,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:31,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:56:31,477 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:56:31,477 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:56:31,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:31,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:56:31,486 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:56:31,486 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:56:31,578 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:56:31,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:56:31,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 244 conjunts are in the unsatisfiable core [2019-02-25 15:56:31,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:56:31,590 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:56:31,591 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:31,605 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:31,605 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:56:35,002 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:35,002 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:56:38,855 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:38,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:56:38,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 179 [2019-02-25 15:56:38,873 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:56:38,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-02-25 15:56:38,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-02-25 15:56:38,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-02-25 15:56:38,876 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 160 states. [2019-02-25 15:56:39,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:56:39,532 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2019-02-25 15:56:39,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-25 15:56:39,532 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 316 [2019-02-25 15:56:39,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:56:39,534 INFO L225 Difference]: With dead ends: 323 [2019-02-25 15:56:39,534 INFO L226 Difference]: Without dead ends: 322 [2019-02-25 15:56:39,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 472 SyntacticMatches, 58 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24313 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-02-25 15:56:39,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-02-25 15:56:39,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2019-02-25 15:56:39,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-02-25 15:56:39,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-02-25 15:56:39,539 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 316 [2019-02-25 15:56:39,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:56:39,539 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-02-25 15:56:39,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-02-25 15:56:39,539 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-02-25 15:56:39,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-02-25 15:56:39,540 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:56:39,541 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 1, 1] [2019-02-25 15:56:39,541 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:56:39,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:39,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1783280509, now seen corresponding path program 79 times [2019-02-25 15:56:39,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:56:39,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:39,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:56:39,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:39,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:56:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:42,383 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:42,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:42,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:56:42,384 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:56:42,384 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:56:42,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:42,384 INFO 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:56:42,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:56:42,393 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:56:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:42,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 247 conjunts are in the unsatisfiable core [2019-02-25 15:56:42,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:56:42,487 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:56:42,487 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:42,495 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:42,495 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:56:45,993 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:45,994 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:56:49,837 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:49,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:56:49,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 180 [2019-02-25 15:56:49,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:56:49,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-02-25 15:56:49,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-02-25 15:56:49,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-02-25 15:56:49,859 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 162 states. [2019-02-25 15:56:50,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:56:50,521 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2019-02-25 15:56:50,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-25 15:56:50,522 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 320 [2019-02-25 15:56:50,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:56:50,523 INFO L225 Difference]: With dead ends: 327 [2019-02-25 15:56:50,523 INFO L226 Difference]: Without dead ends: 326 [2019-02-25 15:56:50,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 478 SyntacticMatches, 60 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24810 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-02-25 15:56:50,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-02-25 15:56:50,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2019-02-25 15:56:50,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-02-25 15:56:50,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2019-02-25 15:56:50,529 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 320 [2019-02-25 15:56:50,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:56:50,529 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2019-02-25 15:56:50,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-02-25 15:56:50,529 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2019-02-25 15:56:50,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-02-25 15:56:50,530 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:56:50,531 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 1, 1] [2019-02-25 15:56:50,531 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:56:50,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:50,531 INFO L82 PathProgramCache]: Analyzing trace with hash 380550454, now seen corresponding path program 80 times [2019-02-25 15:56:50,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:56:50,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:50,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:56:50,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:50,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:56:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:53,777 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:53,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:53,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:56:53,777 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:56:53,777 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:56:53,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:53,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:56:53,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:56:53,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:56:54,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-02-25 15:56:54,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:56:54,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 250 conjunts are in the unsatisfiable core [2019-02-25 15:56:54,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:56:54,233 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:56:54,233 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:54,242 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:54,242 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:56:57,775 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:57,776 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:57:01,715 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:01,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:57:01,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 181 [2019-02-25 15:57:01,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:57:01,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-02-25 15:57:01,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-02-25 15:57:01,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-02-25 15:57:01,737 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 164 states. [2019-02-25 15:57:02,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:57:02,408 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2019-02-25 15:57:02,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-25 15:57:02,408 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 324 [2019-02-25 15:57:02,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:57:02,410 INFO L225 Difference]: With dead ends: 331 [2019-02-25 15:57:02,410 INFO L226 Difference]: Without dead ends: 330 [2019-02-25 15:57:02,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 484 SyntacticMatches, 62 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25307 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-02-25 15:57:02,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-02-25 15:57:02,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2019-02-25 15:57:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-02-25 15:57:02,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2019-02-25 15:57:02,416 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 324 [2019-02-25 15:57:02,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:57:02,416 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2019-02-25 15:57:02,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-02-25 15:57:02,417 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2019-02-25 15:57:02,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-02-25 15:57:02,418 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:57:02,418 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 1, 1] [2019-02-25 15:57:02,418 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:57:02,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:57:02,418 INFO L82 PathProgramCache]: Analyzing trace with hash 2048213615, now seen corresponding path program 81 times [2019-02-25 15:57:02,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:57:02,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:02,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:57:02,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:02,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:57:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:05,438 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:05,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:05,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:57:05,438 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:57:05,439 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:57:05,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:05,439 INFO 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:57:05,447 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:57:05,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:57:05,544 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:57:05,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:57:05,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 253 conjunts are in the unsatisfiable core [2019-02-25 15:57:05,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:57:05,556 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:57:05,556 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:05,563 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:05,563 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:57:09,195 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:09,195 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:57:13,239 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:13,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:57:13,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 182 [2019-02-25 15:57:13,258 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:57:13,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-02-25 15:57:13,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-02-25 15:57:13,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-02-25 15:57:13,260 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 166 states. [2019-02-25 15:57:13,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:57:13,899 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-02-25 15:57:13,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-25 15:57:13,899 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 328 [2019-02-25 15:57:13,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:57:13,901 INFO L225 Difference]: With dead ends: 335 [2019-02-25 15:57:13,901 INFO L226 Difference]: Without dead ends: 334 [2019-02-25 15:57:13,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 490 SyntacticMatches, 64 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25804 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-02-25 15:57:13,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-02-25 15:57:13,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2019-02-25 15:57:13,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-02-25 15:57:13,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2019-02-25 15:57:13,907 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 328 [2019-02-25 15:57:13,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:57:13,908 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2019-02-25 15:57:13,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-02-25 15:57:13,908 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2019-02-25 15:57:13,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-02-25 15:57:13,909 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:57:13,909 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 1, 1] [2019-02-25 15:57:13,909 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:57:13,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:57:13,909 INFO L82 PathProgramCache]: Analyzing trace with hash 265585448, now seen corresponding path program 82 times [2019-02-25 15:57:13,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:57:13,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:13,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:57:13,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:13,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:57:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:16,944 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:16,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:16,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:57:16,944 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:57:16,944 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:57:16,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:16,945 INFO 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:57:16,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:57:16,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:57:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:17,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 256 conjunts are in the unsatisfiable core [2019-02-25 15:57:17,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:57:17,043 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:57:17,043 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:17,052 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:17,052 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:57:20,744 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:20,745 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:57:24,769 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:24,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:57:24,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 183 [2019-02-25 15:57:24,788 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:57:24,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-02-25 15:57:24,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-02-25 15:57:24,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-02-25 15:57:24,791 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 168 states. [2019-02-25 15:57:25,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:57:25,412 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2019-02-25 15:57:25,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-25 15:57:25,413 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 332 [2019-02-25 15:57:25,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:57:25,414 INFO L225 Difference]: With dead ends: 339 [2019-02-25 15:57:25,414 INFO L226 Difference]: Without dead ends: 338 [2019-02-25 15:57:25,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 496 SyntacticMatches, 66 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26301 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-02-25 15:57:25,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-02-25 15:57:25,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2019-02-25 15:57:25,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-02-25 15:57:25,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2019-02-25 15:57:25,420 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 332 [2019-02-25 15:57:25,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:57:25,420 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2019-02-25 15:57:25,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-02-25 15:57:25,420 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2019-02-25 15:57:25,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-02-25 15:57:25,421 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:57:25,422 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 1, 1] [2019-02-25 15:57:25,422 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:57:25,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:57:25,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1042464609, now seen corresponding path program 83 times [2019-02-25 15:57:25,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:57:25,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:25,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:57:25,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:25,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:57:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:28,553 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:28,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:28,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:57:28,554 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:57:28,554 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:57:28,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:28,554 INFO 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:57:28,565 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:57:28,565 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:57:29,034 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-02-25 15:57:29,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:57:29,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 259 conjunts are in the unsatisfiable core [2019-02-25 15:57:29,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:57:29,045 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:57:29,045 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:29,055 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:29,055 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:57:32,881 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:32,881 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:57:36,816 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:36,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:57:36,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 184 [2019-02-25 15:57:36,835 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:57:36,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-02-25 15:57:36,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-02-25 15:57:36,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-02-25 15:57:36,839 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 170 states. [2019-02-25 15:57:37,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:57:37,583 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2019-02-25 15:57:37,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-25 15:57:37,583 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 336 [2019-02-25 15:57:37,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:57:37,585 INFO L225 Difference]: With dead ends: 343 [2019-02-25 15:57:37,585 INFO L226 Difference]: Without dead ends: 342 [2019-02-25 15:57:37,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 502 SyntacticMatches, 68 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26798 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-02-25 15:57:37,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-02-25 15:57:37,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2019-02-25 15:57:37,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-02-25 15:57:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-02-25 15:57:37,591 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 336 [2019-02-25 15:57:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:57:37,591 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-02-25 15:57:37,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-02-25 15:57:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-02-25 15:57:37,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-02-25 15:57:37,593 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:57:37,593 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 1, 1] [2019-02-25 15:57:37,593 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:57:37,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:57:37,594 INFO L82 PathProgramCache]: Analyzing trace with hash -434751718, now seen corresponding path program 84 times [2019-02-25 15:57:37,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:57:37,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:37,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:57:37,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:37,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:57:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:40,803 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:40,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:40,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:57:40,804 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:57:40,804 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:57:40,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:40,804 INFO 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:57:40,812 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:57:40,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:57:40,914 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:57:40,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:57:40,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 262 conjunts are in the unsatisfiable core [2019-02-25 15:57:40,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:57:40,925 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:57:40,925 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:40,936 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:40,936 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:57:44,860 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:44,861 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:57:48,813 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:48,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:57:48,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 185 [2019-02-25 15:57:48,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:57:48,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-02-25 15:57:48,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-02-25 15:57:48,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-02-25 15:57:48,835 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 172 states. [2019-02-25 15:57:49,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:57:49,590 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2019-02-25 15:57:49,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-25 15:57:49,590 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 340 [2019-02-25 15:57:49,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:57:49,592 INFO L225 Difference]: With dead ends: 347 [2019-02-25 15:57:49,592 INFO L226 Difference]: Without dead ends: 346 [2019-02-25 15:57:49,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 508 SyntacticMatches, 70 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27295 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-02-25 15:57:49,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-02-25 15:57:49,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2019-02-25 15:57:49,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-02-25 15:57:49,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2019-02-25 15:57:49,600 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 340 [2019-02-25 15:57:49,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:57:49,600 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2019-02-25 15:57:49,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-02-25 15:57:49,600 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2019-02-25 15:57:49,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-02-25 15:57:49,602 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:57:49,602 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 1, 1] [2019-02-25 15:57:49,602 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:57:49,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:57:49,602 INFO L82 PathProgramCache]: Analyzing trace with hash -207279533, now seen corresponding path program 85 times [2019-02-25 15:57:49,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:57:49,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:49,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:57:49,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:49,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:57:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:52,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:52,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:57:52,958 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:57:52,958 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:57:52,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:52,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:57:52,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:57:52,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:57:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:53,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 265 conjunts are in the unsatisfiable core [2019-02-25 15:57:53,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:57:53,068 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:57:53,068 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:53,081 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:53,081 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:57:57,062 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:57,063 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:58:01,428 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:01,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:58:01,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 186 [2019-02-25 15:58:01,447 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:58:01,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-02-25 15:58:01,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-02-25 15:58:01,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-02-25 15:58:01,450 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 174 states. [2019-02-25 15:58:02,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:58:02,206 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2019-02-25 15:58:02,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-25 15:58:02,207 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 344 [2019-02-25 15:58:02,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:58:02,209 INFO L225 Difference]: With dead ends: 351 [2019-02-25 15:58:02,209 INFO L226 Difference]: Without dead ends: 350 [2019-02-25 15:58:02,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 772 GetRequests, 514 SyntacticMatches, 72 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27792 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-02-25 15:58:02,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-02-25 15:58:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2019-02-25 15:58:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-02-25 15:58:02,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2019-02-25 15:58:02,215 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 344 [2019-02-25 15:58:02,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:58:02,216 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2019-02-25 15:58:02,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-02-25 15:58:02,216 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2019-02-25 15:58:02,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-02-25 15:58:02,217 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:58:02,217 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 1, 1] [2019-02-25 15:58:02,218 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:58:02,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:58:02,218 INFO L82 PathProgramCache]: Analyzing trace with hash -307898100, now seen corresponding path program 86 times [2019-02-25 15:58:02,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:58:02,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:02,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:58:02,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:02,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:58:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:58:05,589 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:05,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:05,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:58:05,589 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:58:05,589 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:58:05,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:05,590 INFO 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:58:05,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:58:05,598 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:58:06,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2019-02-25 15:58:06,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:58:06,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 268 conjunts are in the unsatisfiable core [2019-02-25 15:58:06,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:58:06,106 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:58:06,106 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:06,126 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:06,126 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:58:10,188 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:10,188 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:58:14,189 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:14,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:58:14,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 187 [2019-02-25 15:58:14,209 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:58:14,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-02-25 15:58:14,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-02-25 15:58:14,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-02-25 15:58:14,211 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 176 states. [2019-02-25 15:58:14,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:58:14,915 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-02-25 15:58:14,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-25 15:58:14,915 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 348 [2019-02-25 15:58:14,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:58:14,917 INFO L225 Difference]: With dead ends: 355 [2019-02-25 15:58:14,917 INFO L226 Difference]: Without dead ends: 354 [2019-02-25 15:58:14,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 781 GetRequests, 520 SyntacticMatches, 74 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28289 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-02-25 15:58:14,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-02-25 15:58:14,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 353. [2019-02-25 15:58:14,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-02-25 15:58:14,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2019-02-25 15:58:14,924 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 348 [2019-02-25 15:58:14,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:58:14,924 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2019-02-25 15:58:14,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-02-25 15:58:14,924 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2019-02-25 15:58:14,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-02-25 15:58:14,925 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:58:14,925 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 1, 1] [2019-02-25 15:58:14,926 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:58:14,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:58:14,926 INFO L82 PathProgramCache]: Analyzing trace with hash -2050063547, now seen corresponding path program 87 times [2019-02-25 15:58:14,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:58:14,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:14,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:58:14,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:14,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:58:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:58:18,353 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:18,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:18,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:58:18,353 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:58:18,353 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:58:18,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:18,354 INFO 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:58:18,363 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:58:18,363 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:58:18,466 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:58:18,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:58:18,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 271 conjunts are in the unsatisfiable core [2019-02-25 15:58:18,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:58:18,478 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:58:18,478 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:18,487 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:18,487 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:58:22,693 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:22,693 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:58:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:26,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:58:26,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 188 [2019-02-25 15:58:26,747 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:58:26,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-02-25 15:58:26,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-02-25 15:58:26,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-02-25 15:58:26,750 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 178 states. [2019-02-25 15:58:27,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:58:27,423 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2019-02-25 15:58:27,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-02-25 15:58:27,423 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 352 [2019-02-25 15:58:27,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:58:27,425 INFO L225 Difference]: With dead ends: 359 [2019-02-25 15:58:27,426 INFO L226 Difference]: Without dead ends: 358 [2019-02-25 15:58:27,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 526 SyntacticMatches, 76 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28786 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-02-25 15:58:27,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-02-25 15:58:27,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2019-02-25 15:58:27,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-02-25 15:58:27,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2019-02-25 15:58:27,432 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 352 [2019-02-25 15:58:27,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:58:27,432 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2019-02-25 15:58:27,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-02-25 15:58:27,432 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2019-02-25 15:58:27,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-02-25 15:58:27,433 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:58:27,434 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 1, 1] [2019-02-25 15:58:27,434 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:58:27,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:58:27,434 INFO L82 PathProgramCache]: Analyzing trace with hash 682977534, now seen corresponding path program 88 times [2019-02-25 15:58:27,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:58:27,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:27,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:58:27,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:27,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:58:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:58:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:30,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:30,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:58:30,930 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:58:30,930 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:58:30,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:30,930 INFO 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:58:30,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:58:30,940 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:58:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:58:31,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 274 conjunts are in the unsatisfiable core [2019-02-25 15:58:31,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:58:31,040 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:58:31,040 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:31,047 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:31,047 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:58:35,296 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:35,297 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:58:39,437 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:39,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:58:39,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 189 [2019-02-25 15:58:39,456 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:58:39,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2019-02-25 15:58:39,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2019-02-25 15:58:39,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-02-25 15:58:39,459 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 180 states. [2019-02-25 15:58:40,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:58:40,261 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2019-02-25 15:58:40,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-25 15:58:40,261 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 356 [2019-02-25 15:58:40,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:58:40,263 INFO L225 Difference]: With dead ends: 363 [2019-02-25 15:58:40,263 INFO L226 Difference]: Without dead ends: 362 [2019-02-25 15:58:40,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 532 SyntacticMatches, 78 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29283 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-02-25 15:58:40,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-02-25 15:58:40,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2019-02-25 15:58:40,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-02-25 15:58:40,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-02-25 15:58:40,269 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 356 [2019-02-25 15:58:40,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:58:40,269 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-02-25 15:58:40,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2019-02-25 15:58:40,270 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-02-25 15:58:40,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-02-25 15:58:40,271 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:58:40,271 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 1, 1] [2019-02-25 15:58:40,271 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:58:40,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:58:40,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1915696585, now seen corresponding path program 89 times [2019-02-25 15:58:40,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:58:40,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:40,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:58:40,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:40,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:58:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:58:43,860 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:43,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:43,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:58:43,860 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:58:43,860 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:58:43,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:43,860 INFO 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:58:43,869 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:58:43,869 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:58:44,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2019-02-25 15:58:44,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:58:44,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 277 conjunts are in the unsatisfiable core [2019-02-25 15:58:44,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:58:44,424 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:58:44,424 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:44,436 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:44,436 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:58:48,791 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:48,791 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:58:52,906 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:52,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:58:52,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 190 [2019-02-25 15:58:52,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:58:52,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2019-02-25 15:58:52,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2019-02-25 15:58:52,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-02-25 15:58:52,928 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 182 states. [2019-02-25 15:58:53,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:58:53,688 INFO L93 Difference]: Finished difference Result 367 states and 367 transitions. [2019-02-25 15:58:53,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-25 15:58:53,689 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 360 [2019-02-25 15:58:53,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:58:53,691 INFO L225 Difference]: With dead ends: 367 [2019-02-25 15:58:53,691 INFO L226 Difference]: Without dead ends: 366 [2019-02-25 15:58:53,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 538 SyntacticMatches, 80 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29780 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-02-25 15:58:53,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-02-25 15:58:53,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2019-02-25 15:58:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-02-25 15:58:53,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 365 transitions. [2019-02-25 15:58:53,697 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 365 transitions. Word has length 360 [2019-02-25 15:58:53,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:58:53,697 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 365 transitions. [2019-02-25 15:58:53,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2019-02-25 15:58:53,697 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 365 transitions. [2019-02-25 15:58:53,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-02-25 15:58:53,699 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:58:53,699 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 90, 90, 1, 1] [2019-02-25 15:58:53,699 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:58:53,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:58:53,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1198974704, now seen corresponding path program 90 times [2019-02-25 15:58:53,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:58:53,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:53,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:58:53,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:53,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:58:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:58:57,318 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:57,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:57,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:58:57,319 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:58:57,319 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:58:57,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:57,319 INFO 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:58:57,329 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:58:57,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:58:57,439 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:58:57,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:58:57,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 280 conjunts are in the unsatisfiable core [2019-02-25 15:58:57,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:58:57,451 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:58:57,451 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:57,459 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:57,459 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:59:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:01,919 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:59:05,984 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:06,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:59:06,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 191 [2019-02-25 15:59:06,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:59:06,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2019-02-25 15:59:06,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2019-02-25 15:59:06,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-02-25 15:59:06,006 INFO L87 Difference]: Start difference. First operand 365 states and 365 transitions. Second operand 184 states. [2019-02-25 15:59:06,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:59:06,699 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2019-02-25 15:59:06,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-25 15:59:06,700 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 364 [2019-02-25 15:59:06,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:59:06,701 INFO L225 Difference]: With dead ends: 371 [2019-02-25 15:59:06,701 INFO L226 Difference]: Without dead ends: 370 [2019-02-25 15:59:06,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 817 GetRequests, 544 SyntacticMatches, 82 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30277 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-02-25 15:59:06,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-02-25 15:59:06,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 369. [2019-02-25 15:59:06,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-02-25 15:59:06,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 369 transitions. [2019-02-25 15:59:06,707 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 369 transitions. Word has length 364 [2019-02-25 15:59:06,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:59:06,707 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 369 transitions. [2019-02-25 15:59:06,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2019-02-25 15:59:06,707 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 369 transitions. [2019-02-25 15:59:06,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-02-25 15:59:06,708 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:59:06,708 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 91, 91, 1, 1] [2019-02-25 15:59:06,709 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:59:06,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:59:06,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1390280489, now seen corresponding path program 91 times [2019-02-25 15:59:06,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:59:06,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:06,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:59:06,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:06,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:59:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:59:10,472 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:10,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:10,473 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:59:10,473 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:59:10,473 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:59:10,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:10,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 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:59:10,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:59:10,481 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:59:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:59:10,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 283 conjunts are in the unsatisfiable core [2019-02-25 15:59:10,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:59:10,587 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:59:10,587 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:10,595 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:10,596 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:59:15,120 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:15,120 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:59:19,261 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:19,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:59:19,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 192 [2019-02-25 15:59:19,280 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:59:19,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2019-02-25 15:59:19,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2019-02-25 15:59:19,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-02-25 15:59:19,283 INFO L87 Difference]: Start difference. First operand 369 states and 369 transitions. Second operand 186 states. [2019-02-25 15:59:20,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:59:20,008 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2019-02-25 15:59:20,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-02-25 15:59:20,008 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 368 [2019-02-25 15:59:20,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:59:20,010 INFO L225 Difference]: With dead ends: 375 [2019-02-25 15:59:20,011 INFO L226 Difference]: Without dead ends: 374 [2019-02-25 15:59:20,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 826 GetRequests, 550 SyntacticMatches, 84 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30774 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-02-25 15:59:20,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-02-25 15:59:20,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2019-02-25 15:59:20,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-02-25 15:59:20,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2019-02-25 15:59:20,017 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 368 [2019-02-25 15:59:20,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:59:20,017 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2019-02-25 15:59:20,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2019-02-25 15:59:20,017 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2019-02-25 15:59:20,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-02-25 15:59:20,019 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:59:20,019 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 92, 92, 1, 1] [2019-02-25 15:59:20,019 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:59:20,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:59:20,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1474538782, now seen corresponding path program 92 times [2019-02-25 15:59:20,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:59:20,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:20,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:59:20,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:20,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:59:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:59:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:23,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:23,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:59:23,791 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:59:23,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:59:23,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:23,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 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:59:23,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:59:23,800 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:59:24,386 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2019-02-25 15:59:24,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:59:24,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 286 conjunts are in the unsatisfiable core [2019-02-25 15:59:24,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:59:24,401 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:59:24,401 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:24,405 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:24,405 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:59:29,056 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:29,056 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:59:33,118 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:33,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:59:33,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 193 [2019-02-25 15:59:33,137 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:59:33,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2019-02-25 15:59:33,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2019-02-25 15:59:33,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-02-25 15:59:33,141 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 188 states. [2019-02-25 15:59:33,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:59:33,848 INFO L93 Difference]: Finished difference Result 379 states and 379 transitions. [2019-02-25 15:59:33,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-25 15:59:33,848 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 372 [2019-02-25 15:59:33,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:59:33,850 INFO L225 Difference]: With dead ends: 379 [2019-02-25 15:59:33,850 INFO L226 Difference]: Without dead ends: 378 [2019-02-25 15:59:33,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 835 GetRequests, 556 SyntacticMatches, 86 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31271 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-02-25 15:59:33,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-02-25 15:59:33,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2019-02-25 15:59:33,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-02-25 15:59:33,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2019-02-25 15:59:33,857 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 372 [2019-02-25 15:59:33,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:59:33,857 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2019-02-25 15:59:33,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2019-02-25 15:59:33,857 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2019-02-25 15:59:33,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-02-25 15:59:33,858 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:59:33,859 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 1, 1] [2019-02-25 15:59:33,859 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:59:33,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:59:33,859 INFO L82 PathProgramCache]: Analyzing trace with hash -903339493, now seen corresponding path program 93 times [2019-02-25 15:59:33,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:59:33,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:33,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:59:33,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:33,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:59:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:59:37,771 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:37,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:37,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:59:37,772 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:59:37,772 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:59:37,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:37,772 INFO 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:59:37,782 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:59:37,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:59:37,898 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:59:37,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:59:37,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 289 conjunts are in the unsatisfiable core [2019-02-25 15:59:37,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:59:37,909 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:59:37,909 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:37,917 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:37,917 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:59:42,679 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:42,679 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:59:46,746 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:46,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:59:46,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 194 [2019-02-25 15:59:46,766 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:59:46,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2019-02-25 15:59:46,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2019-02-25 15:59:46,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-02-25 15:59:46,769 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 190 states. [2019-02-25 15:59:47,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:59:47,454 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2019-02-25 15:59:47,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-02-25 15:59:47,455 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 376 [2019-02-25 15:59:47,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:59:47,457 INFO L225 Difference]: With dead ends: 383 [2019-02-25 15:59:47,457 INFO L226 Difference]: Without dead ends: 382 [2019-02-25 15:59:47,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 562 SyntacticMatches, 88 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31768 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-02-25 15:59:47,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-02-25 15:59:47,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2019-02-25 15:59:47,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-02-25 15:59:47,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-02-25 15:59:47,464 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 376 [2019-02-25 15:59:47,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:59:47,464 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2019-02-25 15:59:47,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2019-02-25 15:59:47,464 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2019-02-25 15:59:47,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-02-25 15:59:47,465 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:59:47,466 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 1, 1] [2019-02-25 15:59:47,466 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:59:47,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:59:47,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1456975060, now seen corresponding path program 94 times [2019-02-25 15:59:47,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:59:47,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:47,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:59:47,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:47,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:59:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:59:51,420 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:51,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:51,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:59:51,421 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:59:51,421 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:59:51,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:51,421 INFO 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:59:51,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:59:51,430 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:59:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:59:51,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 292 conjunts are in the unsatisfiable core [2019-02-25 15:59:51,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:59:51,537 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:59:51,537 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:51,544 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:51,544 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:59:56,348 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:56,348 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:00:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:00,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:00:00,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 195 [2019-02-25 16:00:00,536 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:00:00,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2019-02-25 16:00:00,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2019-02-25 16:00:00,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-02-25 16:00:00,538 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 192 states. [2019-02-25 16:00:01,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:00:01,292 INFO L93 Difference]: Finished difference Result 387 states and 387 transitions. [2019-02-25 16:00:01,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-25 16:00:01,293 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 380 [2019-02-25 16:00:01,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:00:01,295 INFO L225 Difference]: With dead ends: 387 [2019-02-25 16:00:01,295 INFO L226 Difference]: Without dead ends: 386 [2019-02-25 16:00:01,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 568 SyntacticMatches, 90 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32265 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-02-25 16:00:01,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-02-25 16:00:01,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 385. [2019-02-25 16:00:01,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-02-25 16:00:01,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 385 transitions. [2019-02-25 16:00:01,302 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 385 transitions. Word has length 380 [2019-02-25 16:00:01,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:00:01,302 INFO L480 AbstractCegarLoop]: Abstraction has 385 states and 385 transitions. [2019-02-25 16:00:01,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2019-02-25 16:00:01,302 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 385 transitions. [2019-02-25 16:00:01,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-02-25 16:00:01,303 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:00:01,304 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 95, 95, 1, 1] [2019-02-25 16:00:01,304 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:00:01,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:00:01,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1763626227, now seen corresponding path program 95 times [2019-02-25 16:00:01,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:00:01,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:00:01,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:00:01,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:00:01,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:00:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:00:05,543 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:05,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:05,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:00:05,543 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 16:00:05,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 16:00:05,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:05,544 INFO 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 16:00:05,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 16:00:05,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 16:00:06,179 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2019-02-25 16:00:06,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 16:00:06,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 295 conjunts are in the unsatisfiable core [2019-02-25 16:00:06,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:00:06,191 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 16:00:06,192 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:06,202 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:06,202 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 16:00:11,167 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:11,167 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:00:15,237 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:15,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:00:15,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 196 [2019-02-25 16:00:15,257 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:00:15,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2019-02-25 16:00:15,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2019-02-25 16:00:15,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-02-25 16:00:15,260 INFO L87 Difference]: Start difference. First operand 385 states and 385 transitions. Second operand 194 states. [2019-02-25 16:00:16,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:00:16,114 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2019-02-25 16:00:16,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-02-25 16:00:16,115 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 384 [2019-02-25 16:00:16,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:00:16,116 INFO L225 Difference]: With dead ends: 391 [2019-02-25 16:00:16,116 INFO L226 Difference]: Without dead ends: 390 [2019-02-25 16:00:16,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 862 GetRequests, 574 SyntacticMatches, 92 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32762 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-02-25 16:00:16,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-02-25 16:00:16,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2019-02-25 16:00:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-02-25 16:00:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2019-02-25 16:00:16,122 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 384 [2019-02-25 16:00:16,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:00:16,122 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2019-02-25 16:00:16,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2019-02-25 16:00:16,123 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2019-02-25 16:00:16,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-02-25 16:00:16,124 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:00:16,124 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 96, 96, 1, 1] [2019-02-25 16:00:16,124 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:00:16,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:00:16,125 INFO L82 PathProgramCache]: Analyzing trace with hash 232453318, now seen corresponding path program 96 times [2019-02-25 16:00:16,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:00:16,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:00:16,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 16:00:16,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:00:16,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:00:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:00:20,549 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:20,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:20,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:00:20,550 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 16:00:20,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 16:00:20,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:20,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:00:20,560 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 16:00:20,560 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 16:00:20,676 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 16:00:20,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 16:00:20,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 298 conjunts are in the unsatisfiable core [2019-02-25 16:00:20,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:00:20,688 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 16:00:20,688 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:20,698 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:20,698 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 16:00:25,740 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:25,740 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:00:29,943 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:29,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:00:29,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 197 [2019-02-25 16:00:29,961 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:00:29,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2019-02-25 16:00:29,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2019-02-25 16:00:29,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-02-25 16:00:29,964 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 196 states. [2019-02-25 16:00:30,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:00:30,806 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2019-02-25 16:00:30,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-25 16:00:30,806 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 388 [2019-02-25 16:00:30,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:00:30,808 INFO L225 Difference]: With dead ends: 395 [2019-02-25 16:00:30,808 INFO L226 Difference]: Without dead ends: 394 [2019-02-25 16:00:30,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 871 GetRequests, 580 SyntacticMatches, 94 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33259 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-02-25 16:00:30,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-02-25 16:00:30,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2019-02-25 16:00:30,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-02-25 16:00:30,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2019-02-25 16:00:30,815 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 388 [2019-02-25 16:00:30,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:00:30,815 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2019-02-25 16:00:30,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2019-02-25 16:00:30,816 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2019-02-25 16:00:30,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-02-25 16:00:30,817 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:00:30,817 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 97, 97, 1, 1] [2019-02-25 16:00:30,817 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:00:30,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:00:30,817 INFO L82 PathProgramCache]: Analyzing trace with hash 171651583, now seen corresponding path program 97 times [2019-02-25 16:00:30,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:00:30,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:00:30,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 16:00:30,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:00:30,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:00:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:00:35,004 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:35,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:35,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:00:35,005 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 16:00:35,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 16:00:35,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:35,005 INFO 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 16:00:35,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:00:35,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 16:00:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:00:35,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 301 conjunts are in the unsatisfiable core [2019-02-25 16:00:35,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:00:35,123 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 16:00:35,123 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:35,132 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:35,132 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 16:00:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:40,248 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:00:44,379 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:44,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:00:44,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 198 [2019-02-25 16:00:44,419 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:00:44,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2019-02-25 16:00:44,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2019-02-25 16:00:44,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-02-25 16:00:44,422 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 198 states. [2019-02-25 16:00:45,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:00:45,167 INFO L93 Difference]: Finished difference Result 399 states and 399 transitions. [2019-02-25 16:00:45,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-02-25 16:00:45,168 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 392 [2019-02-25 16:00:45,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:00:45,170 INFO L225 Difference]: With dead ends: 399 [2019-02-25 16:00:45,170 INFO L226 Difference]: Without dead ends: 398 [2019-02-25 16:00:45,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 880 GetRequests, 586 SyntacticMatches, 96 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33756 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-02-25 16:00:45,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-02-25 16:00:45,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2019-02-25 16:00:45,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-02-25 16:00:45,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2019-02-25 16:00:45,177 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 392 [2019-02-25 16:00:45,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:00:45,177 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2019-02-25 16:00:45,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2019-02-25 16:00:45,177 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2019-02-25 16:00:45,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-02-25 16:00:45,179 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:00:45,179 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 98, 98, 1, 1] [2019-02-25 16:00:45,179 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:00:45,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:00:45,179 INFO L82 PathProgramCache]: Analyzing trace with hash 894970552, now seen corresponding path program 98 times [2019-02-25 16:00:45,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:00:45,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:00:45,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:00:45,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:00:45,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:00:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:00:49,466 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:49,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:49,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:00:49,466 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 16:00:49,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 16:00:49,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:49,467 INFO 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 16:00:49,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 16:00:49,476 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 16:00:50,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 99 check-sat command(s) [2019-02-25 16:00:50,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 16:00:50,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 304 conjunts are in the unsatisfiable core [2019-02-25 16:00:50,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:00:50,168 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 16:00:50,168 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:50,177 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:50,177 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 16:00:55,397 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:55,398 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:00:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:59,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:00:59,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 199 [2019-02-25 16:00:59,492 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:00:59,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2019-02-25 16:00:59,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2019-02-25 16:00:59,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-02-25 16:00:59,495 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 200 states. [2019-02-25 16:01:00,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:01:00,297 INFO L93 Difference]: Finished difference Result 403 states and 403 transitions. [2019-02-25 16:01:00,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-02-25 16:01:00,298 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 396 [2019-02-25 16:01:00,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:01:00,300 INFO L225 Difference]: With dead ends: 403 [2019-02-25 16:01:00,300 INFO L226 Difference]: Without dead ends: 402 [2019-02-25 16:01:00,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 592 SyntacticMatches, 98 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34253 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-02-25 16:01:00,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-02-25 16:01:00,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 401. [2019-02-25 16:01:00,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-02-25 16:01:00,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2019-02-25 16:01:00,306 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 396 [2019-02-25 16:01:00,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:01:00,306 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2019-02-25 16:01:00,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2019-02-25 16:01:00,306 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2019-02-25 16:01:00,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-02-25 16:01:00,308 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:01:00,309 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 99, 99, 1, 1] [2019-02-25 16:01:00,309 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:01:00,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:01:00,309 INFO L82 PathProgramCache]: Analyzing trace with hash 594026225, now seen corresponding path program 99 times [2019-02-25 16:01:00,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:01:00,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:01:00,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 16:01:00,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:01:00,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:01:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:01:04,726 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:01:04,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:01:04,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:01:04,726 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 16:01:04,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 16:01:04,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:01:04,727 INFO 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 16:01:04,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 16:01:04,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 16:01:04,873 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 16:01:04,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 16:01:04,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 307 conjunts are in the unsatisfiable core [2019-02-25 16:01:04,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:01:04,885 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 16:01:04,886 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:04,889 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:04,889 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 16:01:10,173 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:01:10,173 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:01:14,224 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:01:14,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:01:14,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 200 [2019-02-25 16:01:14,244 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:01:14,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2019-02-25 16:01:14,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2019-02-25 16:01:14,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-02-25 16:01:14,247 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 202 states. [2019-02-25 16:01:15,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:01:15,099 INFO L93 Difference]: Finished difference Result 407 states and 407 transitions. [2019-02-25 16:01:15,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-25 16:01:15,099 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 400 [2019-02-25 16:01:15,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:01:15,101 INFO L225 Difference]: With dead ends: 407 [2019-02-25 16:01:15,101 INFO L226 Difference]: Without dead ends: 406 [2019-02-25 16:01:15,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 898 GetRequests, 599 SyntacticMatches, 99 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34551 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-02-25 16:01:15,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-02-25 16:01:15,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 405. [2019-02-25 16:01:15,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-02-25 16:01:15,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 405 transitions. [2019-02-25 16:01:15,108 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 405 transitions. Word has length 400 [2019-02-25 16:01:15,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:01:15,109 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 405 transitions. [2019-02-25 16:01:15,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2019-02-25 16:01:15,109 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 405 transitions. [2019-02-25 16:01:15,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-02-25 16:01:15,110 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:01:15,111 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 100, 100, 1, 1] [2019-02-25 16:01:15,111 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:01:15,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:01:15,111 INFO L82 PathProgramCache]: Analyzing trace with hash -478064982, now seen corresponding path program 100 times [2019-02-25 16:01:15,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:01:15,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:01:15,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 16:01:15,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:01:15,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:01:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:01:19,477 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 19603 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:01:19,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:01:19,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:01:19,478 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 16:01:19,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 16:01:19,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:01:19,478 INFO 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 16:01:19,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:01:19,487 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 16:01:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:01:19,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 103 conjunts are in the unsatisfiable core [2019-02-25 16:01:19,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:01:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 20000 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:01:19,798 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:01:23,817 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 20000 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:01:23,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:01:23,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 104 [2019-02-25 16:01:23,835 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:01:23,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-02-25 16:01:23,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-02-25 16:01:23,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5258, Invalid=5662, Unknown=0, NotChecked=0, Total=10920 [2019-02-25 16:01:23,838 INFO L87 Difference]: Start difference. First operand 405 states and 405 transitions. Second operand 105 states. [2019-02-25 16:01:25,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:01:25,196 INFO L93 Difference]: Finished difference Result 408 states and 408 transitions. [2019-02-25 16:01:25,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-02-25 16:01:25,196 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 404 [2019-02-25 16:01:25,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:01:25,197 INFO L225 Difference]: With dead ends: 408 [2019-02-25 16:01:25,197 INFO L226 Difference]: Without dead ends: 0 [2019-02-25 16:01:25,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 910 GetRequests, 706 SyntacticMatches, 100 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5643 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=5362, Invalid=5768, Unknown=0, NotChecked=0, Total=11130 [2019-02-25 16:01:25,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-25 16:01:25,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-25 16:01:25,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-25 16:01:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-25 16:01:25,202 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 404 [2019-02-25 16:01:25,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:01:25,202 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-25 16:01:25,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-02-25 16:01:25,202 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-25 16:01:25,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-25 16:01:25,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-25 16:01:28,129 WARN L181 SmtUtils]: Spent 2.81 s on a formula simplification. DAG size of input: 511 DAG size of output: 509 [2019-02-25 16:01:28,135 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 3 24) no Hoare annotation was computed. [2019-02-25 16:01:28,135 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 3 24) no Hoare annotation was computed. [2019-02-25 16:01:28,135 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-02-25 16:01:28,135 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2019-02-25 16:01:28,135 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 17) no Hoare annotation was computed. [2019-02-25 16:01:28,135 INFO L448 ceAbstractionStarter]: For program point L16-1(lines 16 20) no Hoare annotation was computed. [2019-02-25 16:01:28,137 INFO L444 ceAbstractionStarter]: At program point L13-1(lines 13 22) the Hoare annotation is: (let ((.cse0 (<= 400 (select |#length| main_q.base)))) (or (and (<= main_q.offset 112) (<= (+ main_p.offset 112) main_q.offset) .cse0) (and (<= main_q.offset 260) (<= (+ main_p.offset 260) main_q.offset) .cse0) (and (<= (+ main_p.offset 128) main_q.offset) (<= main_q.offset 128) .cse0) (and (<= (+ main_p.offset 196) main_q.offset) (<= main_q.offset 196) .cse0) (and (<= main_q.offset 124) (<= (+ main_p.offset 124) main_q.offset) .cse0) (and (<= (+ main_p.offset 308) main_q.offset) (<= main_q.offset 308) .cse0) (and (<= main_q.offset 240) (<= (+ main_p.offset 240) main_q.offset) .cse0) (and (<= main_q.offset 332) (<= (+ main_p.offset 332) main_q.offset) .cse0) (and (<= (+ main_p.offset 296) main_q.offset) (<= main_q.offset 296) .cse0) (and (<= (+ main_p.offset 268) main_q.offset) (<= main_q.offset 268) .cse0) (and (<= main_q.offset 160) (<= (+ main_p.offset 160) main_q.offset) .cse0) (and (<= main_q.offset 180) (<= (+ main_p.offset 180) main_q.offset) .cse0) (and (<= (+ main_p.offset 368) main_q.offset) (<= main_q.offset 368) .cse0) (and (<= main_q.offset 384) (<= (+ main_p.offset 384) main_q.offset) .cse0) (and (<= main_q.offset 392) (<= (+ main_p.offset 392) main_q.offset) .cse0) (and (<= main_q.offset 144) .cse0 (<= (+ main_p.offset 144) main_q.offset)) (and (<= main_q.offset 200) (<= (+ main_p.offset 200) main_q.offset) .cse0) (and (<= (+ main_p.offset 288) main_q.offset) (<= main_q.offset 288) .cse0) (and (<= main_q.offset 340) (<= (+ main_p.offset 340) main_q.offset) .cse0) (and (<= (+ main_p.offset 276) main_q.offset) (<= main_q.offset 276) .cse0) (and (<= main_q.offset 356) (<= (+ main_p.offset 356) main_q.offset) .cse0) (and (<= main_q.offset 336) (<= (+ main_p.offset 336) main_q.offset) .cse0) (and (<= (+ main_p.offset 140) main_q.offset) (<= main_q.offset 140) .cse0) (and (<= main_q.offset 244) (<= (+ main_p.offset 244) main_q.offset) .cse0) (and (<= (+ main_p.offset 312) main_q.offset) (<= main_q.offset 312) .cse0) (and (<= (+ main_p.offset 396) main_q.offset) (<= main_q.offset 396) .cse0) (and (<= main_q.offset 148) (<= (+ main_p.offset 148) main_q.offset) .cse0) (and (<= (+ main_p.offset 352) main_q.offset) (<= main_q.offset 352) .cse0) (and (<= main_q.offset 344) (<= (+ main_p.offset 344) main_q.offset) .cse0) (and (<= main_q.offset 164) (<= (+ main_p.offset 164) main_q.offset) .cse0) (and (<= (+ main_p.offset 304) main_q.offset) (<= main_q.offset 304) .cse0) (and (<= main_q.offset 320) (<= (+ main_p.offset 320) main_q.offset) .cse0) (and (<= (+ main_p.offset 36) main_q.offset) (<= main_q.offset 36) .cse0) (and (<= (+ main_p.offset 44) main_q.offset) (<= main_q.offset 44) .cse0) (and (<= (+ main_p.offset 228) main_q.offset) (<= main_q.offset 228) .cse0) (and (<= (+ main_p.offset 284) main_q.offset) (<= main_q.offset 284) .cse0) (and (<= (+ main_p.offset 188) main_q.offset) (<= main_q.offset 188) .cse0) (and (<= (+ main_p.offset 8) main_q.offset) (<= main_q.offset 8) .cse0) (and (<= main_q.offset 348) .cse0 (<= (+ main_p.offset 348) main_q.offset)) (<= (+ main_p.offset 400) main_q.offset) (and (<= (+ main_p.offset 224) main_q.offset) (<= main_q.offset 224) .cse0) (and (<= (+ main_p.offset 120) main_q.offset) (<= main_q.offset 120) .cse0) (and (<= main_q.offset 232) (<= (+ main_p.offset 232) main_q.offset) .cse0) (and (<= main_q.offset 92) (<= (+ main_p.offset 92) main_q.offset) .cse0) (and (<= main_q.offset 236) (<= (+ main_p.offset 236) main_q.offset) .cse0) (and (<= (+ main_p.offset 328) main_q.offset) (<= main_q.offset 328) .cse0) (and (<= main_q.offset 12) (<= (+ main_p.offset 12) main_q.offset) .cse0) (and (<= (+ main_p.offset 64) main_q.offset) (<= main_q.offset 64) .cse0) (and (<= (+ main_p.offset 192) main_q.offset) (<= main_q.offset 192) .cse0) (and (<= (+ main_p.offset 104) main_q.offset) (<= main_q.offset 104) .cse0) (and (<= main_q.offset 280) (<= (+ main_p.offset 280) main_q.offset) .cse0) (and (<= (+ main_p.offset 316) main_q.offset) (<= main_q.offset 316) .cse0) (and (<= main_q.offset 152) (<= (+ main_p.offset 152) main_q.offset) .cse0) (and (<= (+ main_p.offset 248) main_q.offset) (<= main_q.offset 248) .cse0) (and (<= main_q.offset 28) (<= (+ main_p.offset 28) main_q.offset) .cse0) (and (<= (+ main_p.offset 68) main_q.offset) (<= main_q.offset 68) .cse0) (and (<= main_q.offset 4) .cse0 (<= (+ main_p.offset 4) main_q.offset)) (and (<= (+ main_p.offset 204) main_q.offset) (<= main_q.offset 204) .cse0) (and (<= main_q.offset 380) (<= (+ main_p.offset 380) main_q.offset) .cse0) (and (<= main_q.offset 52) (<= (+ main_p.offset 52) main_q.offset) .cse0) (and (<= (+ main_p.offset 172) main_q.offset) (<= main_q.offset 172) .cse0) (and (<= main_q.offset 56) (<= (+ main_p.offset 56) main_q.offset) .cse0) (and (<= main_q.offset 60) (<= (+ main_p.offset 60) main_q.offset) .cse0) (and (<= main_q.offset 100) (<= (+ main_p.offset 100) main_q.offset) .cse0) (and (<= main_q.offset 208) (<= (+ main_p.offset 208) main_q.offset) .cse0) (and (<= (+ main_p.offset 220) main_q.offset) (<= main_q.offset 220) .cse0) (and (<= (+ main_p.offset 132) main_q.offset) (<= main_q.offset 132) .cse0) (and (<= main_q.offset 176) (<= (+ main_p.offset 176) main_q.offset) .cse0) (and (<= main_q.offset 116) (<= (+ main_p.offset 116) main_q.offset) .cse0) (and (<= (+ main_p.offset 136) main_q.offset) (<= main_q.offset 136) .cse0) (and (<= main_q.offset 184) (<= (+ main_p.offset 184) main_q.offset) .cse0) (and (<= main_q.offset 20) (<= (+ main_p.offset 20) main_q.offset) .cse0) (and (<= (+ main_p.offset 216) main_q.offset) (<= main_q.offset 216) .cse0) (and (<= (+ main_p.offset 376) main_q.offset) (<= main_q.offset 376) .cse0) (and (<= (+ main_p.offset 324) main_q.offset) (<= main_q.offset 324) .cse0) (and (<= (+ main_p.offset 72) main_q.offset) (<= main_q.offset 72) .cse0) (and (<= main_q.offset 76) (<= (+ main_p.offset 76) main_q.offset) .cse0) (and (<= main_q.offset 16) (<= (+ main_p.offset 16) main_q.offset) .cse0) (and (<= main_q.offset 84) (<= (+ main_p.offset 84) main_q.offset) .cse0) (and (<= (+ main_p.offset 156) main_q.offset) (<= main_q.offset 156) .cse0) (and (<= (+ main_p.offset 364) main_q.offset) (<= main_q.offset 364) .cse0) (and (<= (+ main_p.offset 88) main_q.offset) .cse0 (<= main_q.offset 88)) (and (<= main_q.offset 168) (<= (+ main_p.offset 168) main_q.offset) .cse0) (and (<= (+ main_p.offset 48) main_q.offset) (<= main_q.offset 48) .cse0) (and (<= main_q.offset 252) (<= (+ main_p.offset 252) main_q.offset) .cse0) (and (<= (+ main_p.offset 264) main_q.offset) (<= main_q.offset 264) .cse0) (and (<= (+ main_p.offset 388) main_q.offset) (<= main_q.offset 388) .cse0) (and (<= main_q.offset 0) .cse0 (= main_p.offset main_q.offset)) (and (<= (+ main_p.offset 40) main_q.offset) (<= main_q.offset 40) .cse0) (and (<= main_q.offset 256) (<= (+ main_p.offset 256) main_q.offset) .cse0) (and (<= main_q.offset 300) .cse0 (<= (+ main_p.offset 300) main_q.offset)) (and (<= (+ main_p.offset 80) main_q.offset) (<= main_q.offset 80) .cse0) (and (<= main_q.offset 108) .cse0 (<= (+ main_p.offset 108) main_q.offset)) (and (<= main_q.offset 212) (<= (+ main_p.offset 212) main_q.offset) .cse0) (and (<= main_q.offset 372) (<= (+ main_p.offset 372) main_q.offset) .cse0) (and (<= (+ main_p.offset 96) main_q.offset) .cse0 (<= main_q.offset 96)) (and (<= (+ main_p.offset 272) main_q.offset) (<= main_q.offset 272) .cse0) (and (<= main_q.offset 292) (<= (+ main_p.offset 292) main_q.offset) .cse0) (and (<= (+ main_p.offset 360) main_q.offset) (<= main_q.offset 360) .cse0) (and (<= main_q.offset 32) (<= (+ main_p.offset 32) main_q.offset) .cse0) (and (<= (+ main_p.offset 24) main_q.offset) (<= main_q.offset 24) .cse0))) [2019-02-25 16:01:28,137 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 3 24) no Hoare annotation was computed. [2019-02-25 16:01:28,182 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.02 04:01:28 BoogieIcfgContainer [2019-02-25 16:01:28,182 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-25 16:01:28,182 INFO L168 Benchmark]: Toolchain (without parser) took 725950.12 ms. Allocated memory was 138.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 106.0 MB in the beginning and 687.1 MB in the end (delta: -581.1 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-02-25 16:01:28,183 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 138.4 MB. Free memory is still 107.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-25 16:01:28,183 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.59 ms. Allocated memory is still 138.4 MB. Free memory was 105.8 MB in the beginning and 103.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-02-25 16:01:28,184 INFO L168 Benchmark]: Boogie Preprocessor took 23.63 ms. Allocated memory is still 138.4 MB. Free memory was 103.6 MB in the beginning and 102.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-25 16:01:28,184 INFO L168 Benchmark]: RCFGBuilder took 363.52 ms. Allocated memory is still 138.4 MB. Free memory was 102.4 MB in the beginning and 92.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-02-25 16:01:28,184 INFO L168 Benchmark]: TraceAbstraction took 725506.02 ms. Allocated memory was 138.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 91.9 MB in the beginning and 687.1 MB in the end (delta: -595.2 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-02-25 16:01:28,186 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 138.4 MB. Free memory is still 107.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 52.59 ms. Allocated memory is still 138.4 MB. Free memory was 105.8 MB in the beginning and 103.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.63 ms. Allocated memory is still 138.4 MB. Free memory was 103.6 MB in the beginning and 102.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 363.52 ms. Allocated memory is still 138.4 MB. Free memory was 102.4 MB in the beginning and 92.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 725506.02 ms. Allocated memory was 138.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 91.9 MB in the beginning and 687.1 MB in the end (delta: -595.2 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((q!offset <= 112 && p!offset + 112 <= q!offset) && 400 <= #length[q!base]) || ((q!offset <= 260 && p!offset + 260 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 128 <= q!offset && q!offset <= 128) && 400 <= #length[q!base])) || ((p!offset + 196 <= q!offset && q!offset <= 196) && 400 <= #length[q!base])) || ((q!offset <= 124 && p!offset + 124 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 308 <= q!offset && q!offset <= 308) && 400 <= #length[q!base])) || ((q!offset <= 240 && p!offset + 240 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 332 && p!offset + 332 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 296 <= q!offset && q!offset <= 296) && 400 <= #length[q!base])) || ((p!offset + 268 <= q!offset && q!offset <= 268) && 400 <= #length[q!base])) || ((q!offset <= 160 && p!offset + 160 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 180 && p!offset + 180 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 368 <= q!offset && q!offset <= 368) && 400 <= #length[q!base])) || ((q!offset <= 384 && p!offset + 384 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 392 && p!offset + 392 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 144 && 400 <= #length[q!base]) && p!offset + 144 <= q!offset)) || ((q!offset <= 200 && p!offset + 200 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 288 <= q!offset && q!offset <= 288) && 400 <= #length[q!base])) || ((q!offset <= 340 && p!offset + 340 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 276 <= q!offset && q!offset <= 276) && 400 <= #length[q!base])) || ((q!offset <= 356 && p!offset + 356 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 336 && p!offset + 336 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 140 <= q!offset && q!offset <= 140) && 400 <= #length[q!base])) || ((q!offset <= 244 && p!offset + 244 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 312 <= q!offset && q!offset <= 312) && 400 <= #length[q!base])) || ((p!offset + 396 <= q!offset && q!offset <= 396) && 400 <= #length[q!base])) || ((q!offset <= 148 && p!offset + 148 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 352 <= q!offset && q!offset <= 352) && 400 <= #length[q!base])) || ((q!offset <= 344 && p!offset + 344 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 164 && p!offset + 164 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 304 <= q!offset && q!offset <= 304) && 400 <= #length[q!base])) || ((q!offset <= 320 && p!offset + 320 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 36 <= q!offset && q!offset <= 36) && 400 <= #length[q!base])) || ((p!offset + 44 <= q!offset && q!offset <= 44) && 400 <= #length[q!base])) || ((p!offset + 228 <= q!offset && q!offset <= 228) && 400 <= #length[q!base])) || ((p!offset + 284 <= q!offset && q!offset <= 284) && 400 <= #length[q!base])) || ((p!offset + 188 <= q!offset && q!offset <= 188) && 400 <= #length[q!base])) || ((p!offset + 8 <= q!offset && q!offset <= 8) && 400 <= #length[q!base])) || ((q!offset <= 348 && 400 <= #length[q!base]) && p!offset + 348 <= q!offset)) || p!offset + 400 <= q!offset) || ((p!offset + 224 <= q!offset && q!offset <= 224) && 400 <= #length[q!base])) || ((p!offset + 120 <= q!offset && q!offset <= 120) && 400 <= #length[q!base])) || ((q!offset <= 232 && p!offset + 232 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 92 && p!offset + 92 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 236 && p!offset + 236 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 328 <= q!offset && q!offset <= 328) && 400 <= #length[q!base])) || ((q!offset <= 12 && p!offset + 12 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 64 <= q!offset && q!offset <= 64) && 400 <= #length[q!base])) || ((p!offset + 192 <= q!offset && q!offset <= 192) && 400 <= #length[q!base])) || ((p!offset + 104 <= q!offset && q!offset <= 104) && 400 <= #length[q!base])) || ((q!offset <= 280 && p!offset + 280 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 316 <= q!offset && q!offset <= 316) && 400 <= #length[q!base])) || ((q!offset <= 152 && p!offset + 152 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 248 <= q!offset && q!offset <= 248) && 400 <= #length[q!base])) || ((q!offset <= 28 && p!offset + 28 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 68 <= q!offset && q!offset <= 68) && 400 <= #length[q!base])) || ((q!offset <= 4 && 400 <= #length[q!base]) && p!offset + 4 <= q!offset)) || ((p!offset + 204 <= q!offset && q!offset <= 204) && 400 <= #length[q!base])) || ((q!offset <= 380 && p!offset + 380 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 52 && p!offset + 52 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 172 <= q!offset && q!offset <= 172) && 400 <= #length[q!base])) || ((q!offset <= 56 && p!offset + 56 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 60 && p!offset + 60 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 100 && p!offset + 100 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 208 && p!offset + 208 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 220 <= q!offset && q!offset <= 220) && 400 <= #length[q!base])) || ((p!offset + 132 <= q!offset && q!offset <= 132) && 400 <= #length[q!base])) || ((q!offset <= 176 && p!offset + 176 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 116 && p!offset + 116 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 136 <= q!offset && q!offset <= 136) && 400 <= #length[q!base])) || ((q!offset <= 184 && p!offset + 184 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 20 && p!offset + 20 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 216 <= q!offset && q!offset <= 216) && 400 <= #length[q!base])) || ((p!offset + 376 <= q!offset && q!offset <= 376) && 400 <= #length[q!base])) || ((p!offset + 324 <= q!offset && q!offset <= 324) && 400 <= #length[q!base])) || ((p!offset + 72 <= q!offset && q!offset <= 72) && 400 <= #length[q!base])) || ((q!offset <= 76 && p!offset + 76 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 16 && p!offset + 16 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 84 && p!offset + 84 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 156 <= q!offset && q!offset <= 156) && 400 <= #length[q!base])) || ((p!offset + 364 <= q!offset && q!offset <= 364) && 400 <= #length[q!base])) || ((p!offset + 88 <= q!offset && 400 <= #length[q!base]) && q!offset <= 88)) || ((q!offset <= 168 && p!offset + 168 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 48 <= q!offset && q!offset <= 48) && 400 <= #length[q!base])) || ((q!offset <= 252 && p!offset + 252 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 264 <= q!offset && q!offset <= 264) && 400 <= #length[q!base])) || ((p!offset + 388 <= q!offset && q!offset <= 388) && 400 <= #length[q!base])) || ((q!offset <= 0 && 400 <= #length[q!base]) && p!offset == q!offset)) || ((p!offset + 40 <= q!offset && q!offset <= 40) && 400 <= #length[q!base])) || ((q!offset <= 256 && p!offset + 256 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 300 && 400 <= #length[q!base]) && p!offset + 300 <= q!offset)) || ((p!offset + 80 <= q!offset && q!offset <= 80) && 400 <= #length[q!base])) || ((q!offset <= 108 && 400 <= #length[q!base]) && p!offset + 108 <= q!offset)) || ((q!offset <= 212 && p!offset + 212 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 372 && p!offset + 372 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 96 <= q!offset && 400 <= #length[q!base]) && q!offset <= 96)) || ((p!offset + 272 <= q!offset && q!offset <= 272) && 400 <= #length[q!base])) || ((q!offset <= 292 && p!offset + 292 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 360 <= q!offset && q!offset <= 360) && 400 <= #length[q!base])) || ((q!offset <= 32 && p!offset + 32 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 24 <= q!offset && q!offset <= 24) && 400 <= #length[q!base]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 725.3s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 44.2s AutomataDifference, 0.0s DeadEndRemovalTime, 2.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 403 SDtfs, 7610 SDslu, 7951 SDs, 0 SdLazy, 28139 SolverSat, 355 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46154 GetRequests, 30803 SyntacticMatches, 2649 SemanticMatches, 12702 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1303267 ImplicationChecksByTransitivity, 609.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=405occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 10.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 101 MinimizatonAttempts, 100 StatesRemovedByMinimization, 100 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 102 NumberOfFragments, 1404 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 7 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 1.0s SsaConstructionTime, 13.9s SatisfiabilityAnalysisTime, 641.5s InterpolantComputationTime, 41204 NumberOfCodeBlocks, 41204 NumberOfCodeBlocksAsserted, 1884 NumberOfCheckSat, 61503 ConstructedInterpolants, 0 QuantifiedInterpolants, 126003756 SizeOfPredicates, 596 NumberOfNonLiveVariables, 37650 ConjunctsInSsa, 15943 ConjunctsInUnsatCore, 301 InterpolantComputations, 1 PerfectInterpolantSequences, 59603/2045250 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...