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_exp_cong.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:11:57,141 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:11:57,143 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:11:57,155 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:11:57,156 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:11:57,157 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:11:57,158 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:11:57,160 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:11:57,162 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:11:57,163 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:11:57,167 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:11:57,168 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:11:57,169 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:11:57,172 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:11:57,173 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:11:57,174 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:11:57,175 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:11:57,181 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:11:57,186 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:11:57,193 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:11:57,194 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:11:57,196 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:11:57,202 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:11:57,202 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:11:57,202 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:11:57,203 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:11:57,207 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:11:57,208 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:11:57,212 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:11:57,214 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:11:57,215 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:11:57,215 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:11:57,217 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:11:57,217 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:11:57,218 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:11:57,219 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:11:57,219 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:11:57,244 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:11:57,244 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:11:57,245 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:11:57,245 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:11:57,245 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:11:57,246 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:11:57,246 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:11:57,246 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:11:57,247 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:11:57,247 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:11:57,247 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:11:57,247 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:11:57,247 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:11:57,248 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:11:57,248 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:11:57,249 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:11:57,250 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:11:57,250 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:11:57,250 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:11:57,252 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:11:57,252 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:11:57,252 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:11:57,252 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:11:57,253 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:11:57,253 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:11:57,253 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:11:57,253 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:11:57,253 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:11:57,254 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:11:57,254 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:11:57,254 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:11:57,255 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:11:57,255 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:11:57,255 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:11:57,255 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:11:57,255 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:11:57,256 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:11:57,256 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:11:57,256 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:11:57,256 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:11:57,257 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:11:57,307 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:11:57,321 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:11:57,324 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:11:57,326 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:11:57,327 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:11:57,328 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl [2018-12-03 16:11:57,328 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl' [2018-12-03 16:11:57,378 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:11:57,379 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:11:57,380 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:11:57,380 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:11:57,380 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:11:57,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:57" (1/1) ... [2018-12-03 16:11:57,410 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:57" (1/1) ... [2018-12-03 16:11:57,420 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 16:11:57,420 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 16:11:57,421 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 16:11:57,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:11:57,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:11:57,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:11:57,425 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:11:57,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:57" (1/1) ... [2018-12-03 16:11:57,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:57" (1/1) ... [2018-12-03 16:11:57,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:57" (1/1) ... [2018-12-03 16:11:57,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:57" (1/1) ... [2018-12-03 16:11:57,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:57" (1/1) ... [2018-12-03 16:11:57,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:57" (1/1) ... [2018-12-03 16:11:57,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:57" (1/1) ... [2018-12-03 16:11:57,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:11:57,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:11:57,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:11:57,455 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:11:57,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:57" (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 16:11:57,529 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-12-03 16:11:57,529 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-12-03 16:11:57,530 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-12-03 16:11:57,873 INFO L272 CfgBuilder]: Using library mode [2018-12-03 16:11:57,874 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 16:11:57,874 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:11:57 BoogieIcfgContainer [2018-12-03 16:11:57,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:11:57,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:11:57,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:11:57,879 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:11:57,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:57" (1/2) ... [2018-12-03 16:11:57,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4b2ce1 and model type threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:11:57, skipping insertion in model container [2018-12-03 16:11:57,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:11:57" (2/2) ... [2018-12-03 16:11:57,883 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithoutIf.bpl [2018-12-03 16:11:57,894 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:11:57,903 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-12-03 16:11:57,922 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-12-03 16:11:57,959 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:11:57,959 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:11:57,959 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:11:57,959 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:11:57,960 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:11:57,960 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:11:57,960 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:11:57,960 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:11:57,980 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-03 16:11:57,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 16:11:57,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:57,991 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 16:11:58,001 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:58,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:58,016 INFO L82 PathProgramCache]: Analyzing trace with hash 927686, now seen corresponding path program 1 times [2018-12-03 16:11:58,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:58,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:58,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:58,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:58,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:58,229 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 16:11:58,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:58,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:58,231 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:58,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:11:58,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:11:58,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:11:58,250 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2018-12-03 16:11:58,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:58,764 INFO L93 Difference]: Finished difference Result 32 states and 51 transitions. [2018-12-03 16:11:58,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:11:58,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-03 16:11:58,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:58,779 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:11:58,780 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:11:58,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:11:58,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:11:58,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-12-03 16:11:58,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 16:11:58,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2018-12-03 16:11:58,824 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 4 [2018-12-03 16:11:58,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:58,825 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2018-12-03 16:11:58,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:11:58,825 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-12-03 16:11:58,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 16:11:58,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:58,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 16:11:58,827 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:58,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:58,827 INFO L82 PathProgramCache]: Analyzing trace with hash 930088, now seen corresponding path program 1 times [2018-12-03 16:11:58,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:58,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:58,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:58,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:58,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:58,914 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 16:11:58,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:58,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:58,915 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:58,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:11:58,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:11:58,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:11:58,918 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 5 states. [2018-12-03 16:11:59,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:59,278 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2018-12-03 16:11:59,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:11:59,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-03 16:11:59,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:59,280 INFO L225 Difference]: With dead ends: 38 [2018-12-03 16:11:59,280 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:11:59,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:11:59,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:11:59,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-12-03 16:11:59,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 16:11:59,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions. [2018-12-03 16:11:59,289 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 47 transitions. Word has length 4 [2018-12-03 16:11:59,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:59,290 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 47 transitions. [2018-12-03 16:11:59,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:11:59,290 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 47 transitions. [2018-12-03 16:11:59,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:11:59,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:59,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 16:11:59,291 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:59,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:59,292 INFO L82 PathProgramCache]: Analyzing trace with hash 28768015, now seen corresponding path program 1 times [2018-12-03 16:11:59,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:59,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:59,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:59,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:59,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:59,403 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 16:11:59,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:59,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:11:59,404 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:59,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:11:59,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:11:59,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:11:59,406 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. Second operand 6 states. [2018-12-03 16:12:00,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:00,142 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2018-12-03 16:12:00,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:12:00,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-03 16:12:00,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:00,144 INFO L225 Difference]: With dead ends: 43 [2018-12-03 16:12:00,144 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 16:12:00,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:12:00,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 16:12:00,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-12-03 16:12:00,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 16:12:00,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2018-12-03 16:12:00,158 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 5 [2018-12-03 16:12:00,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:00,158 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2018-12-03 16:12:00,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:12:00,159 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2018-12-03 16:12:00,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:12:00,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:00,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 16:12:00,160 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:00,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:00,160 INFO L82 PathProgramCache]: Analyzing trace with hash 28831153, now seen corresponding path program 1 times [2018-12-03 16:12:00,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:00,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:00,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:00,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:00,162 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:00,234 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 16:12:00,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:00,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:12:00,235 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:00,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:12:00,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:12:00,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:12:00,236 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 6 states. [2018-12-03 16:12:00,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:00,565 INFO L93 Difference]: Finished difference Result 54 states and 89 transitions. [2018-12-03 16:12:00,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:12:00,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-03 16:12:00,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:00,567 INFO L225 Difference]: With dead ends: 54 [2018-12-03 16:12:00,567 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 16:12:00,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:12:00,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 16:12:00,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2018-12-03 16:12:00,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 16:12:00,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 70 transitions. [2018-12-03 16:12:00,583 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 70 transitions. Word has length 5 [2018-12-03 16:12:00,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:00,583 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 70 transitions. [2018-12-03 16:12:00,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:12:00,583 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 70 transitions. [2018-12-03 16:12:00,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:00,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:00,589 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:00,589 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:00,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:00,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1974033510, now seen corresponding path program 1 times [2018-12-03 16:12:00,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:00,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:00,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:00,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:00,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:00,791 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 16:12:00,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:00,792 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:00,793 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 16:12:00,795 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [36], [38], [41], [45], [46] [2018-12-03 16:12:00,835 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:00,835 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:00,957 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:00,959 INFO L272 AbstractInterpreter]: Visited 8 different actions 11 times. Merged at 3 different actions 3 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 16:12:01,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:01,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:01,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:01,009 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 16:12:01,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:01,028 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:01,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:01,454 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 16:12:01,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:01,628 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 16:12:01,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:01,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2018-12-03 16:12:01,648 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:01,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:12:01,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:12:01,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:12:01,650 INFO L87 Difference]: Start difference. First operand 43 states and 70 transitions. Second operand 14 states. [2018-12-03 16:12:03,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:03,191 INFO L93 Difference]: Finished difference Result 107 states and 168 transitions. [2018-12-03 16:12:03,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 16:12:03,192 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2018-12-03 16:12:03,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:03,194 INFO L225 Difference]: With dead ends: 107 [2018-12-03 16:12:03,194 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 16:12:03,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2018-12-03 16:12:03,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 16:12:03,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 64. [2018-12-03 16:12:03,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 16:12:03,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 109 transitions. [2018-12-03 16:12:03,210 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 109 transitions. Word has length 8 [2018-12-03 16:12:03,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:03,210 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 109 transitions. [2018-12-03 16:12:03,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:12:03,211 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 109 transitions. [2018-12-03 16:12:03,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:03,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:03,212 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:03,212 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:03,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:03,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1974032228, now seen corresponding path program 1 times [2018-12-03 16:12:03,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:03,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:03,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:03,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:03,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:03,332 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 16:12:03,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:03,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:12:03,333 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:03,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:12:03,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:12:03,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:12:03,335 INFO L87 Difference]: Start difference. First operand 64 states and 109 transitions. Second operand 8 states. [2018-12-03 16:12:03,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:03,680 INFO L93 Difference]: Finished difference Result 95 states and 152 transitions. [2018-12-03 16:12:03,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:12:03,681 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:12:03,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:03,683 INFO L225 Difference]: With dead ends: 95 [2018-12-03 16:12:03,683 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 16:12:03,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:12:03,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 16:12:03,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 77. [2018-12-03 16:12:03,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 16:12:03,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 134 transitions. [2018-12-03 16:12:03,702 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 134 transitions. Word has length 8 [2018-12-03 16:12:03,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:03,702 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 134 transitions. [2018-12-03 16:12:03,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:12:03,702 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 134 transitions. [2018-12-03 16:12:03,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:03,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:03,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:03,704 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:03,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:03,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445341, now seen corresponding path program 1 times [2018-12-03 16:12:03,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:03,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:03,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:03,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:03,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:03,770 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 16:12:03,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:03,771 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:03,771 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 16:12:03,771 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [36], [37], [45], [47], [50] [2018-12-03 16:12:03,773 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:03,774 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:03,793 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:03,793 INFO L272 AbstractInterpreter]: Visited 8 different actions 11 times. Merged at 3 different actions 3 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 16:12:03,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:03,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:03,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:03,798 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 16:12:03,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:03,808 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:03,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:03,966 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 16:12:03,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:04,183 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 16:12:04,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:04,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 17 [2018-12-03 16:12:04,203 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:04,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:12:04,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:12:04,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:12:04,204 INFO L87 Difference]: Start difference. First operand 77 states and 134 transitions. Second operand 13 states. [2018-12-03 16:12:06,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:06,185 INFO L93 Difference]: Finished difference Result 150 states and 246 transitions. [2018-12-03 16:12:06,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 16:12:06,186 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-12-03 16:12:06,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:06,188 INFO L225 Difference]: With dead ends: 150 [2018-12-03 16:12:06,188 INFO L226 Difference]: Without dead ends: 148 [2018-12-03 16:12:06,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=422, Invalid=1300, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:12:06,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-03 16:12:06,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 106. [2018-12-03 16:12:06,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 16:12:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 185 transitions. [2018-12-03 16:12:06,211 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 185 transitions. Word has length 8 [2018-12-03 16:12:06,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:06,212 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 185 transitions. [2018-12-03 16:12:06,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:12:06,212 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 185 transitions. [2018-12-03 16:12:06,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:06,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:06,213 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:06,213 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:06,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:06,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445053, now seen corresponding path program 1 times [2018-12-03 16:12:06,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:06,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:06,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:06,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:06,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:06,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:06,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:06,285 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:06,285 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 16:12:06,285 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [45], [46], [47], [50] [2018-12-03 16:12:06,286 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:06,287 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:06,297 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:06,297 INFO L272 AbstractInterpreter]: Visited 7 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 16:12:06,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:06,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:06,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:06,304 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 16:12:06,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:06,313 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:06,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:06,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:06,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:06,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:06,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:06,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2018-12-03 16:12:06,801 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:06,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:12:06,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:12:06,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:12:06,802 INFO L87 Difference]: Start difference. First operand 106 states and 185 transitions. Second operand 13 states. [2018-12-03 16:12:08,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:08,225 INFO L93 Difference]: Finished difference Result 137 states and 241 transitions. [2018-12-03 16:12:08,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:12:08,225 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-12-03 16:12:08,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:08,227 INFO L225 Difference]: With dead ends: 137 [2018-12-03 16:12:08,227 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 16:12:08,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:12:08,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 16:12:08,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 111. [2018-12-03 16:12:08,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 16:12:08,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 194 transitions. [2018-12-03 16:12:08,266 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 194 transitions. Word has length 8 [2018-12-03 16:12:08,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:08,266 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 194 transitions. [2018-12-03 16:12:08,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:12:08,266 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 194 transitions. [2018-12-03 16:12:08,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:08,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:08,272 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:08,273 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:08,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:08,273 INFO L82 PathProgramCache]: Analyzing trace with hash 2040447037, now seen corresponding path program 1 times [2018-12-03 16:12:08,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:08,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:08,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:08,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:08,278 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:08,412 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 16:12:08,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:08,413 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:08,413 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 16:12:08,414 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [12], [17], [25], [26] [2018-12-03 16:12:08,415 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:08,415 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:08,434 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:08,435 INFO L272 AbstractInterpreter]: Visited 8 different actions 13 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 16:12:08,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:08,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:08,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:08,445 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 16:12:08,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:08,455 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:08,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:08,632 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 16:12:08,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:08,663 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 16:12:08,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:08,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-12-03 16:12:08,682 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:08,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:12:08,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:12:08,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:12:08,683 INFO L87 Difference]: Start difference. First operand 111 states and 194 transitions. Second operand 12 states. [2018-12-03 16:12:09,462 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-03 16:12:09,795 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 16:12:10,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:10,623 INFO L93 Difference]: Finished difference Result 211 states and 359 transitions. [2018-12-03 16:12:10,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:12:10,624 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2018-12-03 16:12:10,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:10,626 INFO L225 Difference]: With dead ends: 211 [2018-12-03 16:12:10,626 INFO L226 Difference]: Without dead ends: 209 [2018-12-03 16:12:10,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=292, Invalid=764, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 16:12:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-03 16:12:10,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 173. [2018-12-03 16:12:10,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-12-03 16:12:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 304 transitions. [2018-12-03 16:12:10,660 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 304 transitions. Word has length 8 [2018-12-03 16:12:10,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:10,660 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 304 transitions. [2018-12-03 16:12:10,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:12:10,660 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 304 transitions. [2018-12-03 16:12:10,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:10,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:10,661 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:10,662 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:10,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:10,662 INFO L82 PathProgramCache]: Analyzing trace with hash -84509544, now seen corresponding path program 1 times [2018-12-03 16:12:10,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:10,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:10,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:10,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:10,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:10,734 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 16:12:10,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:10,735 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:10,735 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 16:12:10,735 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [36], [38], [41], [45], [46] [2018-12-03 16:12:10,736 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:10,737 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:10,749 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:10,749 INFO L272 AbstractInterpreter]: Visited 8 different actions 11 times. Merged at 3 different actions 3 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 16:12:10,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:10,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:10,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:10,751 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 16:12:10,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:10,759 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:10,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:10,852 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 16:12:10,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:11,065 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 16:12:11,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:11,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2018-12-03 16:12:11,086 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:11,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:12:11,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:12:11,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:12:11,088 INFO L87 Difference]: Start difference. First operand 173 states and 304 transitions. Second operand 10 states. [2018-12-03 16:12:11,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:11,796 INFO L93 Difference]: Finished difference Result 246 states and 415 transitions. [2018-12-03 16:12:11,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:12:11,796 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-12-03 16:12:11,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:11,797 INFO L225 Difference]: With dead ends: 246 [2018-12-03 16:12:11,797 INFO L226 Difference]: Without dead ends: 245 [2018-12-03 16:12:11,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:12:11,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-12-03 16:12:11,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 201. [2018-12-03 16:12:11,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-12-03 16:12:11,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 358 transitions. [2018-12-03 16:12:11,834 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 358 transitions. Word has length 8 [2018-12-03 16:12:11,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:11,834 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 358 transitions. [2018-12-03 16:12:11,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:12:11,834 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 358 transitions. [2018-12-03 16:12:11,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:11,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:11,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:11,835 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:11,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:11,836 INFO L82 PathProgramCache]: Analyzing trace with hash -84508262, now seen corresponding path program 1 times [2018-12-03 16:12:11,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:11,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:11,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:11,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:11,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:11,964 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 16:12:11,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:11,965 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:11,965 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 16:12:11,966 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [26], [36], [38], [43] [2018-12-03 16:12:11,967 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:11,967 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:11,981 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:11,981 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 16:12:11,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:11,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:11,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:11,984 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 16:12:11,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:11,993 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:12,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:12,011 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 16:12:12,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:12,079 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 16:12:12,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:12,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2018-12-03 16:12:12,098 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:12,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:12,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:12,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:12:12,099 INFO L87 Difference]: Start difference. First operand 201 states and 358 transitions. Second operand 7 states. [2018-12-03 16:12:12,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:12,494 INFO L93 Difference]: Finished difference Result 252 states and 436 transitions. [2018-12-03 16:12:12,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:12:12,495 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 16:12:12,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:12,497 INFO L225 Difference]: With dead ends: 252 [2018-12-03 16:12:12,497 INFO L226 Difference]: Without dead ends: 250 [2018-12-03 16:12:12,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:12:12,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-12-03 16:12:12,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 210. [2018-12-03 16:12:12,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-12-03 16:12:12,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 375 transitions. [2018-12-03 16:12:12,524 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 375 transitions. Word has length 8 [2018-12-03 16:12:12,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:12,524 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 375 transitions. [2018-12-03 16:12:12,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:12,524 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 375 transitions. [2018-12-03 16:12:12,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:12,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:12,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:12,526 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:12,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:12,526 INFO L82 PathProgramCache]: Analyzing trace with hash -75921375, now seen corresponding path program 1 times [2018-12-03 16:12:12,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:12,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:12,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:12,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:12,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:12,640 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 16:12:12,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:12,640 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:12,640 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 16:12:12,640 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [36], [37], [45], [47], [50] [2018-12-03 16:12:12,644 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:12,644 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:12,665 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:12,665 INFO L272 AbstractInterpreter]: Visited 8 different actions 11 times. Merged at 3 different actions 3 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 16:12:12,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:12,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:12,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:12,674 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 16:12:12,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:12,684 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:12,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:12,748 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 16:12:12,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:12,809 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 16:12:12,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:12,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2018-12-03 16:12:12,831 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:12,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:12:12,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:12:12,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:12:12,832 INFO L87 Difference]: Start difference. First operand 210 states and 375 transitions. Second operand 10 states. [2018-12-03 16:12:13,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:13,165 INFO L93 Difference]: Finished difference Result 260 states and 452 transitions. [2018-12-03 16:12:13,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:12:13,170 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-12-03 16:12:13,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:13,172 INFO L225 Difference]: With dead ends: 260 [2018-12-03 16:12:13,172 INFO L226 Difference]: Without dead ends: 259 [2018-12-03 16:12:13,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:12:13,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-12-03 16:12:13,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 229. [2018-12-03 16:12:13,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-12-03 16:12:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 409 transitions. [2018-12-03 16:12:13,210 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 409 transitions. Word has length 8 [2018-12-03 16:12:13,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:13,210 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 409 transitions. [2018-12-03 16:12:13,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:12:13,210 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 409 transitions. [2018-12-03 16:12:13,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:13,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:13,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:13,212 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:13,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:13,212 INFO L82 PathProgramCache]: Analyzing trace with hash -75920285, now seen corresponding path program 1 times [2018-12-03 16:12:13,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:13,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:13,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:13,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:13,213 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:13,284 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 16:12:13,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:13,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 16:12:13,285 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:13,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:13,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:13,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:12:13,286 INFO L87 Difference]: Start difference. First operand 229 states and 409 transitions. Second operand 7 states. [2018-12-03 16:12:13,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:13,789 INFO L93 Difference]: Finished difference Result 316 states and 557 transitions. [2018-12-03 16:12:13,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:12:13,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 16:12:13,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:13,792 INFO L225 Difference]: With dead ends: 316 [2018-12-03 16:12:13,792 INFO L226 Difference]: Without dead ends: 314 [2018-12-03 16:12:13,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:12:13,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-12-03 16:12:13,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 245. [2018-12-03 16:12:13,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-12-03 16:12:13,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 438 transitions. [2018-12-03 16:12:13,835 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 438 transitions. Word has length 8 [2018-12-03 16:12:13,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:13,835 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 438 transitions. [2018-12-03 16:12:13,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:13,836 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 438 transitions. [2018-12-03 16:12:13,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:13,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:13,837 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:13,837 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:13,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:13,837 INFO L82 PathProgramCache]: Analyzing trace with hash -35778354, now seen corresponding path program 1 times [2018-12-03 16:12:13,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:13,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:13,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:13,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:13,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:13,903 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 16:12:13,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:13,904 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:13,904 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 16:12:13,904 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [11], [25], [27], [32] [2018-12-03 16:12:13,905 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:13,905 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:13,920 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:13,920 INFO L272 AbstractInterpreter]: Visited 8 different actions 13 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 16:12:13,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:13,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:13,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:13,934 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 16:12:13,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:13,943 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:13,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:13,960 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 16:12:13,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:14,007 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 16:12:14,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:14,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2018-12-03 16:12:14,027 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:14,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:14,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:14,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:12:14,027 INFO L87 Difference]: Start difference. First operand 245 states and 438 transitions. Second operand 7 states. [2018-12-03 16:12:14,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:14,589 INFO L93 Difference]: Finished difference Result 428 states and 767 transitions. [2018-12-03 16:12:14,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:12:14,590 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 16:12:14,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:14,592 INFO L225 Difference]: With dead ends: 428 [2018-12-03 16:12:14,592 INFO L226 Difference]: Without dead ends: 426 [2018-12-03 16:12:14,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:12:14,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-12-03 16:12:14,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 345. [2018-12-03 16:12:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-12-03 16:12:14,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 622 transitions. [2018-12-03 16:12:14,670 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 622 transitions. Word has length 8 [2018-12-03 16:12:14,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:14,671 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 622 transitions. [2018-12-03 16:12:14,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:14,671 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 622 transitions. [2018-12-03 16:12:14,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:12:14,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:14,672 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:14,672 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:14,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:14,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1740000584, now seen corresponding path program 1 times [2018-12-03 16:12:14,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:14,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:14,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:14,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:14,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:14,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:14,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:14,884 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:14,884 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 16:12:14,884 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [36], [37], [38], [41], [45], [47], [50] [2018-12-03 16:12:14,886 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:14,886 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:14,933 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:14,937 INFO L272 AbstractInterpreter]: Visited 10 different actions 21 times. Merged at 7 different actions 8 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 16:12:14,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:14,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:14,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:14,950 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 16:12:14,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:14,959 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:14,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:15,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:15,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:15,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:15,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:15,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2018-12-03 16:12:15,082 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:15,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:12:15,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:12:15,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:12:15,083 INFO L87 Difference]: Start difference. First operand 345 states and 622 transitions. Second operand 10 states. [2018-12-03 16:12:16,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:16,322 INFO L93 Difference]: Finished difference Result 466 states and 826 transitions. [2018-12-03 16:12:16,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:12:16,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 16:12:16,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:16,325 INFO L225 Difference]: With dead ends: 466 [2018-12-03 16:12:16,325 INFO L226 Difference]: Without dead ends: 464 [2018-12-03 16:12:16,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2018-12-03 16:12:16,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-12-03 16:12:16,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 351. [2018-12-03 16:12:16,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-12-03 16:12:16,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 634 transitions. [2018-12-03 16:12:16,414 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 634 transitions. Word has length 11 [2018-12-03 16:12:16,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:16,414 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 634 transitions. [2018-12-03 16:12:16,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:12:16,414 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 634 transitions. [2018-12-03 16:12:16,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:12:16,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:16,415 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:16,415 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:16,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:16,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1701828094, now seen corresponding path program 1 times [2018-12-03 16:12:16,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:16,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:16,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:16,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:16,419 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:17,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:17,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:17,322 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:17,322 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 16:12:17,322 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [25], [26], [27], [30], [36], [38], [43] [2018-12-03 16:12:17,323 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:17,323 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:17,331 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:17,331 INFO L272 AbstractInterpreter]: Visited 10 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 16:12:17,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:17,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:17,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:17,342 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 16:12:17,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:17,352 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:17,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:17,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:17,435 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:17,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:17,577 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 16:12:17,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [7] total 17 [2018-12-03 16:12:17,578 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:17,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:17,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:17,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:12:17,579 INFO L87 Difference]: Start difference. First operand 351 states and 634 transitions. Second operand 7 states. [2018-12-03 16:12:18,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:18,007 INFO L93 Difference]: Finished difference Result 826 states and 1461 transitions. [2018-12-03 16:12:18,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:12:18,008 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 16:12:18,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:18,011 INFO L225 Difference]: With dead ends: 826 [2018-12-03 16:12:18,011 INFO L226 Difference]: Without dead ends: 476 [2018-12-03 16:12:18,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:12:18,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-12-03 16:12:18,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 377. [2018-12-03 16:12:18,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-12-03 16:12:18,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 677 transitions. [2018-12-03 16:12:18,097 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 677 transitions. Word has length 11 [2018-12-03 16:12:18,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:18,097 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 677 transitions. [2018-12-03 16:12:18,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:18,097 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 677 transitions. [2018-12-03 16:12:18,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:12:18,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:18,098 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:18,099 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:18,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:18,099 INFO L82 PathProgramCache]: Analyzing trace with hash 707064552, now seen corresponding path program 1 times [2018-12-03 16:12:18,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:18,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:18,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:18,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:18,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:18,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:18,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:18,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:12:18,216 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:18,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:12:18,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:12:18,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:12:18,217 INFO L87 Difference]: Start difference. First operand 377 states and 677 transitions. Second operand 8 states. [2018-12-03 16:12:18,933 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-03 16:12:19,183 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-03 16:12:19,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:19,459 INFO L93 Difference]: Finished difference Result 470 states and 828 transitions. [2018-12-03 16:12:19,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:12:19,459 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-12-03 16:12:19,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:19,462 INFO L225 Difference]: With dead ends: 470 [2018-12-03 16:12:19,462 INFO L226 Difference]: Without dead ends: 468 [2018-12-03 16:12:19,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:12:19,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-12-03 16:12:19,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 390. [2018-12-03 16:12:19,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-12-03 16:12:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 695 transitions. [2018-12-03 16:12:19,543 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 695 transitions. Word has length 11 [2018-12-03 16:12:19,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:19,543 INFO L480 AbstractCegarLoop]: Abstraction has 390 states and 695 transitions. [2018-12-03 16:12:19,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:12:19,543 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 695 transitions. [2018-12-03 16:12:19,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:12:19,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:19,544 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:19,545 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:19,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:19,545 INFO L82 PathProgramCache]: Analyzing trace with hash 739509354, now seen corresponding path program 1 times [2018-12-03 16:12:19,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:19,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:19,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:19,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:19,546 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:19,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:19,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:19,706 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:19,706 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 16:12:19,707 INFO L205 CegarAbsIntRunner]: [0], [4], [10], [11], [12], [15], [19], [45], [47], [52] [2018-12-03 16:12:19,708 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:19,708 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:19,737 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:19,737 INFO L272 AbstractInterpreter]: Visited 10 different actions 24 times. Merged at 8 different actions 11 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 16:12:19,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:19,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:19,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:19,753 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 16:12:19,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:19,765 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:19,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:19,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:19,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:20,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:20,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 16:12:20,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 8] total 16 [2018-12-03 16:12:20,022 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:20,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:20,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:20,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:12:20,023 INFO L87 Difference]: Start difference. First operand 390 states and 695 transitions. Second operand 7 states. [2018-12-03 16:12:20,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:20,226 INFO L93 Difference]: Finished difference Result 878 states and 1557 transitions. [2018-12-03 16:12:20,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:12:20,226 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 16:12:20,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:20,229 INFO L225 Difference]: With dead ends: 878 [2018-12-03 16:12:20,229 INFO L226 Difference]: Without dead ends: 489 [2018-12-03 16:12:20,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:12:20,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-12-03 16:12:20,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 451. [2018-12-03 16:12:20,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-12-03 16:12:20,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 793 transitions. [2018-12-03 16:12:20,320 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 793 transitions. Word has length 11 [2018-12-03 16:12:20,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:20,321 INFO L480 AbstractCegarLoop]: Abstraction has 451 states and 793 transitions. [2018-12-03 16:12:20,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:20,321 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 793 transitions. [2018-12-03 16:12:20,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:12:20,322 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:20,322 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:20,322 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:20,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:20,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1106731073, now seen corresponding path program 1 times [2018-12-03 16:12:20,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:20,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:20,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:20,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:20,323 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:20,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:20,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:20,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:12:20,433 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:20,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:12:20,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:12:20,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:12:20,434 INFO L87 Difference]: Start difference. First operand 451 states and 793 transitions. Second operand 8 states. [2018-12-03 16:12:20,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:20,975 INFO L93 Difference]: Finished difference Result 502 states and 862 transitions. [2018-12-03 16:12:20,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:12:20,976 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-12-03 16:12:20,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:20,978 INFO L225 Difference]: With dead ends: 502 [2018-12-03 16:12:20,978 INFO L226 Difference]: Without dead ends: 500 [2018-12-03 16:12:20,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-12-03 16:12:20,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-12-03 16:12:21,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 449. [2018-12-03 16:12:21,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-12-03 16:12:21,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 788 transitions. [2018-12-03 16:12:21,090 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 788 transitions. Word has length 11 [2018-12-03 16:12:21,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:21,090 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 788 transitions. [2018-12-03 16:12:21,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:12:21,091 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 788 transitions. [2018-12-03 16:12:21,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:12:21,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:21,091 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:21,092 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:21,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:21,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1098144186, now seen corresponding path program 1 times [2018-12-03 16:12:21,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:21,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:21,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:21,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:21,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:21,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:21,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:21,604 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:21,604 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 16:12:21,605 INFO L205 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [36], [37], [45], [47], [50] [2018-12-03 16:12:21,606 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:21,606 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:21,624 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:21,624 INFO L272 AbstractInterpreter]: Visited 11 different actions 22 times. Merged at 7 different actions 8 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 16:12:21,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:21,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:21,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:21,662 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 16:12:21,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:21,678 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:21,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:22,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:22,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:22,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:22,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:22,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2018-12-03 16:12:22,633 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:22,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:12:22,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:12:22,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:12:22,634 INFO L87 Difference]: Start difference. First operand 449 states and 788 transitions. Second operand 9 states. [2018-12-03 16:12:23,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:23,147 INFO L93 Difference]: Finished difference Result 519 states and 895 transitions. [2018-12-03 16:12:23,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:12:23,147 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-12-03 16:12:23,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:23,150 INFO L225 Difference]: With dead ends: 519 [2018-12-03 16:12:23,150 INFO L226 Difference]: Without dead ends: 517 [2018-12-03 16:12:23,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:12:23,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-12-03 16:12:23,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 453. [2018-12-03 16:12:23,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-12-03 16:12:23,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 794 transitions. [2018-12-03 16:12:23,266 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 794 transitions. Word has length 11 [2018-12-03 16:12:23,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:23,266 INFO L480 AbstractCegarLoop]: Abstraction has 453 states and 794 transitions. [2018-12-03 16:12:23,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:12:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 794 transitions. [2018-12-03 16:12:23,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:12:23,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:23,268 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:23,268 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:23,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:23,268 INFO L82 PathProgramCache]: Analyzing trace with hash -772910566, now seen corresponding path program 1 times [2018-12-03 16:12:23,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:23,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:23,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:23,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:23,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:23,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:23,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:23,360 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:23,361 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 16:12:23,361 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [36], [38], [41], [45], [46], [47], [50] [2018-12-03 16:12:23,362 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:23,362 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:23,380 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:23,380 INFO L272 AbstractInterpreter]: Visited 10 different actions 21 times. Merged at 7 different actions 8 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 16:12:23,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:23,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:23,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:23,407 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 16:12:23,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:23,421 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:23,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:23,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:23,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:23,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:23,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:23,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8] total 16 [2018-12-03 16:12:23,643 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:23,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:12:23,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:12:23,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:12:23,644 INFO L87 Difference]: Start difference. First operand 453 states and 794 transitions. Second operand 13 states. [2018-12-03 16:12:24,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:24,761 INFO L93 Difference]: Finished difference Result 595 states and 1010 transitions. [2018-12-03 16:12:24,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:12:24,762 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-12-03 16:12:24,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:24,764 INFO L225 Difference]: With dead ends: 595 [2018-12-03 16:12:24,764 INFO L226 Difference]: Without dead ends: 593 [2018-12-03 16:12:24,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=1019, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:12:24,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2018-12-03 16:12:24,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 477. [2018-12-03 16:12:24,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-12-03 16:12:24,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 837 transitions. [2018-12-03 16:12:24,868 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 837 transitions. Word has length 11 [2018-12-03 16:12:24,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:24,868 INFO L480 AbstractCegarLoop]: Abstraction has 477 states and 837 transitions. [2018-12-03 16:12:24,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:12:24,868 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 837 transitions. [2018-12-03 16:12:24,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:12:24,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:24,869 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:24,869 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:24,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:24,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1674153000, now seen corresponding path program 2 times [2018-12-03 16:12:24,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:24,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:24,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:24,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:24,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:24,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:24,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:24,954 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:24,954 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:24,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:24,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:24,954 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 16:12:24,962 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:12:24,962 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:12:24,968 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:12:24,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:12:24,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:24,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:24,973 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:25,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:25,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:25,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 16:12:25,073 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:25,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:25,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:25,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:12:25,074 INFO L87 Difference]: Start difference. First operand 477 states and 837 transitions. Second operand 7 states. [2018-12-03 16:12:25,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:25,484 INFO L93 Difference]: Finished difference Result 564 states and 971 transitions. [2018-12-03 16:12:25,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:12:25,492 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 16:12:25,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:25,495 INFO L225 Difference]: With dead ends: 564 [2018-12-03 16:12:25,495 INFO L226 Difference]: Without dead ends: 562 [2018-12-03 16:12:25,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:12:25,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-12-03 16:12:25,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 472. [2018-12-03 16:12:25,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-12-03 16:12:25,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 829 transitions. [2018-12-03 16:12:25,582 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 829 transitions. Word has length 11 [2018-12-03 16:12:25,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:25,583 INFO L480 AbstractCegarLoop]: Abstraction has 472 states and 829 transitions. [2018-12-03 16:12:25,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:25,583 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 829 transitions. [2018-12-03 16:12:25,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:12:25,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:25,583 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:25,584 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:25,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:25,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1682742259, now seen corresponding path program 1 times [2018-12-03 16:12:25,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:25,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:25,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:12:25,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:25,585 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:25,656 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 16:12:25,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:25,656 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:25,656 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 16:12:25,657 INFO L205 CegarAbsIntRunner]: [0], [6], [10], [11], [23], [45], [47], [50], [52] [2018-12-03 16:12:25,657 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:25,658 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:25,663 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:25,663 INFO L272 AbstractInterpreter]: Visited 9 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 16:12:25,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:25,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:25,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:25,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 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 16:12:25,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:25,680 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:25,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:25,703 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 16:12:25,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:25,779 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 16:12:25,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:25,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 16:12:25,798 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:25,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:25,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:25,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:12:25,799 INFO L87 Difference]: Start difference. First operand 472 states and 829 transitions. Second operand 7 states. [2018-12-03 16:12:26,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:26,367 INFO L93 Difference]: Finished difference Result 581 states and 1007 transitions. [2018-12-03 16:12:26,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:12:26,367 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 16:12:26,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:26,370 INFO L225 Difference]: With dead ends: 581 [2018-12-03 16:12:26,370 INFO L226 Difference]: Without dead ends: 579 [2018-12-03 16:12:26,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:12:26,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-12-03 16:12:26,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 497. [2018-12-03 16:12:26,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-12-03 16:12:26,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 873 transitions. [2018-12-03 16:12:26,462 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 873 transitions. Word has length 11 [2018-12-03 16:12:26,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:26,462 INFO L480 AbstractCegarLoop]: Abstraction has 497 states and 873 transitions. [2018-12-03 16:12:26,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:26,462 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 873 transitions. [2018-12-03 16:12:26,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:12:26,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:26,463 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:26,463 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:26,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:26,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1927251354, now seen corresponding path program 1 times [2018-12-03 16:12:26,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:26,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:26,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:26,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:26,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:26,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:26,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:26,529 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:26,529 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 16:12:26,529 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [27], [30], [36], [38], [41], [45], [46] [2018-12-03 16:12:26,530 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:26,530 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:26,544 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:26,544 INFO L272 AbstractInterpreter]: Visited 11 different actions 22 times. Merged at 7 different actions 8 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 16:12:26,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:26,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:26,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:26,559 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 16:12:26,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:26,568 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:26,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:26,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:26,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:26,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:26,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:26,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 16:12:26,630 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:26,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:26,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:26,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:12:26,630 INFO L87 Difference]: Start difference. First operand 497 states and 873 transitions. Second operand 7 states. [2018-12-03 16:12:26,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:26,975 INFO L93 Difference]: Finished difference Result 543 states and 936 transitions. [2018-12-03 16:12:26,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:12:26,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 16:12:26,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:26,977 INFO L225 Difference]: With dead ends: 543 [2018-12-03 16:12:26,977 INFO L226 Difference]: Without dead ends: 541 [2018-12-03 16:12:26,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:12:26,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-12-03 16:12:27,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 502. [2018-12-03 16:12:27,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-12-03 16:12:27,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 880 transitions. [2018-12-03 16:12:27,066 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 880 transitions. Word has length 11 [2018-12-03 16:12:27,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:27,066 INFO L480 AbstractCegarLoop]: Abstraction has 502 states and 880 transitions. [2018-12-03 16:12:27,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:27,067 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 880 transitions. [2018-12-03 16:12:27,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:12:27,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:27,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:27,067 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:27,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:27,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1918662095, now seen corresponding path program 1 times [2018-12-03 16:12:27,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:27,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:27,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:27,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:27,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:27,155 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 16:12:27,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:27,155 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:27,155 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 16:12:27,156 INFO L205 CegarAbsIntRunner]: [0], [6], [10], [11], [23], [25], [27], [30], [45], [47], [52] [2018-12-03 16:12:27,157 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:27,158 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:27,165 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:27,165 INFO L272 AbstractInterpreter]: Visited 11 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 16:12:27,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:27,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:27,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:27,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 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 16:12:27,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:27,190 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:27,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:27,198 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 16:12:27,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:27,223 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 16:12:27,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:27,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 16:12:27,242 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:27,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:27,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:27,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:12:27,243 INFO L87 Difference]: Start difference. First operand 502 states and 880 transitions. Second operand 7 states. [2018-12-03 16:12:27,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:27,668 INFO L93 Difference]: Finished difference Result 571 states and 986 transitions. [2018-12-03 16:12:27,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:12:27,669 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 16:12:27,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:27,671 INFO L225 Difference]: With dead ends: 571 [2018-12-03 16:12:27,671 INFO L226 Difference]: Without dead ends: 569 [2018-12-03 16:12:27,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-12-03 16:12:27,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-12-03 16:12:27,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 489. [2018-12-03 16:12:27,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-12-03 16:12:27,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 855 transitions. [2018-12-03 16:12:27,778 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 855 transitions. Word has length 11 [2018-12-03 16:12:27,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:27,779 INFO L480 AbstractCegarLoop]: Abstraction has 489 states and 855 transitions. [2018-12-03 16:12:27,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:27,779 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 855 transitions. [2018-12-03 16:12:27,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:12:27,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:27,779 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:27,780 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:27,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:27,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1878520164, now seen corresponding path program 1 times [2018-12-03 16:12:27,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:27,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:27,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:27,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:27,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:27,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:27,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:27,862 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:27,862 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 16:12:27,862 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [11], [25], [27], [30], [32] [2018-12-03 16:12:27,863 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:27,863 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:27,871 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:27,871 INFO L272 AbstractInterpreter]: Visited 9 different actions 14 times. Merged at 5 different actions 5 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 16:12:27,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:27,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:27,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:27,880 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 16:12:27,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:27,888 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:27,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:27,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:27,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:27,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:27,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 16:12:27,957 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:27,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:27,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:27,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:12:27,958 INFO L87 Difference]: Start difference. First operand 489 states and 855 transitions. Second operand 7 states. [2018-12-03 16:12:28,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:28,377 INFO L93 Difference]: Finished difference Result 561 states and 969 transitions. [2018-12-03 16:12:28,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:12:28,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 16:12:28,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:28,385 INFO L225 Difference]: With dead ends: 561 [2018-12-03 16:12:28,385 INFO L226 Difference]: Without dead ends: 559 [2018-12-03 16:12:28,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:12:28,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-12-03 16:12:28,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 483. [2018-12-03 16:12:28,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-12-03 16:12:28,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 840 transitions. [2018-12-03 16:12:28,499 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 840 transitions. Word has length 11 [2018-12-03 16:12:28,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:28,500 INFO L480 AbstractCegarLoop]: Abstraction has 483 states and 840 transitions. [2018-12-03 16:12:28,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:28,500 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 840 transitions. [2018-12-03 16:12:28,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:12:28,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:28,500 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:28,501 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:28,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:28,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1730497723, now seen corresponding path program 1 times [2018-12-03 16:12:28,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:28,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:28,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:28,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:28,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:28,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:28,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:28,784 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:28,784 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2018-12-03 16:12:28,784 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [25], [26], [36], [38], [43], [45], [47], [52] [2018-12-03 16:12:28,785 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:28,785 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:28,794 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:28,795 INFO L272 AbstractInterpreter]: Visited 11 different actions 17 times. Merged at 5 different actions 5 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 16:12:28,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:28,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:28,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:28,822 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 16:12:28,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:28,830 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:28,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:28,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:28,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:28,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:28,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:28,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2018-12-03 16:12:28,955 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:28,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:12:28,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:12:28,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:12:28,956 INFO L87 Difference]: Start difference. First operand 483 states and 840 transitions. Second operand 12 states. [2018-12-03 16:12:29,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:29,848 INFO L93 Difference]: Finished difference Result 835 states and 1449 transitions. [2018-12-03 16:12:29,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:12:29,849 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:12:29,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:29,852 INFO L225 Difference]: With dead ends: 835 [2018-12-03 16:12:29,853 INFO L226 Difference]: Without dead ends: 833 [2018-12-03 16:12:29,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 16:12:29,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2018-12-03 16:12:29,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 625. [2018-12-03 16:12:29,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2018-12-03 16:12:29,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 1098 transitions. [2018-12-03 16:12:29,978 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 1098 transitions. Word has length 12 [2018-12-03 16:12:29,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:29,978 INFO L480 AbstractCegarLoop]: Abstraction has 625 states and 1098 transitions. [2018-12-03 16:12:29,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:12:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 1098 transitions. [2018-12-03 16:12:29,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:12:29,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:29,979 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:29,979 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:29,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:29,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1895489947, now seen corresponding path program 1 times [2018-12-03 16:12:29,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:29,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:29,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:29,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:29,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:30,724 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:30,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:30,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:30,725 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2018-12-03 16:12:30,725 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [27], [30], [32], [36], [37] [2018-12-03 16:12:30,726 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:30,726 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:30,734 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:30,734 INFO L272 AbstractInterpreter]: Visited 9 different actions 14 times. Merged at 5 different actions 5 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 16:12:30,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:30,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:30,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:30,752 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 16:12:30,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:30,763 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:30,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:30,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:30,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:31,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:31,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:31,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2018-12-03 16:12:31,068 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:31,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:12:31,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:12:31,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:12:31,069 INFO L87 Difference]: Start difference. First operand 625 states and 1098 transitions. Second operand 13 states. [2018-12-03 16:12:32,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:32,386 INFO L93 Difference]: Finished difference Result 1141 states and 1993 transitions. [2018-12-03 16:12:32,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 16:12:32,387 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-12-03 16:12:32,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:32,391 INFO L225 Difference]: With dead ends: 1141 [2018-12-03 16:12:32,391 INFO L226 Difference]: Without dead ends: 1139 [2018-12-03 16:12:32,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=392, Invalid=1414, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 16:12:32,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2018-12-03 16:12:32,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 822. [2018-12-03 16:12:32,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2018-12-03 16:12:32,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1443 transitions. [2018-12-03 16:12:32,571 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1443 transitions. Word has length 12 [2018-12-03 16:12:32,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:32,572 INFO L480 AbstractCegarLoop]: Abstraction has 822 states and 1443 transitions. [2018-12-03 16:12:32,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:12:32,572 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1443 transitions. [2018-12-03 16:12:32,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:12:32,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:32,573 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:32,573 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:32,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:32,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1489044045, now seen corresponding path program 1 times [2018-12-03 16:12:32,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:32,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:32,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:32,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:32,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:32,651 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:32,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:32,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:32,652 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-12-03 16:12:32,652 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [25], [26], [27], [30], [36], [38], [41], [43] [2018-12-03 16:12:32,653 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:32,653 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:32,659 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:32,659 INFO L272 AbstractInterpreter]: Visited 11 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 16:12:32,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:32,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:32,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:32,690 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 16:12:32,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:32,699 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:32,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:32,748 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:32,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:32,793 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:32,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:32,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2018-12-03 16:12:32,813 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:32,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:12:32,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:12:32,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:12:32,814 INFO L87 Difference]: Start difference. First operand 822 states and 1443 transitions. Second operand 12 states. [2018-12-03 16:12:33,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:33,633 INFO L93 Difference]: Finished difference Result 949 states and 1651 transitions. [2018-12-03 16:12:33,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:12:33,633 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-12-03 16:12:33,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:33,636 INFO L225 Difference]: With dead ends: 949 [2018-12-03 16:12:33,637 INFO L226 Difference]: Without dead ends: 947 [2018-12-03 16:12:33,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=688, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:12:33,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2018-12-03 16:12:33,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 820. [2018-12-03 16:12:33,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2018-12-03 16:12:33,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1443 transitions. [2018-12-03 16:12:33,845 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1443 transitions. Word has length 14 [2018-12-03 16:12:33,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:33,846 INFO L480 AbstractCegarLoop]: Abstraction has 820 states and 1443 transitions. [2018-12-03 16:12:33,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:12:33,846 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1443 transitions. [2018-12-03 16:12:33,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:12:33,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:33,847 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:33,847 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:33,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:33,848 INFO L82 PathProgramCache]: Analyzing trace with hash -397032175, now seen corresponding path program 2 times [2018-12-03 16:12:33,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:33,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:33,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:33,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:33,849 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:33,915 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:12:33,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:33,916 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:33,916 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:33,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:33,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:33,917 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 16:12:33,925 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:12:33,926 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:12:33,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:12:33,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:12:33,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:34,018 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:12:34,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:34,051 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:12:34,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:34,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-12-03 16:12:34,070 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:34,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:12:34,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:12:34,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:12:34,071 INFO L87 Difference]: Start difference. First operand 820 states and 1443 transitions. Second operand 11 states. [2018-12-03 16:12:34,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:34,955 INFO L93 Difference]: Finished difference Result 997 states and 1741 transitions. [2018-12-03 16:12:34,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:12:34,955 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-12-03 16:12:34,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:34,958 INFO L225 Difference]: With dead ends: 997 [2018-12-03 16:12:34,958 INFO L226 Difference]: Without dead ends: 994 [2018-12-03 16:12:34,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:12:34,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2018-12-03 16:12:35,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 860. [2018-12-03 16:12:35,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2018-12-03 16:12:35,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1513 transitions. [2018-12-03 16:12:35,139 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1513 transitions. Word has length 14 [2018-12-03 16:12:35,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:35,139 INFO L480 AbstractCegarLoop]: Abstraction has 860 states and 1513 transitions. [2018-12-03 16:12:35,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:12:35,140 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1513 transitions. [2018-12-03 16:12:35,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:12:35,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:35,140 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:35,141 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:35,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:35,141 INFO L82 PathProgramCache]: Analyzing trace with hash -397030605, now seen corresponding path program 1 times [2018-12-03 16:12:35,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:35,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:35,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:12:35,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:35,142 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:35,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:35,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:35,212 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-12-03 16:12:35,212 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [25], [26], [36], [38], [41], [43], [45], [47], [50] [2018-12-03 16:12:35,213 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:35,213 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:35,226 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:35,226 INFO L272 AbstractInterpreter]: Visited 12 different actions 24 times. Merged at 7 different actions 8 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 16:12:35,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:35,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:35,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:35,247 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 16:12:35,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:35,255 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:35,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:35,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:35,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:35,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:35,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:35,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2018-12-03 16:12:35,377 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:35,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:12:35,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:12:35,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:12:35,377 INFO L87 Difference]: Start difference. First operand 860 states and 1513 transitions. Second operand 11 states. [2018-12-03 16:12:36,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:36,233 INFO L93 Difference]: Finished difference Result 961 states and 1671 transitions. [2018-12-03 16:12:36,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:12:36,233 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-12-03 16:12:36,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:36,236 INFO L225 Difference]: With dead ends: 961 [2018-12-03 16:12:36,236 INFO L226 Difference]: Without dead ends: 959 [2018-12-03 16:12:36,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:12:36,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2018-12-03 16:12:36,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 854. [2018-12-03 16:12:36,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2018-12-03 16:12:36,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1503 transitions. [2018-12-03 16:12:36,399 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1503 transitions. Word has length 14 [2018-12-03 16:12:36,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:36,399 INFO L480 AbstractCegarLoop]: Abstraction has 854 states and 1503 transitions. [2018-12-03 16:12:36,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:12:36,399 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1503 transitions. [2018-12-03 16:12:36,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:12:36,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:36,400 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:36,400 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:36,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:36,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1838595071, now seen corresponding path program 1 times [2018-12-03 16:12:36,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:36,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:36,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:36,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:36,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:36,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:36,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:36,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:36,482 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-12-03 16:12:36,482 INFO L205 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [25], [26], [27], [30], [36], [38], [43] [2018-12-03 16:12:36,483 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:36,483 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:36,490 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:36,490 INFO L272 AbstractInterpreter]: Visited 13 different actions 17 times. Merged at 3 different actions 3 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 16:12:36,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:36,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:36,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:36,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 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 16:12:36,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:36,525 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:36,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:36,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:36,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:36,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:36,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:36,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2018-12-03 16:12:36,692 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:36,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:12:36,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:12:36,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:12:36,693 INFO L87 Difference]: Start difference. First operand 854 states and 1503 transitions. Second operand 12 states. [2018-12-03 16:12:37,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:37,515 INFO L93 Difference]: Finished difference Result 1073 states and 1863 transitions. [2018-12-03 16:12:37,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:12:37,515 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-12-03 16:12:37,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:37,519 INFO L225 Difference]: With dead ends: 1073 [2018-12-03 16:12:37,519 INFO L226 Difference]: Without dead ends: 1071 [2018-12-03 16:12:37,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:12:37,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2018-12-03 16:12:37,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 848. [2018-12-03 16:12:37,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2018-12-03 16:12:37,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1495 transitions. [2018-12-03 16:12:37,703 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1495 transitions. Word has length 14 [2018-12-03 16:12:37,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:37,704 INFO L480 AbstractCegarLoop]: Abstraction has 848 states and 1495 transitions. [2018-12-03 16:12:37,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:12:37,704 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1495 transitions. [2018-12-03 16:12:37,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:12:37,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:37,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:37,705 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:37,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:37,705 INFO L82 PathProgramCache]: Analyzing trace with hash -47479579, now seen corresponding path program 1 times [2018-12-03 16:12:37,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:37,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:37,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:37,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:37,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:37,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:37,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:37,795 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:37,795 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-12-03 16:12:37,796 INFO L205 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [25], [26], [36], [38], [43], [45], [47], [50] [2018-12-03 16:12:37,797 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:37,797 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:37,810 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:37,810 INFO L272 AbstractInterpreter]: Visited 14 different actions 27 times. Merged at 8 different actions 9 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 16:12:37,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:37,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:37,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:37,825 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 16:12:37,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:37,834 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:37,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:37,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:37,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:37,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:37,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:37,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2018-12-03 16:12:37,970 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:37,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:12:37,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:12:37,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:12:37,971 INFO L87 Difference]: Start difference. First operand 848 states and 1495 transitions. Second operand 11 states. [2018-12-03 16:12:38,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:38,742 INFO L93 Difference]: Finished difference Result 959 states and 1654 transitions. [2018-12-03 16:12:38,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:12:38,743 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-12-03 16:12:38,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:38,746 INFO L225 Difference]: With dead ends: 959 [2018-12-03 16:12:38,746 INFO L226 Difference]: Without dead ends: 957 [2018-12-03 16:12:38,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:12:38,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2018-12-03 16:12:38,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 842. [2018-12-03 16:12:38,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2018-12-03 16:12:38,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1483 transitions. [2018-12-03 16:12:38,959 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1483 transitions. Word has length 14 [2018-12-03 16:12:38,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:38,959 INFO L480 AbstractCegarLoop]: Abstraction has 842 states and 1483 transitions. [2018-12-03 16:12:38,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:12:38,960 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1483 transitions. [2018-12-03 16:12:38,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:12:38,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:38,961 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 16:12:38,961 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:38,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:38,961 INFO L82 PathProgramCache]: Analyzing trace with hash 2027388784, now seen corresponding path program 1 times [2018-12-03 16:12:38,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:38,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:38,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:38,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:38,963 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:39,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:39,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:39,135 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 16:12:39,135 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [36], [38], [41], [45], [46], [47], [52] [2018-12-03 16:12:39,136 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:39,136 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:39,149 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:39,149 INFO L272 AbstractInterpreter]: Visited 10 different actions 23 times. Merged at 8 different actions 10 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 16:12:39,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:39,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:39,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:39,193 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 16:12:39,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:39,205 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:39,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:39,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:39,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:39,845 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:39,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 16:12:39,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 8] total 22 [2018-12-03 16:12:39,865 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:39,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:12:39,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:12:39,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:12:39,866 INFO L87 Difference]: Start difference. First operand 842 states and 1483 transitions. Second operand 8 states. [2018-12-03 16:12:40,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:40,346 INFO L93 Difference]: Finished difference Result 1851 states and 3241 transitions. [2018-12-03 16:12:40,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:12:40,347 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-03 16:12:40,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:40,350 INFO L225 Difference]: With dead ends: 1851 [2018-12-03 16:12:40,350 INFO L226 Difference]: Without dead ends: 1010 [2018-12-03 16:12:40,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=117, Invalid=639, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:12:40,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2018-12-03 16:12:40,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 945. [2018-12-03 16:12:40,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2018-12-03 16:12:40,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1641 transitions. [2018-12-03 16:12:40,573 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1641 transitions. Word has length 15 [2018-12-03 16:12:40,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:40,573 INFO L480 AbstractCegarLoop]: Abstraction has 945 states and 1641 transitions. [2018-12-03 16:12:40,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:12:40,573 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1641 transitions. [2018-12-03 16:12:40,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:12:40,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:40,574 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:40,574 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:40,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:40,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1084233543, now seen corresponding path program 1 times [2018-12-03 16:12:40,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:40,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:40,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:40,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:40,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:40,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:40,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:40,750 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:40,750 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 16:12:40,750 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [19], [25], [26], [27], [32], [36], [38], [41], [43] [2018-12-03 16:12:40,751 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:40,751 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:40,767 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:40,767 INFO L272 AbstractInterpreter]: Visited 12 different actions 30 times. Merged at 11 different actions 15 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 16:12:40,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:40,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:40,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:40,793 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 16:12:40,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:40,813 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:40,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:41,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:41,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:41,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 16:12:41,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 18 [2018-12-03 16:12:41,392 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:41,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:41,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:41,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:12:41,393 INFO L87 Difference]: Start difference. First operand 945 states and 1641 transitions. Second operand 7 states. [2018-12-03 16:12:41,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:41,974 INFO L93 Difference]: Finished difference Result 2006 states and 3469 transitions. [2018-12-03 16:12:41,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:12:41,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 16:12:41,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:41,979 INFO L225 Difference]: With dead ends: 2006 [2018-12-03 16:12:41,979 INFO L226 Difference]: Without dead ends: 1062 [2018-12-03 16:12:41,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:12:41,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2018-12-03 16:12:42,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 901. [2018-12-03 16:12:42,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-12-03 16:12:42,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1554 transitions. [2018-12-03 16:12:42,203 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1554 transitions. Word has length 15 [2018-12-03 16:12:42,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:42,204 INFO L480 AbstractCegarLoop]: Abstraction has 901 states and 1554 transitions. [2018-12-03 16:12:42,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:42,204 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1554 transitions. [2018-12-03 16:12:42,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:12:42,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:42,204 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:42,205 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:42,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:42,205 INFO L82 PathProgramCache]: Analyzing trace with hash -2133386956, now seen corresponding path program 1 times [2018-12-03 16:12:42,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:42,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:42,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:42,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:42,206 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:42,298 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:42,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:42,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:42,299 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 16:12:42,299 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [23], [36], [38], [41], [43], [45], [46], [47], [50] [2018-12-03 16:12:42,301 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:42,301 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:42,313 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:42,313 INFO L272 AbstractInterpreter]: Visited 12 different actions 25 times. Merged at 8 different actions 9 times. Never widened. Found 7 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 16:12:42,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:42,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:42,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:42,339 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 16:12:42,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:42,358 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:42,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:42,441 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:42,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:42,519 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:42,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:42,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2018-12-03 16:12:42,540 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:42,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:12:42,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:12:42,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:12:42,541 INFO L87 Difference]: Start difference. First operand 901 states and 1554 transitions. Second operand 12 states. [2018-12-03 16:12:43,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:43,750 INFO L93 Difference]: Finished difference Result 1069 states and 1801 transitions. [2018-12-03 16:12:43,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 16:12:43,750 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2018-12-03 16:12:43,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:43,754 INFO L225 Difference]: With dead ends: 1069 [2018-12-03 16:12:43,754 INFO L226 Difference]: Without dead ends: 1067 [2018-12-03 16:12:43,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=317, Invalid=1165, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 16:12:43,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2018-12-03 16:12:43,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 867. [2018-12-03 16:12:43,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2018-12-03 16:12:43,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1492 transitions. [2018-12-03 16:12:43,970 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1492 transitions. Word has length 15 [2018-12-03 16:12:43,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:43,970 INFO L480 AbstractCegarLoop]: Abstraction has 867 states and 1492 transitions. [2018-12-03 16:12:43,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:12:43,970 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1492 transitions. [2018-12-03 16:12:43,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:12:43,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:43,972 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:43,972 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:43,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:43,972 INFO L82 PathProgramCache]: Analyzing trace with hash -185533858, now seen corresponding path program 1 times [2018-12-03 16:12:43,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:43,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:43,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:43,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:43,974 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:44,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:44,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:44,073 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:44,073 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 16:12:44,073 INFO L205 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [25], [26], [36], [38], [43], [45], [47], [52] [2018-12-03 16:12:44,074 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:44,074 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:44,091 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:44,092 INFO L272 AbstractInterpreter]: Visited 14 different actions 33 times. Merged at 10 different actions 13 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 16:12:44,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:44,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:44,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:44,123 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 16:12:44,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:44,138 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:44,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:44,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:44,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:44,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:44,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 16:12:44,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 17 [2018-12-03 16:12:44,518 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:44,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:44,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:44,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:12:44,519 INFO L87 Difference]: Start difference. First operand 867 states and 1492 transitions. Second operand 7 states. [2018-12-03 16:12:45,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:45,067 INFO L93 Difference]: Finished difference Result 2080 states and 3524 transitions. [2018-12-03 16:12:45,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:12:45,067 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 16:12:45,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:45,071 INFO L225 Difference]: With dead ends: 2080 [2018-12-03 16:12:45,071 INFO L226 Difference]: Without dead ends: 1203 [2018-12-03 16:12:45,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:12:45,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2018-12-03 16:12:45,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 978. [2018-12-03 16:12:45,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2018-12-03 16:12:45,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1642 transitions. [2018-12-03 16:12:45,365 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1642 transitions. Word has length 15 [2018-12-03 16:12:45,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:45,365 INFO L480 AbstractCegarLoop]: Abstraction has 978 states and 1642 transitions. [2018-12-03 16:12:45,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:45,365 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1642 transitions. [2018-12-03 16:12:45,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:12:45,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:45,367 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:45,367 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:45,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:45,367 INFO L82 PathProgramCache]: Analyzing trace with hash -497943192, now seen corresponding path program 1 times [2018-12-03 16:12:45,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:45,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:45,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:45,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:45,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:45,614 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 16:12:45,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:45,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:45,614 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 16:12:45,615 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [36], [38], [41], [43], [45], [46], [47], [50] [2018-12-03 16:12:45,616 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:45,616 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:45,627 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:45,628 INFO L272 AbstractInterpreter]: Visited 11 different actions 25 times. Merged at 8 different actions 10 times. Never widened. Found 7 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 16:12:45,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:45,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:45,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:45,665 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:45,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:45,682 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:45,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:45,777 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:12:45,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:45,825 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:12:45,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:45,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2018-12-03 16:12:45,845 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:45,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:12:45,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:12:45,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:12:45,846 INFO L87 Difference]: Start difference. First operand 978 states and 1642 transitions. Second operand 15 states. [2018-12-03 16:12:49,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:49,896 INFO L93 Difference]: Finished difference Result 2928 states and 4860 transitions. [2018-12-03 16:12:49,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 16:12:49,897 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-03 16:12:49,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:49,907 INFO L225 Difference]: With dead ends: 2928 [2018-12-03 16:12:49,907 INFO L226 Difference]: Without dead ends: 2232 [2018-12-03 16:12:49,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2061 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1422, Invalid=5384, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 16:12:49,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2018-12-03 16:12:50,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 1663. [2018-12-03 16:12:50,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1663 states. [2018-12-03 16:12:50,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2708 transitions. [2018-12-03 16:12:50,753 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2708 transitions. Word has length 15 [2018-12-03 16:12:50,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:50,753 INFO L480 AbstractCegarLoop]: Abstraction has 1663 states and 2708 transitions. [2018-12-03 16:12:50,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:12:50,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2708 transitions. [2018-12-03 16:12:50,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:12:50,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:50,755 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 16:12:50,756 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:50,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:50,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1957708543, now seen corresponding path program 1 times [2018-12-03 16:12:50,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:50,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:50,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:50,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:50,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:51,083 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 16:12:51,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:51,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:51,083 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 16:12:51,083 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [36], [37], [38], [43], [45], [47], [50] [2018-12-03 16:12:51,084 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:51,084 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:51,094 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:51,094 INFO L272 AbstractInterpreter]: Visited 10 different actions 23 times. Merged at 8 different actions 10 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 16:12:51,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:51,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:51,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:51,112 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:51,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:51,142 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:51,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:12:51,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:51,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:12:51,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 16:12:51,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 8] total 19 [2018-12-03 16:12:51,517 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:51,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:51,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:51,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:12:51,518 INFO L87 Difference]: Start difference. First operand 1663 states and 2708 transitions. Second operand 7 states. [2018-12-03 16:12:52,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:52,176 INFO L93 Difference]: Finished difference Result 2237 states and 3574 transitions. [2018-12-03 16:12:52,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:12:52,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 16:12:52,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:52,183 INFO L225 Difference]: With dead ends: 2237 [2018-12-03 16:12:52,183 INFO L226 Difference]: Without dead ends: 1609 [2018-12-03 16:12:52,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:12:52,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2018-12-03 16:12:52,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1373. [2018-12-03 16:12:52,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2018-12-03 16:12:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 2243 transitions. [2018-12-03 16:12:52,616 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 2243 transitions. Word has length 15 [2018-12-03 16:12:52,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:52,616 INFO L480 AbstractCegarLoop]: Abstraction has 1373 states and 2243 transitions. [2018-12-03 16:12:52,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:52,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 2243 transitions. [2018-12-03 16:12:52,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:12:52,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:52,618 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:52,618 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:52,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:52,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1386290021, now seen corresponding path program 1 times [2018-12-03 16:12:52,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:52,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:52,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:52,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:52,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:52,748 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 16:12:52,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:52,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:52,749 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 16:12:52,749 INFO L205 CegarAbsIntRunner]: [0], [6], [10], [11], [23], [36], [38], [43], [45], [47], [50], [52] [2018-12-03 16:12:52,750 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:52,750 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:52,759 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:52,759 INFO L272 AbstractInterpreter]: Visited 12 different actions 26 times. Merged at 8 different actions 10 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 16:12:52,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:52,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:52,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:52,768 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:52,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:52,776 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:52,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:52,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:52,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:52,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:52,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 16:12:52,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 18 [2018-12-03 16:12:52,958 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:52,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:52,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:52,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:12:52,959 INFO L87 Difference]: Start difference. First operand 1373 states and 2243 transitions. Second operand 7 states. [2018-12-03 16:12:53,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:53,869 INFO L93 Difference]: Finished difference Result 3043 states and 4935 transitions. [2018-12-03 16:12:53,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:12:53,869 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 16:12:53,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:53,877 INFO L225 Difference]: With dead ends: 3043 [2018-12-03 16:12:53,877 INFO L226 Difference]: Without dead ends: 1528 [2018-12-03 16:12:53,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:12:53,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2018-12-03 16:12:54,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1369. [2018-12-03 16:12:54,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1369 states. [2018-12-03 16:12:54,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2220 transitions. [2018-12-03 16:12:54,313 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2220 transitions. Word has length 15 [2018-12-03 16:12:54,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:54,313 INFO L480 AbstractCegarLoop]: Abstraction has 1369 states and 2220 transitions. [2018-12-03 16:12:54,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:54,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2220 transitions. [2018-12-03 16:12:54,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:12:54,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:54,315 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 16:12:54,315 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:54,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:54,315 INFO L82 PathProgramCache]: Analyzing trace with hash -38293542, now seen corresponding path program 1 times [2018-12-03 16:12:54,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:54,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:54,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:54,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:54,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:54,410 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 16:12:54,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:54,411 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:54,411 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 16:12:54,411 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [26], [27], [30], [36], [38], [43] [2018-12-03 16:12:54,412 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:54,412 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:54,423 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:54,423 INFO L272 AbstractInterpreter]: Visited 10 different actions 24 times. Merged at 8 different actions 11 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 16:12:54,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:54,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:54,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:54,460 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:54,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:54,478 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:54,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:54,627 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:12:54,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:12:54,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 16:12:54,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 17 [2018-12-03 16:12:54,698 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:54,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:54,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:54,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:12:54,699 INFO L87 Difference]: Start difference. First operand 1369 states and 2220 transitions. Second operand 7 states. [2018-12-03 16:12:55,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:55,403 INFO L93 Difference]: Finished difference Result 2968 states and 4750 transitions. [2018-12-03 16:12:55,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:12:55,403 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 16:12:55,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:55,406 INFO L225 Difference]: With dead ends: 2968 [2018-12-03 16:12:55,407 INFO L226 Difference]: Without dead ends: 1345 [2018-12-03 16:12:55,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:12:55,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-12-03 16:12:55,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1010. [2018-12-03 16:12:55,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1010 states. [2018-12-03 16:12:55,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1626 transitions. [2018-12-03 16:12:55,706 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1626 transitions. Word has length 15 [2018-12-03 16:12:55,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:55,706 INFO L480 AbstractCegarLoop]: Abstraction has 1010 states and 1626 transitions. [2018-12-03 16:12:55,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:55,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1626 transitions. [2018-12-03 16:12:55,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:12:55,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:55,707 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 16:12:55,707 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:55,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:55,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1080543844, now seen corresponding path program 1 times [2018-12-03 16:12:55,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:55,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:55,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:55,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:55,708 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:55,916 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:12:55,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:55,916 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:55,916 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 16:12:55,916 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [36], [38], [41], [45], [46], [47], [50], [52] [2018-12-03 16:12:55,917 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:55,917 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:55,927 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:55,927 INFO L272 AbstractInterpreter]: Visited 11 different actions 25 times. Merged at 8 different actions 10 times. Never widened. Found 7 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 16:12:55,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:55,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:55,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:55,954 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:55,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:55,964 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:55,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:56,093 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:56,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:56,215 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:56,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:56,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2018-12-03 16:12:56,233 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:56,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:12:56,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:12:56,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:12:56,234 INFO L87 Difference]: Start difference. First operand 1010 states and 1626 transitions. Second operand 19 states. [2018-12-03 16:12:58,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:58,966 INFO L93 Difference]: Finished difference Result 2204 states and 3532 transitions. [2018-12-03 16:12:58,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 16:12:58,966 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-12-03 16:12:58,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:58,969 INFO L225 Difference]: With dead ends: 2204 [2018-12-03 16:12:58,969 INFO L226 Difference]: Without dead ends: 1512 [2018-12-03 16:12:58,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=696, Invalid=3464, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 16:12:58,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2018-12-03 16:12:59,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1371. [2018-12-03 16:12:59,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1371 states. [2018-12-03 16:12:59,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 2170 transitions. [2018-12-03 16:12:59,366 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 2170 transitions. Word has length 18 [2018-12-03 16:12:59,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:59,366 INFO L480 AbstractCegarLoop]: Abstraction has 1371 states and 2170 transitions. [2018-12-03 16:12:59,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:12:59,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2170 transitions. [2018-12-03 16:12:59,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:12:59,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:59,368 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:59,368 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:59,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:59,368 INFO L82 PathProgramCache]: Analyzing trace with hash 818532565, now seen corresponding path program 1 times [2018-12-03 16:12:59,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:59,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:59,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:59,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:59,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:59,557 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:59,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:59,557 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:59,557 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 16:12:59,558 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [19], [25], [26], [27], [30], [32], [36], [38], [41], [43] [2018-12-03 16:12:59,558 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:59,558 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:59,574 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:59,574 INFO L272 AbstractInterpreter]: Visited 13 different actions 32 times. Merged at 11 different actions 15 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 16:12:59,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:59,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:59,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:59,580 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:59,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:59,588 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:59,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:12:59,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:59,950 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:12:59,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:59,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 25 [2018-12-03 16:12:59,969 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:59,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:12:59,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:12:59,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:12:59,970 INFO L87 Difference]: Start difference. First operand 1371 states and 2170 transitions. Second operand 19 states. [2018-12-03 16:13:02,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:02,844 INFO L93 Difference]: Finished difference Result 1470 states and 2323 transitions. [2018-12-03 16:13:02,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 16:13:02,844 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-12-03 16:13:02,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:02,846 INFO L225 Difference]: With dead ends: 1470 [2018-12-03 16:13:02,846 INFO L226 Difference]: Without dead ends: 1468 [2018-12-03 16:13:02,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=608, Invalid=3174, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:13:02,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2018-12-03 16:13:03,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1360. [2018-12-03 16:13:03,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2018-12-03 16:13:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 2154 transitions. [2018-12-03 16:13:03,250 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 2154 transitions. Word has length 18 [2018-12-03 16:13:03,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:03,250 INFO L480 AbstractCegarLoop]: Abstraction has 1360 states and 2154 transitions. [2018-12-03 16:13:03,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:13:03,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 2154 transitions. [2018-12-03 16:13:03,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:13:03,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:03,252 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 16:13:03,252 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:03,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:03,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1793898800, now seen corresponding path program 2 times [2018-12-03 16:13:03,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:03,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:03,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:03,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:03,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:13:03,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:03,391 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:03,391 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:13:03,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:13:03,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:03,391 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:03,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:13:03,401 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:13:03,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:13:03,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:13:03,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:03,509 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 16:13:03,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:04,107 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 16:13:04,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:04,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 27 [2018-12-03 16:13:04,127 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:04,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 16:13:04,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 16:13:04,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:13:04,128 INFO L87 Difference]: Start difference. First operand 1360 states and 2154 transitions. Second operand 20 states. [2018-12-03 16:13:04,426 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-12-03 16:13:06,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:06,118 INFO L93 Difference]: Finished difference Result 1557 states and 2459 transitions. [2018-12-03 16:13:06,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 16:13:06,118 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 18 [2018-12-03 16:13:06,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:06,121 INFO L225 Difference]: With dead ends: 1557 [2018-12-03 16:13:06,121 INFO L226 Difference]: Without dead ends: 1556 [2018-12-03 16:13:06,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=593, Invalid=1957, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 16:13:06,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2018-12-03 16:13:06,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1353. [2018-12-03 16:13:06,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1353 states. [2018-12-03 16:13:06,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 2139 transitions. [2018-12-03 16:13:06,640 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 2139 transitions. Word has length 18 [2018-12-03 16:13:06,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:06,640 INFO L480 AbstractCegarLoop]: Abstraction has 1353 states and 2139 transitions. [2018-12-03 16:13:06,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 16:13:06,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 2139 transitions. [2018-12-03 16:13:06,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:13:06,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:06,641 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:06,642 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:06,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:06,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1793897518, now seen corresponding path program 1 times [2018-12-03 16:13:06,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:06,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:06,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:13:06,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:06,643 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:07,014 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:07,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:07,015 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:07,015 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 16:13:07,015 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [25], [26], [36], [38], [41], [43], [45], [47], [50], [52] [2018-12-03 16:13:07,016 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:13:07,016 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:13:07,026 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:13:07,026 INFO L272 AbstractInterpreter]: Visited 13 different actions 28 times. Merged at 8 different actions 10 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 16:13:07,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:07,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:13:07,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:07,063 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:07,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:07,075 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:13:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:07,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:13:07,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:07,297 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:13:07,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:07,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2018-12-03 16:13:07,318 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:07,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:13:07,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:13:07,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:13:07,319 INFO L87 Difference]: Start difference. First operand 1353 states and 2139 transitions. Second operand 16 states. [2018-12-03 16:13:10,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:10,079 INFO L93 Difference]: Finished difference Result 1659 states and 2632 transitions. [2018-12-03 16:13:10,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 16:13:10,080 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-03 16:13:10,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:10,084 INFO L225 Difference]: With dead ends: 1659 [2018-12-03 16:13:10,084 INFO L226 Difference]: Without dead ends: 1657 [2018-12-03 16:13:10,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1331 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=809, Invalid=4303, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:13:10,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2018-12-03 16:13:10,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1426. [2018-12-03 16:13:10,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1426 states. [2018-12-03 16:13:10,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2263 transitions. [2018-12-03 16:13:10,621 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 2263 transitions. Word has length 18 [2018-12-03 16:13:10,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:10,621 INFO L480 AbstractCegarLoop]: Abstraction has 1426 states and 2263 transitions. [2018-12-03 16:13:10,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:13:10,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 2263 transitions. [2018-12-03 16:13:10,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:13:10,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:10,622 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:10,623 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:10,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:10,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1785310631, now seen corresponding path program 1 times [2018-12-03 16:13:10,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:10,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:10,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:10,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:10,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:10,727 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:10,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:10,727 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:10,728 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 16:13:10,728 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [36], [37], [38], [41], [45], [47], [50], [52] [2018-12-03 16:13:10,729 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:13:10,729 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:13:10,738 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:13:10,738 INFO L272 AbstractInterpreter]: Visited 11 different actions 25 times. Merged at 8 different actions 10 times. Never widened. Found 7 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 16:13:10,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:10,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:13:10,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:10,773 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:10,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:10,791 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:13:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:10,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:10,898 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:13:10,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:10,993 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:13:11,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:11,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-12-03 16:13:11,012 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:11,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:13:11,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:13:11,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:13:11,013 INFO L87 Difference]: Start difference. First operand 1426 states and 2263 transitions. Second operand 15 states. [2018-12-03 16:13:11,418 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-12-03 16:13:14,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:14,178 INFO L93 Difference]: Finished difference Result 1712 states and 2716 transitions. [2018-12-03 16:13:14,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 16:13:14,178 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 16:13:14,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:14,182 INFO L225 Difference]: With dead ends: 1712 [2018-12-03 16:13:14,182 INFO L226 Difference]: Without dead ends: 1710 [2018-12-03 16:13:14,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1245 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=838, Invalid=3992, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:13:14,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2018-12-03 16:13:14,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1469. [2018-12-03 16:13:14,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2018-12-03 16:13:14,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 2333 transitions. [2018-12-03 16:13:14,835 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 2333 transitions. Word has length 18 [2018-12-03 16:13:14,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:14,836 INFO L480 AbstractCegarLoop]: Abstraction has 1469 states and 2333 transitions. [2018-12-03 16:13:14,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:13:14,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 2333 transitions. [2018-12-03 16:13:14,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:13:14,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:14,837 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:14,837 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:14,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:14,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1256757274, now seen corresponding path program 2 times [2018-12-03 16:13:14,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:14,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:14,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:14,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:14,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:14,928 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:14,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:14,928 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:14,928 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:13:14,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:13:14,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:14,929 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:14,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:13:14,939 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:13:14,947 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:13:14,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:13:14,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:15,058 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:13:15,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:13:15,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:15,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 23 [2018-12-03 16:13:15,163 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:15,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:13:15,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:13:15,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:13:15,164 INFO L87 Difference]: Start difference. First operand 1469 states and 2333 transitions. Second operand 18 states. [2018-12-03 16:13:19,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:19,999 INFO L93 Difference]: Finished difference Result 1829 states and 2908 transitions. [2018-12-03 16:13:19,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 16:13:19,999 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 16:13:19,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:20,001 INFO L225 Difference]: With dead ends: 1829 [2018-12-03 16:13:20,001 INFO L226 Difference]: Without dead ends: 1827 [2018-12-03 16:13:20,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 5 DeprecatedPredicates, 3165 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2174, Invalid=7926, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 16:13:20,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2018-12-03 16:13:20,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1331. [2018-12-03 16:13:20,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-12-03 16:13:20,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2101 transitions. [2018-12-03 16:13:20,512 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2101 transitions. Word has length 18 [2018-12-03 16:13:20,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:20,512 INFO L480 AbstractCegarLoop]: Abstraction has 1331 states and 2101 transitions. [2018-12-03 16:13:20,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:13:20,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2101 transitions. [2018-12-03 16:13:20,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:13:20,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:20,513 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:20,514 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:20,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:20,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1248170387, now seen corresponding path program 2 times [2018-12-03 16:13:20,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:20,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:20,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:13:20,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:20,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:20,695 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:20,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:20,696 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:20,696 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:13:20,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:13:20,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:20,696 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:20,706 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:13:20,706 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:13:20,713 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:13:20,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:13:20,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:13:20,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:20,906 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:13:20,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:20,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2018-12-03 16:13:20,925 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:20,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:13:20,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:13:20,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:13:20,925 INFO L87 Difference]: Start difference. First operand 1331 states and 2101 transitions. Second operand 16 states. [2018-12-03 16:13:24,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:24,878 INFO L93 Difference]: Finished difference Result 1534 states and 2400 transitions. [2018-12-03 16:13:24,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 16:13:24,879 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-03 16:13:24,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:24,880 INFO L225 Difference]: With dead ends: 1534 [2018-12-03 16:13:24,880 INFO L226 Difference]: Without dead ends: 1532 [2018-12-03 16:13:24,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1726 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1425, Invalid=5381, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 16:13:24,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2018-12-03 16:13:25,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1329. [2018-12-03 16:13:25,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1329 states. [2018-12-03 16:13:25,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 2096 transitions. [2018-12-03 16:13:25,341 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 2096 transitions. Word has length 18 [2018-12-03 16:13:25,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:25,342 INFO L480 AbstractCegarLoop]: Abstraction has 1329 states and 2096 transitions. [2018-12-03 16:13:25,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:13:25,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 2096 transitions. [2018-12-03 16:13:25,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:13:25,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:25,343 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:25,343 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:25,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:25,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1882250372, now seen corresponding path program 1 times [2018-12-03 16:13:25,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:25,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:25,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:13:25,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:25,344 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:25,441 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:25,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:25,442 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:25,442 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 16:13:25,442 INFO L205 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [25], [26], [36], [38], [43], [45], [47], [50], [52] [2018-12-03 16:13:25,443 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:13:25,443 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:13:25,454 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:13:25,454 INFO L272 AbstractInterpreter]: Visited 15 different actions 35 times. Merged at 11 different actions 13 times. Never widened. Found 10 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 16:13:25,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:25,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:13:25,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:25,467 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:25,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:25,476 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:13:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:25,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:13:25,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:25,663 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:13:25,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:25,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2018-12-03 16:13:25,682 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:25,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:13:25,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:13:25,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:13:25,683 INFO L87 Difference]: Start difference. First operand 1329 states and 2096 transitions. Second operand 16 states. [2018-12-03 16:13:27,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:27,997 INFO L93 Difference]: Finished difference Result 1621 states and 2566 transitions. [2018-12-03 16:13:27,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 16:13:27,997 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-03 16:13:27,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:27,999 INFO L225 Difference]: With dead ends: 1621 [2018-12-03 16:13:27,999 INFO L226 Difference]: Without dead ends: 1619 [2018-12-03 16:13:28,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=387, Invalid=2265, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:13:28,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2018-12-03 16:13:28,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1312. [2018-12-03 16:13:28,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1312 states. [2018-12-03 16:13:28,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 2065 transitions. [2018-12-03 16:13:28,466 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 2065 transitions. Word has length 18 [2018-12-03 16:13:28,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:28,466 INFO L480 AbstractCegarLoop]: Abstraction has 1312 states and 2065 transitions. [2018-12-03 16:13:28,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:13:28,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 2065 transitions. [2018-12-03 16:13:28,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:13:28,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:28,467 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:28,468 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:28,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:28,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1890837259, now seen corresponding path program 1 times [2018-12-03 16:13:28,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:28,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:28,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:28,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:28,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:28,658 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:28,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:28,659 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:28,659 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 16:13:28,659 INFO L205 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [36], [37], [45], [47], [50], [52] [2018-12-03 16:13:28,660 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:13:28,660 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:13:28,670 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:13:28,671 INFO L272 AbstractInterpreter]: Visited 12 different actions 30 times. Merged at 10 different actions 12 times. Never widened. Found 9 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 16:13:28,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:28,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:13:28,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:28,683 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:28,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:28,691 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:13:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:28,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:28,773 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:13:28,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:28,847 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:13:28,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:28,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2018-12-03 16:13:28,868 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:28,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:13:28,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:13:28,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:13:28,869 INFO L87 Difference]: Start difference. First operand 1312 states and 2065 transitions. Second operand 15 states. [2018-12-03 16:13:31,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:31,227 INFO L93 Difference]: Finished difference Result 1779 states and 2806 transitions. [2018-12-03 16:13:31,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 16:13:31,227 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 16:13:31,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:31,229 INFO L225 Difference]: With dead ends: 1779 [2018-12-03 16:13:31,229 INFO L226 Difference]: Without dead ends: 1777 [2018-12-03 16:13:31,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=487, Invalid=2375, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:13:31,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2018-12-03 16:13:31,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1453. [2018-12-03 16:13:31,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1453 states. [2018-12-03 16:13:31,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2301 transitions. [2018-12-03 16:13:31,787 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2301 transitions. Word has length 18 [2018-12-03 16:13:31,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:31,787 INFO L480 AbstractCegarLoop]: Abstraction has 1453 states and 2301 transitions. [2018-12-03 16:13:31,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:13:31,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2301 transitions. [2018-12-03 16:13:31,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:13:31,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:31,788 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:31,788 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:31,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:31,789 INFO L82 PathProgramCache]: Analyzing trace with hash 740718717, now seen corresponding path program 2 times [2018-12-03 16:13:31,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:31,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:31,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:31,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:31,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:31,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:31,873 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:31,873 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:13:31,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:13:31,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:31,874 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:31,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:13:31,884 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:13:31,890 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:13:31,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:13:31,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:32,024 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:13:32,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:32,126 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:13:32,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:32,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2018-12-03 16:13:32,147 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:32,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:13:32,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:13:32,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:13:32,147 INFO L87 Difference]: Start difference. First operand 1453 states and 2301 transitions. Second operand 16 states. [2018-12-03 16:13:35,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:35,736 INFO L93 Difference]: Finished difference Result 1849 states and 2916 transitions. [2018-12-03 16:13:35,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 16:13:35,736 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-03 16:13:35,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:35,738 INFO L225 Difference]: With dead ends: 1849 [2018-12-03 16:13:35,739 INFO L226 Difference]: Without dead ends: 1847 [2018-12-03 16:13:35,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1576 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1317, Invalid=4845, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 16:13:35,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2018-12-03 16:13:36,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1505. [2018-12-03 16:13:36,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1505 states. [2018-12-03 16:13:36,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2384 transitions. [2018-12-03 16:13:36,329 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2384 transitions. Word has length 18 [2018-12-03 16:13:36,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:36,330 INFO L480 AbstractCegarLoop]: Abstraction has 1505 states and 2384 transitions. [2018-12-03 16:13:36,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:13:36,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2384 transitions. [2018-12-03 16:13:36,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:13:36,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:36,331 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 16:13:36,331 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:36,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:36,332 INFO L82 PathProgramCache]: Analyzing trace with hash 749306886, now seen corresponding path program 1 times [2018-12-03 16:13:36,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:36,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:36,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:13:36,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:36,333 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:36,453 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:36,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:36,453 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:36,453 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 16:13:36,453 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [36], [37], [38], [41], [43], [45], [47], [50] [2018-12-03 16:13:36,454 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:13:36,454 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:13:36,462 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:13:36,462 INFO L272 AbstractInterpreter]: Visited 11 different actions 25 times. Merged at 8 different actions 10 times. Never widened. Found 7 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 16:13:36,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:36,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:13:36,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:36,498 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:36,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:36,515 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:13:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:36,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:36,782 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:36,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:36,910 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:36,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:36,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2018-12-03 16:13:36,931 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:36,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:13:36,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:13:36,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:13:36,932 INFO L87 Difference]: Start difference. First operand 1505 states and 2384 transitions. Second operand 19 states. [2018-12-03 16:13:44,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:44,263 INFO L93 Difference]: Finished difference Result 4923 states and 7834 transitions. [2018-12-03 16:13:44,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-12-03 16:13:44,263 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-12-03 16:13:44,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:44,267 INFO L225 Difference]: With dead ends: 4923 [2018-12-03 16:13:44,267 INFO L226 Difference]: Without dead ends: 3654 [2018-12-03 16:13:44,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11798 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3851, Invalid=25219, Unknown=0, NotChecked=0, Total=29070 [2018-12-03 16:13:44,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2018-12-03 16:13:45,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 2695. [2018-12-03 16:13:45,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2695 states. [2018-12-03 16:13:45,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 4311 transitions. [2018-12-03 16:13:45,278 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 4311 transitions. Word has length 18 [2018-12-03 16:13:45,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:45,278 INFO L480 AbstractCegarLoop]: Abstraction has 2695 states and 4311 transitions. [2018-12-03 16:13:45,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:13:45,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 4311 transitions. [2018-12-03 16:13:45,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:13:45,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:45,280 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:45,280 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:45,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:45,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1434281659, now seen corresponding path program 1 times [2018-12-03 16:13:45,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:45,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:45,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:45,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:45,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:45,413 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:45,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:45,413 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:45,413 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 16:13:45,414 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [27], [30], [36], [38], [41], [43], [45], [46] [2018-12-03 16:13:45,414 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:13:45,414 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:13:45,428 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:13:45,428 INFO L272 AbstractInterpreter]: Visited 12 different actions 30 times. Merged at 10 different actions 12 times. Never widened. Found 9 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 16:13:45,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:45,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:13:45,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:45,462 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:45,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:45,471 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:13:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:45,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:45,560 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 16:13:45,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:45,665 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:45,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:45,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2018-12-03 16:13:45,685 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:45,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:13:45,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:13:45,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:13:45,686 INFO L87 Difference]: Start difference. First operand 2695 states and 4311 transitions. Second operand 16 states. [2018-12-03 16:13:49,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:49,603 INFO L93 Difference]: Finished difference Result 4103 states and 6582 transitions. [2018-12-03 16:13:49,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 16:13:49,604 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-03 16:13:49,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:49,608 INFO L225 Difference]: With dead ends: 4103 [2018-12-03 16:13:49,608 INFO L226 Difference]: Without dead ends: 4052 [2018-12-03 16:13:49,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1002, Invalid=3420, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 16:13:49,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4052 states. [2018-12-03 16:13:50,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4052 to 2890. [2018-12-03 16:13:50,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2890 states. [2018-12-03 16:13:50,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 4653 transitions. [2018-12-03 16:13:50,724 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 4653 transitions. Word has length 18 [2018-12-03 16:13:50,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:50,724 INFO L480 AbstractCegarLoop]: Abstraction has 2890 states and 4653 transitions. [2018-12-03 16:13:50,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:13:50,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 4653 transitions. [2018-12-03 16:13:50,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:13:50,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:50,726 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:50,727 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:50,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:50,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1483012849, now seen corresponding path program 1 times [2018-12-03 16:13:50,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:50,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:50,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:50,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:50,728 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:51,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:51,251 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:51,251 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 16:13:51,251 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [11], [23], [25], [27], [30], [32], [36], [38], [41], [43] [2018-12-03 16:13:51,252 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:13:51,252 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:13:51,273 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:13:51,274 INFO L272 AbstractInterpreter]: Visited 14 different actions 36 times. Merged at 12 different actions 16 times. Never widened. Found 10 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 16:13:51,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:51,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:13:51,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:51,281 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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:51,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:51,291 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:13:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:51,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:51,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:52,025 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:52,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:52,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2018-12-03 16:13:52,043 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:52,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:13:52,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:13:52,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:13:52,044 INFO L87 Difference]: Start difference. First operand 2890 states and 4653 transitions. Second operand 18 states. [2018-12-03 16:13:56,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:56,833 INFO L93 Difference]: Finished difference Result 4467 states and 7172 transitions. [2018-12-03 16:13:56,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 16:13:56,833 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 16:13:56,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:56,838 INFO L225 Difference]: With dead ends: 4467 [2018-12-03 16:13:56,838 INFO L226 Difference]: Without dead ends: 4465 [2018-12-03 16:13:56,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1638 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1116, Invalid=4736, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 16:13:56,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4465 states. [2018-12-03 16:13:58,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4465 to 3583. [2018-12-03 16:13:58,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3583 states. [2018-12-03 16:13:58,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 5784 transitions. [2018-12-03 16:13:58,315 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 5784 transitions. Word has length 18 [2018-12-03 16:13:58,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:58,315 INFO L480 AbstractCegarLoop]: Abstraction has 3583 states and 5784 transitions. [2018-12-03 16:13:58,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:13:58,316 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 5784 transitions. [2018-12-03 16:13:58,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:13:58,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:58,317 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:58,318 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:58,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:58,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1851213523, now seen corresponding path program 3 times [2018-12-03 16:13:58,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:58,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:58,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:58,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:58,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:58,417 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:58,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:58,418 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:58,418 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:13:58,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:13:58,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:58,418 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:58,429 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:13:58,429 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:13:58,434 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:13:58,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:13:58,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:58,494 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:13:58,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:58,583 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:13:58,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:58,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-12-03 16:13:58,602 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:58,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:13:58,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:13:58,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:13:58,603 INFO L87 Difference]: Start difference. First operand 3583 states and 5784 transitions. Second operand 15 states. [2018-12-03 16:14:04,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:04,028 INFO L93 Difference]: Finished difference Result 5480 states and 8882 transitions. [2018-12-03 16:14:04,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 16:14:04,029 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 16:14:04,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:04,033 INFO L225 Difference]: With dead ends: 5480 [2018-12-03 16:14:04,034 INFO L226 Difference]: Without dead ends: 5475 [2018-12-03 16:14:04,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2423 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1729, Invalid=6461, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 16:14:04,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5475 states. [2018-12-03 16:14:05,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5475 to 3430. [2018-12-03 16:14:05,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3430 states. [2018-12-03 16:14:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3430 states to 3430 states and 5514 transitions. [2018-12-03 16:14:05,419 INFO L78 Accepts]: Start accepts. Automaton has 3430 states and 5514 transitions. Word has length 18 [2018-12-03 16:14:05,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:05,419 INFO L480 AbstractCegarLoop]: Abstraction has 3430 states and 5514 transitions. [2018-12-03 16:14:05,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:14:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3430 states and 5514 transitions. [2018-12-03 16:14:05,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:14:05,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:05,421 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:14:05,421 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:05,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:05,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1899944713, now seen corresponding path program 1 times [2018-12-03 16:14:05,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:05,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:05,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:14:05,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:05,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:05,544 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:05,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:05,545 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:14:05,545 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 16:14:05,545 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [11], [23], [25], [27], [32], [36], [38], [41], [43], [45], [47], [50] [2018-12-03 16:14:05,546 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:14:05,546 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:14:05,559 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:14:05,559 INFO L272 AbstractInterpreter]: Visited 16 different actions 42 times. Merged at 14 different actions 18 times. Never widened. Found 12 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 16:14:05,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:05,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:14:05,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:05,598 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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:14:05,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:05,617 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:14:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:05,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:14:05,723 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:14:05,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:14:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:14:05,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:14:05,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2018-12-03 16:14:05,837 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:14:05,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:14:05,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:14:05,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:14:05,837 INFO L87 Difference]: Start difference. First operand 3430 states and 5514 transitions. Second operand 17 states. [2018-12-03 16:14:12,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:12,031 INFO L93 Difference]: Finished difference Result 5007 states and 8126 transitions. [2018-12-03 16:14:12,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 16:14:12,032 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-12-03 16:14:12,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:12,036 INFO L225 Difference]: With dead ends: 5007 [2018-12-03 16:14:12,036 INFO L226 Difference]: Without dead ends: 5005 [2018-12-03 16:14:12,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2909 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1735, Invalid=7967, Unknown=0, NotChecked=0, Total=9702 [2018-12-03 16:14:12,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5005 states. [2018-12-03 16:14:13,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5005 to 3569. [2018-12-03 16:14:13,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3569 states. [2018-12-03 16:14:13,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3569 states to 3569 states and 5750 transitions. [2018-12-03 16:14:13,485 INFO L78 Accepts]: Start accepts. Automaton has 3569 states and 5750 transitions. Word has length 18 [2018-12-03 16:14:13,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:13,485 INFO L480 AbstractCegarLoop]: Abstraction has 3569 states and 5750 transitions. [2018-12-03 16:14:13,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:14:13,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3569 states and 5750 transitions. [2018-12-03 16:14:13,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:14:13,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:13,486 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:14:13,487 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:13,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:13,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1199474987, now seen corresponding path program 2 times [2018-12-03 16:14:13,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:13,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:13,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:13,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:13,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:13,584 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:13,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:13,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:14:13,585 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:14:13,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:14:13,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:13,585 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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:14:13,594 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:14:13,595 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:14:13,601 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:14:13,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:14:13,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:14:13,696 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:14:13,696 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:14:13,769 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:14:13,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:14:13,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2018-12-03 16:14:13,787 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:14:13,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:14:13,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:14:13,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:14:13,788 INFO L87 Difference]: Start difference. First operand 3569 states and 5750 transitions. Second operand 15 states. [2018-12-03 16:14:18,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:18,309 INFO L93 Difference]: Finished difference Result 4931 states and 7956 transitions. [2018-12-03 16:14:18,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 16:14:18,309 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 16:14:18,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:18,313 INFO L225 Difference]: With dead ends: 4931 [2018-12-03 16:14:18,313 INFO L226 Difference]: Without dead ends: 4929 [2018-12-03 16:14:18,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1551 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=887, Invalid=4083, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 16:14:18,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4929 states. [2018-12-03 16:14:19,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4929 to 3555. [2018-12-03 16:14:19,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3555 states. [2018-12-03 16:14:19,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3555 states to 3555 states and 5693 transitions. [2018-12-03 16:14:19,848 INFO L78 Accepts]: Start accepts. Automaton has 3555 states and 5693 transitions. Word has length 18 [2018-12-03 16:14:19,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:19,848 INFO L480 AbstractCegarLoop]: Abstraction has 3555 states and 5693 transitions. [2018-12-03 16:14:19,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:14:19,848 INFO L276 IsEmpty]: Start isEmpty. Operand 3555 states and 5693 transitions. [2018-12-03 16:14:19,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:14:19,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:19,849 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:14:19,849 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:19,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:19,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1150743797, now seen corresponding path program 2 times [2018-12-03 16:14:19,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:19,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:19,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:14:19,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:19,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:19,938 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:19,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:19,938 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:14:19,938 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:14:19,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:14:19,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:19,939 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:14:19,948 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:14:19,948 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:14:19,954 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 16:14:19,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:14:19,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:14:20,039 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:14:20,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:14:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:14:20,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:14:20,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2018-12-03 16:14:20,127 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:14:20,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:14:20,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:14:20,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:14:20,128 INFO L87 Difference]: Start difference. First operand 3555 states and 5693 transitions. Second operand 17 states. [2018-12-03 16:14:25,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:25,158 INFO L93 Difference]: Finished difference Result 4742 states and 7601 transitions. [2018-12-03 16:14:25,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 16:14:25,159 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-12-03 16:14:25,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:25,163 INFO L225 Difference]: With dead ends: 4742 [2018-12-03 16:14:25,163 INFO L226 Difference]: Without dead ends: 4708 [2018-12-03 16:14:25,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2280 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=991, Invalid=6149, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 16:14:25,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4708 states. [2018-12-03 16:14:26,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4708 to 3514. [2018-12-03 16:14:26,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2018-12-03 16:14:26,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 5590 transitions. [2018-12-03 16:14:26,716 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 5590 transitions. Word has length 18 [2018-12-03 16:14:26,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:26,716 INFO L480 AbstractCegarLoop]: Abstraction has 3514 states and 5590 transitions. [2018-12-03 16:14:26,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:14:26,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 5590 transitions. [2018-12-03 16:14:26,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 16:14:26,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:26,717 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:14:26,717 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:26,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:26,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1665373557, now seen corresponding path program 1 times [2018-12-03 16:14:26,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:26,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:26,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:14:26,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:26,718 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:26,876 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:26,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:26,876 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:14:26,876 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-03 16:14:26,877 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [23], [36], [38], [41], [43], [45], [46], [47], [50], [52] [2018-12-03 16:14:26,877 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:14:26,877 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:14:26,888 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:14:26,888 INFO L272 AbstractInterpreter]: Visited 13 different actions 29 times. Merged at 9 different actions 11 times. Never widened. Found 9 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 16:14:26,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:26,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:14:26,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:26,916 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:14:26,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:26,925 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:14:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:26,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:14:27,091 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:14:27,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:14:27,227 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:14:27,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:14:27,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2018-12-03 16:14:27,245 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:14:27,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:14:27,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:14:27,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2018-12-03 16:14:27,246 INFO L87 Difference]: Start difference. First operand 3514 states and 5590 transitions. Second operand 21 states. [2018-12-03 16:14:31,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:31,734 INFO L93 Difference]: Finished difference Result 3893 states and 6210 transitions. [2018-12-03 16:14:31,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 16:14:31,735 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 19 [2018-12-03 16:14:31,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:31,738 INFO L225 Difference]: With dead ends: 3893 [2018-12-03 16:14:31,738 INFO L226 Difference]: Without dead ends: 3891 [2018-12-03 16:14:31,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1134 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=967, Invalid=4003, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 16:14:31,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3891 states. [2018-12-03 16:14:33,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3891 to 3702. [2018-12-03 16:14:33,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3702 states. [2018-12-03 16:14:33,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3702 states to 3702 states and 5899 transitions. [2018-12-03 16:14:33,401 INFO L78 Accepts]: Start accepts. Automaton has 3702 states and 5899 transitions. Word has length 19 [2018-12-03 16:14:33,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:33,402 INFO L480 AbstractCegarLoop]: Abstraction has 3702 states and 5899 transitions. [2018-12-03 16:14:33,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:14:33,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3702 states and 5899 transitions. [2018-12-03 16:14:33,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 16:14:33,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:33,403 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 16:14:33,403 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:33,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:33,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1271169050, now seen corresponding path program 1 times [2018-12-03 16:14:33,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:33,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:33,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:33,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:33,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:33,509 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:33,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:33,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:14:33,510 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-03 16:14:33,510 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [27], [30], [32], [36], [37], [38], [41], [43] [2018-12-03 16:14:33,511 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:14:33,511 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:14:33,520 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:14:33,520 INFO L272 AbstractInterpreter]: Visited 12 different actions 30 times. Merged at 10 different actions 13 times. Never widened. Found 9 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 16:14:33,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:33,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:14:33,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:33,525 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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:14:33,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:33,536 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:14:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:33,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:14:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:33,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:14:34,008 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:34,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:14:34,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 27 [2018-12-03 16:14:34,028 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:14:34,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:14:34,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:14:34,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:14:34,029 INFO L87 Difference]: Start difference. First operand 3702 states and 5899 transitions. Second operand 19 states. [2018-12-03 16:14:34,832 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 16:14:35,616 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-12-03 16:14:42,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:42,066 INFO L93 Difference]: Finished difference Result 6554 states and 10571 transitions. [2018-12-03 16:14:42,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 16:14:42,066 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-12-03 16:14:42,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:42,072 INFO L225 Difference]: With dead ends: 6554 [2018-12-03 16:14:42,072 INFO L226 Difference]: Without dead ends: 6543 [2018-12-03 16:14:42,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1489 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1381, Invalid=4625, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:14:42,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6543 states. [2018-12-03 16:14:44,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6543 to 4454. [2018-12-03 16:14:44,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2018-12-03 16:14:44,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 7183 transitions. [2018-12-03 16:14:44,358 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 7183 transitions. Word has length 19 [2018-12-03 16:14:44,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:44,358 INFO L480 AbstractCegarLoop]: Abstraction has 4454 states and 7183 transitions. [2018-12-03 16:14:44,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:14:44,358 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 7183 transitions. [2018-12-03 16:14:44,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 16:14:44,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:44,360 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:14:44,360 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:44,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:44,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1231183154, now seen corresponding path program 1 times [2018-12-03 16:14:44,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:44,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:44,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:44,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:44,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:44,566 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:44,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:44,567 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:14:44,567 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-03 16:14:44,567 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [27], [32], [36], [37], [38], [41], [43], [45], [47], [50] [2018-12-03 16:14:44,567 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:14:44,568 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:14:44,578 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:14:44,578 INFO L272 AbstractInterpreter]: Visited 14 different actions 36 times. Merged at 12 different actions 15 times. Never widened. Found 11 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 16:14:44,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:44,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:14:44,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:44,616 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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:14:44,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:44,634 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:14:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:44,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:14:46,411 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:14:46,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:14:46,531 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:14:46,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:14:46,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2018-12-03 16:14:46,551 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:14:46,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:14:46,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:14:46,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:14:46,552 INFO L87 Difference]: Start difference. First operand 4454 states and 7183 transitions. Second operand 18 states. [2018-12-03 16:14:56,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:56,588 INFO L93 Difference]: Finished difference Result 8116 states and 13179 transitions. [2018-12-03 16:14:56,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 16:14:56,588 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2018-12-03 16:14:56,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:56,597 INFO L225 Difference]: With dead ends: 8116 [2018-12-03 16:14:56,597 INFO L226 Difference]: Without dead ends: 8099 [2018-12-03 16:14:56,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2106 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1490, Invalid=6342, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 16:14:56,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8099 states. [2018-12-03 16:14:59,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8099 to 4656. [2018-12-03 16:14:59,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4656 states. [2018-12-03 16:14:59,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4656 states to 4656 states and 7487 transitions. [2018-12-03 16:14:59,058 INFO L78 Accepts]: Start accepts. Automaton has 4656 states and 7487 transitions. Word has length 19 [2018-12-03 16:14:59,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:59,058 INFO L480 AbstractCegarLoop]: Abstraction has 4656 states and 7487 transitions. [2018-12-03 16:14:59,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:14:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 4656 states and 7487 transitions. [2018-12-03 16:14:59,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 16:14:59,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:59,060 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 16:14:59,060 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:59,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:59,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1608911408, now seen corresponding path program 3 times [2018-12-03 16:14:59,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:59,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:59,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:59,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:59,061 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:59,316 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:14:59,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:59,317 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:14:59,317 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:14:59,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:14:59,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:59,317 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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:14:59,327 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:14:59,327 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:14:59,342 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:14:59,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:14:59,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:14:59,671 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:14:59,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:14:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:14:59,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:14:59,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 24 [2018-12-03 16:14:59,804 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:14:59,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:14:59,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:14:59,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:14:59,805 INFO L87 Difference]: Start difference. First operand 4656 states and 7487 transitions. Second operand 19 states. [2018-12-03 16:15:05,736 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2018-12-03 16:15:08,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:08,676 INFO L93 Difference]: Finished difference Result 9416 states and 15153 transitions. [2018-12-03 16:15:08,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 16:15:08,677 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2018-12-03 16:15:08,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:08,681 INFO L225 Difference]: With dead ends: 9416 [2018-12-03 16:15:08,682 INFO L226 Difference]: Without dead ends: 5079 [2018-12-03 16:15:08,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 4269 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2456, Invalid=11824, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 16:15:08,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5079 states. [2018-12-03 16:15:11,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5079 to 4622. [2018-12-03 16:15:11,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4622 states. [2018-12-03 16:15:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4622 states to 4622 states and 7414 transitions. [2018-12-03 16:15:11,221 INFO L78 Accepts]: Start accepts. Automaton has 4622 states and 7414 transitions. Word has length 21 [2018-12-03 16:15:11,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:11,221 INFO L480 AbstractCegarLoop]: Abstraction has 4622 states and 7414 transitions. [2018-12-03 16:15:11,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:15:11,221 INFO L276 IsEmpty]: Start isEmpty. Operand 4622 states and 7414 transitions. [2018-12-03 16:15:11,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 16:15:11,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:11,223 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:15:11,223 INFO L423 AbstractCegarLoop]: === Iteration 63 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:11,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:11,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1688920231, now seen corresponding path program 1 times [2018-12-03 16:15:11,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:11,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:11,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:15:11,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:11,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:11,336 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:11,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:11,337 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:15:11,337 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 16:15:11,337 INFO L205 CegarAbsIntRunner]: [0], [6], [10], [11], [12], [15], [23], [36], [38], [41], [43], [45], [47], [50], [52] [2018-12-03 16:15:11,338 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:15:11,338 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:15:11,347 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:15:11,348 INFO L272 AbstractInterpreter]: Visited 15 different actions 30 times. Merged at 8 different actions 10 times. Never widened. Found 9 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 16:15:11,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:11,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:15:11,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:11,384 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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:15:11,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:11,399 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:15:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:11,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:15:11,490 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:11,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:15:11,648 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:11,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:15:11,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 25 [2018-12-03 16:15:11,668 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:15:11,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:15:11,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:15:11,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:15:11,669 INFO L87 Difference]: Start difference. First operand 4622 states and 7414 transitions. Second operand 17 states. [2018-12-03 16:15:19,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:19,576 INFO L93 Difference]: Finished difference Result 6773 states and 10838 transitions. [2018-12-03 16:15:19,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 16:15:19,576 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2018-12-03 16:15:19,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:19,582 INFO L225 Difference]: With dead ends: 6773 [2018-12-03 16:15:19,583 INFO L226 Difference]: Without dead ends: 6771 [2018-12-03 16:15:19,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2358 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1779, Invalid=6411, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 16:15:19,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6771 states. [2018-12-03 16:15:22,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6771 to 4410. [2018-12-03 16:15:22,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4410 states. [2018-12-03 16:15:22,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4410 states to 4410 states and 7017 transitions. [2018-12-03 16:15:22,073 INFO L78 Accepts]: Start accepts. Automaton has 4410 states and 7017 transitions. Word has length 21 [2018-12-03 16:15:22,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:22,074 INFO L480 AbstractCegarLoop]: Abstraction has 4410 states and 7017 transitions. [2018-12-03 16:15:22,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:15:22,074 INFO L276 IsEmpty]: Start isEmpty. Operand 4410 states and 7017 transitions. [2018-12-03 16:15:22,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 16:15:22,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:22,075 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:15:22,076 INFO L423 AbstractCegarLoop]: === Iteration 64 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:22,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:22,076 INFO L82 PathProgramCache]: Analyzing trace with hash 534864297, now seen corresponding path program 1 times [2018-12-03 16:15:22,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:22,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:22,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:22,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:22,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:22,174 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:22,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:22,174 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:15:22,174 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 16:15:22,175 INFO L205 CegarAbsIntRunner]: [0], [6], [10], [11], [12], [15], [23], [25], [27], [30], [36], [38], [41], [43], [45], [47], [52] [2018-12-03 16:15:22,176 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:15:22,176 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:15:22,186 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:15:22,187 INFO L272 AbstractInterpreter]: Visited 17 different actions 37 times. Merged at 11 different actions 13 times. Never widened. Found 11 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 16:15:22,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:22,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:15:22,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:22,225 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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:15:22,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:22,242 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:15:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:22,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:15:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:23,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:15:23,446 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:23,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:15:23,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2018-12-03 16:15:23,467 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:15:23,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:15:23,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:15:23,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:15:23,467 INFO L87 Difference]: Start difference. First operand 4410 states and 7017 transitions. Second operand 16 states. [2018-12-03 16:15:31,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:31,081 INFO L93 Difference]: Finished difference Result 6829 states and 10911 transitions. [2018-12-03 16:15:31,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 16:15:31,081 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-12-03 16:15:31,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:31,088 INFO L225 Difference]: With dead ends: 6829 [2018-12-03 16:15:31,088 INFO L226 Difference]: Without dead ends: 6827 [2018-12-03 16:15:31,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=843, Invalid=3189, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:15:31,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6827 states. [2018-12-03 16:15:33,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6827 to 4132. [2018-12-03 16:15:33,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4132 states. [2018-12-03 16:15:33,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4132 states to 4132 states and 6566 transitions. [2018-12-03 16:15:33,443 INFO L78 Accepts]: Start accepts. Automaton has 4132 states and 6566 transitions. Word has length 21 [2018-12-03 16:15:33,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:33,443 INFO L480 AbstractCegarLoop]: Abstraction has 4132 states and 6566 transitions. [2018-12-03 16:15:33,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:15:33,443 INFO L276 IsEmpty]: Start isEmpty. Operand 4132 states and 6566 transitions. [2018-12-03 16:15:33,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 16:15:33,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:33,445 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 16:15:33,445 INFO L423 AbstractCegarLoop]: === Iteration 65 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:33,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:33,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1298110833, now seen corresponding path program 4 times [2018-12-03 16:15:33,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:33,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:33,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:33,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:33,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:33,607 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:33,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:33,607 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:15:33,607 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:15:33,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:15:33,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:33,607 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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:15:33,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:33,615 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:15:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:33,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:15:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:15:34,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:15:34,238 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:15:34,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:15:34,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2018-12-03 16:15:34,257 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:15:34,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:15:34,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:15:34,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:15:34,258 INFO L87 Difference]: Start difference. First operand 4132 states and 6566 transitions. Second operand 19 states. [2018-12-03 16:15:43,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:43,066 INFO L93 Difference]: Finished difference Result 9377 states and 14799 transitions. [2018-12-03 16:15:43,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 16:15:43,067 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2018-12-03 16:15:43,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:43,071 INFO L225 Difference]: With dead ends: 9377 [2018-12-03 16:15:43,071 INFO L226 Difference]: Without dead ends: 5463 [2018-12-03 16:15:43,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4905 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1834, Invalid=12446, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 16:15:43,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5463 states. [2018-12-03 16:15:45,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5463 to 4506. [2018-12-03 16:15:45,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4506 states. [2018-12-03 16:15:45,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 7148 transitions. [2018-12-03 16:15:45,813 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 7148 transitions. Word has length 21 [2018-12-03 16:15:45,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:45,814 INFO L480 AbstractCegarLoop]: Abstraction has 4506 states and 7148 transitions. [2018-12-03 16:15:45,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:15:45,814 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 7148 transitions. [2018-12-03 16:15:45,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 16:15:45,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:45,816 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 16:15:45,816 INFO L423 AbstractCegarLoop]: === Iteration 66 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:45,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:45,816 INFO L82 PathProgramCache]: Analyzing trace with hash 2122062335, now seen corresponding path program 5 times [2018-12-03 16:15:45,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:45,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:45,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:45,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:45,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:45,920 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:45,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:45,920 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:15:45,920 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:15:45,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:15:45,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:45,921 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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:15:45,933 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:15:45,933 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:15:45,940 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:15:45,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:15:45,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:15:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 16:15:46,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:15:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 16:15:46,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:15:46,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 24 [2018-12-03 16:15:46,148 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:15:46,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:15:46,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:15:46,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:15:46,149 INFO L87 Difference]: Start difference. First operand 4506 states and 7148 transitions. Second operand 18 states. [2018-12-03 16:15:57,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:57,925 INFO L93 Difference]: Finished difference Result 6513 states and 10374 transitions. [2018-12-03 16:15:57,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 16:15:57,926 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-12-03 16:15:57,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:57,931 INFO L225 Difference]: With dead ends: 6513 [2018-12-03 16:15:57,931 INFO L226 Difference]: Without dead ends: 6505 [2018-12-03 16:15:57,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4627 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3445, Invalid=11807, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 16:15:57,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6505 states. [2018-12-03 16:16:00,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6505 to 3159. [2018-12-03 16:16:00,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3159 states. [2018-12-03 16:16:00,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3159 states to 3159 states and 4960 transitions. [2018-12-03 16:16:00,086 INFO L78 Accepts]: Start accepts. Automaton has 3159 states and 4960 transitions. Word has length 21 [2018-12-03 16:16:00,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:16:00,087 INFO L480 AbstractCegarLoop]: Abstraction has 3159 states and 4960 transitions. [2018-12-03 16:16:00,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:16:00,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3159 states and 4960 transitions. [2018-12-03 16:16:00,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 16:16:00,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:16:00,088 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 16:16:00,088 INFO L423 AbstractCegarLoop]: === Iteration 67 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:16:00,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:00,089 INFO L82 PathProgramCache]: Analyzing trace with hash 274158317, now seen corresponding path program 2 times [2018-12-03 16:16:00,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:16:00,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:00,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:16:00,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:00,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:16:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:16:00,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:00,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:16:00,242 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:16:00,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:16:00,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:00,243 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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:16:00,252 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:16:00,252 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:16:00,258 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:16:00,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:16:00,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:16:00,384 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 16:16:00,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:16:00,556 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 16:16:00,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:16:00,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2018-12-03 16:16:00,576 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:16:00,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:16:00,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:16:00,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:16:00,577 INFO L87 Difference]: Start difference. First operand 3159 states and 4960 transitions. Second operand 21 states. [2018-12-03 16:16:20,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:16:20,503 INFO L93 Difference]: Finished difference Result 8041 states and 12780 transitions. [2018-12-03 16:16:20,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-12-03 16:16:20,504 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-03 16:16:20,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:16:20,511 INFO L225 Difference]: With dead ends: 8041 [2018-12-03 16:16:20,511 INFO L226 Difference]: Without dead ends: 8030 [2018-12-03 16:16:20,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17937 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5328, Invalid=41544, Unknown=0, NotChecked=0, Total=46872 [2018-12-03 16:16:20,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8030 states. [2018-12-03 16:16:23,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8030 to 3767. [2018-12-03 16:16:23,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3767 states. [2018-12-03 16:16:23,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3767 states to 3767 states and 5901 transitions. [2018-12-03 16:16:23,215 INFO L78 Accepts]: Start accepts. Automaton has 3767 states and 5901 transitions. Word has length 21 [2018-12-03 16:16:23,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:16:23,215 INFO L480 AbstractCegarLoop]: Abstraction has 3767 states and 5901 transitions. [2018-12-03 16:16:23,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:16:23,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3767 states and 5901 transitions. [2018-12-03 16:16:23,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 16:16:23,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:16:23,217 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:16:23,217 INFO L423 AbstractCegarLoop]: === Iteration 68 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:16:23,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:23,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1246813361, now seen corresponding path program 2 times [2018-12-03 16:16:23,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:16:23,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:23,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:16:23,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:23,218 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:16:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:23,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:16:23,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:23,332 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:16:23,332 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:16:23,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:16:23,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:23,332 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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:16:23,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:16:23,348 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:16:23,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:16:23,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:16:23,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:16:23,837 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 1 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:16:23,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:16:23,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:16:24,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:16:24,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2018-12-03 16:16:24,018 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:16:24,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:16:24,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:16:24,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=554, Unknown=1, NotChecked=0, Total=650 [2018-12-03 16:16:24,018 INFO L87 Difference]: Start difference. First operand 3767 states and 5901 transitions. Second operand 18 states. [2018-12-03 16:16:29,688 WARN L180 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-03 16:16:31,588 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-12-03 16:16:33,078 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-12-03 16:16:35,523 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-12-03 16:16:37,967 WARN L180 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-03 16:16:41,274 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-12-03 16:16:43,227 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-12-03 16:16:44,309 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-12-03 16:16:44,738 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-12-03 16:16:48,816 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2018-12-03 16:16:49,117 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-12-03 16:16:49,427 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-12-03 16:16:49,900 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-12-03 16:16:51,112 WARN L180 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-12-03 16:16:54,053 WARN L180 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-03 16:16:55,117 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-03 16:16:56,228 WARN L180 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-03 16:16:57,006 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-12-03 16:16:58,543 WARN L180 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-12-03 16:16:58,796 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 16:16:59,068 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-12-03 16:17:01,630 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-12-03 16:17:02,267 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-12-03 16:17:03,586 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-12-03 16:17:04,113 WARN L180 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-12-03 16:17:05,486 WARN L180 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-03 16:17:10,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:17:10,877 INFO L93 Difference]: Finished difference Result 8236 states and 13011 transitions. [2018-12-03 16:17:10,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-12-03 16:17:10,877 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-12-03 16:17:10,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:17:10,884 INFO L225 Difference]: With dead ends: 8236 [2018-12-03 16:17:10,884 INFO L226 Difference]: Without dead ends: 8225 [2018-12-03 16:17:10,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11730 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=5455, Invalid=26037, Unknown=14, NotChecked=0, Total=31506 [2018-12-03 16:17:10,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8225 states. [2018-12-03 16:17:13,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8225 to 3526. [2018-12-03 16:17:13,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3526 states. [2018-12-03 16:17:13,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 5543 transitions. [2018-12-03 16:17:13,598 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 5543 transitions. Word has length 21 [2018-12-03 16:17:13,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:17:13,598 INFO L480 AbstractCegarLoop]: Abstraction has 3526 states and 5543 transitions. [2018-12-03 16:17:13,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:17:13,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 5543 transitions. [2018-12-03 16:17:13,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:17:13,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:17:13,600 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:17:13,600 INFO L423 AbstractCegarLoop]: === Iteration 69 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:17:13,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:17:13,601 INFO L82 PathProgramCache]: Analyzing trace with hash -471522047, now seen corresponding path program 2 times [2018-12-03 16:17:13,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:17:13,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:13,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:17:13,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:13,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:17:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:17:13,727 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:17:13,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:13,728 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:17:13,728 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:17:13,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:17:13,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:13,728 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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:17:13,737 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:17:13,737 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:17:13,746 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 16:17:13,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:17:13,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:17:13,859 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 16:17:13,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:17:14,003 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 16:17:14,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:17:14,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2018-12-03 16:17:14,021 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:17:14,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 16:17:14,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 16:17:14,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:17:14,022 INFO L87 Difference]: Start difference. First operand 3526 states and 5543 transitions. Second operand 20 states. [2018-12-03 16:17:30,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:17:30,512 INFO L93 Difference]: Finished difference Result 7411 states and 11736 transitions. [2018-12-03 16:17:30,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-12-03 16:17:30,512 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2018-12-03 16:17:30,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:17:30,519 INFO L225 Difference]: With dead ends: 7411 [2018-12-03 16:17:30,519 INFO L226 Difference]: Without dead ends: 7409 [2018-12-03 16:17:30,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7198 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3224, Invalid=18238, Unknown=0, NotChecked=0, Total=21462 [2018-12-03 16:17:30,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7409 states. [2018-12-03 16:17:33,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7409 to 3433. [2018-12-03 16:17:33,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3433 states. [2018-12-03 16:17:33,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 3433 states and 5394 transitions. [2018-12-03 16:17:33,164 INFO L78 Accepts]: Start accepts. Automaton has 3433 states and 5394 transitions. Word has length 24 [2018-12-03 16:17:33,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:17:33,164 INFO L480 AbstractCegarLoop]: Abstraction has 3433 states and 5394 transitions. [2018-12-03 16:17:33,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 16:17:33,164 INFO L276 IsEmpty]: Start isEmpty. Operand 3433 states and 5394 transitions. [2018-12-03 16:17:33,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 16:17:33,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:17:33,166 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2018-12-03 16:17:33,167 INFO L423 AbstractCegarLoop]: === Iteration 70 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:17:33,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:17:33,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1997760783, now seen corresponding path program 3 times [2018-12-03 16:17:33,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:17:33,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:33,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:17:33,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:33,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:17:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:17:33,506 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:17:33,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:33,507 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:17:33,507 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:17:33,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:17:33,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:33,507 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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:17:33,516 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:17:33,516 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:17:33,525 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:17:33,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:17:33,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:17:33,677 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 16:17:33,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:17:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 16:17:33,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:17:33,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 28 [2018-12-03 16:17:33,800 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:17:33,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:17:33,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:17:33,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:17:33,801 INFO L87 Difference]: Start difference. First operand 3433 states and 5394 transitions. Second operand 24 states. [2018-12-03 16:17:41,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:17:41,957 INFO L93 Difference]: Finished difference Result 7328 states and 11502 transitions. [2018-12-03 16:17:41,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 16:17:41,958 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 25 [2018-12-03 16:17:41,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:17:41,962 INFO L225 Difference]: With dead ends: 7328 [2018-12-03 16:17:41,962 INFO L226 Difference]: Without dead ends: 4152 [2018-12-03 16:17:41,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 4696 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2065, Invalid=11507, Unknown=0, NotChecked=0, Total=13572 [2018-12-03 16:17:41,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4152 states. [2018-12-03 16:17:44,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4152 to 3677. [2018-12-03 16:17:44,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3677 states. [2018-12-03 16:17:44,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3677 states to 3677 states and 5781 transitions. [2018-12-03 16:17:44,870 INFO L78 Accepts]: Start accepts. Automaton has 3677 states and 5781 transitions. Word has length 25 [2018-12-03 16:17:44,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:17:44,871 INFO L480 AbstractCegarLoop]: Abstraction has 3677 states and 5781 transitions. [2018-12-03 16:17:44,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:17:44,871 INFO L276 IsEmpty]: Start isEmpty. Operand 3677 states and 5781 transitions. [2018-12-03 16:17:44,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 16:17:44,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:17:44,873 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:17:44,873 INFO L423 AbstractCegarLoop]: === Iteration 71 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:17:44,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:17:44,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1735749504, now seen corresponding path program 1 times [2018-12-03 16:17:44,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:17:44,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:44,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:17:44,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:44,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:17:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:17:45,169 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:17:45,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:45,169 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:17:45,169 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-12-03 16:17:45,169 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [19], [25], [26], [27], [30], [32], [36], [38], [41], [43], [45], [47], [50], [52] [2018-12-03 16:17:45,170 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:17:45,170 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:17:45,181 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:17:45,181 INFO L272 AbstractInterpreter]: Visited 17 different actions 42 times. Merged at 13 different actions 17 times. Never widened. Found 14 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 16:17:45,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:17:45,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:17:45,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:45,182 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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:17:45,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:17:45,192 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:17:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:17:45,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:17:45,366 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:17:45,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:17:45,529 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:17:45,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:17:45,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 32 [2018-12-03 16:17:45,550 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:17:45,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:17:45,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:17:45,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 16:17:45,550 INFO L87 Difference]: Start difference. First operand 3677 states and 5781 transitions. Second operand 24 states. [2018-12-03 16:18:00,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:18:00,046 INFO L93 Difference]: Finished difference Result 5347 states and 8486 transitions. [2018-12-03 16:18:00,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-12-03 16:18:00,047 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 25 [2018-12-03 16:18:00,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:18:00,051 INFO L225 Difference]: With dead ends: 5347 [2018-12-03 16:18:00,052 INFO L226 Difference]: Without dead ends: 5345 [2018-12-03 16:18:00,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9545 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=4946, Invalid=23110, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 16:18:00,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5345 states. [2018-12-03 16:18:03,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5345 to 4112. [2018-12-03 16:18:03,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4112 states. [2018-12-03 16:18:03,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4112 states to 4112 states and 6480 transitions. [2018-12-03 16:18:03,249 INFO L78 Accepts]: Start accepts. Automaton has 4112 states and 6480 transitions. Word has length 25 [2018-12-03 16:18:03,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:18:03,249 INFO L480 AbstractCegarLoop]: Abstraction has 4112 states and 6480 transitions. [2018-12-03 16:18:03,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:18:03,249 INFO L276 IsEmpty]: Start isEmpty. Operand 4112 states and 6480 transitions. [2018-12-03 16:18:03,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 16:18:03,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:18:03,251 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 16:18:03,251 INFO L423 AbstractCegarLoop]: === Iteration 72 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:18:03,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:18:03,252 INFO L82 PathProgramCache]: Analyzing trace with hash -868093692, now seen corresponding path program 4 times [2018-12-03 16:18:03,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:18:03,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:03,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:18:03,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:03,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:18:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:18:03,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:03,479 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:18:03,480 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:18:03,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:18:03,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:03,480 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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:18:03,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:18:03,488 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:18:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:03,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:18:03,737 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 41 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:18:03,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:18:03,980 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:18:04,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:18:04,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 29 [2018-12-03 16:18:04,000 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:18:04,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:18:04,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:18:04,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:18:04,001 INFO L87 Difference]: Start difference. First operand 4112 states and 6480 transitions. Second operand 21 states. [2018-12-03 16:18:17,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:18:17,006 INFO L93 Difference]: Finished difference Result 6190 states and 9786 transitions. [2018-12-03 16:18:17,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-12-03 16:18:17,006 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 25 [2018-12-03 16:18:17,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:18:17,011 INFO L225 Difference]: With dead ends: 6190 [2018-12-03 16:18:17,011 INFO L226 Difference]: Without dead ends: 6188 [2018-12-03 16:18:17,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7876 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=4385, Invalid=18265, Unknown=0, NotChecked=0, Total=22650 [2018-12-03 16:18:17,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6188 states. [2018-12-03 16:18:20,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6188 to 4324. [2018-12-03 16:18:20,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4324 states. [2018-12-03 16:18:20,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4324 states to 4324 states and 6824 transitions. [2018-12-03 16:18:20,543 INFO L78 Accepts]: Start accepts. Automaton has 4324 states and 6824 transitions. Word has length 25 [2018-12-03 16:18:20,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:18:20,543 INFO L480 AbstractCegarLoop]: Abstraction has 4324 states and 6824 transitions. [2018-12-03 16:18:20,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:18:20,543 INFO L276 IsEmpty]: Start isEmpty. Operand 4324 states and 6824 transitions. [2018-12-03 16:18:20,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 16:18:20,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:18:20,546 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:18:20,546 INFO L423 AbstractCegarLoop]: === Iteration 73 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:18:20,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:18:20,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1568806716, now seen corresponding path program 1 times [2018-12-03 16:18:20,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:18:20,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:20,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:18:20,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:20,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:18:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:21,948 WARN L180 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-12-03 16:18:22,185 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:18:22,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:22,185 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:18:22,185 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-12-03 16:18:22,185 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [11], [12], [15], [17], [23], [36], [38], [41], [43], [45], [47], [50], [52] [2018-12-03 16:18:22,186 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:18:22,186 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:18:22,198 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:18:22,198 INFO L272 AbstractInterpreter]: Visited 17 different actions 42 times. Merged at 14 different actions 17 times. Never widened. Found 14 fixpoints after 9 different actions. Largest state had 0 variables. [2018-12-03 16:18:22,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:18:22,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:18:22,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:22,247 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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:18:22,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:18:22,262 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:18:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:22,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:18:22,553 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:18:22,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:18:22,719 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:18:22,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:18:22,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 32 [2018-12-03 16:18:22,740 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:18:22,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:18:22,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:18:22,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 16:18:22,741 INFO L87 Difference]: Start difference. First operand 4324 states and 6824 transitions. Second operand 24 states. [2018-12-03 16:18:41,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:18:41,840 INFO L93 Difference]: Finished difference Result 7157 states and 11372 transitions. [2018-12-03 16:18:41,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-12-03 16:18:41,841 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 25 [2018-12-03 16:18:41,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:18:41,847 INFO L225 Difference]: With dead ends: 7157 [2018-12-03 16:18:41,847 INFO L226 Difference]: Without dead ends: 7155 [2018-12-03 16:18:41,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7965 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=4587, Invalid=19593, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 16:18:41,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7155 states. [2018-12-03 16:18:45,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7155 to 4870. [2018-12-03 16:18:45,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4870 states. [2018-12-03 16:18:46,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4870 states to 4870 states and 7673 transitions. [2018-12-03 16:18:46,004 INFO L78 Accepts]: Start accepts. Automaton has 4870 states and 7673 transitions. Word has length 25 [2018-12-03 16:18:46,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:18:46,005 INFO L480 AbstractCegarLoop]: Abstraction has 4870 states and 7673 transitions. [2018-12-03 16:18:46,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:18:46,005 INFO L276 IsEmpty]: Start isEmpty. Operand 4870 states and 7673 transitions. [2018-12-03 16:18:46,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 16:18:46,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:18:46,007 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:18:46,007 INFO L423 AbstractCegarLoop]: === Iteration 74 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:18:46,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:18:46,008 INFO L82 PathProgramCache]: Analyzing trace with hash 2018393209, now seen corresponding path program 1 times [2018-12-03 16:18:46,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:18:46,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:46,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:18:46,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:46,008 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:18:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:46,313 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:18:46,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:46,314 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:18:46,314 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-12-03 16:18:46,314 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [27], [30], [36], [37], [38], [41], [43], [45], [47], [50] [2018-12-03 16:18:46,315 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:18:46,315 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:18:46,325 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:18:46,325 INFO L272 AbstractInterpreter]: Visited 14 different actions 34 times. Merged at 11 different actions 13 times. Never widened. Found 11 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 16:18:46,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:18:46,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:18:46,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:46,361 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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:18:46,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:18:46,371 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:18:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:46,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:18:46,560 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 16:18:46,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:18:46,682 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 16:18:46,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:18:46,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 28 [2018-12-03 16:18:46,702 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:18:46,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 16:18:46,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 16:18:46,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:18:46,703 INFO L87 Difference]: Start difference. First operand 4870 states and 7673 transitions. Second operand 23 states. [2018-12-03 16:19:07,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:19:07,430 INFO L93 Difference]: Finished difference Result 13968 states and 21837 transitions. [2018-12-03 16:19:07,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-12-03 16:19:07,430 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2018-12-03 16:19:07,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:19:07,437 INFO L225 Difference]: With dead ends: 13968 [2018-12-03 16:19:07,437 INFO L226 Difference]: Without dead ends: 9235 [2018-12-03 16:19:07,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 16942 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=3908, Invalid=39148, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 16:19:07,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9235 states. [2018-12-03 16:19:13,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9235 to 6547. [2018-12-03 16:19:13,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6547 states. [2018-12-03 16:19:13,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6547 states to 6547 states and 10378 transitions. [2018-12-03 16:19:13,385 INFO L78 Accepts]: Start accepts. Automaton has 6547 states and 10378 transitions. Word has length 25 [2018-12-03 16:19:13,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:19:13,385 INFO L480 AbstractCegarLoop]: Abstraction has 6547 states and 10378 transitions. [2018-12-03 16:19:13,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 16:19:13,385 INFO L276 IsEmpty]: Start isEmpty. Operand 6547 states and 10378 transitions. [2018-12-03 16:19:13,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:19:13,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:19:13,388 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 16:19:13,388 INFO L423 AbstractCegarLoop]: === Iteration 75 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:19:13,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:19:13,388 INFO L82 PathProgramCache]: Analyzing trace with hash 998547776, now seen corresponding path program 2 times [2018-12-03 16:19:13,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:19:13,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:13,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:19:13,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:13,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:19:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:19:13,560 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:19:13,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:19:13,560 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:19:13,560 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:19:13,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:19:13,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:19:13,561 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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:19:13,570 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:19:13,570 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:19:13,582 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:19:13,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:19:13,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:19:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 16:19:13,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:19:13,968 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 16:19:13,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:19:13,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 32 [2018-12-03 16:19:13,988 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:19:13,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 16:19:13,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 16:19:13,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=939, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 16:19:13,989 INFO L87 Difference]: Start difference. First operand 6547 states and 10378 transitions. Second operand 25 states. [2018-12-03 16:19:36,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:19:36,168 INFO L93 Difference]: Finished difference Result 10436 states and 16883 transitions. [2018-12-03 16:19:36,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-12-03 16:19:36,168 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2018-12-03 16:19:36,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:19:36,176 INFO L225 Difference]: With dead ends: 10436 [2018-12-03 16:19:36,176 INFO L226 Difference]: Without dead ends: 10434 [2018-12-03 16:19:36,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11212 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=6462, Invalid=27210, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 16:19:36,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10434 states. [2018-12-03 16:19:42,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10434 to 7390. [2018-12-03 16:19:42,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7390 states. [2018-12-03 16:19:43,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7390 states to 7390 states and 11793 transitions. [2018-12-03 16:19:43,070 INFO L78 Accepts]: Start accepts. Automaton has 7390 states and 11793 transitions. Word has length 26 [2018-12-03 16:19:43,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:19:43,070 INFO L480 AbstractCegarLoop]: Abstraction has 7390 states and 11793 transitions. [2018-12-03 16:19:43,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 16:19:43,070 INFO L276 IsEmpty]: Start isEmpty. Operand 7390 states and 11793 transitions. [2018-12-03 16:19:43,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:19:43,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:19:43,073 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 16:19:43,073 INFO L423 AbstractCegarLoop]: === Iteration 76 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:19:43,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:19:43,074 INFO L82 PathProgramCache]: Analyzing trace with hash 604672123, now seen corresponding path program 2 times [2018-12-03 16:19:43,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:19:43,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:43,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:19:43,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:43,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:19:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:19:43,281 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:19:43,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:19:43,281 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:19:43,282 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:19:43,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:19:43,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:19:43,282 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:19:43,290 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:19:43,290 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:19:43,300 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:19:43,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:19:43,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:19:43,415 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 16:19:43,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:19:43,575 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 16:19:43,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:19:43,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10] total 31 [2018-12-03 16:19:43,595 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:19:43,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 16:19:43,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 16:19:43,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:19:43,595 INFO L87 Difference]: Start difference. First operand 7390 states and 11793 transitions. Second operand 23 states. [2018-12-03 16:20:08,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:20:08,894 INFO L93 Difference]: Finished difference Result 15564 states and 24982 transitions. [2018-12-03 16:20:08,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 16:20:08,895 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2018-12-03 16:20:08,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:20:08,907 INFO L225 Difference]: With dead ends: 15564 [2018-12-03 16:20:08,907 INFO L226 Difference]: Without dead ends: 15552 [2018-12-03 16:20:08,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2832 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1989, Invalid=7713, Unknown=0, NotChecked=0, Total=9702 [2018-12-03 16:20:08,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15552 states. [2018-12-03 16:20:17,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15552 to 9180. [2018-12-03 16:20:17,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9180 states. [2018-12-03 16:20:17,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9180 states to 9180 states and 14704 transitions. [2018-12-03 16:20:17,668 INFO L78 Accepts]: Start accepts. Automaton has 9180 states and 14704 transitions. Word has length 26 [2018-12-03 16:20:17,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:20:17,669 INFO L480 AbstractCegarLoop]: Abstraction has 9180 states and 14704 transitions. [2018-12-03 16:20:17,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 16:20:17,669 INFO L276 IsEmpty]: Start isEmpty. Operand 9180 states and 14704 transitions. [2018-12-03 16:20:17,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:20:17,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:20:17,672 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:20:17,672 INFO L423 AbstractCegarLoop]: === Iteration 77 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:20:17,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:20:17,672 INFO L82 PathProgramCache]: Analyzing trace with hash -951541235, now seen corresponding path program 1 times [2018-12-03 16:20:17,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:20:17,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:17,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:20:17,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:17,673 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:20:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:20:17,923 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:20:17,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:20:17,923 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:20:17,923 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-03 16:20:17,923 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [19], [23], [25], [27], [30], [32], [36], [37], [38], [41], [43] [2018-12-03 16:20:17,924 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:20:17,924 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:20:17,935 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:20:17,935 INFO L272 AbstractInterpreter]: Visited 14 different actions 36 times. Merged at 11 different actions 15 times. Never widened. Found 12 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 16:20:17,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:20:17,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:20:17,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:20:17,974 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:20:17,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:20:17,991 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:20:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:20:18,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:20:18,317 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 16:20:18,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:20:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 16:20:18,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:20:18,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 33 [2018-12-03 16:20:18,490 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:20:18,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 16:20:18,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 16:20:18,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1002, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:20:18,490 INFO L87 Difference]: Start difference. First operand 9180 states and 14704 transitions. Second operand 25 states. [2018-12-03 16:20:43,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:20:43,311 INFO L93 Difference]: Finished difference Result 15778 states and 25294 transitions. [2018-12-03 16:20:43,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 16:20:43,311 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2018-12-03 16:20:43,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:20:43,327 INFO L225 Difference]: With dead ends: 15778 [2018-12-03 16:20:43,327 INFO L226 Difference]: Without dead ends: 15767 [2018-12-03 16:20:43,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5324 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2454, Invalid=13046, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 16:20:43,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15767 states. [2018-12-03 16:20:54,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15767 to 11633. [2018-12-03 16:20:54,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11633 states. [2018-12-03 16:20:54,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11633 states to 11633 states and 18699 transitions. [2018-12-03 16:20:54,432 INFO L78 Accepts]: Start accepts. Automaton has 11633 states and 18699 transitions. Word has length 26 [2018-12-03 16:20:54,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:20:54,432 INFO L480 AbstractCegarLoop]: Abstraction has 11633 states and 18699 transitions. [2018-12-03 16:20:54,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 16:20:54,432 INFO L276 IsEmpty]: Start isEmpty. Operand 11633 states and 18699 transitions. [2018-12-03 16:20:54,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 16:20:54,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:20:54,436 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:20:54,436 INFO L423 AbstractCegarLoop]: === Iteration 78 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:20:54,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:20:54,436 INFO L82 PathProgramCache]: Analyzing trace with hash 179058058, now seen corresponding path program 2 times [2018-12-03 16:20:54,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:20:54,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:54,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:20:54,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:54,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:20:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:20:54,600 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:20:54,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:20:54,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:20:54,601 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:20:54,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:20:54,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:20:54,601 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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:20:54,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:20:54,611 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:20:54,623 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:20:54,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:20:54,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:20:54,857 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 16:20:54,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:20:55,061 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 16:20:55,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:20:55,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 31 [2018-12-03 16:20:55,080 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:20:55,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 16:20:55,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 16:20:55,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:20:55,081 INFO L87 Difference]: Start difference. First operand 11633 states and 18699 transitions. Second operand 23 states. [2018-12-03 16:21:00,130 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-03 16:21:03,952 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2018-12-03 16:21:05,295 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 16:21:06,326 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-12-03 16:21:08,804 WARN L180 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2018-12-03 16:21:09,586 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2018-12-03 16:21:10,416 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2018-12-03 16:21:13,371 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2018-12-03 16:21:14,566 WARN L180 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2018-12-03 16:21:14,913 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-12-03 16:21:17,599 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-12-03 16:21:19,346 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2018-12-03 16:21:20,142 WARN L180 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2018-12-03 16:21:21,200 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2018-12-03 16:21:23,072 WARN L180 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2018-12-03 16:21:24,933 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-12-03 16:21:25,467 WARN L180 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2018-12-03 16:21:25,921 WARN L180 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2018-12-03 16:21:29,025 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2018-12-03 16:21:34,987 WARN L180 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2018-12-03 16:21:39,494 WARN L180 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2018-12-03 16:21:41,347 WARN L180 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2018-12-03 16:21:48,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:21:48,691 INFO L93 Difference]: Finished difference Result 14844 states and 23990 transitions. [2018-12-03 16:21:48,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-12-03 16:21:48,691 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 28 [2018-12-03 16:21:48,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:21:48,705 INFO L225 Difference]: With dead ends: 14844 [2018-12-03 16:21:48,705 INFO L226 Difference]: Without dead ends: 14842 [2018-12-03 16:21:48,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10006 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=4976, Invalid=25118, Unknown=8, NotChecked=0, Total=30102 [2018-12-03 16:21:48,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14842 states. [2018-12-03 16:22:00,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14842 to 12837. [2018-12-03 16:22:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12837 states. [2018-12-03 16:22:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12837 states to 12837 states and 20694 transitions. [2018-12-03 16:22:00,976 INFO L78 Accepts]: Start accepts. Automaton has 12837 states and 20694 transitions. Word has length 28 [2018-12-03 16:22:00,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:22:00,976 INFO L480 AbstractCegarLoop]: Abstraction has 12837 states and 20694 transitions. [2018-12-03 16:22:00,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 16:22:00,976 INFO L276 IsEmpty]: Start isEmpty. Operand 12837 states and 20694 transitions. [2018-12-03 16:22:00,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 16:22:00,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:22:00,980 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1] [2018-12-03 16:22:00,980 INFO L423 AbstractCegarLoop]: === Iteration 79 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:22:00,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:22:00,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1671739405, now seen corresponding path program 5 times [2018-12-03 16:22:00,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:22:00,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:22:00,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:22:00,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:22:00,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:22:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:22:01,153 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 8 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:22:01,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:22:01,153 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:22:01,153 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:22:01,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:22:01,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:22:01,153 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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:22:01,164 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:22:01,164 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:22:01,173 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:22:01,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:22:01,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:22:01,617 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 16:22:01,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:22:01,808 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 37 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 16:22:01,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:22:01,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 30 [2018-12-03 16:22:01,826 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:22:01,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 16:22:01,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 16:22:01,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2018-12-03 16:22:01,827 INFO L87 Difference]: Start difference. First operand 12837 states and 20694 transitions. Second operand 22 states. [2018-12-03 16:22:05,628 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-12-03 16:22:06,302 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-03 16:22:07,709 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-12-03 16:22:10,813 WARN L180 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-03 16:22:11,820 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-03 16:22:14,283 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-03 16:22:26,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:22:26,153 INFO L93 Difference]: Finished difference Result 15839 states and 25502 transitions. [2018-12-03 16:22:26,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 16:22:26,154 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-12-03 16:22:26,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:22:26,168 INFO L225 Difference]: With dead ends: 15839 [2018-12-03 16:22:26,168 INFO L226 Difference]: Without dead ends: 15837 [2018-12-03 16:22:26,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2707 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=2653, Invalid=8689, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 16:22:26,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15837 states. [2018-12-03 16:22:37,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15837 to 11007. [2018-12-03 16:22:37,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11007 states. [2018-12-03 16:22:37,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11007 states to 11007 states and 17619 transitions. [2018-12-03 16:22:37,333 INFO L78 Accepts]: Start accepts. Automaton has 11007 states and 17619 transitions. Word has length 28 [2018-12-03 16:22:37,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:22:37,334 INFO L480 AbstractCegarLoop]: Abstraction has 11007 states and 17619 transitions. [2018-12-03 16:22:37,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 16:22:37,334 INFO L276 IsEmpty]: Start isEmpty. Operand 11007 states and 17619 transitions. [2018-12-03 16:22:37,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 16:22:37,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:22:37,337 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:22:37,337 INFO L423 AbstractCegarLoop]: === Iteration 80 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:22:37,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:22:37,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1100753059, now seen corresponding path program 1 times [2018-12-03 16:22:37,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:22:37,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:22:37,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:22:37,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:22:37,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:22:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:22:37,571 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:22:37,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:22:37,571 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:22:37,571 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-03 16:22:37,572 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [12], [15], [19], [25], [26], [27], [32], [36], [38], [41], [43], [45], [47], [50], [52] [2018-12-03 16:22:37,572 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:22:37,573 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:22:37,586 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:22:37,587 INFO L272 AbstractInterpreter]: Visited 19 different actions 49 times. Merged at 16 different actions 20 times. Never widened. Found 16 fixpoints after 9 different actions. Largest state had 0 variables. [2018-12-03 16:22:37,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:22:37,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:22:37,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:22:37,603 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:22:37,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:22:37,611 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:22:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:22:37,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:22:37,799 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:22:37,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:22:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:22:37,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:22:37,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 28 [2018-12-03 16:22:37,952 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:22:37,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 16:22:37,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 16:22:37,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:22:37,952 INFO L87 Difference]: Start difference. First operand 11007 states and 17619 transitions. Second operand 23 states. [2018-12-03 16:22:56,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:22:56,981 INFO L93 Difference]: Finished difference Result 23665 states and 37956 transitions. [2018-12-03 16:22:56,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 16:22:56,982 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 28 [2018-12-03 16:22:56,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:22:56,995 INFO L225 Difference]: With dead ends: 23665 [2018-12-03 16:22:56,995 INFO L226 Difference]: Without dead ends: 12929 [2018-12-03 16:22:57,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 4526 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1926, Invalid=12836, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 16:22:57,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12929 states. [2018-12-03 16:23:07,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12929 to 10996. [2018-12-03 16:23:07,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10996 states. [2018-12-03 16:23:07,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10996 states to 10996 states and 17614 transitions. [2018-12-03 16:23:07,890 INFO L78 Accepts]: Start accepts. Automaton has 10996 states and 17614 transitions. Word has length 28 [2018-12-03 16:23:07,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:23:07,890 INFO L480 AbstractCegarLoop]: Abstraction has 10996 states and 17614 transitions. [2018-12-03 16:23:07,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 16:23:07,891 INFO L276 IsEmpty]: Start isEmpty. Operand 10996 states and 17614 transitions. [2018-12-03 16:23:07,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 16:23:07,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:23:07,894 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:23:07,894 INFO L423 AbstractCegarLoop]: === Iteration 81 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:23:07,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:23:07,894 INFO L82 PathProgramCache]: Analyzing trace with hash 564227467, now seen corresponding path program 1 times [2018-12-03 16:23:07,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:23:07,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:23:07,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:23:07,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:23:07,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:23:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:23:08,087 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:23:08,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:23:08,087 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:23:08,087 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-03 16:23:08,087 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [11], [12], [15], [17], [23], [25], [27], [30], [36], [38], [41], [43], [45], [47], [52] [2018-12-03 16:23:08,088 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:23:08,089 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:23:08,100 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:23:08,101 INFO L272 AbstractInterpreter]: Visited 19 different actions 49 times. Merged at 16 different actions 20 times. Never widened. Found 16 fixpoints after 9 different actions. Largest state had 0 variables. [2018-12-03 16:23:08,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:23:08,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:23:08,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:23:08,115 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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:23:08,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:23:08,125 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:23:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:23:08,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:23:08,256 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 16:23:08,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:23:08,419 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 16:23:08,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:23:08,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 29 [2018-12-03 16:23:08,437 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:23:08,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:23:08,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:23:08,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:23:08,438 INFO L87 Difference]: Start difference. First operand 10996 states and 17614 transitions. Second operand 21 states. [2018-12-03 16:23:33,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:23:33,055 INFO L93 Difference]: Finished difference Result 16545 states and 27011 transitions. [2018-12-03 16:23:33,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 16:23:33,055 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-12-03 16:23:33,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:23:33,071 INFO L225 Difference]: With dead ends: 16545 [2018-12-03 16:23:33,071 INFO L226 Difference]: Without dead ends: 16543 [2018-12-03 16:23:33,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1058, Invalid=4642, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:23:33,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16543 states. [2018-12-03 16:23:46,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16543 to 12921. [2018-12-03 16:23:46,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12921 states. [2018-12-03 16:23:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12921 states to 12921 states and 20820 transitions. [2018-12-03 16:23:46,082 INFO L78 Accepts]: Start accepts. Automaton has 12921 states and 20820 transitions. Word has length 28 [2018-12-03 16:23:46,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:23:46,082 INFO L480 AbstractCegarLoop]: Abstraction has 12921 states and 20820 transitions. [2018-12-03 16:23:46,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:23:46,082 INFO L276 IsEmpty]: Start isEmpty. Operand 12921 states and 20820 transitions. [2018-12-03 16:23:46,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 16:23:46,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:23:46,087 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:23:46,088 INFO L423 AbstractCegarLoop]: === Iteration 82 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:23:46,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:23:46,088 INFO L82 PathProgramCache]: Analyzing trace with hash -323092399, now seen corresponding path program 3 times [2018-12-03 16:23:46,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:23:46,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:23:46,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:23:46,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:23:46,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:23:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:23:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:23:46,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:23:46,330 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:23:46,331 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:23:46,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:23:46,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:23:46,331 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 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:23:46,341 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:23:46,341 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:23:46,352 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:23:46,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:23:46,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:23:46,553 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 16:23:46,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:23:46,917 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 16:23:46,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:23:46,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 29 [2018-12-03 16:23:46,937 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:23:46,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:23:46,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:23:46,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2018-12-03 16:23:46,938 INFO L87 Difference]: Start difference. First operand 12921 states and 20820 transitions. Second operand 24 states. [2018-12-03 16:24:11,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:11,114 INFO L93 Difference]: Finished difference Result 28705 states and 46406 transitions. [2018-12-03 16:24:11,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 16:24:11,115 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-12-03 16:24:11,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:11,128 INFO L225 Difference]: With dead ends: 28705 [2018-12-03 16:24:11,128 INFO L226 Difference]: Without dead ends: 16039 [2018-12-03 16:24:11,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2200 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1168, Invalid=7574, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 16:24:11,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16039 states. [2018-12-03 16:24:25,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16039 to 13234. [2018-12-03 16:24:25,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13234 states. [2018-12-03 16:24:25,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13234 states to 13234 states and 21347 transitions. [2018-12-03 16:24:25,110 INFO L78 Accepts]: Start accepts. Automaton has 13234 states and 21347 transitions. Word has length 31 [2018-12-03 16:24:25,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:25,110 INFO L480 AbstractCegarLoop]: Abstraction has 13234 states and 21347 transitions. [2018-12-03 16:24:25,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:24:25,111 INFO L276 IsEmpty]: Start isEmpty. Operand 13234 states and 21347 transitions. [2018-12-03 16:24:25,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 16:24:25,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:25,115 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1] [2018-12-03 16:24:25,115 INFO L423 AbstractCegarLoop]: === Iteration 83 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:25,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:25,115 INFO L82 PathProgramCache]: Analyzing trace with hash 537548598, now seen corresponding path program 4 times [2018-12-03 16:24:25,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:25,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:25,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:25,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:25,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:25,288 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 16:24:25,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:25,289 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:25,289 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:25,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:25,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:25,289 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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:25,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:25,298 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:25,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 43 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 16:24:25,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:25,652 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 16:24:25,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:25,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2018-12-03 16:24:25,671 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:25,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:24:25,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:24:25,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2018-12-03 16:24:25,672 INFO L87 Difference]: Start difference. First operand 13234 states and 21347 transitions. Second operand 24 states. [2018-12-03 16:24:45,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:45,341 INFO L93 Difference]: Finished difference Result 27515 states and 44327 transitions. [2018-12-03 16:24:45,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:24:45,342 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-12-03 16:24:45,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:45,354 INFO L225 Difference]: With dead ends: 27515 [2018-12-03 16:24:45,354 INFO L226 Difference]: Without dead ends: 14536 [2018-12-03 16:24:45,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1104, Invalid=4446, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 16:24:45,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14536 states. [2018-12-03 16:24:58,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14536 to 12956. [2018-12-03 16:24:58,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12956 states. [2018-12-03 16:24:58,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12956 states to 12956 states and 20861 transitions. [2018-12-03 16:24:58,482 INFO L78 Accepts]: Start accepts. Automaton has 12956 states and 20861 transitions. Word has length 31 [2018-12-03 16:24:58,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:58,482 INFO L480 AbstractCegarLoop]: Abstraction has 12956 states and 20861 transitions. [2018-12-03 16:24:58,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:24:58,483 INFO L276 IsEmpty]: Start isEmpty. Operand 12956 states and 20861 transitions. [2018-12-03 16:24:58,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 16:24:58,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:58,486 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:24:58,486 INFO L423 AbstractCegarLoop]: === Iteration 84 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:58,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:58,487 INFO L82 PathProgramCache]: Analyzing trace with hash 516576961, now seen corresponding path program 4 times [2018-12-03 16:24:58,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:58,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:58,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:58,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:58,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:58,725 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:24:58,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:58,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:58,725 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:58,725 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:58,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:58,726 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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:58,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:58,734 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:58,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:58,945 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 16:24:58,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:59,126 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 16:24:59,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:59,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 29 [2018-12-03 16:24:59,147 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:59,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:24:59,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:24:59,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2018-12-03 16:24:59,148 INFO L87 Difference]: Start difference. First operand 12956 states and 20861 transitions. Second operand 24 states. [2018-12-03 16:25:22,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:22,168 INFO L93 Difference]: Finished difference Result 27069 states and 43688 transitions. [2018-12-03 16:25:22,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 16:25:22,168 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-12-03 16:25:22,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:22,181 INFO L225 Difference]: With dead ends: 27069 [2018-12-03 16:25:22,182 INFO L226 Difference]: Without dead ends: 14384 [2018-12-03 16:25:22,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 4737 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2404, Invalid=13096, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 16:25:22,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14384 states. [2018-12-03 16:25:35,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14384 to 12929. [2018-12-03 16:25:35,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12929 states. [2018-12-03 16:25:35,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12929 states to 12929 states and 20821 transitions. [2018-12-03 16:25:35,829 INFO L78 Accepts]: Start accepts. Automaton has 12929 states and 20821 transitions. Word has length 31 [2018-12-03 16:25:35,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:35,829 INFO L480 AbstractCegarLoop]: Abstraction has 12929 states and 20821 transitions. [2018-12-03 16:25:35,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:25:35,829 INFO L276 IsEmpty]: Start isEmpty. Operand 12929 states and 20821 transitions. [2018-12-03 16:25:35,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 16:25:35,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:35,832 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:25:35,832 INFO L423 AbstractCegarLoop]: === Iteration 85 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:35,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:35,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1964063353, now seen corresponding path program 1 times [2018-12-03 16:25:35,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:35,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:35,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:35,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:35,834 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:36,010 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:25:36,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:36,011 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:36,011 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-12-03 16:25:36,011 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [12], [15], [19], [25], [26], [27], [30], [32], [36], [38], [41], [43], [45], [47], [50], [52] [2018-12-03 16:25:36,012 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:25:36,012 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:25:36,025 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:25:36,026 INFO L272 AbstractInterpreter]: Visited 20 different actions 51 times. Merged at 16 different actions 20 times. Never widened. Found 18 fixpoints after 10 different actions. Largest state had 0 variables. [2018-12-03 16:25:36,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:36,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:25:36,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:36,061 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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:36,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:36,079 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:36,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:36,303 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 16:25:36,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:36,497 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 16:25:36,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:36,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 27 [2018-12-03 16:25:36,516 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:36,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 16:25:36,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 16:25:36,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-12-03 16:25:36,517 INFO L87 Difference]: Start difference. First operand 12929 states and 20821 transitions. Second operand 23 states.