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_compound_oct_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/functions1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:40:25,175 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:40:25,177 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:40:25,190 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:40:25,190 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:40:25,191 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:40:25,193 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:40:25,196 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:40:25,198 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:40:25,199 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:40:25,202 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:40:25,202 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:40:25,203 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:40:25,204 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:40:25,214 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:40:25,215 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:40:25,216 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:40:25,219 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:40:25,225 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:40:25,226 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:40:25,229 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:40:25,230 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:40:25,233 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:40:25,233 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:40:25,234 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:40:25,234 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:40:25,236 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:40:25,237 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:40:25,240 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:40:25,242 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:40:25,243 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:40:25,244 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:40:25,244 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:40:25,245 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:40:25,245 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:40:25,248 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:40:25,249 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:40:25,274 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:40:25,274 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:40:25,276 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:40:25,276 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:40:25,276 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:40:25,276 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:40:25,276 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:40:25,277 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:40:25,277 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:40:25,277 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:40:25,278 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:40:25,278 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:40:25,278 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:40:25,279 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:40:25,279 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:40:25,279 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:40:25,279 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:40:25,279 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:40:25,281 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:40:25,281 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:40:25,281 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:40:25,282 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:40:25,282 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:40:25,282 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:40:25,282 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:40:25,283 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:40:25,283 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:40:25,283 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:40:25,283 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:40:25,283 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:40:25,283 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:40:25,284 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:40:25,284 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:40:25,284 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:40:25,284 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:40:25,284 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:40:25,285 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:40:25,285 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:40:25,285 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:40:25,325 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:40:25,340 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:40:25,344 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:40:25,345 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:40:25,345 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:40:25,346 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/functions1.i_3.bpl [2018-12-03 17:40:25,346 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/functions1.i_3.bpl' [2018-12-03 17:40:25,383 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:40:25,385 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:40:25,385 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:40:25,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:40:25,386 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:40:25,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:40:25" (1/1) ... [2018-12-03 17:40:25,413 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:40:25" (1/1) ... [2018-12-03 17:40:25,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:40:25,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:40:25,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:40:25,422 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:40:25,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:40:25" (1/1) ... [2018-12-03 17:40:25,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:40:25" (1/1) ... [2018-12-03 17:40:25,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:40:25" (1/1) ... [2018-12-03 17:40:25,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:40:25" (1/1) ... [2018-12-03 17:40:25,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:40:25" (1/1) ... [2018-12-03 17:40:25,441 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:40:25" (1/1) ... [2018-12-03 17:40:25,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:40:25" (1/1) ... [2018-12-03 17:40:25,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:40:25,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:40:25,445 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:40:25,445 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:40:25,446 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:40:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:40:25,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:40:25,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:40:25,674 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:40:25,675 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 17:40:25,675 INFO L202 PluginConnector]: Adding new model functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:40:25 BoogieIcfgContainer [2018-12-03 17:40:25,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:40:25,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:40:25,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:40:25,681 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:40:25,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:40:25" (1/2) ... [2018-12-03 17:40:25,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@633f813d and model type functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:40:25, skipping insertion in model container [2018-12-03 17:40:25,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:40:25" (2/2) ... [2018-12-03 17:40:25,684 INFO L112 eAbstractionObserver]: Analyzing ICFG functions1.i_3.bpl [2018-12-03 17:40:25,695 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:40:25,702 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:40:25,721 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:40:25,757 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:40:25,757 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:40:25,757 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:40:25,757 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:40:25,758 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:40:25,758 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:40:25,758 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:40:25,758 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:40:25,772 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 17:40:25,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 17:40:25,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:25,780 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 17:40:25,783 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:25,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:25,790 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 17:40:25,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:25,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:25,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:25,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:25,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:26,119 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-12-03 17:40:26,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:26,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:40:26,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:40:26,125 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:40:26,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:40:26,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:40:26,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:40:26,150 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 17:40:26,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:26,208 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 17:40:26,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:40:26,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 17:40:26,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:26,221 INFO L225 Difference]: With dead ends: 9 [2018-12-03 17:40:26,222 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 17:40:26,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:40:26,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 17:40:26,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 17:40:26,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 17:40:26,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 17:40:26,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 17:40:26,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:26,262 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 17:40:26,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:40:26,262 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 17:40:26,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 17:40:26,263 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:26,263 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 17:40:26,263 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:26,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:26,264 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 17:40:26,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:26,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:26,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:26,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:26,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:26,602 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 17:40:26,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:26,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:26,605 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:26,606 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 17:40:26,608 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 17:40:26,678 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:40:26,678 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:40:26,774 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 17:40:27,517 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:40:27,519 INFO L272 AbstractInterpreter]: Visited 4 different actions 29 times. Merged at 3 different actions 23 times. Widened at 2 different actions 9 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:40:27,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:27,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:40:27,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:27,567 INFO L192 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 [2018-12-03 17:40:27,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:27,579 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:40:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:27,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:27,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:27,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:27,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:27,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:27,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2018-12-03 17:40:27,881 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:27,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:40:27,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:40:27,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:40:27,883 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-12-03 17:40:27,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:27,914 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 17:40:27,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:40:27,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-03 17:40:27,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:27,915 INFO L225 Difference]: With dead ends: 8 [2018-12-03 17:40:27,916 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 17:40:27,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:40:27,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 17:40:27,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 17:40:27,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 17:40:27,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 17:40:27,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 17:40:27,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:27,920 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 17:40:27,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:40:27,920 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 17:40:27,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 17:40:27,921 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:27,922 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 17:40:27,923 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:27,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:27,923 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-03 17:40:27,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:27,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:27,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:27,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:27,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:28,250 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 17:40:28,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:28,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:28,253 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:28,253 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:28,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:28,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:28,253 INFO L192 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 [2018-12-03 17:40:28,280 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:40:28,280 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:40:28,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 17:40:28,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:28,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:28,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:28,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:28,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:28,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:28,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2018-12-03 17:40:28,513 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:28,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 17:40:28,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 17:40:28,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:40:28,515 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-12-03 17:40:28,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:28,586 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 17:40:28,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:40:28,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-03 17:40:28,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:28,587 INFO L225 Difference]: With dead ends: 9 [2018-12-03 17:40:28,587 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 17:40:28,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:40:28,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 17:40:28,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 17:40:28,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 17:40:28,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 17:40:28,591 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 17:40:28,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:28,591 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 17:40:28,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 17:40:28,591 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 17:40:28,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 17:40:28,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:28,592 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 17:40:28,592 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:28,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:28,592 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-12-03 17:40:28,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:28,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:28,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:28,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:28,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:28,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:28,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:28,869 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:28,869 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:28,870 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:28,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:28,870 INFO L192 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 [2018-12-03 17:40:28,882 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:40:28,882 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:40:28,891 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:40:28,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:28,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:28,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:28,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:29,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:29,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:29,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-12-03 17:40:29,068 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:29,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:40:29,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:40:29,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:40:29,069 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-12-03 17:40:29,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:29,135 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 17:40:29,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 17:40:29,136 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-03 17:40:29,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:29,137 INFO L225 Difference]: With dead ends: 10 [2018-12-03 17:40:29,137 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 17:40:29,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:40:29,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 17:40:29,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 17:40:29,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 17:40:29,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 17:40:29,141 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 17:40:29,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:29,141 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 17:40:29,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:40:29,142 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 17:40:29,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 17:40:29,142 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:29,142 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 17:40:29,142 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:29,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:29,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-12-03 17:40:29,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:29,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:29,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:29,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:29,144 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:29,618 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 17:40:29,619 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:29,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:29,620 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:29,620 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:29,621 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:29,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:29,621 INFO L192 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 [2018-12-03 17:40:29,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:29,630 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:40:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:29,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:29,702 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:29,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:29,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:29,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:29,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-12-03 17:40:29,854 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:29,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:40:29,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:40:29,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:40:29,856 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-12-03 17:40:29,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:29,916 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 17:40:29,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 17:40:29,918 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-03 17:40:29,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:29,919 INFO L225 Difference]: With dead ends: 11 [2018-12-03 17:40:29,919 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 17:40:29,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:40:29,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 17:40:29,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 17:40:29,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 17:40:29,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 17:40:29,925 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 17:40:29,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:29,925 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 17:40:29,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:40:29,926 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 17:40:29,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:40:29,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:29,926 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 17:40:29,926 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:29,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:29,932 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-12-03 17:40:29,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:29,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:29,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:29,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:29,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:30,146 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:30,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:30,147 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:30,147 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:30,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:30,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:30,148 INFO L192 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 [2018-12-03 17:40:30,157 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:40:30,157 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:40:30,219 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 17:40:30,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:30,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:30,280 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:30,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:30,415 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:30,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:30,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2018-12-03 17:40:30,435 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:30,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:40:30,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:40:30,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:40:30,436 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-12-03 17:40:30,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:30,508 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 17:40:30,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 17:40:30,509 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-03 17:40:30,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:30,509 INFO L225 Difference]: With dead ends: 12 [2018-12-03 17:40:30,509 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 17:40:30,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:40:30,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 17:40:30,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 17:40:30,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 17:40:30,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 17:40:30,513 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 17:40:30,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:30,514 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 17:40:30,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:40:30,514 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 17:40:30,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:40:30,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:30,514 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 17:40:30,515 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:30,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:30,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-12-03 17:40:30,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:30,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:30,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:30,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:30,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:30,801 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:30,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:30,802 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:30,802 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:30,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:30,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:30,803 INFO L192 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 [2018-12-03 17:40:30,820 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:40:30,821 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:40:30,835 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:40:30,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:30,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:30,885 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:30,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:31,030 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:31,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:31,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2018-12-03 17:40:31,051 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:31,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:40:31,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:40:31,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:40:31,052 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-12-03 17:40:31,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:31,130 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 17:40:31,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 17:40:31,130 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-12-03 17:40:31,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:31,131 INFO L225 Difference]: With dead ends: 13 [2018-12-03 17:40:31,131 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 17:40:31,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:40:31,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 17:40:31,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 17:40:31,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 17:40:31,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 17:40:31,135 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 17:40:31,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:31,136 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 17:40:31,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:40:31,136 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 17:40:31,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 17:40:31,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:31,137 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 17:40:31,137 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:31,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:31,137 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2018-12-03 17:40:31,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:31,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:31,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:31,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:31,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:31,576 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:31,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:31,576 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:31,577 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:31,577 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:31,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:31,577 INFO L192 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 [2018-12-03 17:40:31,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:31,590 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:40:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:31,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:31,676 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:31,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:31,899 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:31,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:31,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2018-12-03 17:40:31,920 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:31,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:40:31,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:40:31,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:40:31,921 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-12-03 17:40:32,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:32,022 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 17:40:32,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:40:32,023 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-12-03 17:40:32,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:32,024 INFO L225 Difference]: With dead ends: 14 [2018-12-03 17:40:32,024 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 17:40:32,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:40:32,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 17:40:32,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 17:40:32,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 17:40:32,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 17:40:32,029 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 17:40:32,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:32,029 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 17:40:32,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:40:32,029 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 17:40:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:40:32,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:32,030 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 17:40:32,030 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:32,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:32,030 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2018-12-03 17:40:32,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:32,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:32,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:32,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:32,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:32,296 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:32,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:32,297 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:32,297 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:32,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:32,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:32,298 INFO L192 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 [2018-12-03 17:40:32,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:40:32,314 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:40:32,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:40:32,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:32,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:32,444 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:32,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:32,860 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:32,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:32,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2018-12-03 17:40:32,884 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:32,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:40:32,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:40:32,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:40:32,886 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-12-03 17:40:32,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:32,984 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 17:40:32,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:40:32,985 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-12-03 17:40:32,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:32,986 INFO L225 Difference]: With dead ends: 15 [2018-12-03 17:40:32,986 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 17:40:32,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:40:32,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 17:40:32,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 17:40:32,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 17:40:32,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 17:40:32,991 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 17:40:32,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:32,991 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 17:40:32,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:40:32,992 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 17:40:32,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:40:32,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:32,992 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 17:40:32,993 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:32,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:32,993 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2018-12-03 17:40:32,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:32,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:32,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:32,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:32,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:33,307 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:33,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:33,308 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:33,308 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:33,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:33,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:33,309 INFO L192 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 [2018-12-03 17:40:33,319 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:40:33,319 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:40:33,336 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:40:33,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:33,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:33,381 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:33,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:33,699 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:33,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:33,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-12-03 17:40:33,720 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:33,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:40:33,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:40:33,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:40:33,721 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-12-03 17:40:33,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:33,844 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 17:40:33,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:40:33,845 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-12-03 17:40:33,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:33,846 INFO L225 Difference]: With dead ends: 16 [2018-12-03 17:40:33,846 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 17:40:33,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:40:33,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 17:40:33,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 17:40:33,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 17:40:33,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 17:40:33,850 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 17:40:33,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:33,851 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 17:40:33,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:40:33,851 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 17:40:33,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:40:33,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:33,852 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-03 17:40:33,852 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:33,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:33,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2018-12-03 17:40:33,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:33,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:33,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:33,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:33,854 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:34,499 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:34,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:34,500 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:34,500 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:34,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:34,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:34,501 INFO L192 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 [2018-12-03 17:40:34,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:34,510 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:40:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:34,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:34,632 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:34,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:35,021 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:35,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:35,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2018-12-03 17:40:35,041 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:35,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:40:35,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:40:35,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:40:35,043 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-12-03 17:40:35,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:35,172 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 17:40:35,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:40:35,172 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-12-03 17:40:35,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:35,173 INFO L225 Difference]: With dead ends: 17 [2018-12-03 17:40:35,174 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 17:40:35,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:40:35,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 17:40:35,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 17:40:35,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 17:40:35,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 17:40:35,179 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 17:40:35,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:35,179 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 17:40:35,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:40:35,179 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 17:40:35,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:40:35,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:35,180 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 17:40:35,180 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:35,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:35,180 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2018-12-03 17:40:35,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:35,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:35,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:35,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:35,182 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:35,424 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:35,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:35,425 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:35,425 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:35,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:35,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:35,426 INFO L192 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 [2018-12-03 17:40:35,434 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:40:35,435 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:40:36,390 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 17:40:36,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:36,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:36,435 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:36,435 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:37,037 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:37,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:37,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2018-12-03 17:40:37,058 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:37,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:40:37,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:40:37,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2018-12-03 17:40:37,059 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-12-03 17:40:37,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:37,522 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 17:40:37,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 17:40:37,523 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-12-03 17:40:37,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:37,524 INFO L225 Difference]: With dead ends: 18 [2018-12-03 17:40:37,524 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 17:40:37,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2018-12-03 17:40:37,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 17:40:37,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 17:40:37,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 17:40:37,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 17:40:37,530 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 17:40:37,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:37,531 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 17:40:37,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:40:37,531 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 17:40:37,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:40:37,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:37,533 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-03 17:40:37,533 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:37,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:37,533 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2018-12-03 17:40:37,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:37,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:37,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:37,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:37,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:38,014 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:38,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:38,015 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:38,015 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:38,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:38,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:38,016 INFO L192 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 [2018-12-03 17:40:38,025 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:40:38,025 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:40:38,056 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:40:38,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:38,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:38,214 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:38,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:38,666 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:38,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:38,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 28 [2018-12-03 17:40:38,686 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:38,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 17:40:38,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 17:40:38,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-12-03 17:40:38,687 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-12-03 17:40:38,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:38,949 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 17:40:38,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:40:38,949 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-12-03 17:40:38,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:38,950 INFO L225 Difference]: With dead ends: 19 [2018-12-03 17:40:38,950 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 17:40:38,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-12-03 17:40:38,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 17:40:38,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 17:40:38,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 17:40:38,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 17:40:38,956 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 17:40:38,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:38,956 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 17:40:38,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 17:40:38,956 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 17:40:38,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:40:38,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:38,957 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 17:40:38,957 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:38,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:38,957 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2018-12-03 17:40:38,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:38,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:38,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:38,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:38,958 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:39,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:39,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:39,200 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:39,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:39,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:39,201 INFO L192 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 [2018-12-03 17:40:39,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:39,211 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:40:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:39,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:39,276 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:39,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:40,045 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:40,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:40,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2018-12-03 17:40:40,064 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:40,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 17:40:40,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 17:40:40,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:40:40,066 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-12-03 17:40:40,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:40,224 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 17:40:40,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:40:40,225 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 17:40:40,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:40,225 INFO L225 Difference]: With dead ends: 20 [2018-12-03 17:40:40,225 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 17:40:40,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:40:40,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 17:40:40,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 17:40:40,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 17:40:40,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 17:40:40,231 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 17:40:40,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:40,231 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 17:40:40,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 17:40:40,231 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 17:40:40,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 17:40:40,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:40,232 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 17:40:40,232 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:40,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:40,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2018-12-03 17:40:40,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:40,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:40,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:40,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:40,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:40,509 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:40,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:40,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:40,510 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:40,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:40,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:40,510 INFO L192 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 [2018-12-03 17:40:40,519 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:40:40,519 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:40:41,479 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 17:40:41,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:41,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:41,541 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:41,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:42,256 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:42,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:42,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2018-12-03 17:40:42,276 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:42,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 17:40:42,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 17:40:42,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 17:40:42,277 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-12-03 17:40:42,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:42,477 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 17:40:42,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:40:42,477 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-12-03 17:40:42,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:42,478 INFO L225 Difference]: With dead ends: 21 [2018-12-03 17:40:42,479 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 17:40:42,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 17:40:42,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 17:40:42,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 17:40:42,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:40:42,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 17:40:42,483 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 17:40:42,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:42,484 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 17:40:42,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 17:40:42,484 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 17:40:42,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:40:42,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:42,485 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 17:40:42,485 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:42,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:42,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2018-12-03 17:40:42,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:42,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:42,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:42,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:42,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:43,409 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:43,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:43,409 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:43,410 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:43,410 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:43,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:43,410 INFO L192 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 [2018-12-03 17:40:43,419 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:40:43,420 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:40:43,468 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:40:43,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:43,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:43,525 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:43,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:44,084 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:44,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:44,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2018-12-03 17:40:44,104 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:44,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 17:40:44,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 17:40:44,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 17:40:44,105 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-12-03 17:40:44,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:44,335 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 17:40:44,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 17:40:44,336 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-12-03 17:40:44,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:44,337 INFO L225 Difference]: With dead ends: 22 [2018-12-03 17:40:44,337 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 17:40:44,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 17:40:44,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 17:40:44,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 17:40:44,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:40:44,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 17:40:44,343 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 17:40:44,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:44,343 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 17:40:44,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 17:40:44,344 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 17:40:44,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 17:40:44,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:44,344 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-03 17:40:44,345 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:44,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:44,345 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2018-12-03 17:40:44,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:44,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:44,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:44,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:44,346 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:45,209 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:45,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:45,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:45,212 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:45,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:45,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:45,213 INFO L192 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 [2018-12-03 17:40:45,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:45,226 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:40:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:45,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:45,402 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:45,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:46,093 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:46,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:46,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 36 [2018-12-03 17:40:46,113 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:46,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 17:40:46,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 17:40:46,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 17:40:46,114 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-12-03 17:40:46,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:46,356 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 17:40:46,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 17:40:46,357 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-12-03 17:40:46,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:46,357 INFO L225 Difference]: With dead ends: 23 [2018-12-03 17:40:46,358 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 17:40:46,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 17:40:46,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 17:40:46,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 17:40:46,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:40:46,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 17:40:46,362 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 17:40:46,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:46,362 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 17:40:46,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 17:40:46,362 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 17:40:46,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:40:46,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:46,363 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 17:40:46,363 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:46,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:46,363 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2018-12-03 17:40:46,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:46,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:46,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:46,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:46,364 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:47,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:47,092 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:47,092 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:47,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:47,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:47,093 INFO L192 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 [2018-12-03 17:40:47,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:40:47,104 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:41:00,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 17:41:00,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:00,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:00,788 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:00,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:01,987 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:02,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:02,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2018-12-03 17:41:02,013 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:02,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 17:41:02,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 17:41:02,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 17:41:02,015 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-12-03 17:41:02,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:02,293 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 17:41:02,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 17:41:02,294 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-12-03 17:41:02,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:02,294 INFO L225 Difference]: With dead ends: 24 [2018-12-03 17:41:02,295 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 17:41:02,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 17:41:02,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 17:41:02,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 17:41:02,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 17:41:02,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 17:41:02,299 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 17:41:02,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:02,300 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 17:41:02,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 17:41:02,300 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 17:41:02,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 17:41:02,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:02,301 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-03 17:41:02,301 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:02,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:02,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2018-12-03 17:41:02,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:02,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:02,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:02,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:02,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:02,707 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:02,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:02,707 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:02,707 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:02,708 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:41:02,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:02,708 INFO L192 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 [2018-12-03 17:41:02,716 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:41:02,716 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:41:02,748 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:41:02,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:02,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:02,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:04,245 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:04,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:04,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 40 [2018-12-03 17:41:04,264 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:04,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 17:41:04,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 17:41:04,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 17:41:04,266 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-12-03 17:41:04,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:04,527 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 17:41:04,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:41:04,527 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-12-03 17:41:04,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:04,528 INFO L225 Difference]: With dead ends: 25 [2018-12-03 17:41:04,528 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 17:41:04,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 17:41:04,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 17:41:04,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 17:41:04,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 17:41:04,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 17:41:04,533 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 17:41:04,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:04,534 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 17:41:04,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 17:41:04,534 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 17:41:04,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 17:41:04,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:04,535 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 17:41:04,535 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:04,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:04,535 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2018-12-03 17:41:04,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:04,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:04,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:04,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:04,536 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:05,617 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:05,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:05,617 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:05,618 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:05,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:41:05,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:05,618 INFO L192 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 [2018-12-03 17:41:05,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:05,627 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:41:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:05,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:05,754 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:05,754 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:06,991 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:07,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:07,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2018-12-03 17:41:07,011 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:07,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 17:41:07,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 17:41:07,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 17:41:07,013 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-12-03 17:41:07,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:07,342 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 17:41:07,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 17:41:07,343 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-12-03 17:41:07,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:07,344 INFO L225 Difference]: With dead ends: 26 [2018-12-03 17:41:07,344 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 17:41:07,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 17:41:07,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 17:41:07,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 17:41:07,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 17:41:07,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 17:41:07,349 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 17:41:07,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:07,349 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 17:41:07,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 17:41:07,350 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 17:41:07,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 17:41:07,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:07,350 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-03 17:41:07,351 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:07,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:07,351 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2018-12-03 17:41:07,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:07,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:07,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:07,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:07,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:07,818 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:07,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:07,818 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:07,819 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:07,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:41:07,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:07,819 INFO L192 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 [2018-12-03 17:41:07,828 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:41:07,828 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:41:09,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 17:41:09,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:09,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:09,377 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:09,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:13,195 WARN L180 SmtUtils]: Spent 430.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:41:26,777 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:41:38,932 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:41:54,330 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:42:01,859 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:42:23,144 WARN L180 SmtUtils]: Spent 2.94 s on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:42:41,773 WARN L180 SmtUtils]: Spent 523.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:42:51,417 WARN L180 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:43:00,499 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:43:12,537 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 203 refuted. 7 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:12,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:43:12,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 44 [2018-12-03 17:43:12,556 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:43:12,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 17:43:12,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 17:43:12,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=1376, Unknown=34, NotChecked=0, Total=1980 [2018-12-03 17:43:12,558 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-12-03 17:43:12,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:43:12,902 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 17:43:12,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 17:43:12,902 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-12-03 17:43:12,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:43:12,903 INFO L225 Difference]: With dead ends: 27 [2018-12-03 17:43:12,903 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 17:43:12,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 123.5s TimeCoverageRelationStatistics Valid=570, Invalid=1376, Unknown=34, NotChecked=0, Total=1980 [2018-12-03 17:43:12,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 17:43:12,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 17:43:12,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 17:43:12,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 17:43:12,910 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 17:43:12,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:43:12,910 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 17:43:12,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 17:43:12,910 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 17:43:12,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:43:12,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:43:12,911 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 17:43:12,911 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:43:12,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:43:12,912 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2018-12-03 17:43:12,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:43:12,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:12,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:43:12,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:12,913 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:43:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:14,668 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:14,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:14,669 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:43:14,669 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:43:14,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:43:14,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:14,670 INFO L192 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 [2018-12-03 17:43:14,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:43:14,687 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:43:14,723 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:43:14,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:43:14,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:43:14,783 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:14,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:43:15,844 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:15,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:43:15,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2018-12-03 17:43:15,865 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:43:15,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 17:43:15,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 17:43:15,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 17:43:15,867 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-12-03 17:43:16,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:43:16,209 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 17:43:16,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:43:16,210 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-12-03 17:43:16,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:43:16,210 INFO L225 Difference]: With dead ends: 28 [2018-12-03 17:43:16,211 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 17:43:16,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 17:43:16,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 17:43:16,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 17:43:16,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 17:43:16,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 17:43:16,215 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 17:43:16,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:43:16,216 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 17:43:16,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 17:43:16,216 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 17:43:16,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 17:43:16,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:43:16,217 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-03 17:43:16,217 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:43:16,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:43:16,217 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2018-12-03 17:43:16,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:43:16,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:16,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:43:16,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:16,218 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:43:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:17,086 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:17,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:17,087 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:43:17,087 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:43:17,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:43:17,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:17,087 INFO L192 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 [2018-12-03 17:43:17,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:43:17,097 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:43:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:17,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:43:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:17,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:43:18,910 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:18,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:43:18,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2018-12-03 17:43:18,930 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:43:18,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 17:43:18,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 17:43:18,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 17:43:18,932 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-12-03 17:43:19,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:43:19,695 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 17:43:19,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 17:43:19,696 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-12-03 17:43:19,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:43:19,696 INFO L225 Difference]: With dead ends: 29 [2018-12-03 17:43:19,696 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 17:43:19,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 17:43:19,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 17:43:19,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 17:43:19,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 17:43:19,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 17:43:19,702 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 17:43:19,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:43:19,703 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 17:43:19,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 17:43:19,703 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 17:43:19,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 17:43:19,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:43:19,704 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 17:43:19,704 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:43:19,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:43:19,704 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2018-12-03 17:43:19,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:43:19,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:19,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:43:19,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:19,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:43:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:20,471 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:20,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:20,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:43:20,471 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:43:20,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:43:20,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:20,472 INFO L192 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 [2018-12-03 17:43:20,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:43:20,481 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:44:26,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 17:44:26,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:44:26,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:44:26,976 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:44:26,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:45:00,785 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:46:40,436 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 264 refuted. 12 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:46:40,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:46:40,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 50 [2018-12-03 17:46:40,458 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:46:40,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 17:46:40,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 17:46:40,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=1776, Unknown=51, NotChecked=0, Total=2550 [2018-12-03 17:46:40,460 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-12-03 17:46:41,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:46:41,067 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 17:46:41,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 17:46:41,068 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-12-03 17:46:41,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:46:41,069 INFO L225 Difference]: With dead ends: 30 [2018-12-03 17:46:41,069 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 17:46:41,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 134.2s TimeCoverageRelationStatistics Valid=723, Invalid=1776, Unknown=51, NotChecked=0, Total=2550 [2018-12-03 17:46:41,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 17:46:41,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 17:46:41,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 17:46:41,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 17:46:41,075 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 17:46:41,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:46:41,076 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 17:46:41,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 17:46:41,076 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 17:46:41,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 17:46:41,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:46:41,077 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-03 17:46:41,077 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:46:41,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:46:41,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2018-12-03 17:46:41,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:46:41,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:46:41,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:46:41,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:46:41,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:46:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:46:42,187 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:46:42,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:46:42,188 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:46:42,188 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:46:42,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:46:42,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:46:42,188 INFO L192 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 [2018-12-03 17:46:42,197 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:46:42,198 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:46:42,236 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:46:42,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:46:42,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:46:42,314 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:46:42,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:46:43,986 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:46:44,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:46:44,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 52 [2018-12-03 17:46:44,007 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:46:44,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 17:46:44,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 17:46:44,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 17:46:44,009 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-12-03 17:46:44,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:46:44,487 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 17:46:44,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 17:46:44,488 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-12-03 17:46:44,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:46:44,489 INFO L225 Difference]: With dead ends: 31 [2018-12-03 17:46:44,489 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 17:46:44,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 17:46:44,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 17:46:44,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 17:46:44,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 17:46:44,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 17:46:44,496 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 17:46:44,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:46:44,496 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 17:46:44,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 17:46:44,496 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 17:46:44,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 17:46:44,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:46:44,497 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 17:46:44,497 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:46:44,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:46:44,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2018-12-03 17:46:44,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:46:44,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:46:44,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:46:44,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:46:44,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:46:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:46:45,180 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:46:45,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:46:45,180 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:46:45,180 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:46:45,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:46:45,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:46:45,181 INFO L192 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 [2018-12-03 17:46:45,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:46:45,200 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:46:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:46:45,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:46:45,369 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:46:45,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:46:46,887 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:46:46,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:46:46,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 54 [2018-12-03 17:46:46,907 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:46:46,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 17:46:46,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 17:46:46,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 17:46:46,909 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-12-03 17:46:47,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:46:47,418 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 17:46:47,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 17:46:47,419 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-12-03 17:46:47,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:46:47,419 INFO L225 Difference]: With dead ends: 32 [2018-12-03 17:46:47,419 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 17:46:47,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 17:46:47,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 17:46:47,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 17:46:47,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 17:46:47,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 17:46:47,425 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 17:46:47,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:46:47,425 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 17:46:47,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 17:46:47,425 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 17:46:47,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 17:46:47,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:46:47,426 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-03 17:46:47,426 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:46:47,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:46:47,426 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2018-12-03 17:46:47,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:46:47,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:46:47,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:46:47,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:46:47,428 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:46:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:46:48,267 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:46:48,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:46:48,267 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:46:48,267 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:46:48,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:46:48,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:46:48,268 INFO L192 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 [2018-12-03 17:46:48,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:46:48,278 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:48:35,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 17:48:35,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:48:38,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:48:39,033 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:48:39,033 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:49:06,381 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:49:16,751 WARN L180 SmtUtils]: Spent 434.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:51:36,869 WARN L180 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:52:27,634 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 326 refuted. 25 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:52:27,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:52:27,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 56 [2018-12-03 17:52:27,642 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:52:27,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 17:52:27,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 17:52:27,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=2216, Unknown=82, NotChecked=0, Total=3192 [2018-12-03 17:52:27,644 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-12-03 17:52:28,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:52:28,198 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 17:52:28,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 17:52:28,200 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-12-03 17:52:28,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:52:28,201 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:52:28,201 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:52:28,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 229.4s TimeCoverageRelationStatistics Valid=894, Invalid=2216, Unknown=82, NotChecked=0, Total=3192 [2018-12-03 17:52:28,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:52:28,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 17:52:28,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 17:52:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 17:52:28,207 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 17:52:28,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:52:28,207 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 17:52:28,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 17:52:28,207 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 17:52:28,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 17:52:28,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:52:28,208 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 17:52:28,208 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:52:28,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:52:28,208 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2018-12-03 17:52:28,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:52:28,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:52:28,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:52:28,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:52:28,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:52:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:52:29,380 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:52:29,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:52:29,381 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:52:29,381 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:52:29,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:52:29,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:52:29,381 INFO L192 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 [2018-12-03 17:52:29,392 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:52:29,392 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:52:29,437 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:52:29,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:52:29,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:52:29,497 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:52:29,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:52:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:52:31,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:52:31,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 58 [2018-12-03 17:52:31,337 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:52:31,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 17:52:31,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 17:52:31,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 17:52:31,339 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-12-03 17:52:32,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:52:32,019 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 17:52:32,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 17:52:32,023 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-12-03 17:52:32,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:52:32,023 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:52:32,024 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 17:52:32,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 17:52:32,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 17:52:32,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 17:52:32,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 17:52:32,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 17:52:32,029 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 17:52:32,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:52:32,029 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 17:52:32,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 17:52:32,030 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 17:52:32,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 17:52:32,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:52:32,030 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-03 17:52:32,031 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:52:32,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:52:32,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2018-12-03 17:52:32,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:52:32,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:52:32,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:52:32,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:52:32,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:52:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:52:32,947 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:52:32,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:52:32,947 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:52:32,947 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:52:32,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:52:32,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:52:32,948 INFO L192 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 [2018-12-03 17:52:32,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:52:32,958 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:52:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:52:33,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:52:33,067 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:52:33,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:52:35,032 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:52:35,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:52:35,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 60 [2018-12-03 17:52:35,052 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:52:35,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 17:52:35,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 17:52:35,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 17:52:35,054 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-12-03 17:52:35,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:52:35,643 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 17:52:35,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 17:52:35,645 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-12-03 17:52:35,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:52:35,646 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:52:35,646 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:52:35,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 17:52:35,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:52:35,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 17:52:35,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 17:52:35,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 17:52:35,653 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 17:52:35,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:52:35,654 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 17:52:35,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 17:52:35,654 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 17:52:35,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 17:52:35,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:52:35,655 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 17:52:35,655 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:52:35,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:52:35,655 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2018-12-03 17:52:35,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:52:35,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:52:35,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:52:35,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:52:35,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:52:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:52:36,339 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:52:36,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:52:36,340 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:52:36,340 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:52:36,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:52:36,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:52:36,340 INFO L192 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 [2018-12-03 17:52:36,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:52:36,349 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:53:45,649 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 17:53:45,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:53:45,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:53:46,012 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:53:46,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:53:46,932 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2018-12-03 17:53:52,251 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:54:02,567 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:54:09,804 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:54:31,819 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 17