java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:20:21,121 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:20:21,125 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:20:21,137 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:20:21,137 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:20:21,138 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:20:21,140 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:20:21,142 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:20:21,143 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:20:21,144 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:20:21,145 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:20:21,145 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:20:21,146 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:20:21,147 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:20:21,148 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:20:21,149 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:20:21,150 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:20:21,152 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:20:21,155 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:20:21,156 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:20:21,157 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:20:21,159 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:20:21,161 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:20:21,162 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:20:21,162 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:20:21,163 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:20:21,164 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:20:21,165 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:20:21,166 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:20:21,167 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:20:21,167 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:20:21,168 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:20:21,168 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:20:21,169 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:20:21,170 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:20:21,170 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:20:21,171 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-25 15:20:21,193 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:20:21,193 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:20:21,194 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:20:21,194 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:20:21,195 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:20:21,195 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:20:21,195 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:20:21,195 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:20:21,196 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-25 15:20:21,196 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:20:21,196 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-25 15:20:21,196 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-25 15:20:21,196 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:20:21,197 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:20:21,197 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:20:21,197 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:20:21,199 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:20:21,199 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:20:21,199 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:20:21,199 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:20:21,200 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:20:21,200 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:20:21,200 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:20:21,200 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:20:21,200 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:20:21,201 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:20:21,201 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:20:21,201 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:20:21,201 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:20:21,201 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:20:21,202 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:20:21,202 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:20:21,202 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:20:21,202 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:20:21,202 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:20:21,203 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:20:21,203 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:20:21,203 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:20:21,203 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:20:21,203 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:20:21,236 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:20:21,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:20:21,250 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:20:21,251 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:20:21,252 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:20:21,253 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl [2019-02-25 15:20:21,253 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl' [2019-02-25 15:20:21,288 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:20:21,289 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:20:21,290 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:20:21,290 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:20:21,291 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:20:21,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:20:21" (1/1) ... [2019-02-25 15:20:21,319 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:20:21" (1/1) ... [2019-02-25 15:20:21,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:20:21,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:20:21,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:20:21,346 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:20:21,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:20:21" (1/1) ... [2019-02-25 15:20:21,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:20:21" (1/1) ... [2019-02-25 15:20:21,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:20:21" (1/1) ... [2019-02-25 15:20:21,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:20:21" (1/1) ... [2019-02-25 15:20:21,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:20:21" (1/1) ... [2019-02-25 15:20:21,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:20:21" (1/1) ... [2019-02-25 15:20:21,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:20:21" (1/1) ... [2019-02-25 15:20:21,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:20:21,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:20:21,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:20:21,382 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:20:21,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:20:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:20:21,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-25 15:20:21,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-25 15:20:21,789 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-25 15:20:21,789 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-02-25 15:20:21,791 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:20:21 BoogieIcfgContainer [2019-02-25 15:20:21,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:20:21,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:20:21,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:20:21,796 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:20:21,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:20:21" (1/2) ... [2019-02-25 15:20:21,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d10c537 and model type speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:20:21, skipping insertion in model container [2019-02-25 15:20:21,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:20:21" (2/2) ... [2019-02-25 15:20:21,801 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-unlimited.bpl [2019-02-25 15:20:21,814 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:20:21,824 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-02-25 15:20:21,846 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-02-25 15:20:21,906 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:20:21,907 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:20:21,907 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:20:21,907 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:20:21,907 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:20:21,908 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:20:21,911 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:20:21,911 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:20:21,941 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-02-25 15:20:21,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-25 15:20:21,947 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:21,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-25 15:20:21,951 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:21,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:21,958 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-02-25 15:20:21,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:22,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:22,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:22,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:22,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:22,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:22,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:20:22,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:20:22,148 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:20:22,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:20:22,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:20:22,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:20:22,165 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-02-25 15:20:22,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:22,342 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-02-25 15:20:22,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:20:22,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-25 15:20:22,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:22,369 INFO L225 Difference]: With dead ends: 25 [2019-02-25 15:20:22,369 INFO L226 Difference]: Without dead ends: 20 [2019-02-25 15:20:22,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:20:22,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-25 15:20:22,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-02-25 15:20:22,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-25 15:20:22,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-02-25 15:20:22,406 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-02-25 15:20:22,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:22,408 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-02-25 15:20:22,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:20:22,408 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-02-25 15:20:22,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:20:22,409 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:22,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:20:22,409 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:22,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:22,410 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-02-25 15:20:22,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:22,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:22,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:22,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:22,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:22,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:22,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:22,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:22,548 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:20:22,551 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-02-25 15:20:22,603 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:20:22,604 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:20:22,679 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:20:22,680 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:20:22,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:22,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:20:22,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:22,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:22,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:22,701 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:20:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:22,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:20:22,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:22,937 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:20:22,938 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:22,965 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:23,084 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:23,255 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:23,311 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:20:23,328 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:20:23,336 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:20:23,344 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:20:23,365 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:20:23,367 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:23,407 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:23,481 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:23,551 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:23,572 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:23,659 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:23,660 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-25 15:20:23,786 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:23,787 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:20:23,788 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:23,846 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:23,847 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-25 15:20:23,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:23,917 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:23,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:23,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:23,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:20:23,979 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:23,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:20:23,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:20:23,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:20:23,981 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-02-25 15:20:24,256 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-02-25 15:20:24,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:24,673 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-02-25 15:20:24,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:20:24,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:20:24,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:24,676 INFO L225 Difference]: With dead ends: 39 [2019-02-25 15:20:24,676 INFO L226 Difference]: Without dead ends: 37 [2019-02-25 15:20:24,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:20:24,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-25 15:20:24,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-02-25 15:20:24,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-25 15:20:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-02-25 15:20:24,683 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-02-25 15:20:24,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:24,683 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-02-25 15:20:24,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:20:24,686 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-02-25 15:20:24,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:20:24,687 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:24,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:20:24,687 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:24,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:24,687 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-02-25 15:20:24,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:24,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:24,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:24,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:24,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:24,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:24,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:24,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:24,812 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:20:24,812 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-02-25 15:20:24,813 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:20:24,814 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:20:24,820 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:20:24,820 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:20:24,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:24,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:20:24,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:24,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:24,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:24,830 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:20:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:24,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:20:24,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:24,889 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:20:24,890 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:24,903 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:24,918 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:24,929 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:24,950 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:20:24,959 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:20:24,980 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:20:24,984 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:20:25,003 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:20:25,004 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:25,031 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:25,050 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:25,063 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:25,073 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:25,108 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:25,109 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-25 15:20:25,193 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:25,237 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:20:25,244 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-25 15:20:25,530 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-02-25 15:20:25,530 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:183 [2019-02-25 15:20:25,898 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 45 [2019-02-25 15:20:25,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:25,899 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:25,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:25,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:20:25,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-25 15:20:25,925 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:20:25,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:20:25,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:20:25,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:20:25,926 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-02-25 15:20:25,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:25,973 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-02-25 15:20:25,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:20:25,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-25 15:20:25,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:25,978 INFO L225 Difference]: With dead ends: 18 [2019-02-25 15:20:25,978 INFO L226 Difference]: Without dead ends: 17 [2019-02-25 15:20:25,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:20:25,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-25 15:20:25,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-25 15:20:25,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-25 15:20:25,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-02-25 15:20:25,984 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-02-25 15:20:25,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:25,984 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-02-25 15:20:25,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:20:25,985 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-02-25 15:20:25,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:20:25,985 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:25,985 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:20:25,986 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:25,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:25,986 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-02-25 15:20:25,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:25,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:25,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:25,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:25,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:26,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:26,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:20:26,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:20:26,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:20:26,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:20:26,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:20:26,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:20:26,016 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-02-25 15:20:26,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:26,064 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-02-25 15:20:26,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:20:26,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-25 15:20:26,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:26,066 INFO L225 Difference]: With dead ends: 21 [2019-02-25 15:20:26,066 INFO L226 Difference]: Without dead ends: 20 [2019-02-25 15:20:26,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:20:26,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-25 15:20:26,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-02-25 15:20:26,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-25 15:20:26,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-02-25 15:20:26,073 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-02-25 15:20:26,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:26,073 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-02-25 15:20:26,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:20:26,073 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-02-25 15:20:26,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:20:26,074 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:26,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:20:26,074 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:26,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:26,075 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-02-25 15:20:26,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:26,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:26,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:26,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:26,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:26,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:26,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:26,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:26,126 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:20:26,126 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-02-25 15:20:26,128 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:20:26,128 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:20:26,134 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:20:26,134 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:20:26,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:26,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:20:26,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:26,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:26,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:26,146 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:20:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:26,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:20:26,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:26,174 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:20:26,185 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:26,186 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:20:26,194 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:26,197 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:26,198 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:20:26,209 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:26,211 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:26,213 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:26,215 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:20:26,240 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:20:26,241 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:26,304 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:26,365 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:26,376 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:26,392 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:26,432 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:20:26,433 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:26,458 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:26,464 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:26,475 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:26,499 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:26,499 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-25 15:20:26,533 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:26,534 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:20:26,535 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:26,561 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:26,562 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-25 15:20:26,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:26,581 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:26,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:26,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:26,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:20:26,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:26,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:20:26,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:20:26,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:20:26,612 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-02-25 15:20:26,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:26,768 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-02-25 15:20:26,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:20:26,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:20:26,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:26,772 INFO L225 Difference]: With dead ends: 39 [2019-02-25 15:20:26,772 INFO L226 Difference]: Without dead ends: 38 [2019-02-25 15:20:26,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:20:26,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-25 15:20:26,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-02-25 15:20:26,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-25 15:20:26,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-02-25 15:20:26,777 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-02-25 15:20:26,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:26,778 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-02-25 15:20:26,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:20:26,778 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-02-25 15:20:26,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:20:26,778 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:26,779 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:20:26,779 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:26,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:26,779 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-02-25 15:20:26,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:26,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:26,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:26,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:26,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:26,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:26,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:26,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:26,903 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:20:26,903 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-02-25 15:20:26,905 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:20:26,905 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:20:26,912 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:20:26,912 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:20:26,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:26,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:20:26,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:26,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:26,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:26,925 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:20:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:26,930 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:20:26,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:26,935 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:20:26,939 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:26,940 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:20:26,949 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:26,951 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:26,952 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:20:26,968 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:26,969 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:26,970 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:26,971 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:20:26,989 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:20:26,989 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:27,007 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:27,022 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:27,032 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:27,044 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:27,133 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:20:27,133 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:27,215 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:27,220 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:27,232 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:27,254 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:27,254 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-25 15:20:27,434 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:27,434 INFO L292 Elim1Store]: Index analysis took 155 ms [2019-02-25 15:20:27,561 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-02-25 15:20:27,562 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:20:27,722 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:20:27,723 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:74 [2019-02-25 15:20:27,780 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:27,781 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:27,782 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:27,784 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:27,791 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:27,793 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:27,830 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 68 [2019-02-25 15:20:27,833 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-25 15:20:28,080 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:28,082 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:28,083 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:28,085 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:28,086 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:20:28,087 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2019-02-25 15:20:28,087 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:28,255 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-02-25 15:20:28,255 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:96, output treesize:167 [2019-02-25 15:20:28,463 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 65 [2019-02-25 15:20:28,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:28,465 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:28,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:28,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:28,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:20:28,528 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:28,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:20:28,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:20:28,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:20:28,529 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-02-25 15:20:29,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:29,067 INFO L93 Difference]: Finished difference Result 59 states and 105 transitions. [2019-02-25 15:20:29,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:20:29,067 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:20:29,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:29,069 INFO L225 Difference]: With dead ends: 59 [2019-02-25 15:20:29,069 INFO L226 Difference]: Without dead ends: 55 [2019-02-25 15:20:29,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:20:29,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-25 15:20:29,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 20. [2019-02-25 15:20:29,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-25 15:20:29,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2019-02-25 15:20:29,077 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 59 transitions. Word has length 4 [2019-02-25 15:20:29,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:29,077 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 59 transitions. [2019-02-25 15:20:29,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:20:29,078 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 59 transitions. [2019-02-25 15:20:29,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:20:29,078 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:29,078 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:20:29,079 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:29,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:29,079 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-02-25 15:20:29,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:29,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:29,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:29,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:29,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:29,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:29,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:29,216 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:20:29,216 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-02-25 15:20:29,218 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:20:29,219 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:20:29,229 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:20:29,229 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:20:29,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:29,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:20:29,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:29,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:29,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:29,241 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:20:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:29,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-25 15:20:29,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:29,263 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:20:29,295 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:20:29,299 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:29,300 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:29,301 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:20:29,306 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:29,307 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:29,308 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:29,309 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:20:29,324 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-25 15:20:29,325 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:29,347 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:29,367 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:29,379 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:29,391 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:29,457 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:20:29,458 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:29,465 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:29,481 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:29,512 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:29,512 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-02-25 15:20:29,567 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:29,568 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-02-25 15:20:29,569 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:29,593 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:29,594 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-02-25 15:20:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:29,612 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:29,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:29,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:20:29,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-25 15:20:29,662 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:20:29,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:20:29,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:20:29,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:20:29,663 INFO L87 Difference]: Start difference. First operand 20 states and 59 transitions. Second operand 4 states. [2019-02-25 15:20:29,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:29,784 INFO L93 Difference]: Finished difference Result 25 states and 74 transitions. [2019-02-25 15:20:29,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:20:29,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-25 15:20:29,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:29,786 INFO L225 Difference]: With dead ends: 25 [2019-02-25 15:20:29,786 INFO L226 Difference]: Without dead ends: 24 [2019-02-25 15:20:29,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:20:29,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-25 15:20:29,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-02-25 15:20:29,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-25 15:20:29,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2019-02-25 15:20:29,794 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 73 transitions. Word has length 4 [2019-02-25 15:20:29,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:29,795 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 73 transitions. [2019-02-25 15:20:29,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:20:29,795 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 73 transitions. [2019-02-25 15:20:29,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:20:29,796 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:29,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:20:29,796 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:29,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:29,796 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-02-25 15:20:29,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:29,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:29,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:29,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:29,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:29,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:29,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:29,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:29,934 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:20:29,934 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-02-25 15:20:29,936 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:20:29,936 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:20:29,941 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:20:29,941 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:20:29,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:29,942 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:20:29,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:29,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:29,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:29,952 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:20:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:29,959 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:20:29,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:29,965 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:20:29,972 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:29,973 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:20:29,978 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:29,980 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:29,980 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:20:30,025 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:30,048 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:30,070 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:30,071 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:20:30,133 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:20:30,133 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:30,151 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:30,167 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:30,179 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:30,189 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:30,221 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:20:30,222 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:30,227 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:30,236 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:30,247 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:30,267 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:30,267 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-25 15:20:30,306 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:30,307 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:20:30,307 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:30,325 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:30,325 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:20:30,348 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:30,349 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:30,350 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:30,350 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:20:30,352 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:20:30,352 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:30,368 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:30,369 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:31 [2019-02-25 15:20:30,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:30,385 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:30,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:30,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:30,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:20:30,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:30,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:20:30,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:20:30,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:20:30,442 INFO L87 Difference]: Start difference. First operand 23 states and 73 transitions. Second operand 8 states. [2019-02-25 15:20:30,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:30,924 INFO L93 Difference]: Finished difference Result 56 states and 117 transitions. [2019-02-25 15:20:30,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:20:30,924 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:20:30,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:30,926 INFO L225 Difference]: With dead ends: 56 [2019-02-25 15:20:30,926 INFO L226 Difference]: Without dead ends: 55 [2019-02-25 15:20:30,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:20:30,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-25 15:20:30,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 24. [2019-02-25 15:20:30,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-25 15:20:30,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 79 transitions. [2019-02-25 15:20:30,936 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 79 transitions. Word has length 4 [2019-02-25 15:20:30,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:30,936 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 79 transitions. [2019-02-25 15:20:30,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:20:30,936 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 79 transitions. [2019-02-25 15:20:30,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:20:30,937 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:30,937 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:20:30,938 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:30,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:30,938 INFO L82 PathProgramCache]: Analyzing trace with hash 941276, now seen corresponding path program 1 times [2019-02-25 15:20:30,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:30,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:30,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:30,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:30,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:31,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:31,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:31,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:31,023 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:20:31,023 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [23] [2019-02-25 15:20:31,024 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:20:31,024 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:20:31,029 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:20:31,029 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:20:31,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:31,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:20:31,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:31,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:31,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:31,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:20:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:31,056 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:20:31,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:31,102 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:20:31,103 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:31,109 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:31,121 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:31,147 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:31,168 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:20:31,172 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:20:31,177 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:20:31,182 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:20:31,200 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:20:31,201 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:31,223 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:31,239 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:31,251 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:31,262 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:31,285 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:31,286 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-25 15:20:31,327 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:31,328 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:20:31,329 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:31,350 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:31,350 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:20:31,380 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:31,382 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:31,384 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:31,386 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:31,386 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:31,388 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:20:31,388 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:31,407 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:31,407 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-25 15:20:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:31,425 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:31,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:31,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:31,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:20:31,477 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:31,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:20:31,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:20:31,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:20:31,478 INFO L87 Difference]: Start difference. First operand 24 states and 79 transitions. Second operand 8 states. [2019-02-25 15:20:31,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:31,806 INFO L93 Difference]: Finished difference Result 52 states and 120 transitions. [2019-02-25 15:20:31,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:20:31,807 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:20:31,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:31,809 INFO L225 Difference]: With dead ends: 52 [2019-02-25 15:20:31,809 INFO L226 Difference]: Without dead ends: 48 [2019-02-25 15:20:31,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:20:31,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-25 15:20:31,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2019-02-25 15:20:31,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-25 15:20:31,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-02-25 15:20:31,819 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-02-25 15:20:31,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:31,819 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-02-25 15:20:31,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:20:31,820 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-02-25 15:20:31,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:20:31,820 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:31,820 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:20:31,821 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:31,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:31,821 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-02-25 15:20:31,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:31,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:31,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:31,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:31,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:31,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:31,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:31,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:31,883 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:20:31,883 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-02-25 15:20:31,886 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:20:31,886 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:20:31,890 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:20:31,890 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:20:31,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:31,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:20:31,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:31,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:31,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:31,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:20:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:31,909 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:20:31,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:31,914 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:20:31,920 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:20:31,926 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:31,928 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:31,929 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:20:31,939 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:31,941 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:31,943 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:31,944 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:20:31,947 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:31,951 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:31,953 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:31,958 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:31,959 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:20:31,959 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:32,017 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:32,029 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:32,039 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:32,048 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:32,085 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:20:32,085 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:32,094 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:32,103 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:32,118 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:32,146 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:32,147 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-25 15:20:32,201 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:32,202 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:20:32,203 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:32,230 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:32,230 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-02-25 15:20:32,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:32,256 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:32,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:32,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:20:32,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:32,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:20:32,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:20:32,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:20:32,289 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 6 states. [2019-02-25 15:20:32,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:32,502 INFO L93 Difference]: Finished difference Result 42 states and 110 transitions. [2019-02-25 15:20:32,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:20:32,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-25 15:20:32,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:32,505 INFO L225 Difference]: With dead ends: 42 [2019-02-25 15:20:32,505 INFO L226 Difference]: Without dead ends: 41 [2019-02-25 15:20:32,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:20:32,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-25 15:20:32,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2019-02-25 15:20:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-25 15:20:32,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-02-25 15:20:32,513 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-02-25 15:20:32,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:32,514 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-02-25 15:20:32,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:20:32,514 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-02-25 15:20:32,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:20:32,514 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:32,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:20:32,515 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:32,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:32,515 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-02-25 15:20:32,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:32,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:32,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:32,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:32,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:32,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:32,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:32,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:32,597 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:20:32,597 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-02-25 15:20:32,598 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:20:32,598 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:20:32,603 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:20:32,603 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:20:32,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:32,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:20:32,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:32,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:32,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:32,616 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:20:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:32,625 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:20:32,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:32,633 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:20:32,638 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:32,639 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:20:32,652 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:32,654 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:32,655 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:20:32,659 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:32,661 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:32,664 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:32,664 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:20:32,680 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:32,683 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:32,686 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:32,706 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:32,707 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:20:32,707 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:32,735 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:32,752 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:32,762 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:32,772 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:32,819 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:20:32,819 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:32,834 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:32,844 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:32,855 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:32,872 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:32,900 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:32,900 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-25 15:20:32,960 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:32,961 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:20:32,963 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:32,989 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:32,990 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:20:33,008 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:33,009 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:33,010 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:33,011 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:33,012 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:33,013 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:33,014 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:20:33,015 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:33,041 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:33,042 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-02-25 15:20:33,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:33,060 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:33,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:33,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:20:33,101 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:33,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:20:33,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:20:33,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:20:33,102 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 8 states. [2019-02-25 15:20:33,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:33,474 INFO L93 Difference]: Finished difference Result 54 states and 131 transitions. [2019-02-25 15:20:33,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:20:33,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:20:33,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:33,476 INFO L225 Difference]: With dead ends: 54 [2019-02-25 15:20:33,476 INFO L226 Difference]: Without dead ends: 53 [2019-02-25 15:20:33,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:20:33,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-25 15:20:33,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 27. [2019-02-25 15:20:33,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-25 15:20:33,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 96 transitions. [2019-02-25 15:20:33,486 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 96 transitions. Word has length 4 [2019-02-25 15:20:33,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:33,487 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 96 transitions. [2019-02-25 15:20:33,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:20:33,487 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 96 transitions. [2019-02-25 15:20:33,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:20:33,487 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:33,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:20:33,488 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:33,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:33,488 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 1 times [2019-02-25 15:20:33,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:33,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:33,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:33,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:33,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:33,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:33,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:33,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:33,602 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:20:33,602 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-02-25 15:20:33,605 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:20:33,605 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:20:33,609 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:20:33,609 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:20:33,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:33,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:20:33,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:33,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:33,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:33,622 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:20:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:33,628 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:20:33,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:33,672 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:20:33,672 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:33,681 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:33,689 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:33,699 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:33,714 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:20:33,717 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:20:33,738 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:20:33,741 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:20:33,765 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:20:33,765 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:33,781 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:33,806 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:33,816 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:33,826 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:33,847 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:33,847 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-25 15:20:33,882 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:33,883 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:20:33,884 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:33,900 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:33,900 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:20:33,917 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:33,918 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:33,919 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:33,920 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:33,921 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:33,922 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:20:33,922 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:33,940 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:33,941 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-25 15:20:33,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:33,963 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:33,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:33,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:33,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:20:33,995 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:33,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:20:33,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:20:33,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:20:33,996 INFO L87 Difference]: Start difference. First operand 27 states and 96 transitions. Second operand 8 states. [2019-02-25 15:20:34,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:34,283 INFO L93 Difference]: Finished difference Result 63 states and 165 transitions. [2019-02-25 15:20:34,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:20:34,284 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:20:34,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:34,285 INFO L225 Difference]: With dead ends: 63 [2019-02-25 15:20:34,285 INFO L226 Difference]: Without dead ends: 61 [2019-02-25 15:20:34,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:20:34,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-25 15:20:34,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 32. [2019-02-25 15:20:34,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-25 15:20:34,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 113 transitions. [2019-02-25 15:20:34,295 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 113 transitions. Word has length 4 [2019-02-25 15:20:34,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:34,296 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 113 transitions. [2019-02-25 15:20:34,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:20:34,296 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 113 transitions. [2019-02-25 15:20:34,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:20:34,296 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:34,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:20:34,297 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:34,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:34,297 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-02-25 15:20:34,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:34,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:34,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:34,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:34,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:34,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:20:34,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:20:34,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-25 15:20:34,377 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:20:34,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:20:34,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:20:34,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:20:34,378 INFO L87 Difference]: Start difference. First operand 32 states and 113 transitions. Second operand 4 states. [2019-02-25 15:20:34,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:34,432 INFO L93 Difference]: Finished difference Result 41 states and 126 transitions. [2019-02-25 15:20:34,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:20:34,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-25 15:20:34,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:34,433 INFO L225 Difference]: With dead ends: 41 [2019-02-25 15:20:34,433 INFO L226 Difference]: Without dead ends: 40 [2019-02-25 15:20:34,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:20:34,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-25 15:20:34,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-02-25 15:20:34,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-25 15:20:34,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 118 transitions. [2019-02-25 15:20:34,443 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 118 transitions. Word has length 4 [2019-02-25 15:20:34,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:34,443 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 118 transitions. [2019-02-25 15:20:34,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:20:34,443 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 118 transitions. [2019-02-25 15:20:34,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:20:34,444 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:34,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:20:34,444 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:34,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:34,444 INFO L82 PathProgramCache]: Analyzing trace with hash 933712, now seen corresponding path program 2 times [2019-02-25 15:20:34,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:34,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:34,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:34,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:34,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:34,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:34,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:34,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:34,538 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:20:34,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:20:34,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:34,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:34,547 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:20:34,548 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:20:34,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-25 15:20:34,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:20:34,555 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:20:34,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:34,566 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:20:34,610 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:34,611 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:20:34,615 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:34,616 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:34,618 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:20:34,626 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:34,628 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:34,630 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:34,631 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:20:34,636 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:34,638 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:34,640 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:34,643 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:34,644 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:20:34,644 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:34,685 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:34,743 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:34,761 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:34,772 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:34,821 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:20:34,822 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:34,834 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:34,845 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:34,857 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:34,876 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:34,905 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:34,906 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-25 15:20:34,945 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:34,946 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:20:34,946 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:34,976 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:34,977 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:20:34,999 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:34,999 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:35,000 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:35,001 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:35,002 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:35,003 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:20:35,004 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:20:35,005 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:35,031 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:35,031 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:44 [2019-02-25 15:20:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:35,058 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:35,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:35,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:35,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:20:35,100 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:35,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:20:35,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:20:35,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:20:35,101 INFO L87 Difference]: Start difference. First operand 33 states and 118 transitions. Second operand 8 states. [2019-02-25 15:20:35,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:35,451 INFO L93 Difference]: Finished difference Result 57 states and 149 transitions. [2019-02-25 15:20:35,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:20:35,452 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:20:35,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:35,453 INFO L225 Difference]: With dead ends: 57 [2019-02-25 15:20:35,453 INFO L226 Difference]: Without dead ends: 55 [2019-02-25 15:20:35,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:20:35,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-25 15:20:35,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2019-02-25 15:20:35,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-25 15:20:35,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 117 transitions. [2019-02-25 15:20:35,464 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 117 transitions. Word has length 4 [2019-02-25 15:20:35,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:35,465 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 117 transitions. [2019-02-25 15:20:35,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:20:35,465 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 117 transitions. [2019-02-25 15:20:35,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:20:35,466 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:35,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:20:35,466 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:35,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:35,466 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-02-25 15:20:35,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:35,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:35,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:20:35,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:35,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:35,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:35,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:35,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:35,563 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:20:35,564 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-02-25 15:20:35,564 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:20:35,564 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:20:35,568 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:20:35,568 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:20:35,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:35,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:20:35,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:35,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:35,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:35,579 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:20:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:35,588 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:20:35,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:35,621 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:20:35,622 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:35,631 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:35,639 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:35,652 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:35,669 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:20:35,674 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:20:35,679 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:20:35,704 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:20:35,781 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:20:35,781 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:36,046 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:36,160 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:36,170 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:36,180 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:36,201 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:36,201 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-25 15:20:36,287 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:36,288 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:20:36,289 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:36,317 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:36,318 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-25 15:20:36,339 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:36,340 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:36,341 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:36,341 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:36,342 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:36,343 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:20:36,344 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:36,358 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:36,359 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-25 15:20:36,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:36,378 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:36,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:36,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:20:36,417 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:36,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:20:36,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:20:36,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:20:36,417 INFO L87 Difference]: Start difference. First operand 33 states and 117 transitions. Second operand 8 states. [2019-02-25 15:20:36,854 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-02-25 15:20:37,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:37,398 INFO L93 Difference]: Finished difference Result 61 states and 173 transitions. [2019-02-25 15:20:37,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:20:37,398 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:20:37,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:37,399 INFO L225 Difference]: With dead ends: 61 [2019-02-25 15:20:37,399 INFO L226 Difference]: Without dead ends: 60 [2019-02-25 15:20:37,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:20:37,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-25 15:20:37,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-02-25 15:20:37,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-25 15:20:37,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 135 transitions. [2019-02-25 15:20:37,412 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 135 transitions. Word has length 4 [2019-02-25 15:20:37,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:37,412 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 135 transitions. [2019-02-25 15:20:37,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:20:37,412 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 135 transitions. [2019-02-25 15:20:37,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:20:37,413 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:37,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:20:37,414 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:37,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:37,414 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-02-25 15:20:37,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:37,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:37,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:37,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:37,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:37,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:37,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:37,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:37,506 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:20:37,506 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-02-25 15:20:37,507 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:20:37,507 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:20:37,510 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:20:37,511 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:20:37,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:37,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:20:37,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:37,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:37,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:37,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:20:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:37,524 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:20:37,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:37,545 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:20:37,562 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:20:37,566 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:37,568 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:37,568 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:20:37,572 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:37,573 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:37,575 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:37,575 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:20:37,584 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:37,586 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:37,587 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:37,587 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:37,588 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:20:37,589 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:37,619 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:37,633 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:37,642 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:37,652 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:37,723 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:20:37,723 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:37,733 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:37,746 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:37,762 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:37,789 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:37,790 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-25 15:20:37,814 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:37,815 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:20:37,815 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:37,840 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:37,840 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-02-25 15:20:37,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:37,857 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:37,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:37,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:37,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:20:37,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:37,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:20:37,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:20:37,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:20:37,892 INFO L87 Difference]: Start difference. First operand 36 states and 135 transitions. Second operand 6 states. [2019-02-25 15:20:38,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:38,098 INFO L93 Difference]: Finished difference Result 53 states and 161 transitions. [2019-02-25 15:20:38,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:20:38,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-25 15:20:38,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:38,100 INFO L225 Difference]: With dead ends: 53 [2019-02-25 15:20:38,100 INFO L226 Difference]: Without dead ends: 52 [2019-02-25 15:20:38,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:20:38,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-25 15:20:38,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-02-25 15:20:38,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-25 15:20:38,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 141 transitions. [2019-02-25 15:20:38,113 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 141 transitions. Word has length 4 [2019-02-25 15:20:38,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:38,113 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 141 transitions. [2019-02-25 15:20:38,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:20:38,113 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 141 transitions. [2019-02-25 15:20:38,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:20:38,114 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:38,114 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:20:38,114 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:38,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:38,115 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-02-25 15:20:38,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:38,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:38,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:38,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:38,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:38,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:38,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:38,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:38,185 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:20:38,185 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-02-25 15:20:38,186 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:20:38,187 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:20:38,190 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:20:38,191 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:20:38,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:38,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:20:38,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:38,191 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:38,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:38,202 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:20:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:38,207 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:20:38,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:38,215 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:20:38,218 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:38,218 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:20:38,236 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:38,237 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:38,237 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:20:38,241 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:38,242 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:38,243 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:38,243 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:20:38,247 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:38,248 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:38,249 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:38,250 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:38,252 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:20:38,252 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:38,289 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:38,304 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:38,315 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:38,324 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:38,363 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:20:38,363 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:38,372 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:38,378 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:38,389 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:38,407 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:38,437 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:38,437 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-25 15:20:38,484 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:38,484 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:20:38,485 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:38,513 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:38,514 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:20:38,535 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:38,536 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:38,537 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:38,538 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:38,539 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:38,540 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:38,541 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:20:38,541 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:38,567 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:38,568 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-02-25 15:20:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:38,593 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:38,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:38,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:38,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:20:38,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:38,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:20:38,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:20:38,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:20:38,634 INFO L87 Difference]: Start difference. First operand 37 states and 141 transitions. Second operand 8 states. [2019-02-25 15:20:38,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:38,964 INFO L93 Difference]: Finished difference Result 69 states and 192 transitions. [2019-02-25 15:20:38,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:20:38,964 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:20:38,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:38,966 INFO L225 Difference]: With dead ends: 69 [2019-02-25 15:20:38,966 INFO L226 Difference]: Without dead ends: 68 [2019-02-25 15:20:38,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:20:38,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-25 15:20:38,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 39. [2019-02-25 15:20:38,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-25 15:20:38,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 153 transitions. [2019-02-25 15:20:38,978 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 153 transitions. Word has length 4 [2019-02-25 15:20:38,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:38,978 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 153 transitions. [2019-02-25 15:20:38,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:20:38,978 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 153 transitions. [2019-02-25 15:20:38,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:20:38,979 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:38,979 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-25 15:20:38,979 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:38,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:38,980 INFO L82 PathProgramCache]: Analyzing trace with hash 29182896, now seen corresponding path program 2 times [2019-02-25 15:20:38,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:38,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:38,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:38,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:38,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:39,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:20:39,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:39,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:39,031 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:20:39,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:20:39,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:39,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:39,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:20:39,040 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:20:39,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:20:39,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:20:39,047 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:20:39,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:39,053 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:20:39,063 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:39,064 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:20:39,067 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:39,069 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:39,070 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:20:39,082 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:39,085 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:39,088 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:39,089 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:20:39,100 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:39,102 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:39,105 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:39,108 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:39,109 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:20:39,109 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:39,142 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:39,172 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:39,184 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:39,196 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:39,249 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:20:39,249 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:39,260 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:39,272 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:39,289 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:39,307 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:39,335 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:39,336 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:69, output treesize:66 [2019-02-25 15:20:39,376 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:39,377 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:20:39,377 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:39,469 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:39,470 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:20:39,486 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:39,487 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:39,488 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:39,488 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:39,489 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:39,490 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:39,491 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 66 [2019-02-25 15:20:39,492 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:39,520 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:39,520 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:50 [2019-02-25 15:20:39,539 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:39,540 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:39,541 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:39,541 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:39,542 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:39,543 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:39,544 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:20:39,544 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:39,573 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:39,573 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-02-25 15:20:39,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:39,600 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:39,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:39,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:39,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-02-25 15:20:39,682 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:39,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:20:39,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:20:39,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:20:39,683 INFO L87 Difference]: Start difference. First operand 39 states and 153 transitions. Second operand 9 states. [2019-02-25 15:20:40,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:40,089 INFO L93 Difference]: Finished difference Result 73 states and 219 transitions. [2019-02-25 15:20:40,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:20:40,089 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-25 15:20:40,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:40,091 INFO L225 Difference]: With dead ends: 73 [2019-02-25 15:20:40,091 INFO L226 Difference]: Without dead ends: 71 [2019-02-25 15:20:40,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:20:40,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-25 15:20:40,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 42. [2019-02-25 15:20:40,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-25 15:20:40,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 171 transitions. [2019-02-25 15:20:40,104 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 171 transitions. Word has length 5 [2019-02-25 15:20:40,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:40,104 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 171 transitions. [2019-02-25 15:20:40,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:20:40,105 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 171 transitions. [2019-02-25 15:20:40,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:20:40,105 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:40,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:20:40,106 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:40,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:40,106 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-02-25 15:20:40,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:40,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:40,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:20:40,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:40,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:40,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:40,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:40,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:40,200 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:20:40,201 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-02-25 15:20:40,202 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:20:40,202 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:20:40,204 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:20:40,204 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:20:40,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:40,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:20:40,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:40,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:40,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:40,213 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:20:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:40,233 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:20:40,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:40,250 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:20:40,268 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:20:40,271 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:40,286 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:40,286 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:20:40,290 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:40,291 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:40,292 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:40,293 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:20:40,296 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:40,298 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:40,299 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:40,300 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:40,301 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:20:40,301 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:40,326 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:40,340 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:40,349 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:40,360 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:40,396 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:20:40,396 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:40,405 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:40,412 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:40,428 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:40,454 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:40,454 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:20:40,494 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:40,494 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:20:40,495 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:40,520 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:40,520 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:20:40,580 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:40,603 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:40,607 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:40,607 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:40,609 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:40,609 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:40,610 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 64 [2019-02-25 15:20:40,610 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:40,695 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:40,695 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:36 [2019-02-25 15:20:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:40,716 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:40,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:40,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:40,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:20:40,755 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:40,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:20:40,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:20:40,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:20:40,756 INFO L87 Difference]: Start difference. First operand 42 states and 171 transitions. Second operand 8 states. [2019-02-25 15:20:41,125 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-02-25 15:20:41,495 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-02-25 15:20:41,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:41,726 INFO L93 Difference]: Finished difference Result 84 states and 258 transitions. [2019-02-25 15:20:41,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:20:41,726 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:20:41,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:41,728 INFO L225 Difference]: With dead ends: 84 [2019-02-25 15:20:41,728 INFO L226 Difference]: Without dead ends: 78 [2019-02-25 15:20:41,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:20:41,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-02-25 15:20:41,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 48. [2019-02-25 15:20:41,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-25 15:20:41,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 218 transitions. [2019-02-25 15:20:41,750 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 218 transitions. Word has length 5 [2019-02-25 15:20:41,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:41,750 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 218 transitions. [2019-02-25 15:20:41,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:20:41,750 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 218 transitions. [2019-02-25 15:20:41,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:20:41,751 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:41,751 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:20:41,751 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:41,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:41,752 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-02-25 15:20:41,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:41,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:41,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:41,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:41,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:41,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:41,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:41,876 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:41,876 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:20:41,876 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-02-25 15:20:41,879 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:20:41,879 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:20:41,883 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:20:41,883 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:20:41,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:41,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:20:41,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:41,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:41,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:41,898 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:20:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:41,903 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:20:41,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:41,906 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:20:41,910 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:41,911 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:20:41,914 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:41,916 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:41,918 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:20:41,924 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:41,925 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:41,926 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:41,927 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:20:41,939 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:20:41,940 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:41,965 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:41,980 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:41,992 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:42,002 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:42,033 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:20:42,034 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:42,040 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:42,046 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:42,057 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:42,078 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:42,078 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-25 15:20:42,137 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:42,148 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-02-25 15:20:42,149 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:20:42,211 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-25 15:20:42,212 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:74 [2019-02-25 15:20:42,690 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-02-25 15:20:42,724 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:42,746 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:42,771 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:42,797 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:42,957 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:42,987 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:42,988 INFO L292 Elim1Store]: Index analysis took 291 ms [2019-02-25 15:20:43,342 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 68 [2019-02-25 15:20:43,344 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-25 15:20:43,587 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:43,588 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:43,589 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:43,590 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:20:43,590 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2019-02-25 15:20:43,591 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:43,676 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-02-25 15:20:43,676 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:96, output treesize:167 [2019-02-25 15:20:44,088 WARN L181 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-02-25 15:20:44,103 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:44,104 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:44,107 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:44,110 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:44,111 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:44,111 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:44,112 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:20:44,113 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 51 [2019-02-25 15:20:44,113 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:44,196 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:44,197 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-25 15:20:44,197 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:44,268 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:44,269 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:44,270 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:44,271 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:44,273 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:44,274 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:44,274 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:20:44,275 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 15:20:44,276 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:44,355 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:44,355 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:44,356 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:44,357 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:44,358 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:44,358 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:44,359 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:44,360 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:20:44,361 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 15:20:44,361 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:44,420 INFO L301 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-02-25 15:20:44,420 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:123 [2019-02-25 15:20:44,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:44,503 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:44,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:44,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:44,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:20:44,582 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:44,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:20:44,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:20:44,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:20:44,582 INFO L87 Difference]: Start difference. First operand 48 states and 218 transitions. Second operand 10 states. [2019-02-25 15:20:45,062 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-02-25 15:20:45,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:45,496 INFO L93 Difference]: Finished difference Result 109 states and 322 transitions. [2019-02-25 15:20:45,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:20:45,497 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:20:45,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:45,498 INFO L225 Difference]: With dead ends: 109 [2019-02-25 15:20:45,499 INFO L226 Difference]: Without dead ends: 107 [2019-02-25 15:20:45,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:20:45,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-25 15:20:45,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 51. [2019-02-25 15:20:45,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-25 15:20:45,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 236 transitions. [2019-02-25 15:20:45,515 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 236 transitions. Word has length 5 [2019-02-25 15:20:45,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:45,516 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 236 transitions. [2019-02-25 15:20:45,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:20:45,516 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 236 transitions. [2019-02-25 15:20:45,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:20:45,516 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:45,516 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:20:45,517 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:45,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:45,517 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-02-25 15:20:45,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:45,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:45,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:45,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:45,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:45,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:20:45,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:45,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:45,675 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:20:45,676 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-02-25 15:20:45,677 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:20:45,677 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:20:45,681 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:20:45,681 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:20:45,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:45,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:20:45,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:45,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:45,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:45,691 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:20:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:45,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:20:45,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:45,699 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:20:45,702 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:45,703 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:20:45,707 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:45,709 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:45,710 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:20:45,731 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:45,734 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:45,736 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:45,737 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:20:45,747 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:20:45,747 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:45,764 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:45,779 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:45,789 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:45,798 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:45,866 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:20:45,866 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:45,872 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:45,878 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:45,888 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:45,908 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:45,908 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-25 15:20:45,946 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:45,946 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:20:45,947 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:45,963 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:45,963 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:20:45,982 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:45,983 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:45,984 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:45,985 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:45,986 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:45,987 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:20:45,988 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:46,002 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:46,002 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-25 15:20:46,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:46,022 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:46,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:46,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:46,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:20:46,061 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:46,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:20:46,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:20:46,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:20:46,062 INFO L87 Difference]: Start difference. First operand 51 states and 236 transitions. Second operand 8 states. [2019-02-25 15:20:46,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:46,419 INFO L93 Difference]: Finished difference Result 77 states and 292 transitions. [2019-02-25 15:20:46,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:20:46,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:20:46,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:46,420 INFO L225 Difference]: With dead ends: 77 [2019-02-25 15:20:46,421 INFO L226 Difference]: Without dead ends: 76 [2019-02-25 15:20:46,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:20:46,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-25 15:20:46,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-02-25 15:20:46,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-25 15:20:46,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 261 transitions. [2019-02-25 15:20:46,439 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 261 transitions. Word has length 5 [2019-02-25 15:20:46,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:46,439 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 261 transitions. [2019-02-25 15:20:46,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:20:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 261 transitions. [2019-02-25 15:20:46,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:20:46,440 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:46,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:20:46,440 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:46,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:46,440 INFO L82 PathProgramCache]: Analyzing trace with hash 29175642, now seen corresponding path program 2 times [2019-02-25 15:20:46,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:46,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:46,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:46,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:46,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:46,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:46,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:46,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:46,542 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:20:46,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:20:46,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:46,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:46,553 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:20:46,553 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:20:46,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:20:46,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:20:46,560 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:20:46,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:46,597 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:20:46,598 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:46,609 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:46,621 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:46,635 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:46,653 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:46,678 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:20:46,681 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:20:46,684 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:20:46,687 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:20:46,689 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:20:46,690 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:46,713 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:46,726 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:46,737 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:46,747 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:46,776 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:46,776 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-25 15:20:46,808 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:46,809 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:20:46,809 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:46,838 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:46,838 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 15:20:46,865 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:46,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:46,867 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:46,869 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:46,869 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:20:46,870 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:20:46,871 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:46,898 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:46,898 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:44 [2019-02-25 15:20:46,956 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:46,957 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:46,957 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:46,958 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:46,959 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:46,960 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:46,961 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:46,962 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:46,963 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 70 [2019-02-25 15:20:46,964 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:46,989 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:46,990 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-02-25 15:20:47,009 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:47,009 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:47,054 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:47,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:47,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:20:47,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:47,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:20:47,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:20:47,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:20:47,076 INFO L87 Difference]: Start difference. First operand 55 states and 261 transitions. Second operand 10 states. [2019-02-25 15:20:47,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:47,567 INFO L93 Difference]: Finished difference Result 88 states and 340 transitions. [2019-02-25 15:20:47,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:20:47,570 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:20:47,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:47,572 INFO L225 Difference]: With dead ends: 88 [2019-02-25 15:20:47,572 INFO L226 Difference]: Without dead ends: 83 [2019-02-25 15:20:47,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:20:47,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-25 15:20:47,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2019-02-25 15:20:47,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-25 15:20:47,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-02-25 15:20:47,591 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-02-25 15:20:47,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:47,591 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-02-25 15:20:47,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:20:47,591 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-02-25 15:20:47,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:20:47,592 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:47,592 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:20:47,592 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:47,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:47,592 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-02-25 15:20:47,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:47,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:47,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:20:47,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:47,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:47,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:47,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:47,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:47,841 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:20:47,841 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-02-25 15:20:47,843 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:20:47,843 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:20:47,847 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:20:47,847 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:20:47,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:47,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:20:47,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:47,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:47,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:47,860 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:20:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:47,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-25 15:20:47,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:47,868 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:20:47,873 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:20:47,879 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:47,881 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:47,882 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:20:47,896 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:47,899 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:47,901 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:47,901 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:20:47,912 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-25 15:20:47,912 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:47,926 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:47,940 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:47,949 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:47,958 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:47,983 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:20:47,984 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:47,989 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:47,998 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:48,015 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:48,016 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-25 15:20:48,102 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:48,103 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:20:48,103 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:48,112 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:48,112 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-25 15:20:48,128 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:48,129 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:48,130 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:48,131 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:48,131 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 15:20:48,132 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:48,142 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:48,142 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-02-25 15:20:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:48,156 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:48,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:48,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:48,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:20:48,222 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:48,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:20:48,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:20:48,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:20:48,222 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 8 states. [2019-02-25 15:20:48,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:48,487 INFO L93 Difference]: Finished difference Result 81 states and 298 transitions. [2019-02-25 15:20:48,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:20:48,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:20:48,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:48,489 INFO L225 Difference]: With dead ends: 81 [2019-02-25 15:20:48,490 INFO L226 Difference]: Without dead ends: 80 [2019-02-25 15:20:48,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:20:48,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-25 15:20:48,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2019-02-25 15:20:48,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-25 15:20:48,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-02-25 15:20:48,504 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-02-25 15:20:48,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:48,505 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-02-25 15:20:48,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:20:48,505 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-02-25 15:20:48,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:20:48,505 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:48,505 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:20:48,506 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:48,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:48,506 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-02-25 15:20:48,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:48,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:48,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:48,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:48,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:48,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:48,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:48,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:48,637 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:20:48,637 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-02-25 15:20:48,639 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:20:48,639 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:20:48,642 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:20:48,642 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:20:48,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:48,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:20:48,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:48,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:48,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:48,653 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:20:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:48,657 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:20:48,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:48,683 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:20:48,683 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:48,688 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:48,698 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:48,708 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:48,722 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:20:48,725 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:20:48,728 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:20:48,732 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:20:48,738 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:20:48,739 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:48,755 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:48,769 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:48,780 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:48,789 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:48,810 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:48,811 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-25 15:20:48,858 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:48,859 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:20:48,859 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:48,881 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:48,881 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:20:48,906 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:48,907 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:48,909 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:48,910 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:48,911 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:48,912 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:20:48,913 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:48,932 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:48,933 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-25 15:20:48,962 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:48,963 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:48,964 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:48,965 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:48,966 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:48,967 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:20:48,968 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:20:48,968 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:48,985 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:48,985 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:20:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:49,020 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:49,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:49,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:20:49,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:49,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:20:49,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:20:49,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:20:49,114 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 10 states. [2019-02-25 15:20:49,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:49,589 INFO L93 Difference]: Finished difference Result 113 states and 415 transitions. [2019-02-25 15:20:49,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:20:49,590 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:20:49,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:49,591 INFO L225 Difference]: With dead ends: 113 [2019-02-25 15:20:49,592 INFO L226 Difference]: Without dead ends: 112 [2019-02-25 15:20:49,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:20:49,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-02-25 15:20:49,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 60. [2019-02-25 15:20:49,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-02-25 15:20:49,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 267 transitions. [2019-02-25 15:20:49,611 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 267 transitions. Word has length 5 [2019-02-25 15:20:49,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:49,611 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 267 transitions. [2019-02-25 15:20:49,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:20:49,612 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 267 transitions. [2019-02-25 15:20:49,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:20:49,612 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:49,612 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:20:49,612 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:49,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:49,612 INFO L82 PathProgramCache]: Analyzing trace with hash 29242478, now seen corresponding path program 1 times [2019-02-25 15:20:49,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:49,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:49,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:49,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:49,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:49,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:49,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:49,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:49,767 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:20:49,767 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [23] [2019-02-25 15:20:49,773 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:20:49,773 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:20:49,777 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:20:49,778 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:20:49,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:49,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:20:49,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:49,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:49,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:49,790 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:20:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:49,807 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:20:49,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:49,811 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:20:49,817 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:49,817 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:20:49,823 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:49,827 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:49,827 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:20:49,853 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:49,862 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:49,863 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:49,864 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:20:49,880 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:20:49,880 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:49,911 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:49,934 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:49,949 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:49,965 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:50,002 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:20:50,002 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:50,017 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:50,032 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:50,051 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:50,075 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:50,076 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-25 15:20:50,126 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:50,167 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:20:50,168 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-25 15:20:50,351 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-02-25 15:20:50,351 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:183 [2019-02-25 15:20:50,456 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:50,457 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:50,457 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:50,458 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:50,458 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:20:50,459 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2019-02-25 15:20:50,459 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:50,522 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:50,524 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:50,525 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:50,526 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:50,527 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:50,528 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2019-02-25 15:20:50,528 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:50,591 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:50,592 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:50,593 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:50,594 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:50,596 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:50,597 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 53 [2019-02-25 15:20:50,597 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:50,651 INFO L301 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-25 15:20:50,652 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:96 [2019-02-25 15:20:52,715 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:52,716 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2019-02-25 15:20:52,716 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:52,766 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:52,768 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:52,769 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:52,770 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:52,771 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:52,772 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:52,773 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:52,773 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:20:52,774 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 15:20:52,775 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:52,828 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:52,829 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:52,830 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:52,831 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:52,832 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:52,833 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:52,834 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:52,835 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:52,836 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 15:20:52,837 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:52,880 INFO L301 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-25 15:20:52,880 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:88 [2019-02-25 15:20:52,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:52,974 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:52,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:53,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:53,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-02-25 15:20:53,011 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:53,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:20:53,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:20:53,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=78, Unknown=1, NotChecked=0, Total=132 [2019-02-25 15:20:53,012 INFO L87 Difference]: Start difference. First operand 60 states and 267 transitions. Second operand 10 states. [2019-02-25 15:20:53,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:53,780 INFO L93 Difference]: Finished difference Result 137 states and 516 transitions. [2019-02-25 15:20:53,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:20:53,781 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:20:53,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:53,782 INFO L225 Difference]: With dead ends: 137 [2019-02-25 15:20:53,782 INFO L226 Difference]: Without dead ends: 136 [2019-02-25 15:20:53,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=90, Invalid=149, Unknown=1, NotChecked=0, Total=240 [2019-02-25 15:20:53,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-02-25 15:20:53,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-02-25 15:20:53,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-25 15:20:53,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 468 transitions. [2019-02-25 15:20:53,812 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 468 transitions. Word has length 5 [2019-02-25 15:20:53,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:53,812 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 468 transitions. [2019-02-25 15:20:53,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:20:53,813 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 468 transitions. [2019-02-25 15:20:53,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:20:53,813 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:53,813 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:20:53,814 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:53,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:53,814 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-02-25 15:20:53,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:53,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:53,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:53,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:53,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:20:53,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:53,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:53,911 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:20:53,911 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-02-25 15:20:53,911 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:20:53,912 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:20:53,914 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:20:53,914 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:20:53,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:53,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:20:53,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:53,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:53,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:53,925 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:20:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:53,930 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:20:53,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:53,957 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:20:53,958 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:53,967 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:53,975 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:53,985 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:54,004 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:54,027 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:20:54,037 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:20:54,043 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:20:54,045 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:20:54,047 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:20:54,048 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:54,071 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:54,085 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:54,095 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:54,105 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:54,134 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:54,134 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-25 15:20:54,198 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:54,199 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:20:54,199 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:54,282 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:54,282 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:20:54,302 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:54,302 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:54,303 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:54,304 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:54,305 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:54,306 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:20:54,307 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:20:54,307 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:54,333 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:54,334 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-02-25 15:20:54,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:54,351 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:54,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:54,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:54,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:20:54,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:54,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:20:54,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:20:54,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:20:54,396 INFO L87 Difference]: Start difference. First operand 93 states and 468 transitions. Second operand 8 states. [2019-02-25 15:20:54,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:54,763 INFO L93 Difference]: Finished difference Result 120 states and 513 transitions. [2019-02-25 15:20:54,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:20:54,763 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:20:54,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:54,765 INFO L225 Difference]: With dead ends: 120 [2019-02-25 15:20:54,765 INFO L226 Difference]: Without dead ends: 119 [2019-02-25 15:20:54,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:20:54,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-25 15:20:54,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2019-02-25 15:20:54,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-25 15:20:54,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 486 transitions. [2019-02-25 15:20:54,805 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 486 transitions. Word has length 5 [2019-02-25 15:20:54,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:54,805 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 486 transitions. [2019-02-25 15:20:54,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:20:54,805 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 486 transitions. [2019-02-25 15:20:54,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:20:54,806 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:54,806 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:20:54,806 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:54,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:54,806 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-02-25 15:20:54,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:54,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:54,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:54,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:54,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:54,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:54,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:54,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:54,913 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:20:54,913 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-02-25 15:20:54,916 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:20:54,916 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:20:54,921 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:20:54,921 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:20:54,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:54,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:20:54,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:54,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:54,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:54,930 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:20:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:54,937 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:20:54,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:54,941 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:20:54,945 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:20:54,949 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:54,950 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:54,951 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:20:54,958 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:54,960 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:54,962 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:54,963 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:20:54,968 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:54,973 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:54,975 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:54,977 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:54,978 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:20:54,978 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:55,019 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:55,036 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:55,051 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:55,065 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:55,109 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:20:55,109 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:55,121 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:55,129 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:55,145 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:55,173 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:55,173 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-25 15:20:55,190 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:55,191 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:20:55,191 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:55,216 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:55,216 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-02-25 15:20:55,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:55,238 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:55,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:55,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:20:55,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-25 15:20:55,261 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:20:55,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:20:55,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:20:55,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:20:55,261 INFO L87 Difference]: Start difference. First operand 96 states and 486 transitions. Second operand 4 states. [2019-02-25 15:20:55,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:55,394 INFO L93 Difference]: Finished difference Result 105 states and 515 transitions. [2019-02-25 15:20:55,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:20:55,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-25 15:20:55,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:55,396 INFO L225 Difference]: With dead ends: 105 [2019-02-25 15:20:55,396 INFO L226 Difference]: Without dead ends: 104 [2019-02-25 15:20:55,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:20:55,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-02-25 15:20:55,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-02-25 15:20:55,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-25 15:20:55,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 513 transitions. [2019-02-25 15:20:55,441 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 513 transitions. Word has length 5 [2019-02-25 15:20:55,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:55,441 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 513 transitions. [2019-02-25 15:20:55,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:20:55,441 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 513 transitions. [2019-02-25 15:20:55,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:20:55,442 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:55,442 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:20:55,443 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:55,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:55,443 INFO L82 PathProgramCache]: Analyzing trace with hash 29235162, now seen corresponding path program 3 times [2019-02-25 15:20:55,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:55,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:55,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:55,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:55,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:55,985 WARN L181 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2019-02-25 15:20:56,431 WARN L181 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-02-25 15:20:56,626 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-25 15:20:56,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:56,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:56,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:56,822 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:20:56,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:20:56,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:56,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:56,839 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:20:56,839 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:20:56,857 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:20:56,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:20:56,858 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:20:56,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:56,874 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:20:56,906 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:56,907 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:20:56,912 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:56,913 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:56,914 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:20:56,916 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:56,917 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:56,918 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:56,918 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:20:56,926 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:20:56,926 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:56,945 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:56,965 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:56,975 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:56,986 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:57,017 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:20:57,017 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:57,023 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:57,028 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:57,039 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:57,059 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:57,059 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-25 15:20:57,258 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:57,259 INFO L292 Elim1Store]: Index analysis took 176 ms [2019-02-25 15:20:57,309 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:20:57,314 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-25 15:20:57,631 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-02-25 15:20:57,632 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:183 [2019-02-25 15:20:57,759 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-02-25 15:20:57,799 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:57,800 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:57,801 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:57,802 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:57,802 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:57,803 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 49 [2019-02-25 15:20:57,803 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:57,884 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:57,885 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:57,886 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:57,887 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:57,889 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:57,889 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2019-02-25 15:20:57,890 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:57,966 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:57,967 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:57,969 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:57,970 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:57,971 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:57,971 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2019-02-25 15:20:57,972 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:58,039 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:58,040 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:58,042 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:58,042 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:20:58,043 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2019-02-25 15:20:58,044 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:58,100 INFO L301 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-02-25 15:20:58,100 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:173, output treesize:121 [2019-02-25 15:20:58,175 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:58,176 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 57 [2019-02-25 15:20:58,177 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:58,255 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:58,256 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:58,257 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:58,258 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:58,260 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:58,261 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:58,262 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:58,262 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:20:58,263 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 51 [2019-02-25 15:20:58,264 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:58,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:58,339 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:58,340 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:58,341 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:58,342 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:58,343 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:58,343 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:20:58,344 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 15:20:58,345 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:58,418 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:58,419 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:58,420 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:58,421 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:58,423 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:58,424 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:58,424 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:20:58,425 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 15:20:58,426 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:58,488 INFO L301 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-02-25 15:20:58,488 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:123 [2019-02-25 15:20:58,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:58,574 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:58,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:58,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:58,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:20:58,634 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:58,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:20:58,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:20:58,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:20:58,635 INFO L87 Difference]: Start difference. First operand 103 states and 513 transitions. Second operand 10 states. [2019-02-25 15:20:59,036 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-02-25 15:20:59,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:59,292 INFO L93 Difference]: Finished difference Result 131 states and 560 transitions. [2019-02-25 15:20:59,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:20:59,292 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:20:59,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:59,293 INFO L225 Difference]: With dead ends: 131 [2019-02-25 15:20:59,294 INFO L226 Difference]: Without dead ends: 130 [2019-02-25 15:20:59,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:20:59,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-02-25 15:20:59,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 41. [2019-02-25 15:20:59,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-25 15:20:59,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 140 transitions. [2019-02-25 15:20:59,321 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 140 transitions. Word has length 5 [2019-02-25 15:20:59,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:59,321 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 140 transitions. [2019-02-25 15:20:59,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:20:59,321 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 140 transitions. [2019-02-25 15:20:59,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:20:59,322 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:59,322 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:20:59,322 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:59,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:59,322 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-02-25 15:20:59,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:59,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:59,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:20:59,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:59,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:59,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:59,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:59,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:59,460 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:20:59,461 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-02-25 15:20:59,462 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:20:59,462 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:20:59,465 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:20:59,466 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:20:59,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:59,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:20:59,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:59,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:59,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:59,475 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:20:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:59,495 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:20:59,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:59,513 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:20:59,529 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:20:59,533 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:59,534 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:59,535 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:20:59,538 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:59,539 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:59,540 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:59,541 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:20:59,545 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:59,548 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:59,549 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:59,550 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:59,551 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:20:59,551 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:59,577 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:59,591 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:59,602 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:59,613 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:59,644 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:20:59,645 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:59,653 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:59,666 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:59,681 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:59,709 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:59,709 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:20:59,795 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:59,796 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:20:59,796 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:59,858 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:59,859 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:20:59,901 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:59,902 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:59,902 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:59,903 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:59,905 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:20:59,905 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:20:59,906 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:20:59,907 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:59,930 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:20:59,931 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-02-25 15:20:59,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:59,949 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:59,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:59,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:59,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:20:59,993 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:59,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:20:59,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:20:59,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:20:59,994 INFO L87 Difference]: Start difference. First operand 41 states and 140 transitions. Second operand 8 states. [2019-02-25 15:21:00,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:00,446 INFO L93 Difference]: Finished difference Result 71 states and 187 transitions. [2019-02-25 15:21:00,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:21:00,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:21:00,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:00,447 INFO L225 Difference]: With dead ends: 71 [2019-02-25 15:21:00,448 INFO L226 Difference]: Without dead ends: 68 [2019-02-25 15:21:00,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:21:00,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-25 15:21:00,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2019-02-25 15:21:00,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-25 15:21:00,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 160 transitions. [2019-02-25 15:21:00,475 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 160 transitions. Word has length 5 [2019-02-25 15:21:00,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:00,475 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 160 transitions. [2019-02-25 15:21:00,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:21:00,475 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 160 transitions. [2019-02-25 15:21:00,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:21:00,476 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:00,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:21:00,476 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:00,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:00,476 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-02-25 15:21:00,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:00,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:00,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:00,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:00,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:00,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:21:00,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:00,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:00,669 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:21:00,670 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-02-25 15:21:00,672 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:21:00,672 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:21:00,675 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:21:00,676 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:21:00,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:00,676 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:21:00,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:00,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:00,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:00,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:00,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:21:00,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:00,704 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:21:00,705 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:00,711 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:00,721 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:00,730 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:00,745 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:21:00,748 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:21:00,751 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:21:00,753 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:21:00,760 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:21:00,760 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:00,777 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:00,791 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:00,803 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:00,813 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:00,842 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:00,842 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-25 15:21:00,888 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:00,889 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:21:00,889 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:00,905 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:00,906 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-25 15:21:00,920 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:00,921 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:00,922 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:00,923 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:00,924 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:00,925 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:21:00,925 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:00,943 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:00,943 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-25 15:21:00,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:00,957 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:00,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:00,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:00,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:21:00,988 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:00,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:21:00,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:21:00,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:21:00,989 INFO L87 Difference]: Start difference. First operand 46 states and 160 transitions. Second operand 8 states. [2019-02-25 15:21:01,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:01,252 INFO L93 Difference]: Finished difference Result 73 states and 194 transitions. [2019-02-25 15:21:01,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:21:01,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:21:01,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:01,254 INFO L225 Difference]: With dead ends: 73 [2019-02-25 15:21:01,254 INFO L226 Difference]: Without dead ends: 72 [2019-02-25 15:21:01,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:21:01,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-25 15:21:01,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 47. [2019-02-25 15:21:01,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-25 15:21:01,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 166 transitions. [2019-02-25 15:21:01,285 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 166 transitions. Word has length 5 [2019-02-25 15:21:01,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:01,285 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 166 transitions. [2019-02-25 15:21:01,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:21:01,286 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 166 transitions. [2019-02-25 15:21:01,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:21:01,286 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:01,286 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:21:01,286 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:01,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:01,286 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-02-25 15:21:01,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:01,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:01,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:01,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:01,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:01,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:01,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:01,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:01,363 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:21:01,363 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-02-25 15:21:01,364 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:21:01,364 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:21:01,366 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:21:01,366 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:21:01,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:01,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:21:01,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:01,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:01,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:01,379 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:01,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:21:01,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:01,387 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:21:01,390 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:01,391 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:21:01,395 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:01,397 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:01,397 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:21:01,403 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:01,405 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:01,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:01,407 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:21:01,424 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:21:01,425 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:01,444 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:01,460 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:01,472 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:01,483 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:01,514 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:21:01,514 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:01,521 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:01,550 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:01,559 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:01,580 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:01,581 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-25 15:21:01,613 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:01,614 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:21:01,614 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:01,631 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:01,631 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:21:01,693 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:01,716 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:01,738 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:01,753 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:01,753 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:21:01,754 INFO L292 Elim1Store]: Index analysis took 105 ms [2019-02-25 15:21:01,754 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:21:01,754 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:01,771 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:01,771 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-25 15:21:01,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:01,787 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:01,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:01,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:01,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-02-25 15:21:01,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:01,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:21:01,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:21:01,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:21:01,831 INFO L87 Difference]: Start difference. First operand 47 states and 166 transitions. Second operand 9 states. [2019-02-25 15:21:02,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:02,063 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-02-25 15:21:02,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:21:02,064 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-25 15:21:02,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:02,065 INFO L225 Difference]: With dead ends: 66 [2019-02-25 15:21:02,065 INFO L226 Difference]: Without dead ends: 65 [2019-02-25 15:21:02,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:21:02,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-25 15:21:02,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2019-02-25 15:21:02,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-25 15:21:02,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 172 transitions. [2019-02-25 15:21:02,096 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 172 transitions. Word has length 5 [2019-02-25 15:21:02,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:02,097 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 172 transitions. [2019-02-25 15:21:02,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:21:02,097 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 172 transitions. [2019-02-25 15:21:02,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:21:02,097 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:02,098 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:21:02,098 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:02,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:02,098 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-02-25 15:21:02,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:02,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:02,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:02,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:02,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:02,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:21:02,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:21:02,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-25 15:21:02,157 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:21:02,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:21:02,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:21:02,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:21:02,157 INFO L87 Difference]: Start difference. First operand 48 states and 172 transitions. Second operand 4 states. [2019-02-25 15:21:02,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:02,225 INFO L93 Difference]: Finished difference Result 54 states and 182 transitions. [2019-02-25 15:21:02,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:21:02,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-25 15:21:02,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:02,226 INFO L225 Difference]: With dead ends: 54 [2019-02-25 15:21:02,227 INFO L226 Difference]: Without dead ends: 51 [2019-02-25 15:21:02,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:21:02,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-25 15:21:02,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-02-25 15:21:02,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-25 15:21:02,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 175 transitions. [2019-02-25 15:21:02,262 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 175 transitions. Word has length 5 [2019-02-25 15:21:02,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:02,262 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 175 transitions. [2019-02-25 15:21:02,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:21:02,263 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 175 transitions. [2019-02-25 15:21:02,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:21:02,263 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:02,263 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:21:02,263 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:02,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:02,263 INFO L82 PathProgramCache]: Analyzing trace with hash 28941284, now seen corresponding path program 1 times [2019-02-25 15:21:02,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:02,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:02,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:02,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:02,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:02,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:02,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:02,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:02,358 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:21:02,358 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-02-25 15:21:02,360 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:21:02,360 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:21:02,362 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:21:02,362 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:21:02,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:02,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:21:02,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:02,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:02,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:02,373 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:02,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-25 15:21:02,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:02,395 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:21:02,396 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:02,400 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:02,410 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:02,423 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:21:02,427 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:21:02,430 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:21:02,435 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:21:02,449 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-25 15:21:02,450 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:02,466 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:02,478 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:02,487 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:02,497 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:02,516 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:02,516 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-02-25 15:21:02,545 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:02,553 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:21:02,554 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:21:02,611 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-25 15:21:02,611 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:58 [2019-02-25 15:21:02,639 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:02,639 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:02,640 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:02,640 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 15:21:02,641 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:02,653 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:02,653 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-02-25 15:21:02,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:02,665 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:02,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:02,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:02,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:21:02,695 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:02,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:21:02,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:21:02,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:21:02,696 INFO L87 Difference]: Start difference. First operand 47 states and 175 transitions. Second operand 8 states. [2019-02-25 15:21:02,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:02,937 INFO L93 Difference]: Finished difference Result 83 states and 276 transitions. [2019-02-25 15:21:02,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:21:02,937 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:21:02,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:02,939 INFO L225 Difference]: With dead ends: 83 [2019-02-25 15:21:02,939 INFO L226 Difference]: Without dead ends: 82 [2019-02-25 15:21:02,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:21:02,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-25 15:21:02,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-02-25 15:21:02,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-25 15:21:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 241 transitions. [2019-02-25 15:21:02,982 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 241 transitions. Word has length 5 [2019-02-25 15:21:02,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:02,982 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 241 transitions. [2019-02-25 15:21:02,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:21:02,982 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 241 transitions. [2019-02-25 15:21:02,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:21:02,983 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:02,983 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-25 15:21:02,983 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:02,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:02,984 INFO L82 PathProgramCache]: Analyzing trace with hash 904687194, now seen corresponding path program 1 times [2019-02-25 15:21:02,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:02,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:02,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:02,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:02,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:03,138 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-02-25 15:21:03,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:21:03,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:03,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:03,153 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:21:03,153 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-02-25 15:21:03,154 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:21:03,154 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:21:03,157 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:21:03,157 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:21:03,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:03,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:21:03,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:03,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:03,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:03,169 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:03,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-25 15:21:03,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:03,192 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:21:03,192 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:03,203 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:03,217 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:03,234 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:21:03,240 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:21:03,244 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:21:03,282 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:21:03,294 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-25 15:21:03,294 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:03,310 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:03,322 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:03,331 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:03,340 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:03,359 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:03,359 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-02-25 15:21:03,384 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:03,385 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:21:03,385 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:03,394 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:03,394 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-25 15:21:03,408 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:03,409 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:03,409 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:03,410 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:03,411 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2019-02-25 15:21:03,411 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:03,422 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:03,422 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:20 [2019-02-25 15:21:03,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:03,437 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:03,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:03,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:03,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:21:03,479 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:03,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:21:03,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:21:03,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:21:03,480 INFO L87 Difference]: Start difference. First operand 58 states and 241 transitions. Second operand 8 states. [2019-02-25 15:21:03,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:03,937 INFO L93 Difference]: Finished difference Result 86 states and 325 transitions. [2019-02-25 15:21:03,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:21:03,937 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:21:03,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:03,939 INFO L225 Difference]: With dead ends: 86 [2019-02-25 15:21:03,939 INFO L226 Difference]: Without dead ends: 85 [2019-02-25 15:21:03,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:21:03,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-25 15:21:03,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 66. [2019-02-25 15:21:03,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-25 15:21:03,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 289 transitions. [2019-02-25 15:21:03,997 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 289 transitions. Word has length 6 [2019-02-25 15:21:03,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:03,998 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 289 transitions. [2019-02-25 15:21:03,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:21:03,998 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 289 transitions. [2019-02-25 15:21:03,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:21:03,998 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:03,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:21:03,999 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:03,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:03,999 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-02-25 15:21:03,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:03,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:03,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:03,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:04,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:04,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:21:04,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:04,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:04,114 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:21:04,114 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-02-25 15:21:04,118 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:21:04,118 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:21:04,120 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:21:04,121 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:21:04,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:04,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:21:04,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:04,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:04,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:04,134 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:04,139 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:21:04,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:04,159 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:21:04,159 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:04,183 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:04,194 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:04,207 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:04,225 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:04,248 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:21:04,253 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:21:04,255 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:21:04,258 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:21:04,260 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:21:04,261 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:04,283 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:04,296 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:04,306 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:04,315 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:04,346 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:04,347 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-25 15:21:04,381 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:04,382 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:21:04,382 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:04,414 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:04,414 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 15:21:04,440 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:04,441 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:04,441 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:04,442 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:04,444 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:04,445 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:04,445 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:21:04,446 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:04,474 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:04,474 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-02-25 15:21:04,496 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:04,497 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:04,497 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:04,498 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:04,499 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:04,500 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:04,501 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:04,502 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:04,503 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:21:04,504 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:21:04,504 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:04,532 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:04,532 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-25 15:21:04,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:04,553 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:04,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:04,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:04,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:21:04,609 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:04,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:21:04,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:21:04,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:21:04,610 INFO L87 Difference]: Start difference. First operand 66 states and 289 transitions. Second operand 10 states. [2019-02-25 15:21:07,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:07,282 INFO L93 Difference]: Finished difference Result 100 states and 357 transitions. [2019-02-25 15:21:07,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:21:07,283 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:21:07,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:07,284 INFO L225 Difference]: With dead ends: 100 [2019-02-25 15:21:07,284 INFO L226 Difference]: Without dead ends: 99 [2019-02-25 15:21:07,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:21:07,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-25 15:21:07,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 68. [2019-02-25 15:21:07,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-25 15:21:07,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 301 transitions. [2019-02-25 15:21:07,354 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 301 transitions. Word has length 6 [2019-02-25 15:21:07,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:07,355 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 301 transitions. [2019-02-25 15:21:07,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:21:07,355 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 301 transitions. [2019-02-25 15:21:07,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:21:07,355 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:07,355 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:21:07,356 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:07,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:07,356 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-02-25 15:21:07,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:07,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:07,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:07,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:07,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:07,505 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-25 15:21:07,892 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:07,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:07,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:07,893 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:21:07,893 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-02-25 15:21:07,894 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:21:07,894 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:21:07,897 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:21:07,897 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:21:07,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:07,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:21:07,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:07,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:07,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:07,910 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:07,914 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:21:07,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:07,939 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:21:07,939 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:07,949 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:07,963 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:07,983 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:08,007 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:21:08,010 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:21:08,012 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:21:08,015 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:21:08,018 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:21:08,018 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:08,039 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:08,052 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:08,062 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:08,072 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:08,098 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:08,098 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-25 15:21:08,146 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:08,146 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:21:08,147 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:08,164 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:08,164 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:21:08,223 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:08,246 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:08,253 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:08,256 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:08,257 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:08,257 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:21:08,257 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:08,273 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:08,273 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-25 15:21:08,293 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:08,294 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:08,295 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:08,295 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:08,296 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:08,297 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:08,298 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:21:08,299 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:21:08,299 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:08,315 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:08,315 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:21:08,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:08,331 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:08,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:08,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:08,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:21:08,386 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:08,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:21:08,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:21:08,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:21:08,387 INFO L87 Difference]: Start difference. First operand 68 states and 301 transitions. Second operand 10 states. [2019-02-25 15:21:08,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:08,848 INFO L93 Difference]: Finished difference Result 104 states and 381 transitions. [2019-02-25 15:21:08,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:21:08,849 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:21:08,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:08,850 INFO L225 Difference]: With dead ends: 104 [2019-02-25 15:21:08,850 INFO L226 Difference]: Without dead ends: 103 [2019-02-25 15:21:08,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:21:08,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-25 15:21:08,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 74. [2019-02-25 15:21:08,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-25 15:21:08,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-02-25 15:21:08,955 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-02-25 15:21:08,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:08,955 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-02-25 15:21:08,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:21:08,955 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-02-25 15:21:08,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:21:08,956 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:08,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:21:08,956 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:08,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:08,956 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-02-25 15:21:08,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:08,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:08,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:08,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:08,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:09,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:21:09,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:09,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:09,027 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:21:09,028 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-02-25 15:21:09,029 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:21:09,029 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:21:09,031 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:21:09,031 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:21:09,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:09,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:21:09,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:09,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:09,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:09,041 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:09,046 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:21:09,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:09,072 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:21:09,072 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:09,086 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:09,091 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:09,101 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:09,115 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:21:09,118 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:21:09,135 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:21:09,140 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:21:09,145 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:21:09,145 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:09,162 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:09,176 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:09,187 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:09,196 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:09,217 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:09,218 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-25 15:21:09,261 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:09,262 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:21:09,262 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:09,279 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:09,279 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:21:09,302 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:09,302 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:09,303 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:09,304 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:09,305 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:09,306 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:21:09,306 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:09,324 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:09,324 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-25 15:21:09,348 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:09,349 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:09,350 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:09,350 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:09,351 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:09,352 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:09,353 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:21:09,354 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:21:09,354 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:09,370 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:09,370 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:21:09,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:09,388 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:09,424 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:09,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:09,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:21:09,442 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:09,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:21:09,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:21:09,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:21:09,443 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 10 states. [2019-02-25 15:21:10,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:10,001 INFO L93 Difference]: Finished difference Result 107 states and 399 transitions. [2019-02-25 15:21:10,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:21:10,002 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:21:10,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:10,003 INFO L225 Difference]: With dead ends: 107 [2019-02-25 15:21:10,004 INFO L226 Difference]: Without dead ends: 106 [2019-02-25 15:21:10,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:21:10,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-25 15:21:10,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 74. [2019-02-25 15:21:10,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-25 15:21:10,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-02-25 15:21:10,116 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-02-25 15:21:10,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:10,116 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-02-25 15:21:10,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:21:10,117 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-02-25 15:21:10,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:21:10,117 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:10,117 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:21:10,118 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:10,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:10,118 INFO L82 PathProgramCache]: Analyzing trace with hash 906534236, now seen corresponding path program 1 times [2019-02-25 15:21:10,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:10,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:10,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:10,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:10,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:10,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:10,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:10,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:10,263 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:21:10,263 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-02-25 15:21:10,264 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:21:10,264 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:21:10,267 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:21:10,267 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:21:10,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:10,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:21:10,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:10,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:10,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:10,278 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:10,282 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:21:10,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:10,287 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:21:10,290 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:21:10,296 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:10,298 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:10,298 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:21:10,308 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:10,310 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:10,311 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:10,311 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:21:10,314 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:10,320 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:10,322 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:10,324 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:10,324 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:21:10,325 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:10,364 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:10,388 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:10,400 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:10,414 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:10,464 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:21:10,464 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:10,478 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:10,492 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:10,510 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:10,543 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:10,543 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:21:10,591 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:10,591 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:21:10,592 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:10,614 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:10,615 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:21:10,640 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:10,643 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:10,645 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:10,647 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:10,649 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:10,649 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:21:10,650 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:10,674 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:10,675 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-25 15:21:10,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:10,703 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:10,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:10,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:10,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:21:10,740 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:10,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:21:10,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:21:10,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:21:10,741 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 8 states. [2019-02-25 15:21:11,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:11,118 INFO L93 Difference]: Finished difference Result 100 states and 371 transitions. [2019-02-25 15:21:11,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:21:11,119 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:21:11,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:11,120 INFO L225 Difference]: With dead ends: 100 [2019-02-25 15:21:11,120 INFO L226 Difference]: Without dead ends: 98 [2019-02-25 15:21:11,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:21:11,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-25 15:21:11,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 75. [2019-02-25 15:21:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-25 15:21:11,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 343 transitions. [2019-02-25 15:21:11,225 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 343 transitions. Word has length 6 [2019-02-25 15:21:11,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:11,225 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 343 transitions. [2019-02-25 15:21:11,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:21:11,225 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 343 transitions. [2019-02-25 15:21:11,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:21:11,226 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:11,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:21:11,226 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:11,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:11,226 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-02-25 15:21:11,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:11,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:11,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:11,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:11,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:11,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:11,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:11,312 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:11,312 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:21:11,312 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-02-25 15:21:11,314 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:21:11,314 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:21:11,316 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:21:11,316 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:21:11,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:11,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:21:11,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:11,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:11,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:11,325 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:11,330 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:21:11,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:11,356 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:21:11,357 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:11,368 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:11,379 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:11,391 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:11,411 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:21:11,413 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:21:11,415 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:21:11,417 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:21:11,424 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:21:11,424 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:11,440 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:11,453 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:11,464 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:11,474 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:11,494 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:11,494 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-25 15:21:11,522 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:11,551 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:21:11,554 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-25 15:21:11,720 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-02-25 15:21:11,720 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:183 [2019-02-25 15:21:11,851 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:11,874 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:11,898 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:11,903 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:11,903 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:21:11,904 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 53 [2019-02-25 15:21:11,904 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:12,002 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:12,003 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:12,004 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:12,005 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:12,006 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:12,007 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 49 [2019-02-25 15:21:12,007 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:12,063 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:12,064 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:12,065 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:12,066 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:12,067 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:21:12,068 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 49 [2019-02-25 15:21:12,068 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:12,116 INFO L301 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-25 15:21:12,116 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:92 [2019-02-25 15:21:12,174 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:12,174 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:12,175 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:12,176 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:12,177 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:12,178 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:12,178 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 49 [2019-02-25 15:21:12,179 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:12,234 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:12,236 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:12,237 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:12,238 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:12,239 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:12,240 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2019-02-25 15:21:12,240 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:12,289 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:12,290 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:12,291 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:12,292 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:12,293 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:21:12,294 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 45 [2019-02-25 15:21:12,294 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:12,342 INFO L301 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-25 15:21:12,342 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:122, output treesize:84 [2019-02-25 15:21:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:12,391 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:12,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:12,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:21:12,469 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:12,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:21:12,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:21:12,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:21:12,470 INFO L87 Difference]: Start difference. First operand 75 states and 343 transitions. Second operand 10 states. [2019-02-25 15:21:13,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:13,525 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-02-25 15:21:13,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:21:13,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:21:13,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:13,527 INFO L225 Difference]: With dead ends: 124 [2019-02-25 15:21:13,527 INFO L226 Difference]: Without dead ends: 123 [2019-02-25 15:21:13,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:21:13,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-02-25 15:21:13,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 78. [2019-02-25 15:21:13,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-25 15:21:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 361 transitions. [2019-02-25 15:21:13,642 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 361 transitions. Word has length 6 [2019-02-25 15:21:13,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:13,642 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 361 transitions. [2019-02-25 15:21:13,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:21:13,642 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 361 transitions. [2019-02-25 15:21:13,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:21:13,643 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:13,643 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:21:13,643 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:13,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:13,643 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-02-25 15:21:13,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:13,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:13,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:13,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:13,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:13,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:21:13,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:13,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:13,735 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:21:13,735 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-02-25 15:21:13,737 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:21:13,737 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:21:13,740 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:21:13,740 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:21:13,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:13,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:21:13,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:13,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:13,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:13,751 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:13,759 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:21:13,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:13,768 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:21:13,773 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:13,774 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:21:13,776 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:13,779 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:13,780 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:21:13,786 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:13,789 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:13,792 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:13,792 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:21:13,798 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:13,799 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:13,799 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:13,800 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:13,801 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:21:13,801 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:13,826 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:13,839 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:13,850 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:13,861 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:13,902 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:21:13,903 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:13,911 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:13,920 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:13,932 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:13,949 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:13,979 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:13,979 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-25 15:21:14,008 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:14,009 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:21:14,009 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:14,035 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:14,035 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 15:21:14,101 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:14,124 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:14,145 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:14,168 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:14,192 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:14,205 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:21:14,205 INFO L292 Elim1Store]: Index analysis took 147 ms [2019-02-25 15:21:14,206 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:21:14,206 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:14,246 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:14,247 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-02-25 15:21:14,270 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:14,271 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:14,272 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:14,273 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:14,274 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:14,276 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:14,277 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:14,277 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:21:14,278 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:21:14,279 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:14,304 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:14,304 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-25 15:21:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:14,325 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:14,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:14,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-25 15:21:14,381 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:14,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:21:14,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:21:14,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:21:14,381 INFO L87 Difference]: Start difference. First operand 78 states and 361 transitions. Second operand 9 states. [2019-02-25 15:21:14,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:14,914 INFO L93 Difference]: Finished difference Result 114 states and 434 transitions. [2019-02-25 15:21:14,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:21:14,915 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-25 15:21:14,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:14,916 INFO L225 Difference]: With dead ends: 114 [2019-02-25 15:21:14,917 INFO L226 Difference]: Without dead ends: 113 [2019-02-25 15:21:14,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:21:14,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-25 15:21:15,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 84. [2019-02-25 15:21:15,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-25 15:21:15,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 397 transitions. [2019-02-25 15:21:15,063 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 397 transitions. Word has length 6 [2019-02-25 15:21:15,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:15,063 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 397 transitions. [2019-02-25 15:21:15,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:21:15,063 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 397 transitions. [2019-02-25 15:21:15,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:21:15,063 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:15,063 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:21:15,064 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:15,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:15,064 INFO L82 PathProgramCache]: Analyzing trace with hash 906278546, now seen corresponding path program 2 times [2019-02-25 15:21:15,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:15,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:15,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:15,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:15,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:15,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:15,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:15,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:15,154 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:21:15,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:21:15,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:15,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:15,163 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:21:15,163 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:21:15,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:21:15,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:21:15,173 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:21:15,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:15,177 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:21:15,184 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:15,184 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:21:15,187 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:15,189 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:15,190 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:21:15,198 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:15,201 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:15,204 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:15,204 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:21:15,208 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:15,210 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:15,212 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:15,215 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:15,215 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:21:15,216 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:15,241 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:15,256 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:15,269 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:15,280 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:15,321 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:21:15,321 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:15,338 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:15,348 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:15,362 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:15,379 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:15,405 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:15,406 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-25 15:21:15,431 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:15,431 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:21:15,432 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:15,470 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:15,470 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:21:15,488 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:15,489 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:15,490 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:15,490 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:15,491 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:15,492 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:15,493 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:21:15,493 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:15,521 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:15,521 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-02-25 15:21:15,542 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:15,543 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:15,543 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:15,545 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:15,546 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:15,547 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:15,548 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:15,549 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:15,549 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:21:15,550 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:21:15,551 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:15,581 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:15,581 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-25 15:21:15,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:15,599 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:15,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:15,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:15,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:21:15,642 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:15,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:21:15,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:21:15,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:21:15,642 INFO L87 Difference]: Start difference. First operand 84 states and 397 transitions. Second operand 10 states. [2019-02-25 15:21:16,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:16,222 INFO L93 Difference]: Finished difference Result 164 states and 664 transitions. [2019-02-25 15:21:16,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:21:16,222 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:21:16,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:16,224 INFO L225 Difference]: With dead ends: 164 [2019-02-25 15:21:16,225 INFO L226 Difference]: Without dead ends: 163 [2019-02-25 15:21:16,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:21:16,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-02-25 15:21:16,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 117. [2019-02-25 15:21:16,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-02-25 15:21:16,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 595 transitions. [2019-02-25 15:21:16,578 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 595 transitions. Word has length 6 [2019-02-25 15:21:16,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:16,579 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 595 transitions. [2019-02-25 15:21:16,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:21:16,579 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 595 transitions. [2019-02-25 15:21:16,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:21:16,580 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:16,580 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:21:16,580 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:16,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:16,581 INFO L82 PathProgramCache]: Analyzing trace with hash 906295908, now seen corresponding path program 1 times [2019-02-25 15:21:16,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:16,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:16,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:21:16,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:16,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:16,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:21:16,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:16,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:16,703 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:21:16,703 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-02-25 15:21:16,704 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:21:16,704 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:21:16,706 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:21:16,706 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:21:16,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:16,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:21:16,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:16,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:16,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:16,718 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:16,722 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:21:16,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:16,751 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:21:16,751 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:16,780 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:16,798 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:16,813 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:16,834 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:21:16,837 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:21:16,840 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:21:16,842 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:21:16,846 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:21:16,846 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:16,871 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:16,883 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:16,893 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:16,902 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:16,929 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:16,930 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:21:16,952 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:16,953 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:21:16,953 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:16,979 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:16,979 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:21:16,997 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:16,998 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:16,999 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:17,000 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:17,002 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:17,003 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:17,012 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:21:17,013 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:21:17,090 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:21:17,091 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:68 [2019-02-25 15:21:17,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:17,121 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:17,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:17,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:17,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:21:17,161 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:17,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:21:17,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:21:17,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:21:17,162 INFO L87 Difference]: Start difference. First operand 117 states and 595 transitions. Second operand 8 states. [2019-02-25 15:21:17,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:17,640 INFO L93 Difference]: Finished difference Result 160 states and 722 transitions. [2019-02-25 15:21:17,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:21:17,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:21:17,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:17,643 INFO L225 Difference]: With dead ends: 160 [2019-02-25 15:21:17,643 INFO L226 Difference]: Without dead ends: 159 [2019-02-25 15:21:17,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:21:17,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-02-25 15:21:17,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2019-02-25 15:21:17,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-02-25 15:21:17,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 697 transitions. [2019-02-25 15:21:17,872 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 697 transitions. Word has length 6 [2019-02-25 15:21:17,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:17,872 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 697 transitions. [2019-02-25 15:21:17,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:21:17,872 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 697 transitions. [2019-02-25 15:21:17,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:21:17,873 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:17,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:21:17,873 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:17,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:17,874 INFO L82 PathProgramCache]: Analyzing trace with hash 893604942, now seen corresponding path program 1 times [2019-02-25 15:21:17,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:17,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:17,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:17,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:17,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:17,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:21:17,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:17,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:17,942 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:21:17,942 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-02-25 15:21:17,943 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:21:17,943 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:21:17,945 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:21:17,946 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:21:17,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:17,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:21:17,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:17,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:17,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:17,955 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:17,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-25 15:21:17,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:17,968 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:21:17,973 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:21:17,980 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:17,982 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:17,982 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:21:17,987 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:17,989 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:17,990 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:17,991 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:21:18,009 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-25 15:21:18,009 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:18,031 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:18,043 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:18,054 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:18,063 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:18,088 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:21:18,089 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:18,094 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:18,103 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:18,122 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:18,123 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-25 15:21:18,154 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:18,154 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:21:18,154 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:18,163 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:18,164 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-25 15:21:18,178 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:18,179 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:18,180 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:18,181 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:18,181 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:21:18,182 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:18,192 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:18,192 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-02-25 15:21:18,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:18,204 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:18,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:18,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:18,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:21:18,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:18,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:21:18,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:21:18,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:21:18,241 INFO L87 Difference]: Start difference. First operand 134 states and 697 transitions. Second operand 8 states. [2019-02-25 15:21:19,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:19,046 INFO L93 Difference]: Finished difference Result 175 states and 783 transitions. [2019-02-25 15:21:19,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:21:19,047 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:21:19,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:19,049 INFO L225 Difference]: With dead ends: 175 [2019-02-25 15:21:19,049 INFO L226 Difference]: Without dead ends: 174 [2019-02-25 15:21:19,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:21:19,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-02-25 15:21:19,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 132. [2019-02-25 15:21:19,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-02-25 15:21:19,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-02-25 15:21:19,279 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-02-25 15:21:19,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:19,279 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-02-25 15:21:19,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:21:19,279 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-02-25 15:21:19,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:21:19,280 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:19,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:21:19,280 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:19,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:19,280 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-02-25 15:21:19,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:19,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:19,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:19,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:19,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:19,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:21:19,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:21:19,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-25 15:21:19,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:21:19,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-25 15:21:19,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-25 15:21:19,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-02-25 15:21:19,415 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 5 states. [2019-02-25 15:21:19,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:19,772 INFO L93 Difference]: Finished difference Result 185 states and 858 transitions. [2019-02-25 15:21:19,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:21:19,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-02-25 15:21:19,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:19,774 INFO L225 Difference]: With dead ends: 185 [2019-02-25 15:21:19,774 INFO L226 Difference]: Without dead ends: 184 [2019-02-25 15:21:19,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:21:19,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-02-25 15:21:19,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 132. [2019-02-25 15:21:19,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-02-25 15:21:19,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-02-25 15:21:19,989 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-02-25 15:21:19,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:19,990 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-02-25 15:21:19,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-25 15:21:19,990 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-02-25 15:21:19,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:21:19,990 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:19,990 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:21:19,991 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:19,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:19,991 INFO L82 PathProgramCache]: Analyzing trace with hash 897299026, now seen corresponding path program 1 times [2019-02-25 15:21:19,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:19,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:19,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:19,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:19,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:20,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:21:20,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:20,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:20,056 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:21:20,056 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-02-25 15:21:20,057 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:21:20,057 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:21:20,059 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:21:20,059 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:21:20,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:20,059 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:21:20,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:20,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:20,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:20,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:20,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-25 15:21:20,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:20,088 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:21:20,088 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:20,096 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:20,108 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:20,124 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:21:20,128 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:21:20,136 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:21:20,140 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:21:20,147 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-25 15:21:20,148 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:20,162 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:20,174 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:20,183 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:20,193 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:20,211 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:20,211 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-25 15:21:20,239 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:20,240 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:21:20,240 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:20,249 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:20,250 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-25 15:21:20,264 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:20,265 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:20,265 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:20,266 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:21:20,267 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 15:21:20,267 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:20,277 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:20,278 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-25 15:21:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:20,290 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:20,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:20,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:20,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:21:20,328 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:20,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:21:20,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:21:20,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:21:20,328 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 8 states. [2019-02-25 15:21:20,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:20,777 INFO L93 Difference]: Finished difference Result 142 states and 698 transitions. [2019-02-25 15:21:20,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:21:20,778 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:21:20,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:20,780 INFO L225 Difference]: With dead ends: 142 [2019-02-25 15:21:20,780 INFO L226 Difference]: Without dead ends: 141 [2019-02-25 15:21:20,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:21:20,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-02-25 15:21:21,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2019-02-25 15:21:21,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-02-25 15:21:21,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 682 transitions. [2019-02-25 15:21:21,022 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 682 transitions. Word has length 6 [2019-02-25 15:21:21,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:21,022 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 682 transitions. [2019-02-25 15:21:21,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:21:21,022 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 682 transitions. [2019-02-25 15:21:21,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:21:21,023 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:21,023 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-25 15:21:21,023 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:21,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:21,023 INFO L82 PathProgramCache]: Analyzing trace with hash 897354700, now seen corresponding path program 1 times [2019-02-25 15:21:21,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:21,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:21,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:21,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:21,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:21,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:21:21,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:21,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:21,144 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:21:21,144 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-02-25 15:21:21,145 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:21:21,145 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:21:21,146 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:21:21,147 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:21:21,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:21,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:21:21,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:21,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:21,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:21,156 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:21,161 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:21:21,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:21,167 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:21:21,172 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:21:21,177 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:21,181 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:21,181 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:21:21,191 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:21,191 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:21,192 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:21,193 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:21:21,196 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:21,199 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:21,200 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:21,201 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:21,202 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:21:21,203 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:21,236 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:21,250 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:21,261 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:21,271 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:21,304 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:21:21,305 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:21,312 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:21,325 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:21,347 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:21,372 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:21,373 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-25 15:21:21,391 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:21,398 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:21:21,399 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:21:21,484 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:21:21,484 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-02-25 15:21:21,516 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:21,517 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:21,518 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:21,518 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:21:21,519 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:21,539 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:21,540 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-02-25 15:21:21,556 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:21,557 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:21,558 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:21,559 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:21,560 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:21,561 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:21,562 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:21,563 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:21,563 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:21:21,564 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:21,581 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:21,581 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:21:21,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:21,599 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:21,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:21,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:21,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-02-25 15:21:21,659 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:21,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:21:21,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:21:21,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:21:21,660 INFO L87 Difference]: Start difference. First operand 130 states and 682 transitions. Second operand 9 states. [2019-02-25 15:21:22,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:22,356 INFO L93 Difference]: Finished difference Result 219 states and 1011 transitions. [2019-02-25 15:21:22,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:21:22,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-25 15:21:22,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:22,359 INFO L225 Difference]: With dead ends: 219 [2019-02-25 15:21:22,359 INFO L226 Difference]: Without dead ends: 216 [2019-02-25 15:21:22,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:21:22,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-02-25 15:21:22,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 148. [2019-02-25 15:21:22,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-02-25 15:21:22,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 790 transitions. [2019-02-25 15:21:22,638 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 790 transitions. Word has length 6 [2019-02-25 15:21:22,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:22,638 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 790 transitions. [2019-02-25 15:21:22,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:21:22,638 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 790 transitions. [2019-02-25 15:21:22,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:21:22,639 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:22,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:21:22,639 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:22,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:22,639 INFO L82 PathProgramCache]: Analyzing trace with hash 896937626, now seen corresponding path program 3 times [2019-02-25 15:21:22,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:22,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:22,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:22,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:22,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:22,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:21:22,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:22,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:22,718 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:21:22,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:21:22,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:22,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:22,729 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:21:22,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:21:22,734 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:21:22,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:21:22,734 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:21:22,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:22,756 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:21:22,756 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:22,768 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:22,780 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:22,789 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:22,802 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:21:22,805 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:21:22,808 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:21:22,810 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:21:22,815 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:21:22,816 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:22,832 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:22,845 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:22,856 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:22,865 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:22,885 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:22,886 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-25 15:21:22,911 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:22,920 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-02-25 15:21:22,920 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:21:22,983 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-02-25 15:21:22,984 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:75 [2019-02-25 15:21:23,018 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,020 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,022 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,023 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,024 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,025 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,034 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 60 [2019-02-25 15:21:23,035 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:21:23,117 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,117 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,118 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,119 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,120 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,121 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-25 15:21:23,122 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:23,175 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-02-25 15:21:23,175 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:99, output treesize:90 [2019-02-25 15:21:23,225 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,225 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,226 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,227 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,229 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,230 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,232 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,233 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,233 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:21:23,249 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 68 [2019-02-25 15:21:23,250 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-02-25 15:21:23,419 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,420 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,421 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,423 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,424 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,424 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:21:23,425 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 45 [2019-02-25 15:21:23,425 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:23,509 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,510 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,511 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,512 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,514 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,515 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,516 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,517 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:23,517 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 15:21:23,518 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:23,600 INFO L301 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-02-25 15:21:23,601 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:117, output treesize:151 [2019-02-25 15:21:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:23,694 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:23,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:23,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:23,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:21:23,759 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:23,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:21:23,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:21:23,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:21:23,760 INFO L87 Difference]: Start difference. First operand 148 states and 790 transitions. Second operand 10 states. [2019-02-25 15:21:24,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:24,899 INFO L93 Difference]: Finished difference Result 218 states and 1012 transitions. [2019-02-25 15:21:24,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:21:24,899 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:21:24,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:24,902 INFO L225 Difference]: With dead ends: 218 [2019-02-25 15:21:24,902 INFO L226 Difference]: Without dead ends: 215 [2019-02-25 15:21:24,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:21:24,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-02-25 15:21:25,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 165. [2019-02-25 15:21:25,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-02-25 15:21:25,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 892 transitions. [2019-02-25 15:21:25,218 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 892 transitions. Word has length 6 [2019-02-25 15:21:25,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:25,218 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 892 transitions. [2019-02-25 15:21:25,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:21:25,218 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 892 transitions. [2019-02-25 15:21:25,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:21:25,219 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:25,219 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:21:25,219 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:25,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:25,219 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 1 times [2019-02-25 15:21:25,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:25,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:25,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:21:25,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:25,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:25,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:25,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:25,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:25,280 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:21:25,280 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-02-25 15:21:25,281 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:21:25,281 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:21:25,282 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:21:25,282 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:21:25,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:25,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:21:25,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:25,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:25,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:25,297 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:25,302 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:21:25,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:25,335 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:21:25,335 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:25,346 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:25,357 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:25,374 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:25,396 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:21:25,400 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:21:25,403 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:21:25,405 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:21:25,416 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:21:25,417 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:25,437 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:25,448 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:25,457 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:25,467 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:25,495 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:25,495 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-25 15:21:25,515 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:25,516 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:21:25,516 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:25,543 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:25,543 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:21:25,563 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:25,566 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:25,567 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:25,568 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:25,569 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:25,570 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:25,571 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:21:25,571 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:25,622 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:25,622 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-02-25 15:21:25,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:25,641 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:25,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:25,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:25,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:21:25,672 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:25,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:21:25,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:21:25,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:21:25,673 INFO L87 Difference]: Start difference. First operand 165 states and 892 transitions. Second operand 8 states. [2019-02-25 15:21:26,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:26,477 INFO L93 Difference]: Finished difference Result 274 states and 1371 transitions. [2019-02-25 15:21:26,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:21:26,477 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:21:26,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:26,481 INFO L225 Difference]: With dead ends: 274 [2019-02-25 15:21:26,481 INFO L226 Difference]: Without dead ends: 269 [2019-02-25 15:21:26,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:21:26,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-02-25 15:21:26,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 221. [2019-02-25 15:21:26,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-02-25 15:21:26,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1227 transitions. [2019-02-25 15:21:26,950 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1227 transitions. Word has length 6 [2019-02-25 15:21:26,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:26,950 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1227 transitions. [2019-02-25 15:21:26,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:21:26,950 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1227 transitions. [2019-02-25 15:21:26,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:21:26,951 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:26,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:21:26,951 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:26,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:26,951 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 1 times [2019-02-25 15:21:26,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:26,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:26,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:26,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:26,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:27,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:27,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:27,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:27,093 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:21:27,093 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-02-25 15:21:27,094 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:21:27,095 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:21:27,096 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:21:27,097 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:21:27,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:27,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:21:27,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:27,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:27,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:27,110 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:27,117 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:21:27,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:27,124 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:21:27,127 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:21:27,132 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:27,134 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:27,135 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:21:27,139 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:27,141 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:27,142 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:27,143 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:21:27,147 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:27,149 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:27,150 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:27,151 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:27,152 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:21:27,152 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:27,178 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:27,193 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:27,203 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:27,213 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:27,248 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:21:27,249 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:27,257 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:27,268 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:27,284 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:27,312 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:27,312 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:21:27,336 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:27,336 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:21:27,337 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:27,361 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:27,362 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:21:27,381 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:27,382 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:27,383 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:27,384 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:27,385 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:27,386 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:27,394 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:21:27,395 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:21:27,473 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:21:27,473 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:68 [2019-02-25 15:21:27,520 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:27,521 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:27,522 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:27,523 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:27,524 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:27,525 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:27,525 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:21:27,526 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:21:27,526 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:27,545 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:27,545 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-02-25 15:21:27,561 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:27,561 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:27,579 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:27,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:27,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-02-25 15:21:27,599 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:27,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:21:27,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:21:27,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:21:27,599 INFO L87 Difference]: Start difference. First operand 221 states and 1227 transitions. Second operand 10 states. [2019-02-25 15:21:29,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:29,089 INFO L93 Difference]: Finished difference Result 480 states and 2479 transitions. [2019-02-25 15:21:29,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-25 15:21:29,090 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:21:29,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:29,095 INFO L225 Difference]: With dead ends: 480 [2019-02-25 15:21:29,095 INFO L226 Difference]: Without dead ends: 477 [2019-02-25 15:21:29,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:21:29,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-02-25 15:21:29,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 348. [2019-02-25 15:21:29,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-02-25 15:21:29,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1989 transitions. [2019-02-25 15:21:29,944 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1989 transitions. Word has length 6 [2019-02-25 15:21:29,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:29,945 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 1989 transitions. [2019-02-25 15:21:29,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:21:29,945 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1989 transitions. [2019-02-25 15:21:29,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:21:29,946 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:29,946 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-25 15:21:29,946 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:29,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:29,946 INFO L82 PathProgramCache]: Analyzing trace with hash -2019467998, now seen corresponding path program 1 times [2019-02-25 15:21:29,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:29,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:29,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:29,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:29,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:29,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:29,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:29,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:29,982 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:21:29,982 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [28], [29] [2019-02-25 15:21:29,983 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:21:29,983 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:21:29,984 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:21:29,985 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:21:29,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:29,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:21:29,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:29,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:29,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:29,994 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:29,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-25 15:21:29,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:30,003 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:21:30,008 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:21:30,019 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-25 15:21:30,033 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-25 15:21:30,044 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-25 15:21:30,044 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:30,053 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:30,063 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:30,072 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:30,081 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:30,090 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:30,090 INFO L208 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-02-25 15:21:30,095 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:30,096 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-25 15:21:30,096 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:30,098 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:30,098 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-25 15:21:30,104 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:30,104 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2019-02-25 15:21:30,105 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:30,106 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:30,107 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2019-02-25 15:21:30,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:30,112 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:30,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:30,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:21:30,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2019-02-25 15:21:30,137 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:21:30,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-25 15:21:30,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-25 15:21:30,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:21:30,137 INFO L87 Difference]: Start difference. First operand 348 states and 1989 transitions. Second operand 5 states. [2019-02-25 15:21:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:31,993 INFO L93 Difference]: Finished difference Result 804 states and 4563 transitions. [2019-02-25 15:21:31,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:21:31,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-02-25 15:21:31,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:32,000 INFO L225 Difference]: With dead ends: 804 [2019-02-25 15:21:32,000 INFO L226 Difference]: Without dead ends: 800 [2019-02-25 15:21:32,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:21:32,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-02-25 15:21:33,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 774. [2019-02-25 15:21:33,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-02-25 15:21:33,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 4522 transitions. [2019-02-25 15:21:33,901 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 4522 transitions. Word has length 7 [2019-02-25 15:21:33,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:33,901 INFO L480 AbstractCegarLoop]: Abstraction has 774 states and 4522 transitions. [2019-02-25 15:21:33,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-25 15:21:33,901 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 4522 transitions. [2019-02-25 15:21:33,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:21:33,904 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:33,904 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:21:33,904 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:33,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:33,904 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-02-25 15:21:33,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:33,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:33,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:33,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:33,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:34,084 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-02-25 15:21:34,260 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:21:34,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:34,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:34,260 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:21:34,261 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-02-25 15:21:34,261 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:21:34,261 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:21:34,264 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:21:34,265 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:21:34,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:34,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:21:34,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:34,265 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:34,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:34,276 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:34,280 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:21:34,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:34,284 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:21:34,287 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,288 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:21:34,292 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,293 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,294 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:21:34,298 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,298 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,299 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,300 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:21:34,304 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,304 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,305 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,306 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,307 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:21:34,308 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:34,334 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:34,349 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:34,360 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:34,371 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:34,409 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:21:34,409 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:34,445 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:34,455 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:34,471 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:34,488 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:34,517 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:34,518 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-02-25 15:21:34,555 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,555 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:21:34,556 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:34,583 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:34,583 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-25 15:21:34,612 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,613 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,613 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,614 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,616 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,617 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,617 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:21:34,618 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:34,643 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:34,644 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-25 15:21:34,694 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,695 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,696 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,696 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,697 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,698 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,699 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,700 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,701 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:21:34,701 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:21:34,702 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:34,739 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:34,740 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-25 15:21:34,765 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,766 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,766 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,767 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,768 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,769 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,770 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,771 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,772 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:34,773 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:21:34,774 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:21:34,774 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:34,800 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:34,800 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-02-25 15:21:34,824 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:34,824 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:34,882 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:34,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:34,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:21:34,901 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:34,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:21:34,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:21:34,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:21:34,902 INFO L87 Difference]: Start difference. First operand 774 states and 4522 transitions. Second operand 12 states. [2019-02-25 15:21:37,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:37,449 INFO L93 Difference]: Finished difference Result 821 states and 4651 transitions. [2019-02-25 15:21:37,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:21:37,449 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-25 15:21:37,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:37,456 INFO L225 Difference]: With dead ends: 821 [2019-02-25 15:21:37,456 INFO L226 Difference]: Without dead ends: 820 [2019-02-25 15:21:37,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-02-25 15:21:37,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-02-25 15:21:39,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 736. [2019-02-25 15:21:39,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-02-25 15:21:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 4294 transitions. [2019-02-25 15:21:39,297 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 4294 transitions. Word has length 7 [2019-02-25 15:21:39,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:39,297 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 4294 transitions. [2019-02-25 15:21:39,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:21:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 4294 transitions. [2019-02-25 15:21:39,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:21:39,300 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:39,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:21:39,300 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:39,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:39,300 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-02-25 15:21:39,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:39,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:39,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:39,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:39,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:39,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:39,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:39,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:39,352 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:21:39,352 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-02-25 15:21:39,353 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:21:39,353 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:21:39,355 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:21:39,355 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:21:39,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:39,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:21:39,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:39,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:39,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:39,365 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:39,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:21:39,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:39,385 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-25 15:21:39,385 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:39,396 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:39,411 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:21:39,414 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:21:39,429 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-25 15:21:39,438 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-25 15:21:39,447 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-25 15:21:39,448 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:39,464 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:39,474 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:39,484 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:39,494 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:39,512 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:39,512 INFO L208 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:36, output treesize:42 [2019-02-25 15:21:39,535 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:39,535 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-25 15:21:39,535 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:39,540 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:39,541 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-25 15:21:39,552 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:39,553 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:39,554 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:39,554 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2019-02-25 15:21:39,555 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:39,561 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:39,561 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-02-25 15:21:39,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:39,573 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:39,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:39,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:39,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:21:39,615 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:39,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:21:39,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:21:39,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:21:39,616 INFO L87 Difference]: Start difference. First operand 736 states and 4294 transitions. Second operand 8 states. [2019-02-25 15:21:41,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:41,647 INFO L93 Difference]: Finished difference Result 805 states and 4572 transitions. [2019-02-25 15:21:41,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:21:41,648 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-25 15:21:41,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:41,653 INFO L225 Difference]: With dead ends: 805 [2019-02-25 15:21:41,654 INFO L226 Difference]: Without dead ends: 804 [2019-02-25 15:21:41,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:21:41,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-02-25 15:21:43,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 776. [2019-02-25 15:21:43,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-02-25 15:21:43,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 4534 transitions. [2019-02-25 15:21:43,603 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 4534 transitions. Word has length 7 [2019-02-25 15:21:43,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:43,603 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 4534 transitions. [2019-02-25 15:21:43,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:21:43,603 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 4534 transitions. [2019-02-25 15:21:43,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:21:43,605 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:43,606 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:21:43,606 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:43,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:43,606 INFO L82 PathProgramCache]: Analyzing trace with hash -2018040016, now seen corresponding path program 1 times [2019-02-25 15:21:43,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:43,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:43,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:43,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:43,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:43,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:21:43,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:43,754 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:43,754 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:21:43,754 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-02-25 15:21:43,755 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:21:43,755 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:21:43,757 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:21:43,758 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:21:43,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:43,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:21:43,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:43,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:43,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:43,767 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:43,775 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:21:43,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:43,781 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:21:43,784 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:21:43,789 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:43,791 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:43,791 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:21:43,798 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:43,800 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:43,803 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:43,803 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:21:43,812 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:43,815 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:43,816 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:43,817 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:43,817 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:21:43,818 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:43,842 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:43,855 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:43,866 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:43,877 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:43,912 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:21:43,912 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:43,921 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:43,930 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:43,946 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:43,974 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:43,974 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-25 15:21:44,019 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:44,020 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:21:44,020 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:44,037 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:44,038 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:21:44,058 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:44,059 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:44,060 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:44,061 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:44,062 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:44,063 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:21:44,063 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:44,081 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:44,081 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-25 15:21:44,101 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:44,102 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:44,103 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:44,103 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:44,105 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:44,105 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:21:44,106 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:21:44,107 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:44,122 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:44,122 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:21:44,142 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:44,142 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:44,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:44,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:44,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:21:44,215 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:44,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:21:44,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:21:44,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:21:44,216 INFO L87 Difference]: Start difference. First operand 776 states and 4534 transitions. Second operand 10 states. [2019-02-25 15:21:46,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:46,976 INFO L93 Difference]: Finished difference Result 1004 states and 5711 transitions. [2019-02-25 15:21:46,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:21:46,977 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-25 15:21:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:46,986 INFO L225 Difference]: With dead ends: 1004 [2019-02-25 15:21:46,986 INFO L226 Difference]: Without dead ends: 1003 [2019-02-25 15:21:46,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:21:46,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-02-25 15:21:49,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 847. [2019-02-25 15:21:49,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-02-25 15:21:49,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 4961 transitions. [2019-02-25 15:21:49,101 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 4961 transitions. Word has length 7 [2019-02-25 15:21:49,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:49,101 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 4961 transitions. [2019-02-25 15:21:49,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:21:49,102 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 4961 transitions. [2019-02-25 15:21:49,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:21:49,103 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:49,104 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:21:49,104 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:49,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:49,104 INFO L82 PathProgramCache]: Analyzing trace with hash -2030550250, now seen corresponding path program 1 times [2019-02-25 15:21:49,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:49,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:49,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:49,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:49,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:49,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:49,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:49,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:49,259 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:21:49,259 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-02-25 15:21:49,260 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:21:49,260 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:21:49,262 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:21:49,263 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:21:49,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:49,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:21:49,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:49,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:49,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:49,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:49,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-25 15:21:49,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:49,296 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:21:49,297 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:49,302 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:49,311 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:49,325 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:21:49,327 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:21:49,330 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:21:49,334 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:21:49,341 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-25 15:21:49,342 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:49,357 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:49,369 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:49,378 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:49,388 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:49,406 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:49,406 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-02-25 15:21:49,434 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:49,435 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-02-25 15:21:49,435 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:49,452 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:49,453 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:29 [2019-02-25 15:21:49,469 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:49,470 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:49,471 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:49,474 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:49,475 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:49,482 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:21:49,483 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:21:49,528 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:21:49,528 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:46 [2019-02-25 15:21:49,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:49,561 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:49,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:49,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:49,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-25 15:21:49,593 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:49,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:21:49,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:21:49,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:21:49,594 INFO L87 Difference]: Start difference. First operand 847 states and 4961 transitions. Second operand 9 states. [2019-02-25 15:21:52,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:52,778 INFO L93 Difference]: Finished difference Result 1213 states and 6892 transitions. [2019-02-25 15:21:52,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:21:52,778 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-02-25 15:21:52,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:52,787 INFO L225 Difference]: With dead ends: 1213 [2019-02-25 15:21:52,787 INFO L226 Difference]: Without dead ends: 1212 [2019-02-25 15:21:52,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:21:52,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-02-25 15:21:55,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1101. [2019-02-25 15:21:55,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-02-25 15:21:55,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 6484 transitions. [2019-02-25 15:21:55,557 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 6484 transitions. Word has length 7 [2019-02-25 15:21:55,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:55,557 INFO L480 AbstractCegarLoop]: Abstraction has 1101 states and 6484 transitions. [2019-02-25 15:21:55,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:21:55,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 6484 transitions. [2019-02-25 15:21:55,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:21:55,560 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:55,560 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:21:55,561 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:55,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:55,561 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 1 times [2019-02-25 15:21:55,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:55,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:55,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:55,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:55,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:55,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:55,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:55,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:55,761 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:21:55,761 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-02-25 15:21:55,762 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:21:55,762 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:21:55,764 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:21:55,764 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:21:55,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:55,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:21:55,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:55,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:55,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:55,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:55,781 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:21:55,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:55,793 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:21:55,795 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:55,796 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:21:55,799 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:55,801 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:55,802 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:21:55,805 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:55,806 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:55,809 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:55,810 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:21:55,814 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:55,816 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:55,818 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:55,820 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:55,821 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:21:55,821 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:55,850 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:55,866 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:55,876 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:55,887 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:55,925 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:21:55,926 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:55,935 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:55,943 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:55,957 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:55,975 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:56,004 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:56,005 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-25 15:21:56,037 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:56,037 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:21:56,038 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:56,065 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:56,065 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 15:21:56,092 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:56,093 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:56,094 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:56,095 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:56,096 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:21:56,097 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:21:56,097 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:56,124 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:56,124 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:44 [2019-02-25 15:21:56,147 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:56,148 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:56,149 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:56,149 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:56,150 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:56,151 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:56,153 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:56,154 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:56,154 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 70 [2019-02-25 15:21:56,155 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:56,181 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:56,182 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:38 [2019-02-25 15:21:56,203 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:56,204 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:56,205 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:56,206 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:56,207 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:56,208 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:56,209 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:56,210 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:56,211 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:21:56,212 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:21:56,213 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 70 [2019-02-25 15:21:56,213 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:56,239 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:21:56,239 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-25 15:21:56,261 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:56,261 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:56,308 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:56,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:56,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:21:56,326 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:56,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:21:56,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:21:56,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:21:56,327 INFO L87 Difference]: Start difference. First operand 1101 states and 6484 transitions. Second operand 12 states. [2019-02-25 15:22:00,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:22:00,621 INFO L93 Difference]: Finished difference Result 1577 states and 9103 transitions. [2019-02-25 15:22:00,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:22:00,621 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-25 15:22:00,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:22:00,635 INFO L225 Difference]: With dead ends: 1577 [2019-02-25 15:22:00,636 INFO L226 Difference]: Without dead ends: 1575 [2019-02-25 15:22:00,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:22:00,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2019-02-25 15:22:02,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 754. [2019-02-25 15:22:02,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-02-25 15:22:02,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 4401 transitions. [2019-02-25 15:22:02,569 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 4401 transitions. Word has length 7 [2019-02-25 15:22:02,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:22:02,569 INFO L480 AbstractCegarLoop]: Abstraction has 754 states and 4401 transitions. [2019-02-25 15:22:02,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:22:02,569 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 4401 transitions. [2019-02-25 15:22:02,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:22:02,570 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:22:02,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:22:02,570 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:22:02,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:02,571 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 1 times [2019-02-25 15:22:02,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:22:02,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:02,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:02,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:02,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:22:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:02,711 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:22:02,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:02,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:22:02,712 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:22:02,712 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-02-25 15:22:02,713 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:22:02,713 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:22:02,715 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:22:02,715 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:22:02,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:02,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:22:02,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:02,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:22:02,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:02,724 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:22:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:02,729 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:22:02,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:22:02,734 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:22:02,736 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:02,737 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:22:02,740 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:02,742 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:02,743 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:22:02,748 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:02,751 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:02,753 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:02,753 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:22:02,764 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:22:02,765 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:02,788 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:02,802 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:02,813 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:02,824 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:02,857 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:22:02,857 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:02,864 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:02,871 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:02,881 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:02,903 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:02,904 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-25 15:22:03,006 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:03,006 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:22:03,007 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:03,024 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:03,024 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:22:03,046 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:03,047 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:03,048 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:03,049 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:22:03,049 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:22:03,050 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:03,068 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:03,068 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:31 [2019-02-25 15:22:03,090 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:03,091 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:03,091 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:03,092 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:03,093 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:03,094 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:03,095 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2019-02-25 15:22:03,095 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:03,112 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:03,112 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-25 15:22:03,132 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:03,132 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:03,133 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:03,134 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:03,135 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:03,137 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:03,137 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:22:03,138 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2019-02-25 15:22:03,138 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:03,154 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:03,154 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-25 15:22:03,171 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:03,172 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:22:03,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:03,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:22:03,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-25 15:22:03,239 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:22:03,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:22:03,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:22:03,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:22:03,240 INFO L87 Difference]: Start difference. First operand 754 states and 4401 transitions. Second operand 11 states. [2019-02-25 15:22:06,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:22:06,532 INFO L93 Difference]: Finished difference Result 1108 states and 6316 transitions. [2019-02-25 15:22:06,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:22:06,533 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-25 15:22:06,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:22:06,539 INFO L225 Difference]: With dead ends: 1108 [2019-02-25 15:22:06,539 INFO L226 Difference]: Without dead ends: 1107 [2019-02-25 15:22:06,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:22:06,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-02-25 15:22:09,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1052. [2019-02-25 15:22:09,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-02-25 15:22:09,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 6189 transitions. [2019-02-25 15:22:09,274 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 6189 transitions. Word has length 7 [2019-02-25 15:22:09,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:22:09,274 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 6189 transitions. [2019-02-25 15:22:09,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:22:09,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 6189 transitions. [2019-02-25 15:22:09,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:22:09,276 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:22:09,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:22:09,276 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:22:09,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:09,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1973291948, now seen corresponding path program 1 times [2019-02-25 15:22:09,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:22:09,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:09,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:09,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:09,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:22:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:09,452 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2019-02-25 15:22:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:22:09,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:09,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:22:09,479 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:22:09,479 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-02-25 15:22:09,480 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:22:09,480 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:22:09,482 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:22:09,482 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:22:09,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:09,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:22:09,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:09,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:22:09,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:09,492 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:22:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:09,501 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:22:09,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:22:09,506 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:22:09,510 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:22:09,521 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:09,524 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:09,524 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:22:09,536 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:09,538 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:09,541 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:09,541 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:22:09,544 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:09,549 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:09,552 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:09,555 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:09,555 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:22:09,556 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:09,583 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:09,594 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:09,604 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:09,615 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:09,647 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:22:09,648 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:09,654 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:09,663 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:09,678 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:09,705 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:09,706 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:22:09,731 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:09,731 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:22:09,732 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:09,756 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:09,756 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:22:09,776 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:09,777 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:09,778 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:09,778 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:09,781 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:09,782 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:22:09,790 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:22:09,791 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:22:09,876 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:22:09,877 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:76 [2019-02-25 15:22:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:09,911 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:22:09,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:09,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:22:09,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:22:09,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:22:09,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:22:09,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:22:09,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:22:09,956 INFO L87 Difference]: Start difference. First operand 1052 states and 6189 transitions. Second operand 8 states. [2019-02-25 15:22:12,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:22:12,872 INFO L93 Difference]: Finished difference Result 1075 states and 6230 transitions. [2019-02-25 15:22:12,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:22:12,872 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-25 15:22:12,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:22:12,878 INFO L225 Difference]: With dead ends: 1075 [2019-02-25 15:22:12,878 INFO L226 Difference]: Without dead ends: 1074 [2019-02-25 15:22:12,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:22:12,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2019-02-25 15:22:15,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1054. [2019-02-25 15:22:15,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-02-25 15:22:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 6201 transitions. [2019-02-25 15:22:15,649 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 6201 transitions. Word has length 7 [2019-02-25 15:22:15,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:22:15,649 INFO L480 AbstractCegarLoop]: Abstraction has 1054 states and 6201 transitions. [2019-02-25 15:22:15,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:22:15,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 6201 transitions. [2019-02-25 15:22:15,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:22:15,651 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:22:15,651 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:22:15,651 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:22:15,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:15,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1973720682, now seen corresponding path program 1 times [2019-02-25 15:22:15,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:22:15,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:15,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:15,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:15,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:22:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:15,755 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:22:15,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:15,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:22:15,756 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:22:15,756 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-02-25 15:22:15,757 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:22:15,757 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:22:15,760 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:22:15,760 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:22:15,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:15,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:22:15,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:15,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:22:15,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:15,771 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:22:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:15,777 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:22:15,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:22:15,786 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:22:15,797 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:15,797 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:22:15,805 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:15,805 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:15,806 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:22:15,808 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:15,827 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:15,828 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:15,829 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:22:15,832 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:15,834 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:15,836 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:15,838 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:15,839 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:22:15,839 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:15,868 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:15,884 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:15,897 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:15,908 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:15,949 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:22:15,949 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:15,959 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:15,968 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:15,981 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:15,998 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:16,028 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:16,028 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-25 15:22:16,060 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:16,060 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:22:16,061 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:16,088 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:16,088 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 15:22:16,113 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:16,114 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:16,115 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:16,116 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:16,117 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:16,118 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:22:16,118 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:22:16,119 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:16,147 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:16,147 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-02-25 15:22:16,169 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:16,170 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:16,171 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:16,172 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:16,173 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:16,174 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:16,175 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:16,176 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:16,177 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:22:16,177 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:16,205 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:16,205 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-02-25 15:22:16,226 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:16,227 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:16,227 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:16,228 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:16,229 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:16,230 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:16,231 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:16,232 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:16,233 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:16,234 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:22:16,235 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:22:16,235 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:16,260 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:16,260 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-02-25 15:22:16,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:16,282 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:22:16,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:16,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:22:16,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:22:16,352 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:22:16,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:22:16,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:22:16,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:22:16,353 INFO L87 Difference]: Start difference. First operand 1054 states and 6201 transitions. Second operand 12 states. [2019-02-25 15:22:20,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:22:20,866 INFO L93 Difference]: Finished difference Result 1522 states and 8743 transitions. [2019-02-25 15:22:20,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:22:20,866 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-25 15:22:20,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:22:20,873 INFO L225 Difference]: With dead ends: 1522 [2019-02-25 15:22:20,874 INFO L226 Difference]: Without dead ends: 1521 [2019-02-25 15:22:20,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:22:20,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-02-25 15:22:23,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1125. [2019-02-25 15:22:23,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-02-25 15:22:23,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 6627 transitions. [2019-02-25 15:22:23,893 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 6627 transitions. Word has length 7 [2019-02-25 15:22:23,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:22:23,893 INFO L480 AbstractCegarLoop]: Abstraction has 1125 states and 6627 transitions. [2019-02-25 15:22:23,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:22:23,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 6627 transitions. [2019-02-25 15:22:23,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:22:23,896 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:22:23,896 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:22:23,896 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:22:23,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:23,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-02-25 15:22:23,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:22:23,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:23,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:23,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:23,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:22:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:24,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:24,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:24,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:22:24,020 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:22:24,020 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-02-25 15:22:24,021 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:22:24,021 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:22:24,023 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:22:24,023 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:22:24,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:24,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:22:24,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:24,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:22:24,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:24,033 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:22:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:24,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-25 15:22:24,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:22:24,040 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:22:24,047 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:22:24,054 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-25 15:22:24,088 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-25 15:22:24,103 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-25 15:22:24,103 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:24,113 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:24,122 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:24,131 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:24,140 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:24,150 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:24,150 INFO L208 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-02-25 15:22:24,156 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:24,157 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-25 15:22:24,157 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:24,158 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:24,158 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-25 15:22:24,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:24,162 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:22:24,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:24,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:22:24,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-25 15:22:24,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:22:24,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:22:24,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:22:24,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:22:24,191 INFO L87 Difference]: Start difference. First operand 1125 states and 6627 transitions. Second operand 4 states. [2019-02-25 15:22:28,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:22:28,098 INFO L93 Difference]: Finished difference Result 1559 states and 9048 transitions. [2019-02-25 15:22:28,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:22:28,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-02-25 15:22:28,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:22:28,107 INFO L225 Difference]: With dead ends: 1559 [2019-02-25 15:22:28,107 INFO L226 Difference]: Without dead ends: 1554 [2019-02-25 15:22:28,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:22:28,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-02-25 15:22:32,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1528. [2019-02-25 15:22:32,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-02-25 15:22:32,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 8994 transitions. [2019-02-25 15:22:32,257 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 8994 transitions. Word has length 7 [2019-02-25 15:22:32,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:22:32,257 INFO L480 AbstractCegarLoop]: Abstraction has 1528 states and 8994 transitions. [2019-02-25 15:22:32,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:22:32,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 8994 transitions. [2019-02-25 15:22:32,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:22:32,259 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:22:32,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:22:32,260 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:22:32,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:32,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-02-25 15:22:32,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:22:32,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:32,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:32,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:32,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:22:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:32,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:22:32,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:32,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:22:32,362 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:22:32,363 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-02-25 15:22:32,363 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:22:32,363 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:22:32,366 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:22:32,366 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:22:32,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:32,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:22:32,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:32,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:22:32,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:32,377 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:22:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:32,381 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:22:32,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:22:32,385 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:22:32,390 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:22:32,399 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:32,401 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:32,401 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:22:32,465 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:32,492 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:32,518 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:32,519 INFO L292 Elim1Store]: Index analysis took 115 ms [2019-02-25 15:22:32,519 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:22:32,545 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:32,588 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:32,609 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:32,634 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:32,635 INFO L292 Elim1Store]: Index analysis took 113 ms [2019-02-25 15:22:32,636 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:22:32,637 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:32,967 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:33,143 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:33,276 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:33,419 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:33,629 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:22:33,630 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:33,638 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:33,650 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:33,667 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:33,696 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:33,697 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:22:33,762 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:33,762 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:22:33,763 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:33,792 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:33,793 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:22:33,816 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:33,817 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:33,818 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:33,819 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:33,821 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:33,823 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:33,832 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:22:33,833 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:22:33,917 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:22:33,917 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:68 [2019-02-25 15:22:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:33,969 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:22:33,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:34,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:22:34,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:22:34,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:22:34,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:22:34,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:22:34,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:22:34,004 INFO L87 Difference]: Start difference. First operand 1528 states and 8994 transitions. Second operand 8 states. [2019-02-25 15:22:38,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:22:38,279 INFO L93 Difference]: Finished difference Result 1574 states and 9156 transitions. [2019-02-25 15:22:38,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:22:38,279 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-25 15:22:38,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:22:38,287 INFO L225 Difference]: With dead ends: 1574 [2019-02-25 15:22:38,288 INFO L226 Difference]: Without dead ends: 1570 [2019-02-25 15:22:38,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:22:38,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-02-25 15:22:42,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1547. [2019-02-25 15:22:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-02-25 15:22:42,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 9102 transitions. [2019-02-25 15:22:42,536 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 9102 transitions. Word has length 7 [2019-02-25 15:22:42,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:22:42,536 INFO L480 AbstractCegarLoop]: Abstraction has 1547 states and 9102 transitions. [2019-02-25 15:22:42,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:22:42,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 9102 transitions. [2019-02-25 15:22:42,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:22:42,538 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:22:42,538 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-25 15:22:42,538 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:22:42,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:42,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1969901668, now seen corresponding path program 2 times [2019-02-25 15:22:42,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:22:42,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:42,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:42,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:42,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:22:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:42,607 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:22:42,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:42,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:22:42,608 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:22:42,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:22:42,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:42,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:22:42,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:22:42,617 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:22:42,622 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:22:42,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:22:42,623 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:22:42,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:22:42,626 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:22:42,630 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:22:42,639 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:42,642 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:42,642 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:22:42,661 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:42,664 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:42,666 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:42,666 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:22:42,671 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:42,675 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:42,677 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:42,679 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:42,679 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:22:42,679 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:42,720 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:42,743 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:42,758 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:42,775 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:42,822 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:22:42,823 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:42,841 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:42,855 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:42,871 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:42,899 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:42,899 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:22:42,924 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:42,925 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:22:42,925 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:42,951 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:42,952 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-25 15:22:42,974 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:42,975 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:42,975 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:42,976 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:42,978 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:42,979 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:42,987 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:22:42,988 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:22:43,065 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-25 15:22:43,066 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:68 [2019-02-25 15:22:43,100 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:43,101 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:43,102 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:43,103 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:43,104 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:43,104 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:22:43,105 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:22:43,105 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:43,122 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:43,122 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2019-02-25 15:22:43,141 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:43,142 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:43,143 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:43,144 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:43,145 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:43,146 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:43,147 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:43,148 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:43,149 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:22:43,150 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:43,165 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:43,166 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-02-25 15:22:43,186 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:43,186 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:22:43,234 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:43,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:22:43,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-25 15:22:43,252 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:22:43,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:22:43,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:22:43,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:22:43,252 INFO L87 Difference]: Start difference. First operand 1547 states and 9102 transitions. Second operand 11 states. [2019-02-25 15:22:49,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:22:49,154 INFO L93 Difference]: Finished difference Result 2098 states and 12192 transitions. [2019-02-25 15:22:49,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:22:49,155 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-25 15:22:49,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:22:49,160 INFO L225 Difference]: With dead ends: 2098 [2019-02-25 15:22:49,160 INFO L226 Difference]: Without dead ends: 2091 [2019-02-25 15:22:49,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:22:49,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2019-02-25 15:22:54,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1838. [2019-02-25 15:22:54,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-02-25 15:22:54,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10847 transitions. [2019-02-25 15:22:54,206 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10847 transitions. Word has length 7 [2019-02-25 15:22:54,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:22:54,206 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10847 transitions. [2019-02-25 15:22:54,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:22:54,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10847 transitions. [2019-02-25 15:22:54,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:22:54,208 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:22:54,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:22:54,209 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:22:54,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:54,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1965903780, now seen corresponding path program 1 times [2019-02-25 15:22:54,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:22:54,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:54,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:22:54,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:54,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:22:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:54,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:54,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:54,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:22:54,262 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:22:54,262 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-02-25 15:22:54,263 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:22:54,263 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:22:54,264 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:22:54,265 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:22:54,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:54,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:22:54,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:54,265 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:22:54,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:54,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:22:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:54,285 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:22:54,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:22:54,289 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:22:54,294 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:22:54,304 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:54,305 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:54,306 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:22:54,309 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:54,310 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:54,311 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:54,312 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:22:54,316 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:54,318 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:54,319 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:54,321 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:54,322 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:22:54,322 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:54,348 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:54,362 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:54,372 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:54,382 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:54,414 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:22:54,414 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:54,421 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:54,430 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:54,446 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:54,473 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:54,474 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:22:54,543 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:54,544 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:22:54,544 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:54,602 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:54,603 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:22:54,620 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:54,621 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:54,621 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:54,622 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:54,622 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:22:54,623 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:22:54,624 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:54,638 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:54,639 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-25 15:22:54,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:54,655 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:22:54,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:54,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:22:54,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:22:54,695 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:22:54,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:22:54,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:22:54,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:22:54,695 INFO L87 Difference]: Start difference. First operand 1838 states and 10847 transitions. Second operand 8 states. [2019-02-25 15:22:59,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:22:59,682 INFO L93 Difference]: Finished difference Result 1846 states and 10859 transitions. [2019-02-25 15:22:59,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:22:59,682 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-25 15:22:59,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:22:59,687 INFO L225 Difference]: With dead ends: 1846 [2019-02-25 15:22:59,687 INFO L226 Difference]: Without dead ends: 1839 [2019-02-25 15:22:59,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:22:59,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2019-02-25 15:23:04,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1838. [2019-02-25 15:23:04,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-02-25 15:23:04,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10841 transitions. [2019-02-25 15:23:04,719 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10841 transitions. Word has length 7 [2019-02-25 15:23:04,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:04,719 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10841 transitions. [2019-02-25 15:23:04,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:23:04,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10841 transitions. [2019-02-25 15:23:04,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:23:04,722 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:04,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:23:04,722 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:04,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:04,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1931530426, now seen corresponding path program 1 times [2019-02-25 15:23:04,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:04,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:04,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:04,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:04,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:23:04,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:04,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:04,851 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:23:04,851 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-02-25 15:23:04,852 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:04,852 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:04,854 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:04,854 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:23:04,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:04,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:04,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:04,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:04,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:04,874 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:04,893 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:23:04,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:04,910 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:23:04,923 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:23:04,929 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:04,931 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:04,931 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:23:04,937 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:04,939 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:04,940 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:04,941 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:23:04,944 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:04,946 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:04,947 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:04,949 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:04,949 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:23:04,950 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:04,974 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:04,987 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:04,996 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,005 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,040 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:23:05,040 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,047 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,056 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,071 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,098 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:05,099 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-25 15:23:05,131 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,140 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:23:05,140 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:23:05,229 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-25 15:23:05,230 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:84 [2019-02-25 15:23:05,279 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,280 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,280 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,281 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,282 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,283 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,284 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 74 [2019-02-25 15:23:05,285 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,344 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,345 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,346 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,347 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,348 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,349 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2019-02-25 15:23:05,350 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,410 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:23:05,410 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:104, output treesize:64 [2019-02-25 15:23:05,469 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,470 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,471 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,472 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,472 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,474 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,475 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,476 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,477 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,478 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:05,478 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 68 [2019-02-25 15:23:05,479 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,534 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,536 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,537 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,538 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,539 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,540 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,541 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,542 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:05,543 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 15:23:05,543 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,579 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:23:05,579 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:72 [2019-02-25 15:23:05,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:05,677 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:05,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:05,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-25 15:23:05,737 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:05,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:23:05,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:23:05,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:23:05,737 INFO L87 Difference]: Start difference. First operand 1838 states and 10841 transitions. Second operand 11 states. [2019-02-25 15:23:07,687 WARN L181 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-02-25 15:23:12,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:12,667 INFO L93 Difference]: Finished difference Result 2193 states and 12710 transitions. [2019-02-25 15:23:12,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:23:12,667 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-25 15:23:12,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:12,674 INFO L225 Difference]: With dead ends: 2193 [2019-02-25 15:23:12,674 INFO L226 Difference]: Without dead ends: 2192 [2019-02-25 15:23:12,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:23:12,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-02-25 15:23:18,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1949. [2019-02-25 15:23:18,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2019-02-25 15:23:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 11505 transitions. [2019-02-25 15:23:18,126 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 11505 transitions. Word has length 7 [2019-02-25 15:23:18,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:18,126 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 11505 transitions. [2019-02-25 15:23:18,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:23:18,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 11505 transitions. [2019-02-25 15:23:18,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:23:18,129 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:18,129 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:23:18,129 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:18,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:18,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 2 times [2019-02-25 15:23:18,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:18,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:18,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:18,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:18,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:18,270 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-25 15:23:18,306 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:18,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:18,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:18,306 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:23:18,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:23:18,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:18,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:18,315 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:23:18,315 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:23:18,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:23:18,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:23:18,324 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:23:18,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:18,355 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:23:18,355 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,374 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,387 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,406 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,428 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,460 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:23:18,462 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:23:18,465 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:23:18,468 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:23:18,470 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:23:18,470 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,510 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,527 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,541 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,553 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,589 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:18,590 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-25 15:23:18,643 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,643 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:23:18,644 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,682 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:18,682 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 15:23:18,710 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,711 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,711 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,712 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,714 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,715 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,715 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:23:18,716 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,744 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:18,744 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-02-25 15:23:18,769 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,770 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,770 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,771 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,772 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,774 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,775 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,776 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,776 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:18,777 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:23:18,777 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,803 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:18,804 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-25 15:23:18,908 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,909 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,910 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,910 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,912 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,913 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,914 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,915 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,916 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,917 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:18,918 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:23:18,918 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,945 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:18,945 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-02-25 15:23:18,965 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:18,965 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:19,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:19,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:23:19,042 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:19,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:23:19,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:23:19,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:23:19,043 INFO L87 Difference]: Start difference. First operand 1949 states and 11505 transitions. Second operand 12 states. [2019-02-25 15:23:26,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:26,169 INFO L93 Difference]: Finished difference Result 2526 states and 14755 transitions. [2019-02-25 15:23:26,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:23:26,169 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-25 15:23:26,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:26,175 INFO L225 Difference]: With dead ends: 2526 [2019-02-25 15:23:26,176 INFO L226 Difference]: Without dead ends: 2520 [2019-02-25 15:23:26,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:23:26,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2019-02-25 15:23:31,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1960. [2019-02-25 15:23:31,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1960 states. [2019-02-25 15:23:31,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 11570 transitions. [2019-02-25 15:23:31,718 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 11570 transitions. Word has length 7 [2019-02-25 15:23:31,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:31,718 INFO L480 AbstractCegarLoop]: Abstraction has 1960 states and 11570 transitions. [2019-02-25 15:23:31,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:23:31,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 11570 transitions. [2019-02-25 15:23:31,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:23:31,721 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:31,721 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:23:31,722 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:31,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:31,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1928255402, now seen corresponding path program 1 times [2019-02-25 15:23:31,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:31,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:31,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:23:31,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:31,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:31,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:23:31,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:31,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:31,808 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:23:31,808 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [26], [28], [29] [2019-02-25 15:23:31,809 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:31,809 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:31,812 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:31,812 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:23:31,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:31,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:31,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:31,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:31,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:31,827 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:31,830 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:23:31,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:31,835 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:23:31,840 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:23:31,850 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,852 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,852 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:23:31,858 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,860 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,862 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,862 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:23:31,865 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,868 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,869 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,870 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:23:31,870 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,894 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,908 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,918 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,928 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,962 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:23:31,962 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,968 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,977 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,992 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:32,018 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:32,019 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:23:32,044 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:32,050 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:23:32,051 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:23:32,134 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:23:32,135 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:84 [2019-02-25 15:23:32,172 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:32,173 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:32,174 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:32,175 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:32,175 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:32,176 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:23:32,176 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:32,192 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:32,192 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-25 15:23:32,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:32,210 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:32,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:32,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:32,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-02-25 15:23:32,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:32,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:23:32,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:23:32,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:23:32,250 INFO L87 Difference]: Start difference. First operand 1960 states and 11570 transitions. Second operand 9 states. [2019-02-25 15:23:37,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:37,659 INFO L93 Difference]: Finished difference Result 1971 states and 11600 transitions. [2019-02-25 15:23:37,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:23:37,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-02-25 15:23:37,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:37,664 INFO L225 Difference]: With dead ends: 1971 [2019-02-25 15:23:37,665 INFO L226 Difference]: Without dead ends: 1964 [2019-02-25 15:23:37,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:23:37,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-02-25 15:23:43,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-02-25 15:23:43,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-02-25 15:23:43,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 11590 transitions. [2019-02-25 15:23:43,149 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 11590 transitions. Word has length 7 [2019-02-25 15:23:43,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:43,149 INFO L480 AbstractCegarLoop]: Abstraction has 1964 states and 11590 transitions. [2019-02-25 15:23:43,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:23:43,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 11590 transitions. [2019-02-25 15:23:43,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:23:43,153 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:43,153 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:23:43,153 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:43,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:43,154 INFO L82 PathProgramCache]: Analyzing trace with hash 2048132400, now seen corresponding path program 2 times [2019-02-25 15:23:43,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:43,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:43,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:43,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:43,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:43,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:23:43,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:43,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:43,238 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:23:43,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:23:43,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:43,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:43,249 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:23:43,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:23:43,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:23:43,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:23:43,255 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:23:43,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:43,258 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:23:43,262 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:23:43,266 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,268 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,268 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:23:43,273 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,274 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,275 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,276 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:23:43,280 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,282 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,283 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,284 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,285 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:23:43,285 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:43,310 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:43,321 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:43,330 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:43,340 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:43,373 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:23:43,373 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:43,381 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:43,393 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:43,408 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:43,434 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:43,434 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-25 15:23:43,477 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,477 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:23:43,478 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:43,494 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:43,494 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:23:43,514 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,515 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,516 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,517 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,518 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,518 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:23:43,519 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:43,534 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:43,534 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-25 15:23:43,552 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,553 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,554 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,555 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,555 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,556 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,557 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,558 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:43,559 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:23:43,559 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:43,575 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:43,576 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:23:43,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:43,592 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:43,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:43,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:43,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-25 15:23:43,648 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:43,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:23:43,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:23:43,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:23:43,649 INFO L87 Difference]: Start difference. First operand 1964 states and 11590 transitions. Second operand 9 states. [2019-02-25 15:23:49,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:49,367 INFO L93 Difference]: Finished difference Result 2036 states and 11913 transitions. [2019-02-25 15:23:49,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:23:49,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-02-25 15:23:49,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:49,372 INFO L225 Difference]: With dead ends: 2036 [2019-02-25 15:23:49,372 INFO L226 Difference]: Without dead ends: 2033 [2019-02-25 15:23:49,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:23:49,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2019-02-25 15:23:55,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2012. [2019-02-25 15:23:55,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-02-25 15:23:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 11885 transitions. [2019-02-25 15:23:55,017 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 11885 transitions. Word has length 7 [2019-02-25 15:23:55,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:55,017 INFO L480 AbstractCegarLoop]: Abstraction has 2012 states and 11885 transitions. [2019-02-25 15:23:55,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:23:55,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 11885 transitions. [2019-02-25 15:23:55,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:23:55,020 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:55,020 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:23:55,020 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:55,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:55,020 INFO L82 PathProgramCache]: Analyzing trace with hash 2047765234, now seen corresponding path program 3 times [2019-02-25 15:23:55,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:55,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:55,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:23:55,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:55,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:23:55,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:55,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:55,091 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:23:55,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:23:55,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:55,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:55,101 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:23:55,102 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:23:55,106 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:23:55,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:23:55,106 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:23:55,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:55,129 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:23:55,129 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:55,145 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:55,155 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:55,169 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:55,188 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:23:55,190 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:23:55,192 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:23:55,194 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:23:55,199 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:23:55,200 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:55,215 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:55,228 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:55,238 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:55,248 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:55,267 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:55,267 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-25 15:23:55,295 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,303 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-02-25 15:23:55,304 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:23:55,365 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-02-25 15:23:55,366 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:75 [2019-02-25 15:23:55,411 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,413 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,415 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,417 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,420 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,421 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,442 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 68 [2019-02-25 15:23:55,443 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-25 15:23:55,582 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,583 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,584 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,584 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:55,585 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2019-02-25 15:23:55,585 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:55,666 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-02-25 15:23:55,666 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:96, output treesize:167 [2019-02-25 15:23:55,784 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,785 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 57 [2019-02-25 15:23:55,785 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:55,858 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,859 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,860 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,861 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,862 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,863 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,864 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,865 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,866 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 51 [2019-02-25 15:23:55,866 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:55,934 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,936 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,937 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,938 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,939 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,940 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,941 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,941 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:55,942 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 15:23:55,942 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:56,004 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,005 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,006 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,007 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,008 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,008 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:56,009 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 51 [2019-02-25 15:23:56,009 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:56,066 INFO L301 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-02-25 15:23:56,066 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:167, output treesize:115 [2019-02-25 15:23:56,162 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,163 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,164 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,194 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,202 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:56,203 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 49 [2019-02-25 15:23:56,203 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:56,293 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,294 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,295 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,296 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,297 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,298 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,299 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,300 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,300 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 51 [2019-02-25 15:23:56,301 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:56,364 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,365 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,366 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,367 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,368 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,368 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:56,369 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 15:23:56,369 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:56,426 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,427 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,428 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,429 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,430 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,431 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,432 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,433 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,434 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 51 [2019-02-25 15:23:56,434 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:56,488 INFO L301 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-02-25 15:23:56,488 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:155, output treesize:111 [2019-02-25 15:23:56,577 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:56,577 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:56,700 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:56,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:56,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-25 15:23:56,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:56,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:23:56,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:23:56,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:23:56,718 INFO L87 Difference]: Start difference. First operand 2012 states and 11885 transitions. Second operand 11 states. [2019-02-25 15:24:05,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:05,733 INFO L93 Difference]: Finished difference Result 2952 states and 17243 transitions. [2019-02-25 15:24:05,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:24:05,734 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-25 15:24:05,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:05,742 INFO L225 Difference]: With dead ends: 2952 [2019-02-25 15:24:05,742 INFO L226 Difference]: Without dead ends: 2951 [2019-02-25 15:24:05,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-02-25 15:24:05,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2019-02-25 15:24:10,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1726. [2019-02-25 15:24:10,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-02-25 15:24:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 10171 transitions. [2019-02-25 15:24:10,849 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 10171 transitions. Word has length 7 [2019-02-25 15:24:10,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:10,849 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 10171 transitions. [2019-02-25 15:24:10,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:24:10,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 10171 transitions. [2019-02-25 15:24:10,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:24:10,852 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:10,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:24:10,852 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:10,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:10,852 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-02-25 15:24:10,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:10,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:10,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:24:10,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:10,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:11,146 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-02-25 15:24:11,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:24:11,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:11,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:11,362 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:24:11,362 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-02-25 15:24:11,363 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:11,363 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:11,365 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:11,365 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:24:11,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:11,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:11,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:11,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:11,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:11,376 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:11,380 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:24:11,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:11,398 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:24:11,398 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,406 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,417 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,431 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,452 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:24:11,455 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:24:11,457 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:24:11,460 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:24:11,463 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:24:11,464 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,485 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,497 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,506 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,516 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,542 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:11,542 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:24:11,568 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,576 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:24:11,577 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:24:11,660 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:24:11,660 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-02-25 15:24:11,727 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,728 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,728 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:11,728 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 53 [2019-02-25 15:24:11,729 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,780 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,782 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,783 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,784 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,785 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,786 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,786 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 68 [2019-02-25 15:24:11,787 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,836 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:24:11,836 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:112, output treesize:86 [2019-02-25 15:24:11,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:11,896 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:11,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:11,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-02-25 15:24:11,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:11,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:24:11,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:24:11,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:24:11,937 INFO L87 Difference]: Start difference. First operand 1726 states and 10171 transitions. Second operand 10 states. [2019-02-25 15:24:13,939 WARN L181 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-02-25 15:24:14,096 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-02-25 15:24:14,260 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-02-25 15:24:19,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:19,825 INFO L93 Difference]: Finished difference Result 1903 states and 11093 transitions. [2019-02-25 15:24:19,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:24:19,826 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-25 15:24:19,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:19,830 INFO L225 Difference]: With dead ends: 1903 [2019-02-25 15:24:19,831 INFO L226 Difference]: Without dead ends: 1896 [2019-02-25 15:24:19,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:24:19,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-02-25 15:24:25,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1875. [2019-02-25 15:24:25,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2019-02-25 15:24:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 11063 transitions. [2019-02-25 15:24:25,417 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 11063 transitions. Word has length 7 [2019-02-25 15:24:25,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:25,417 INFO L480 AbstractCegarLoop]: Abstraction has 1875 states and 11063 transitions. [2019-02-25 15:24:25,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:24:25,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 11063 transitions. [2019-02-25 15:24:25,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:24:25,420 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:25,420 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:24:25,420 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:25,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:25,421 INFO L82 PathProgramCache]: Analyzing trace with hash -2145066854, now seen corresponding path program 2 times [2019-02-25 15:24:25,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:25,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:25,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:25,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:25,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:25,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:24:25,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:25,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:25,520 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:24:25,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:24:25,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:25,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:25,531 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:24:25,531 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:24:25,535 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-25 15:24:25,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:24:25,536 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:24:25,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:25,540 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:24:25,542 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:24:25,554 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,555 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,555 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:24:25,558 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,560 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,561 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,562 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:24:25,601 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,645 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,669 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,682 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,683 INFO L292 Elim1Store]: Index analysis took 119 ms [2019-02-25 15:24:25,683 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:24:25,684 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,824 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,838 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,847 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,857 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,889 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:24:25,889 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,897 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,906 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,921 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,947 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:25,947 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:24:25,970 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,970 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:24:25,971 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,999 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:26,000 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:24:26,027 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,028 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,029 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,030 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,031 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,032 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:26,040 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:24:26,041 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:24:26,116 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:24:26,117 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:80 [2019-02-25 15:24:26,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:26,152 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:26,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:26,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:26,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:24:26,214 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:26,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:26,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:26,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:26,215 INFO L87 Difference]: Start difference. First operand 1875 states and 11063 transitions. Second operand 8 states. [2019-02-25 15:24:31,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:31,731 INFO L93 Difference]: Finished difference Result 1884 states and 11081 transitions. [2019-02-25 15:24:31,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:24:31,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-25 15:24:31,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:31,736 INFO L225 Difference]: With dead ends: 1884 [2019-02-25 15:24:31,736 INFO L226 Difference]: Without dead ends: 1877 [2019-02-25 15:24:31,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:24:31,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2019-02-25 15:24:37,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1877. [2019-02-25 15:24:37,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2019-02-25 15:24:37,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 11071 transitions. [2019-02-25 15:24:37,616 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 11071 transitions. Word has length 7 [2019-02-25 15:24:37,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:37,616 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 11071 transitions. [2019-02-25 15:24:37,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:37,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 11071 transitions. [2019-02-25 15:24:37,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:24:37,619 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:37,619 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:24:37,619 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:37,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:37,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1861574920, now seen corresponding path program 1 times [2019-02-25 15:24:37,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:37,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:37,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:24:37,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:37,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:37,771 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-02-25 15:24:37,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:37,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:37,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:37,832 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-25 15:24:37,832 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-02-25 15:24:37,833 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:37,834 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:37,836 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:37,836 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:24:37,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:37,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:37,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:37,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:37,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:37,853 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:37,860 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:24:37,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:37,882 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:24:37,882 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,891 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,906 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,925 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,948 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:24:37,951 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:24:37,957 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:24:37,960 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:24:37,971 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:24:37,971 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,991 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:38,002 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:38,010 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:38,019 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:38,045 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:38,045 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:24:38,070 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,070 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:24:38,070 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:38,094 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:38,094 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-25 15:24:38,112 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,112 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,113 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,114 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,116 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,117 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,118 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 64 [2019-02-25 15:24:38,119 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:38,156 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:38,156 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-02-25 15:24:38,176 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,176 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,177 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,178 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,179 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,180 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,181 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,184 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,185 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:38,193 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:24:38,194 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:24:38,264 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:24:38,265 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-02-25 15:24:38,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:38,297 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:38,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:38,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-25 15:24:38,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:38,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:24:38,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:24:38,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:24:38,345 INFO L87 Difference]: Start difference. First operand 1877 states and 11071 transitions. Second operand 11 states. [2019-02-25 15:24:47,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:47,084 INFO L93 Difference]: Finished difference Result 2991 states and 17341 transitions. [2019-02-25 15:24:47,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:24:47,084 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-25 15:24:47,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:47,092 INFO L225 Difference]: With dead ends: 2991 [2019-02-25 15:24:47,092 INFO L226 Difference]: Without dead ends: 2978 [2019-02-25 15:24:47,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:24:47,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-02-25 15:24:54,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2350. [2019-02-25 15:24:54,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2350 states. [2019-02-25 15:24:54,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 13866 transitions. [2019-02-25 15:24:54,485 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 13866 transitions. Word has length 8 [2019-02-25 15:24:54,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:54,485 INFO L480 AbstractCegarLoop]: Abstraction has 2350 states and 13866 transitions. [2019-02-25 15:24:54,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:24:54,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 13866 transitions. [2019-02-25 15:24:54,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:24:54,488 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:54,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:24:54,489 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:54,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:54,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1861146186, now seen corresponding path program 1 times [2019-02-25 15:24:54,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:54,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:54,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:54,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:54,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:54,578 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:24:54,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:54,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:54,579 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-25 15:24:54,579 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-02-25 15:24:54,580 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:54,580 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:54,581 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:54,582 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 15:24:54,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:54,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:54,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:54,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:54,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:54,597 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:54,604 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:24:54,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:54,624 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:24:54,624 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:54,634 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:54,643 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:54,653 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:54,669 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:54,690 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:24:54,692 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:24:54,693 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:24:54,712 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:24:54,728 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:24:54,729 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,038 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,051 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,062 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,071 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,099 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,099 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-02-25 15:24:55,133 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,134 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:24:55,134 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,158 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:55,159 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-25 15:24:55,188 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,189 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,190 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,190 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,191 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,192 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,193 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:24:55,194 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,219 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:55,220 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-25 15:24:55,244 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,245 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,246 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,246 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,248 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,249 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,250 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,251 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,251 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:55,252 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:24:55,252 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,276 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:55,277 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-25 15:24:55,301 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,302 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,303 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,304 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,305 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,306 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,308 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,309 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,309 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:55,310 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:24:55,310 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,336 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:55,337 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:36 [2019-02-25 15:24:55,361 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,362 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,363 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,364 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,365 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,366 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,367 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,368 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,369 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,370 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:55,370 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 70 [2019-02-25 15:24:55,371 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,396 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:55,397 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-02-25 15:24:55,456 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:55,456 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:56,170 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:56,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:56,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-25 15:24:56,189 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:56,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-25 15:24:56,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-25 15:24:56,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:24:56,190 INFO L87 Difference]: Start difference. First operand 2350 states and 13866 transitions. Second operand 14 states. [2019-02-25 15:25:06,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:06,186 INFO L93 Difference]: Finished difference Result 3181 states and 18621 transitions. [2019-02-25 15:25:06,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:25:06,187 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-02-25 15:25:06,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:06,195 INFO L225 Difference]: With dead ends: 3181 [2019-02-25 15:25:06,195 INFO L226 Difference]: Without dead ends: 3179 [2019-02-25 15:25:06,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=188, Invalid=364, Unknown=0, NotChecked=0, Total=552 [2019-02-25 15:25:06,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2019-02-25 15:25:13,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 2326. [2019-02-25 15:25:13,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-02-25 15:25:13,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13718 transitions. [2019-02-25 15:25:13,510 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13718 transitions. Word has length 8 [2019-02-25 15:25:13,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:13,511 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13718 transitions. [2019-02-25 15:25:13,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-25 15:25:13,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13718 transitions. [2019-02-25 15:25:13,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:25:13,514 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:13,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:25:13,514 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:13,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:13,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1477451752, now seen corresponding path program 1 times [2019-02-25 15:25:13,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:13,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:13,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:13,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:13,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:13,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:25:13,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:25:13,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-25 15:25:13,591 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:25:13,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-25 15:25:13,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-25 15:25:13,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-02-25 15:25:13,592 INFO L87 Difference]: Start difference. First operand 2326 states and 13718 transitions. Second operand 5 states. [2019-02-25 15:25:20,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:20,516 INFO L93 Difference]: Finished difference Result 2346 states and 13737 transitions. [2019-02-25 15:25:20,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:25:20,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-02-25 15:25:20,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:20,522 INFO L225 Difference]: With dead ends: 2346 [2019-02-25 15:25:20,523 INFO L226 Difference]: Without dead ends: 2337 [2019-02-25 15:25:20,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:25:20,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-02-25 15:25:27,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2326. [2019-02-25 15:25:27,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-02-25 15:25:27,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13543 transitions. [2019-02-25 15:25:27,842 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13543 transitions. Word has length 8 [2019-02-25 15:25:27,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:27,842 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13543 transitions. [2019-02-25 15:25:27,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-25 15:25:27,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13543 transitions. [2019-02-25 15:25:27,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:25:27,846 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:27,846 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:25:27,846 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:27,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:27,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 2 times [2019-02-25 15:25:27,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:27,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:27,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:27,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:27,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:27,967 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:25:27,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:27,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:27,967 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:25:27,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:25:27,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:27,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:25:27,975 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:25:27,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:25:27,984 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-25 15:25:27,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:25:27,984 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:25:27,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:28,028 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:25:28,029 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:28,038 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:28,044 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:28,055 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:28,072 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:28,095 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:25:28,097 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:25:28,100 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:25:28,103 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:25:28,107 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:25:28,107 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:28,128 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:28,141 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:28,151 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:28,160 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:28,188 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:28,188 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-02-25 15:25:28,282 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,283 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:25:28,283 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:28,664 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:28,665 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-25 15:25:28,700 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,701 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,701 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,702 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,703 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,704 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,704 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:25:28,705 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:28,732 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:28,732 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-25 15:25:28,760 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,761 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,762 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,763 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,764 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,765 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,766 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,766 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:28,767 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:25:28,768 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:28,794 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:28,794 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:36 [2019-02-25 15:25:28,820 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,821 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,822 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,823 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,824 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,825 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,826 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,827 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,828 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,829 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,830 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:28,831 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 70 [2019-02-25 15:25:28,831 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:28,866 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:28,867 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-25 15:25:28,892 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,892 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,893 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,894 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,895 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,896 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,897 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,898 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,899 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:28,900 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:28,900 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 70 [2019-02-25 15:25:28,901 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:28,925 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:28,925 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-02-25 15:25:28,952 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:28,952 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:29,038 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:29,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:29,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-25 15:25:29,057 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:29,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-25 15:25:29,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-25 15:25:29,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:25:29,057 INFO L87 Difference]: Start difference. First operand 2326 states and 13543 transitions. Second operand 14 states. [2019-02-25 15:25:36,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:36,833 INFO L93 Difference]: Finished difference Result 2345 states and 13559 transitions. [2019-02-25 15:25:36,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:25:36,834 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-02-25 15:25:36,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:36,840 INFO L225 Difference]: With dead ends: 2345 [2019-02-25 15:25:36,841 INFO L226 Difference]: Without dead ends: 2338 [2019-02-25 15:25:36,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2019-02-25 15:25:36,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2019-02-25 15:25:38,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 473. [2019-02-25 15:25:38,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-02-25 15:25:38,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 2593 transitions. [2019-02-25 15:25:38,922 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 2593 transitions. Word has length 8 [2019-02-25 15:25:38,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:38,922 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 2593 transitions. [2019-02-25 15:25:38,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-25 15:25:38,922 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 2593 transitions. [2019-02-25 15:25:38,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:25:38,923 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:38,923 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-25 15:25:38,923 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:38,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:38,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1700463206, now seen corresponding path program 1 times [2019-02-25 15:25:38,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:38,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:38,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:25:38,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:38,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:38,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:25:38,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:38,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:38,985 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-25 15:25:38,985 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-02-25 15:25:38,985 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:38,986 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:38,987 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:38,987 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:25:38,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:38,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:38,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:38,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:25:38,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:38,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:39,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:25:39,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:39,009 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:25:39,011 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:25:39,016 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,017 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,018 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:25:39,022 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,023 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,025 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,026 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:25:39,032 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-25 15:25:39,032 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,048 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,062 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,071 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,081 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,104 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:25:39,104 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,108 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,116 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,134 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:39,134 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-25 15:25:39,163 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,164 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:25:39,164 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,172 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,172 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-02-25 15:25:39,185 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,186 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,187 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,187 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,188 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 15:25:39,188 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,197 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,198 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:18 [2019-02-25 15:25:39,210 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,211 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,213 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,213 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,214 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,215 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,216 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2019-02-25 15:25:39,216 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,226 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:39,226 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:16 [2019-02-25 15:25:39,240 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,240 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,241 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,242 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,243 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,244 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,245 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 15:25:39,245 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,254 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:39,255 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2019-02-25 15:25:39,268 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:39,269 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:39,307 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:39,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:39,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-25 15:25:39,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:39,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:25:39,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:25:39,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:25:39,326 INFO L87 Difference]: Start difference. First operand 473 states and 2593 transitions. Second operand 11 states. [2019-02-25 15:25:41,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:41,567 INFO L93 Difference]: Finished difference Result 480 states and 2609 transitions. [2019-02-25 15:25:41,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:25:41,567 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-25 15:25:41,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:41,569 INFO L225 Difference]: With dead ends: 480 [2019-02-25 15:25:41,569 INFO L226 Difference]: Without dead ends: 477 [2019-02-25 15:25:41,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:25:41,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-02-25 15:25:42,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 158. [2019-02-25 15:25:42,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-02-25 15:25:42,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 805 transitions. [2019-02-25 15:25:42,480 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 805 transitions. Word has length 8 [2019-02-25 15:25:42,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:42,481 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 805 transitions. [2019-02-25 15:25:42,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:25:42,481 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 805 transitions. [2019-02-25 15:25:42,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:25:42,481 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:42,481 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:25:42,481 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:42,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:42,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1702729308, now seen corresponding path program 1 times [2019-02-25 15:25:42,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:42,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:42,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:42,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:42,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:25:42,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:42,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:42,536 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-25 15:25:42,536 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-02-25 15:25:42,537 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:42,537 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:42,539 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:42,539 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:25:42,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:42,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:42,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:42,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:25:42,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:42,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:42,561 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:25:42,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:42,568 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:25:42,574 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:25:42,577 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:42,578 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:42,578 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:25:42,583 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:42,584 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:42,585 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:42,586 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:25:42,590 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:42,592 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:42,593 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:42,594 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:42,595 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:25:42,595 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:42,622 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:42,635 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:42,645 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:42,656 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:42,688 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:25:42,689 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:42,696 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:42,706 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:42,721 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:42,747 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:42,747 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:25:42,782 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:42,782 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:25:42,782 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:42,798 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:42,798 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:25:42,815 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:42,816 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:42,817 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:42,818 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:42,819 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:42,820 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:25:42,820 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:42,835 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:42,835 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-25 15:25:42,852 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:42,853 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:42,854 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:42,855 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:42,856 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:42,857 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:42,858 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:42,859 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:42,860 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:25:42,860 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:42,876 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:42,876 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:25:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:42,895 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:42,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:42,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:42,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-25 15:25:42,944 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:42,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:25:42,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:25:42,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:25:42,945 INFO L87 Difference]: Start difference. First operand 158 states and 805 transitions. Second operand 9 states. [2019-02-25 15:25:44,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:44,696 INFO L93 Difference]: Finished difference Result 250 states and 1244 transitions. [2019-02-25 15:25:44,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:25:44,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-25 15:25:44,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:44,697 INFO L225 Difference]: With dead ends: 250 [2019-02-25 15:25:44,697 INFO L226 Difference]: Without dead ends: 243 [2019-02-25 15:25:44,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:25:44,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-02-25 15:25:46,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 217. [2019-02-25 15:25:46,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-02-25 15:25:46,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 1122 transitions. [2019-02-25 15:25:46,140 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 1122 transitions. Word has length 8 [2019-02-25 15:25:46,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:46,140 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 1122 transitions. [2019-02-25 15:25:46,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:25:46,140 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 1122 transitions. [2019-02-25 15:25:46,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:25:46,141 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:46,141 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:25:46,141 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:46,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:46,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1689800014, now seen corresponding path program 1 times [2019-02-25 15:25:46,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:46,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:46,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:46,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:46,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:46,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:25:46,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:46,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:46,234 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-25 15:25:46,234 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-02-25 15:25:46,235 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:46,235 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:46,236 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:46,237 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:25:46,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:46,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:46,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:46,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:25:46,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:46,245 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:46,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:25:46,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:46,253 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:25:46,257 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:25:46,261 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:46,262 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:46,263 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:25:46,270 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:46,271 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:46,272 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:46,273 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:25:46,282 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-25 15:25:46,282 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:46,296 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:46,307 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:46,316 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:46,326 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:46,350 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:25:46,350 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:46,355 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:46,364 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:46,382 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:46,382 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-25 15:25:46,410 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:46,410 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:25:46,411 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:46,419 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:46,419 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-02-25 15:25:46,432 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:46,432 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:46,433 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:46,434 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:46,434 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 15:25:46,435 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:46,444 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:46,445 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-02-25 15:25:46,459 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:46,461 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:46,462 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:46,463 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:46,464 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:46,464 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:46,465 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 15:25:46,465 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:46,474 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:46,474 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-02-25 15:25:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:46,488 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:46,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:46,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:46,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:25:46,533 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:46,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:25:46,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:25:46,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:25:46,534 INFO L87 Difference]: Start difference. First operand 217 states and 1122 transitions. Second operand 10 states. [2019-02-25 15:25:49,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:49,585 INFO L93 Difference]: Finished difference Result 372 states and 1862 transitions. [2019-02-25 15:25:49,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:25:49,585 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-25 15:25:49,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:49,587 INFO L225 Difference]: With dead ends: 372 [2019-02-25 15:25:49,587 INFO L226 Difference]: Without dead ends: 362 [2019-02-25 15:25:49,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:25:49,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-02-25 15:25:51,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 274. [2019-02-25 15:25:51,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-02-25 15:25:51,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 1432 transitions. [2019-02-25 15:25:51,784 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 1432 transitions. Word has length 8 [2019-02-25 15:25:51,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:51,784 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 1432 transitions. [2019-02-25 15:25:51,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:25:51,785 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 1432 transitions. [2019-02-25 15:25:51,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:25:51,786 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:51,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:25:51,786 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:51,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:51,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1048110876, now seen corresponding path program 2 times [2019-02-25 15:25:51,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:51,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:51,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:51,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:51,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:51,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:51,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:51,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:51,869 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:25:51,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:25:51,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:51,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:25:51,880 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:25:51,880 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:25:51,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:25:51,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:25:51,885 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:25:51,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:51,889 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:25:51,893 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:25:51,898 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:51,899 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:51,900 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:25:51,959 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:51,984 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,006 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,007 INFO L292 Elim1Store]: Index analysis took 106 ms [2019-02-25 15:25:52,008 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:25:52,048 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,097 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,118 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,144 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,144 INFO L292 Elim1Store]: Index analysis took 135 ms [2019-02-25 15:25:52,145 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:25:52,145 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:52,260 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:52,274 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:52,282 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:52,291 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:52,324 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:25:52,324 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:52,332 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:52,341 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:52,356 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:52,382 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:52,382 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:25:52,403 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,404 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:25:52,404 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:52,428 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:52,429 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:25:52,448 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,449 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,449 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,450 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,453 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,454 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:52,462 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:25:52,463 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:25:52,540 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:25:52,541 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:76 [2019-02-25 15:25:52,575 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,575 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,576 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,577 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,578 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,579 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:25:52,579 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:52,595 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:52,595 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-25 15:25:52,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:52,612 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:52,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:52,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:52,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:25:52,679 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:52,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:25:52,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:25:52,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:25:52,680 INFO L87 Difference]: Start difference. First operand 274 states and 1432 transitions. Second operand 10 states. [2019-02-25 15:25:55,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:55,431 INFO L93 Difference]: Finished difference Result 332 states and 1700 transitions. [2019-02-25 15:25:55,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:25:55,431 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-25 15:25:55,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:55,433 INFO L225 Difference]: With dead ends: 332 [2019-02-25 15:25:55,433 INFO L226 Difference]: Without dead ends: 325 [2019-02-25 15:25:55,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:25:55,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-02-25 15:25:57,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 285. [2019-02-25 15:25:57,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-02-25 15:25:57,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 1489 transitions. [2019-02-25 15:25:57,704 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 1489 transitions. Word has length 8 [2019-02-25 15:25:57,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:57,704 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 1489 transitions. [2019-02-25 15:25:57,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:25:57,704 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 1489 transitions. [2019-02-25 15:25:57,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:25:57,705 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:57,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:25:57,705 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:57,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:57,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1051804960, now seen corresponding path program 1 times [2019-02-25 15:25:57,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:57,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:57,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:25:57,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:57,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:57,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:25:57,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:57,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:57,786 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-25 15:25:57,786 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-02-25 15:25:57,787 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:57,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:57,790 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:57,790 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:25:57,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:57,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:57,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:57,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:25:57,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:57,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:57,812 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:25:57,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:57,827 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:25:57,827 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:57,836 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:57,848 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:57,863 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:57,883 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:25:57,887 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:25:57,891 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:25:57,894 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:25:57,897 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:25:57,897 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:57,917 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:57,929 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:57,938 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:57,947 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:57,973 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:57,973 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-25 15:25:58,017 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:58,018 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:25:58,018 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:58,033 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:58,033 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:25:58,055 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:58,056 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:58,057 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:58,058 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:58,059 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:58,059 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:25:58,060 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:58,076 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:58,077 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-25 15:25:58,118 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:58,119 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:58,120 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:58,120 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:58,121 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:58,121 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:58,122 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:25:58,122 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:58,139 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:58,139 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-25 15:25:58,356 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:58,357 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:58,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:58,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:58,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:25:58,420 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:58,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:25:58,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:25:58,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:25:58,420 INFO L87 Difference]: Start difference. First operand 285 states and 1489 transitions. Second operand 10 states. [2019-02-25 15:26:00,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:00,924 INFO L93 Difference]: Finished difference Result 294 states and 1507 transitions. [2019-02-25 15:26:00,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:26:00,924 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-25 15:26:00,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:00,926 INFO L225 Difference]: With dead ends: 294 [2019-02-25 15:26:00,926 INFO L226 Difference]: Without dead ends: 287 [2019-02-25 15:26:00,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:26:00,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-02-25 15:26:03,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2019-02-25 15:26:03,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-02-25 15:26:03,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1484 transitions. [2019-02-25 15:26:03,206 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1484 transitions. Word has length 8 [2019-02-25 15:26:03,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:03,206 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1484 transitions. [2019-02-25 15:26:03,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:26:03,206 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1484 transitions. [2019-02-25 15:26:03,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:26:03,207 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:03,207 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:26:03,207 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:03,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:03,208 INFO L82 PathProgramCache]: Analyzing trace with hash -944676524, now seen corresponding path program 1 times [2019-02-25 15:26:03,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:03,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:03,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:03,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:03,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:03,318 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:26:03,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:03,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:03,318 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-25 15:26:03,319 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-02-25 15:26:03,319 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:03,320 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:03,321 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:03,322 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:26:03,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:03,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:03,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:03,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:26:03,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:03,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:03,335 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:26:03,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:03,339 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:26:03,342 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:26:03,347 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,349 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,350 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:26:03,354 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,355 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,356 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,357 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:26:03,362 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,364 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,368 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,369 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,369 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:26:03,370 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:03,394 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:03,406 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:03,414 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:03,425 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:03,457 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:26:03,458 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:03,465 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:03,473 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:03,488 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:03,514 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:03,514 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-25 15:26:03,545 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,546 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:26:03,546 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:03,569 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:03,570 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-25 15:26:03,596 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,597 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,598 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,599 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,601 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,602 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,610 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:26:03,611 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:26:03,685 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:26:03,686 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:70 [2019-02-25 15:26:03,757 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,758 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,759 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,760 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,761 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,762 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:03,762 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 45 [2019-02-25 15:26:03,763 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:03,804 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,805 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,806 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,807 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,807 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,808 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,809 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,810 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:03,811 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:03,812 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 68 [2019-02-25 15:26:03,812 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:03,853 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:26:03,854 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-02-25 15:26:03,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:03,905 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:03,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:03,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:03,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-25 15:26:03,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:03,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:26:03,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:26:03,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:26:03,959 INFO L87 Difference]: Start difference. First operand 284 states and 1484 transitions. Second operand 11 states. [2019-02-25 15:26:04,437 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-02-25 15:26:07,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:07,371 INFO L93 Difference]: Finished difference Result 364 states and 1818 transitions. [2019-02-25 15:26:07,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:26:07,371 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-25 15:26:07,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:07,373 INFO L225 Difference]: With dead ends: 364 [2019-02-25 15:26:07,373 INFO L226 Difference]: Without dead ends: 357 [2019-02-25 15:26:07,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:26:07,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-02-25 15:26:09,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 283. [2019-02-25 15:26:09,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-02-25 15:26:09,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 1479 transitions. [2019-02-25 15:26:09,765 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 1479 transitions. Word has length 8 [2019-02-25 15:26:09,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:09,765 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 1479 transitions. [2019-02-25 15:26:09,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:26:09,765 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 1479 transitions. [2019-02-25 15:26:09,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:26:09,766 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:09,766 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:26:09,766 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:09,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:09,766 INFO L82 PathProgramCache]: Analyzing trace with hash -937288356, now seen corresponding path program 1 times [2019-02-25 15:26:09,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:09,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:09,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:09,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:09,767 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:09,913 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2019-02-25 15:26:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:26:09,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:09,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:09,944 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-25 15:26:09,944 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-02-25 15:26:09,945 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:09,945 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:09,946 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:09,946 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:26:09,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:09,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:09,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:09,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:26:09,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:09,954 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:09,959 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:26:09,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:09,962 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:26:09,964 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:26:09,969 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,970 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,970 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:26:09,974 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,976 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,977 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,977 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:26:09,981 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,982 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,983 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,984 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,985 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:26:09,985 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,010 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,024 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,034 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,044 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,077 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:26:10,077 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,085 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,097 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,111 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,137 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:10,137 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-25 15:26:10,179 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,179 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:26:10,180 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,195 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:10,195 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:26:10,215 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,216 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,217 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,218 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,219 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,219 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:26:10,220 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,236 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:10,236 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-25 15:26:10,256 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,257 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,258 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,259 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,260 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,261 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,261 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:10,262 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:26:10,262 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,278 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:10,278 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:26:10,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:10,346 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:10,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:10,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:10,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-25 15:26:10,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:10,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:26:10,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:26:10,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:26:10,393 INFO L87 Difference]: Start difference. First operand 283 states and 1479 transitions. Second operand 9 states. [2019-02-25 15:26:13,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:13,310 INFO L93 Difference]: Finished difference Result 319 states and 1617 transitions. [2019-02-25 15:26:13,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:26:13,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-25 15:26:13,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:13,312 INFO L225 Difference]: With dead ends: 319 [2019-02-25 15:26:13,312 INFO L226 Difference]: Without dead ends: 312 [2019-02-25 15:26:13,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:26:13,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-02-25 15:26:16,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 304. [2019-02-25 15:26:16,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-02-25 15:26:16,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 1600 transitions. [2019-02-25 15:26:16,065 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 1600 transitions. Word has length 8 [2019-02-25 15:26:16,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:16,065 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 1600 transitions. [2019-02-25 15:26:16,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:26:16,065 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 1600 transitions. [2019-02-25 15:26:16,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:26:16,066 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:16,066 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:26:16,066 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:16,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:16,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1115262138, now seen corresponding path program 1 times [2019-02-25 15:26:16,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:16,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:16,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:16,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:16,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:16,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:26:16,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:16,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:16,183 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-25 15:26:16,183 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-02-25 15:26:16,184 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:16,184 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:16,186 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:16,186 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:26:16,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:16,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:16,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:16,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:26:16,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:16,195 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:16,199 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:26:16,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:16,221 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:26:16,221 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:16,229 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:16,242 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:16,261 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:16,283 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:26:16,287 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:26:16,291 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:26:16,294 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:26:16,297 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:26:16,298 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:16,319 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:16,331 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:16,340 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:16,349 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:16,375 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:16,375 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-25 15:26:16,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:16,414 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:26:16,415 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:26:16,497 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-25 15:26:16,498 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-02-25 15:26:16,583 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:16,583 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:16,584 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:16,585 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:16,586 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:16,587 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2019-02-25 15:26:16,587 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:16,638 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:16,639 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:16,641 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:16,642 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:16,643 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:16,644 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:16,644 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 68 [2019-02-25 15:26:16,645 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:16,683 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:26:16,683 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:68 [2019-02-25 15:26:16,728 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:16,728 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:16,748 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:16,770 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:16,771 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:16,772 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:16,773 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:16,774 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:16,774 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:16,775 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 68 [2019-02-25 15:26:16,776 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:16,817 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:16,818 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:16,819 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:16,820 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:16,821 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:16,821 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:16,822 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 45 [2019-02-25 15:26:16,822 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:16,856 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:26:16,856 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-02-25 15:26:16,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:16,905 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:16,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:16,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:16,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-25 15:26:16,957 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:16,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:26:16,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:26:16,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:26:16,958 INFO L87 Difference]: Start difference. First operand 304 states and 1600 transitions. Second operand 11 states. [2019-02-25 15:26:18,330 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-02-25 15:26:21,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:21,165 INFO L93 Difference]: Finished difference Result 392 states and 1929 transitions. [2019-02-25 15:26:21,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:26:21,165 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-25 15:26:21,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:21,167 INFO L225 Difference]: With dead ends: 392 [2019-02-25 15:26:21,167 INFO L226 Difference]: Without dead ends: 386 [2019-02-25 15:26:21,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:26:21,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-02-25 15:26:24,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 315. [2019-02-25 15:26:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-02-25 15:26:24,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 1665 transitions. [2019-02-25 15:26:24,114 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 1665 transitions. Word has length 8 [2019-02-25 15:26:24,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:24,114 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 1665 transitions. [2019-02-25 15:26:24,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:26:24,114 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 1665 transitions. [2019-02-25 15:26:24,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:26:24,115 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:24,115 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:26:24,115 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:24,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:24,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-02-25 15:26:24,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:24,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:24,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:24,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:24,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:24,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:26:24,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:26:24,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-25 15:26:24,193 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:26:24,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-25 15:26:24,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-25 15:26:24,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-02-25 15:26:24,194 INFO L87 Difference]: Start difference. First operand 315 states and 1665 transitions. Second operand 5 states. [2019-02-25 15:26:27,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:27,024 INFO L93 Difference]: Finished difference Result 320 states and 1669 transitions. [2019-02-25 15:26:27,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:26:27,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-02-25 15:26:27,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:27,026 INFO L225 Difference]: With dead ends: 320 [2019-02-25 15:26:27,026 INFO L226 Difference]: Without dead ends: 315 [2019-02-25 15:26:27,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:26:27,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-02-25 15:26:29,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 314. [2019-02-25 15:26:29,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-02-25 15:26:29,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 1654 transitions. [2019-02-25 15:26:29,971 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 1654 transitions. Word has length 8 [2019-02-25 15:26:29,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:29,971 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 1654 transitions. [2019-02-25 15:26:29,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-25 15:26:29,971 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 1654 transitions. [2019-02-25 15:26:29,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:26:29,972 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:29,972 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:26:29,972 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:29,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:29,973 INFO L82 PathProgramCache]: Analyzing trace with hash 95484720, now seen corresponding path program 3 times [2019-02-25 15:26:29,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:29,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:29,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:29,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:29,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:30,127 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-02-25 15:26:30,175 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:26:30,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:30,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:30,176 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:26:30,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:26:30,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:30,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:26:30,184 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:26:30,184 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:26:30,189 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:26:30,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:26:30,190 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:26:30,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:30,206 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:26:30,206 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:30,215 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:30,224 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:30,238 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:30,259 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:26:30,262 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:26:30,265 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:26:30,268 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:26:30,271 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:26:30,271 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:30,291 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:30,303 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:30,312 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:30,321 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:30,347 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:30,347 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:26:30,373 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,374 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:26:30,374 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:30,398 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:30,398 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-25 15:26:30,420 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,420 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,421 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,423 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,425 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,426 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,427 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 62 [2019-02-25 15:26:30,427 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:30,452 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:30,452 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:46 [2019-02-25 15:26:30,477 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,478 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,479 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,479 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,482 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,483 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,491 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:26:30,492 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:26:30,568 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:26:30,569 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:68 [2019-02-25 15:26:30,715 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,715 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,716 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,717 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,717 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,718 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,718 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,719 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:30,719 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:26:30,720 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:30,739 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:30,739 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:26:30,766 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:30,766 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:30,825 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:30,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:30,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:26:30,843 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:30,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:26:30,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:26:30,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:26:30,844 INFO L87 Difference]: Start difference. First operand 314 states and 1654 transitions. Second operand 12 states. [2019-02-25 15:26:36,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:36,877 INFO L93 Difference]: Finished difference Result 601 states and 3111 transitions. [2019-02-25 15:26:36,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:26:36,877 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-25 15:26:36,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:36,879 INFO L225 Difference]: With dead ends: 601 [2019-02-25 15:26:36,879 INFO L226 Difference]: Without dead ends: 591 [2019-02-25 15:26:36,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-02-25 15:26:36,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-02-25 15:26:41,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 448. [2019-02-25 15:26:41,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-02-25 15:26:41,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 2380 transitions. [2019-02-25 15:26:41,776 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 2380 transitions. Word has length 9 [2019-02-25 15:26:41,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:41,776 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 2380 transitions. [2019-02-25 15:26:41,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:26:41,776 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 2380 transitions. [2019-02-25 15:26:41,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:26:41,777 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:41,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:26:41,777 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:41,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:41,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1988764338, now seen corresponding path program 1 times [2019-02-25 15:26:41,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:41,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:41,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:26:41,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:41,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:41,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:26:41,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:41,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:41,873 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-25 15:26:41,873 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-02-25 15:26:41,874 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:41,874 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:41,876 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:41,876 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:26:41,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:41,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:41,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:41,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:26:41,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:41,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:41,891 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:26:41,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:41,914 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:26:41,915 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:41,923 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:41,934 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:41,951 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:41,974 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:26:41,978 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:26:41,982 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:26:41,984 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:26:41,987 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:26:41,987 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:42,008 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:42,019 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:42,028 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:42,037 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:42,063 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:42,064 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:26:42,087 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,088 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:26:42,088 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:42,113 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:42,113 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:26:42,136 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,138 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,139 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,140 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,142 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,143 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,144 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 64 [2019-02-25 15:26:42,144 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:42,168 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:42,168 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-02-25 15:26:42,190 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,208 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,208 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,209 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,210 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,210 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,211 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,212 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:42,221 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:26:42,221 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:26:42,293 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:26:42,294 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:68 [2019-02-25 15:26:42,328 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:42,328 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:42,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:42,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:42,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:26:42,385 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:42,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:26:42,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:26:42,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:26:42,386 INFO L87 Difference]: Start difference. First operand 448 states and 2380 transitions. Second operand 10 states. [2019-02-25 15:26:51,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:51,676 INFO L93 Difference]: Finished difference Result 731 states and 3887 transitions. [2019-02-25 15:26:51,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:26:51,676 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-25 15:26:51,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:51,678 INFO L225 Difference]: With dead ends: 731 [2019-02-25 15:26:51,678 INFO L226 Difference]: Without dead ends: 718 [2019-02-25 15:26:51,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:26:51,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-02-25 15:26:59,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 399. [2019-02-25 15:26:59,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-02-25 15:26:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 2082 transitions. [2019-02-25 15:26:59,708 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 2082 transitions. Word has length 9 [2019-02-25 15:26:59,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:59,709 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 2082 transitions. [2019-02-25 15:26:59,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:26:59,709 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 2082 transitions. [2019-02-25 15:26:59,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:26:59,709 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:59,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:26:59,710 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:59,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:59,710 INFO L82 PathProgramCache]: Analyzing trace with hash 2086595996, now seen corresponding path program 1 times [2019-02-25 15:26:59,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:59,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:59,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:59,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:59,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:26:59,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:59,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:59,839 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-25 15:26:59,839 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-02-25 15:26:59,840 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:59,840 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:59,842 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:59,842 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:26:59,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:59,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:59,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:59,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:26:59,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:59,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:59,860 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:26:59,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:59,881 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:26:59,881 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:59,888 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:59,900 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:59,919 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:59,941 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:26:59,945 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:26:59,948 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:26:59,951 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:26:59,954 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:26:59,954 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:59,974 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:59,986 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:59,995 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:00,004 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:00,030 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:00,030 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-25 15:27:00,075 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:00,076 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:27:00,076 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:00,093 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:00,093 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:33 [2019-02-25 15:27:00,114 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:00,115 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:00,116 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:00,117 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:00,118 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:00,119 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:27:00,119 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:00,134 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:00,134 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-02-25 15:27:00,155 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:00,156 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:00,157 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:00,158 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:00,159 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:00,160 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:00,161 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:27:00,162 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:27:00,162 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:00,184 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:00,185 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-02-25 15:27:00,207 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:00,208 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:00,208 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:00,209 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:00,210 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:00,211 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:00,212 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:27:00,212 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:27:00,213 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:00,228 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:00,228 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:35 [2019-02-25 15:27:00,253 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:27:00,253 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:27:00,318 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:27:00,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:27:00,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:27:00,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:27:00,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:27:00,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:27:00,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:27:00,338 INFO L87 Difference]: Start difference. First operand 399 states and 2082 transitions. Second operand 12 states. [2019-02-25 15:27:09,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:27:09,874 INFO L93 Difference]: Finished difference Result 480 states and 2456 transitions. [2019-02-25 15:27:09,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:27:09,875 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-25 15:27:09,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:27:09,876 INFO L225 Difference]: With dead ends: 480 [2019-02-25 15:27:09,876 INFO L226 Difference]: Without dead ends: 473 [2019-02-25 15:27:09,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2019-02-25 15:27:09,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-02-25 15:27:12,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 193. [2019-02-25 15:27:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-02-25 15:27:12,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 982 transitions. [2019-02-25 15:27:12,998 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 982 transitions. Word has length 9 [2019-02-25 15:27:12,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:27:12,998 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 982 transitions. [2019-02-25 15:27:12,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:27:12,998 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 982 transitions. [2019-02-25 15:27:12,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:27:12,999 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:27:12,999 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:27:12,999 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:27:12,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:12,999 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-02-25 15:27:13,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:27:13,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:13,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:13,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:13,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:27:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:13,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:27:13,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:13,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:27:13,099 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-25 15:27:13,099 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-02-25 15:27:13,100 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:27:13,100 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:27:13,102 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:27:13,102 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:27:13,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:13,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:27:13,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:13,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:27:13,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:13,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:27:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:13,123 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:27:13,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:27:13,126 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:27:13,129 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:27:13,133 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,133 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,134 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:27:13,139 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,140 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,141 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,142 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:27:13,145 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,148 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,149 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,150 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,151 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:27:13,151 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:13,176 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:13,189 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:13,199 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:13,209 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:13,242 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:27:13,242 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:13,249 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:13,259 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:13,274 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:13,300 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:13,300 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-25 15:27:13,344 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,344 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:27:13,345 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:13,360 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:13,360 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:27:13,381 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,381 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,382 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,384 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,385 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,385 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:27:13,386 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:13,402 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:13,402 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-25 15:27:13,421 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,422 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,423 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,424 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,425 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,425 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:27:13,426 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:27:13,426 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:13,441 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:13,441 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:27:13,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:27:13,461 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:27:13,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:27:13,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:27:13,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:27:13,508 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:27:13,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:27:13,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:27:13,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:27:13,509 INFO L87 Difference]: Start difference. First operand 193 states and 982 transitions. Second operand 10 states. [2019-02-25 15:27:18,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:27:18,539 INFO L93 Difference]: Finished difference Result 258 states and 1245 transitions. [2019-02-25 15:27:18,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:27:18,539 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-25 15:27:18,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:27:18,541 INFO L225 Difference]: With dead ends: 258 [2019-02-25 15:27:18,541 INFO L226 Difference]: Without dead ends: 243 [2019-02-25 15:27:18,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:27:18,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-02-25 15:27:22,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 219. [2019-02-25 15:27:22,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-02-25 15:27:22,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 1113 transitions. [2019-02-25 15:27:22,799 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 1113 transitions. Word has length 9 [2019-02-25 15:27:22,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:27:22,799 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 1113 transitions. [2019-02-25 15:27:22,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:27:22,799 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 1113 transitions. [2019-02-25 15:27:22,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:27:22,800 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:27:22,800 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:27:22,800 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:27:22,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:22,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1629971288, now seen corresponding path program 1 times [2019-02-25 15:27:22,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:27:22,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:22,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:22,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:22,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:27:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:27:22,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:22,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:27:22,955 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-25 15:27:22,955 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-02-25 15:27:22,956 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:27:22,956 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:27:22,958 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:27:22,959 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:27:22,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:22,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:27:22,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:22,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:27:22,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:22,969 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:27:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:22,973 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:27:22,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:27:22,977 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:27:22,984 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:27:22,990 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:22,990 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:22,991 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:27:23,008 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,008 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,009 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,010 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:27:23,012 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,014 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,015 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,016 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,017 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:27:23,017 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:23,042 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:23,054 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:23,063 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:23,073 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:23,106 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:27:23,106 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:23,114 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:23,126 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:23,141 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:23,166 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:23,166 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-02-25 15:27:23,199 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,199 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:27:23,200 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:23,223 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:23,223 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-02-25 15:27:23,252 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,253 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,254 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,255 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,258 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,259 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:27:23,267 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:27:23,268 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:27:23,344 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-25 15:27:23,345 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:76 [2019-02-25 15:27:23,421 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,421 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,422 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,423 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,424 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:27:23,425 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 45 [2019-02-25 15:27:23,425 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:23,478 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,480 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,481 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,482 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,483 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,484 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,485 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,486 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,487 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 70 [2019-02-25 15:27:23,487 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:23,534 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:27:23,534 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:92, output treesize:68 [2019-02-25 15:27:23,582 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,583 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,584 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,585 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,587 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,588 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,589 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,590 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,591 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,591 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:27:23,592 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-25 15:27:23,593 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:23,645 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,646 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,647 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,648 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,649 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:27:23,649 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 49 [2019-02-25 15:27:23,650 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:23,686 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:27:23,687 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:90, output treesize:70 [2019-02-25 15:27:23,878 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:27:23,878 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:27:23,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:27:23,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:27:23,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:27:23,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:27:23,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:27:23,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:27:23,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:27:23,949 INFO L87 Difference]: Start difference. First operand 219 states and 1113 transitions. Second operand 12 states. [2019-02-25 15:27:29,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:27:29,873 INFO L93 Difference]: Finished difference Result 295 states and 1406 transitions. [2019-02-25 15:27:29,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:27:29,874 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-25 15:27:29,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:27:29,874 INFO L225 Difference]: With dead ends: 295 [2019-02-25 15:27:29,874 INFO L226 Difference]: Without dead ends: 284 [2019-02-25 15:27:29,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2019-02-25 15:27:29,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-02-25 15:27:34,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 225. [2019-02-25 15:27:34,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-02-25 15:27:34,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1147 transitions. [2019-02-25 15:27:34,383 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1147 transitions. Word has length 9 [2019-02-25 15:27:34,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:27:34,383 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1147 transitions. [2019-02-25 15:27:34,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:27:34,384 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1147 transitions. [2019-02-25 15:27:34,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:27:34,384 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:27:34,384 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:27:34,384 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:27:34,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:34,385 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-02-25 15:27:34,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:27:34,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:34,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:34,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:34,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:27:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:34,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:27:34,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:34,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:27:34,492 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-25 15:27:34,492 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-02-25 15:27:34,493 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:27:34,493 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:27:34,495 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:27:34,495 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:27:34,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:34,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:27:34,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:34,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:27:34,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:34,504 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:27:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:34,509 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:27:34,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:27:34,513 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:27:34,516 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:27:34,519 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:34,520 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:34,521 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:27:34,525 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:34,526 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:34,527 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:34,528 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:27:34,532 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:34,534 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:34,535 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:34,536 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:34,537 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:27:34,537 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:34,562 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:34,574 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:34,583 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:34,593 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:34,626 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:27:34,626 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:34,634 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:34,644 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:34,664 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:34,690 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:34,690 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-25 15:27:34,711 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:34,711 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:27:34,711 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:34,736 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:34,737 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:27:34,752 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:34,753 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:34,754 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:34,755 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:34,757 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:34,758 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:34,766 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:27:34,767 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:27:34,840 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:27:34,841 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:68 [2019-02-25 15:27:34,897 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:34,898 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:34,899 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:34,900 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:34,901 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:34,902 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:34,903 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:34,904 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 45 [2019-02-25 15:27:34,904 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:34,920 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:34,921 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:25 [2019-02-25 15:27:34,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:27:34,938 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:27:34,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:27:34,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:27:34,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:27:34,979 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:27:34,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:27:34,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:27:34,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:27:34,980 INFO L87 Difference]: Start difference. First operand 225 states and 1147 transitions. Second operand 10 states. [2019-02-25 15:27:41,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:27:41,652 INFO L93 Difference]: Finished difference Result 328 states and 1595 transitions. [2019-02-25 15:27:41,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:27:41,652 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-25 15:27:41,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:27:41,653 INFO L225 Difference]: With dead ends: 328 [2019-02-25 15:27:41,654 INFO L226 Difference]: Without dead ends: 315 [2019-02-25 15:27:41,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:27:41,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-02-25 15:27:48,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 258. [2019-02-25 15:27:48,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-02-25 15:27:48,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 1289 transitions. [2019-02-25 15:27:48,039 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 1289 transitions. Word has length 9 [2019-02-25 15:27:48,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:27:48,039 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 1289 transitions. [2019-02-25 15:27:48,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:27:48,039 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 1289 transitions. [2019-02-25 15:27:48,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:27:48,040 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:27:48,040 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:27:48,040 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:27:48,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:48,040 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-02-25 15:27:48,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:27:48,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:48,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:48,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:48,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:27:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:48,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:27:48,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:48,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:27:48,139 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-25 15:27:48,139 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-02-25 15:27:48,140 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:27:48,140 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:27:48,141 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:27:48,141 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:27:48,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:48,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:27:48,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:48,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:27:48,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:48,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:27:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:48,178 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:27:48,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:27:48,471 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:27:48,471 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:48,534 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:48,542 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:48,555 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:48,574 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:48,598 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:27:48,600 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:27:48,603 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:27:48,605 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:27:48,607 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:27:48,608 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:48,630 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:48,642 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:48,653 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:48,662 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:48,690 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:48,690 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-25 15:27:48,722 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:48,723 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:27:48,723 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:48,750 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:48,751 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 15:27:48,778 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:48,779 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:48,780 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:48,781 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:48,782 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:48,782 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:48,783 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:27:48,784 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:48,810 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:48,810 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-02-25 15:27:48,836 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:48,836 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:48,837 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:48,838 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:48,839 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:48,840 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:48,841 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:48,842 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:27:48,843 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:27:48,843 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:48,880 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:48,880 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-25 15:27:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:27:48,906 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:27:48,949 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:27:48,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:27:48,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:27:48,967 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:27:48,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:27:48,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:27:48,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:27:48,967 INFO L87 Difference]: Start difference. First operand 258 states and 1289 transitions. Second operand 10 states. [2019-02-25 15:27:57,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:27:57,889 INFO L93 Difference]: Finished difference Result 326 states and 1564 transitions. [2019-02-25 15:27:57,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:27:57,889 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-25 15:27:57,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:27:57,891 INFO L225 Difference]: With dead ends: 326 [2019-02-25 15:27:57,891 INFO L226 Difference]: Without dead ends: 313 [2019-02-25 15:27:57,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:27:57,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-02-25 15:28:05,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2019-02-25 15:28:05,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-02-25 15:28:05,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1425 transitions. [2019-02-25 15:28:05,735 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1425 transitions. Word has length 9 [2019-02-25 15:28:05,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:28:05,736 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1425 transitions. [2019-02-25 15:28:05,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:28:05,736 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1425 transitions. [2019-02-25 15:28:05,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:28:05,736 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:28:05,736 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:28:05,737 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:28:05,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:28:05,737 INFO L82 PathProgramCache]: Analyzing trace with hash -561287958, now seen corresponding path program 1 times [2019-02-25 15:28:05,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:28:05,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:28:05,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:28:05,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:28:05,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:28:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:28:05,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-25 15:28:05,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:28:05,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:28:05,794 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-25 15:28:05,794 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-02-25 15:28:05,795 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:28:05,795 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:28:05,796 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:28:05,797 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:28:05,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:28:05,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:28:05,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:28:05,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:28:05,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:28:05,810 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:28:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:28:05,818 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:28:05,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:28:05,835 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:28:05,839 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:28:05,842 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:05,843 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:05,844 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:28:05,848 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:05,849 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:05,850 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:05,851 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:28:05,855 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:05,857 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:05,858 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:05,859 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:05,860 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:28:05,860 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:05,885 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:05,898 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:05,907 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:05,917 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:05,949 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:28:05,949 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:05,956 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:05,965 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:05,980 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:06,006 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:28:06,006 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:28:06,030 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:06,037 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:28:06,037 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:28:06,119 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:28:06,119 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-02-25 15:28:06,160 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:06,160 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:06,161 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:28:06,161 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:28:06,161 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:06,177 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:28:06,178 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:31 [2019-02-25 15:28:06,197 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:06,198 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:06,199 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:06,200 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:06,201 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:06,202 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:06,203 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2019-02-25 15:28:06,203 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:06,224 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:28:06,224 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-25 15:28:06,243 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:06,244 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:06,244 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:06,245 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:06,246 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:06,247 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:06,248 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:06,249 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:06,249 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2019-02-25 15:28:06,250 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:06,266 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:28:06,266 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:29 [2019-02-25 15:28:06,289 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:28:06,289 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:28:06,330 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:28:06,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:28:06,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-25 15:28:06,348 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:28:06,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:28:06,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:28:06,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:28:06,348 INFO L87 Difference]: Start difference. First operand 284 states and 1425 transitions. Second operand 11 states. [2019-02-25 15:28:17,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:28:17,226 INFO L93 Difference]: Finished difference Result 400 states and 1978 transitions. [2019-02-25 15:28:17,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:28:17,227 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-02-25 15:28:17,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:28:17,228 INFO L225 Difference]: With dead ends: 400 [2019-02-25 15:28:17,228 INFO L226 Difference]: Without dead ends: 393 [2019-02-25 15:28:17,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:28:17,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-02-25 15:28:27,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 366. [2019-02-25 15:28:27,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-02-25 15:28:27,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1845 transitions. [2019-02-25 15:28:27,092 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1845 transitions. Word has length 9 [2019-02-25 15:28:27,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:28:27,092 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 1845 transitions. [2019-02-25 15:28:27,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:28:27,093 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1845 transitions. [2019-02-25 15:28:27,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:28:27,093 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:28:27,094 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:28:27,094 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:28:27,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:28:27,094 INFO L82 PathProgramCache]: Analyzing trace with hash -975025366, now seen corresponding path program 1 times [2019-02-25 15:28:27,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:28:27,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:28:27,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:28:27,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:28:27,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:28:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:28:27,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-25 15:28:27,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:28:27,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:28:27,188 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-25 15:28:27,188 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [29] [2019-02-25 15:28:27,189 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:28:27,189 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:28:27,191 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:28:27,191 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:28:27,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:28:27,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:28:27,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:28:27,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:28:27,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:28:27,201 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:28:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:28:27,206 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:28:27,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:28:27,213 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:28:27,216 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:28:27,219 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,221 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,221 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:28:27,225 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,227 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,228 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,228 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:28:27,232 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,234 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,235 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,236 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,237 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:28:27,237 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:27,262 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:27,276 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:27,285 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:27,295 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:27,326 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:28:27,326 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:27,334 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:27,345 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:27,360 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:27,386 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:28:27,387 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:28:27,412 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,420 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:28:27,421 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:28:27,503 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:28:27,504 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-02-25 15:28:27,572 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,573 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,574 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,574 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:28:27,575 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 51 [2019-02-25 15:28:27,575 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:27,626 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,627 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,628 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,629 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,630 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,630 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:28:27,631 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 68 [2019-02-25 15:28:27,631 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:27,672 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:28:27,672 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:76 [2019-02-25 15:28:27,710 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,710 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,711 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,712 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,713 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,714 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,715 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,716 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,717 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 70 [2019-02-25 15:28:27,717 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:27,766 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,767 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,768 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,769 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,770 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,770 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:28:27,771 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2019-02-25 15:28:27,771 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:27,803 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:28:27,804 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:100, output treesize:74 [2019-02-25 15:28:27,842 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,842 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,843 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,844 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,845 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,846 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,847 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,849 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,850 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,851 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,852 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,853 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 70 [2019-02-25 15:28:27,853 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:27,903 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,904 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,905 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,907 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,908 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:27,908 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2019-02-25 15:28:27,909 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:27,942 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:28:27,942 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-02-25 15:28:27,983 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:28:27,983 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:28:28,032 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:28:28,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:28:28,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-25 15:28:28,050 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:28:28,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:28:28,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:28:28,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:28:28,051 INFO L87 Difference]: Start difference. First operand 366 states and 1845 transitions. Second operand 11 states. [2019-02-25 15:28:39,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:28:39,932 INFO L93 Difference]: Finished difference Result 441 states and 2134 transitions. [2019-02-25 15:28:39,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-25 15:28:39,932 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-02-25 15:28:39,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:28:39,933 INFO L225 Difference]: With dead ends: 441 [2019-02-25 15:28:39,933 INFO L226 Difference]: Without dead ends: 428 [2019-02-25 15:28:39,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:28:39,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-02-25 15:28:49,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 367. [2019-02-25 15:28:49,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-02-25 15:28:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1844 transitions. [2019-02-25 15:28:49,845 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1844 transitions. Word has length 9 [2019-02-25 15:28:49,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:28:49,845 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1844 transitions. [2019-02-25 15:28:49,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:28:49,845 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1844 transitions. [2019-02-25 15:28:49,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:28:49,846 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:28:49,846 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:28:49,846 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:28:49,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:28:49,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1143531808, now seen corresponding path program 1 times [2019-02-25 15:28:49,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:28:49,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:28:49,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:28:49,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:28:49,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:28:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:28:50,076 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-02-25 15:28:50,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-25 15:28:50,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:28:50,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:28:50,155 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-25 15:28:50,155 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-02-25 15:28:50,155 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:28:50,156 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:28:50,157 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:28:50,157 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:28:50,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:28:50,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:28:50,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:28:50,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:28:50,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:28:50,167 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:28:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:28:50,172 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:28:50,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:28:50,175 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:28:50,177 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:28:50,202 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:50,226 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:50,227 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:28:50,289 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:50,320 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:50,341 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:50,341 INFO L292 Elim1Store]: Index analysis took 113 ms [2019-02-25 15:28:50,342 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:28:50,383 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:50,418 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:50,434 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:50,453 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:50,453 INFO L292 Elim1Store]: Index analysis took 110 ms [2019-02-25 15:28:50,454 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:28:50,454 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:50,588 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:50,601 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:50,612 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:50,621 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:50,654 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:28:50,654 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:50,662 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:50,671 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:50,686 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:50,711 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:28:50,712 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-25 15:28:50,743 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:50,750 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:28:50,751 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:28:50,832 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-25 15:28:50,832 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-02-25 15:28:50,920 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:50,921 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:50,922 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:50,923 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:50,924 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-25 15:28:50,924 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:50,973 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:50,974 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:50,975 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:50,977 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:50,978 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:50,979 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:50,979 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 76 [2019-02-25 15:28:50,980 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:51,022 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:28:51,022 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:68 [2019-02-25 15:28:51,059 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,060 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,061 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,062 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,063 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,064 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,065 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,066 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,067 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,068 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:28:51,068 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 68 [2019-02-25 15:28:51,069 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:51,131 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,132 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,133 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,134 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,135 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,136 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,137 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,138 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:28:51,139 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 15:28:51,139 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:51,172 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:28:51,172 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:64 [2019-02-25 15:28:51,213 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,213 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,214 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,215 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,216 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,217 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,218 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,219 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:28:51,219 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 47 [2019-02-25 15:28:51,220 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:51,259 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,260 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,260 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,261 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,262 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,263 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,264 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,265 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,266 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,267 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:51,268 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:28:51,268 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 70 [2019-02-25 15:28:51,269 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:51,308 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:28:51,308 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:66 [2019-02-25 15:28:51,351 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:28:51,352 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:28:51,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:28:51,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:28:51,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:28:51,422 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:28:51,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:28:51,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:28:51,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:28:51,423 INFO L87 Difference]: Start difference. First operand 367 states and 1844 transitions. Second operand 12 states. [2019-02-25 15:29:10,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:29:10,820 INFO L93 Difference]: Finished difference Result 685 states and 3436 transitions. [2019-02-25 15:29:10,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-25 15:29:10,820 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-25 15:29:10,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:29:10,822 INFO L225 Difference]: With dead ends: 685 [2019-02-25 15:29:10,822 INFO L226 Difference]: Without dead ends: 677 [2019-02-25 15:29:10,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:29:10,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-02-25 15:29:25,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 545. [2019-02-25 15:29:25,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-02-25 15:29:25,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 2791 transitions. [2019-02-25 15:29:25,617 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 2791 transitions. Word has length 9 [2019-02-25 15:29:25,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:29:25,617 INFO L480 AbstractCegarLoop]: Abstraction has 545 states and 2791 transitions. [2019-02-25 15:29:25,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:29:25,617 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 2791 transitions. [2019-02-25 15:29:25,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:29:25,618 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:29:25,619 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:29:25,619 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:29:25,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:29:25,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1616311456, now seen corresponding path program 2 times [2019-02-25 15:29:25,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:29:25,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:29:25,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:29:25,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:29:25,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:29:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:29:25,770 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:29:25,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:29:25,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:29:25,771 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:29:25,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:29:25,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:29:25,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:29:25,779 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:29:25,779 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:29:25,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:29:25,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:29:25,786 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:29:25,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:29:25,802 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:29:25,802 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:25,810 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:25,820 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:25,836 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:25,856 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:29:25,859 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:29:25,863 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:29:25,866 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:29:25,868 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:29:25,869 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:25,890 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:25,902 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:25,911 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:25,920 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:25,946 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:29:25,946 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-25 15:29:25,984 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:25,992 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:29:25,993 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:29:26,074 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-25 15:29:26,075 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-02-25 15:29:26,159 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,160 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,161 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,163 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,164 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,165 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,165 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 68 [2019-02-25 15:29:26,166 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:26,218 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,219 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,220 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,221 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:29:26,221 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2019-02-25 15:29:26,222 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:26,259 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:29:26,260 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:86 [2019-02-25 15:29:26,320 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,321 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,322 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,323 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,324 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,325 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,326 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,327 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,328 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,329 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:29:26,330 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 68 [2019-02-25 15:29:26,330 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:26,384 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,384 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2019-02-25 15:29:26,385 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:26,419 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:29:26,419 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:106, output treesize:70 [2019-02-25 15:29:26,471 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,472 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,473 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,474 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,475 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,475 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2019-02-25 15:29:26,476 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:26,517 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,518 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,519 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,520 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,521 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,522 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,524 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,525 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,526 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,527 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:26,527 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:29:26,528 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 74 [2019-02-25 15:29:26,528 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:26,566 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:29:26,566 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-02-25 15:29:26,613 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:29:26,614 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:29:26,684 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:29:26,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:29:26,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-25 15:29:26,704 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:29:26,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-25 15:29:26,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-25 15:29:26,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:29:26,704 INFO L87 Difference]: Start difference. First operand 545 states and 2791 transitions. Second operand 13 states. [2019-02-25 15:29:28,979 WARN L181 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-02-25 15:29:29,451 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-02-25 15:29:43,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:29:43,361 INFO L93 Difference]: Finished difference Result 550 states and 2805 transitions. [2019-02-25 15:29:43,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:29:43,361 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-02-25 15:29:43,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:29:43,362 INFO L225 Difference]: With dead ends: 550 [2019-02-25 15:29:43,362 INFO L226 Difference]: Without dead ends: 543 [2019-02-25 15:29:43,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2019-02-25 15:29:43,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-02-25 15:29:46,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 38. [2019-02-25 15:29:46,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-25 15:29:46,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-02-25 15:29:46,278 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 9 [2019-02-25 15:29:46,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:29:46,278 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-02-25 15:29:46,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-25 15:29:46,278 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-02-25 15:29:46,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-25 15:29:46,278 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:29:46,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:29:46,278 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:29:46,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:29:46,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1518781026, now seen corresponding path program 1 times [2019-02-25 15:29:46,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:29:46,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:29:46,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:29:46,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:29:46,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:29:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:29:46,442 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:29:46,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:29:46,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:29:46,442 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-02-25 15:29:46,442 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [30], [31] [2019-02-25 15:29:46,443 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:29:46,443 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:29:46,445 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:29:46,445 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:29:46,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:29:46,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:29:46,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:29:46,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:29:46,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:29:46,457 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:29:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:29:46,462 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:29:46,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:29:46,623 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:29:46,623 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:46,633 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:46,646 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:46,660 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:46,677 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:46,699 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:29:46,702 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:29:46,704 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:29:46,707 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:29:46,710 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:29:46,710 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:46,732 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:46,745 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:46,755 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:46,764 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:46,792 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:29:46,792 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-25 15:29:46,822 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:46,822 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:29:46,823 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:46,849 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:29:46,850 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 15:29:46,878 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:46,879 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:46,880 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:46,880 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:46,881 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:46,882 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:46,883 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:29:46,883 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:46,910 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:29:46,910 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-25 15:29:46,940 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:46,941 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:46,942 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:46,942 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:46,950 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:46,951 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:46,952 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:46,952 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:29:46,953 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:29:46,953 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:46,979 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:29:46,980 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-25 15:29:47,004 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:47,005 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:47,006 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:47,007 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:47,008 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:47,009 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:47,010 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:47,011 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:47,012 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:47,013 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:47,013 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:29:47,014 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 70 [2019-02-25 15:29:47,015 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:47,040 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:29:47,040 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-25 15:29:47,309 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:29:47,310 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:29:47,817 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:29:47,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:29:47,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-02-25 15:29:47,838 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:29:47,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-25 15:29:47,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-25 15:29:47,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:29:47,839 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-02-25 15:29:53,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:29:53,529 INFO L93 Difference]: Finished difference Result 67 states and 277 transitions. [2019-02-25 15:29:53,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:29:53,529 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-02-25 15:29:53,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:29:53,530 INFO L225 Difference]: With dead ends: 67 [2019-02-25 15:29:53,530 INFO L226 Difference]: Without dead ends: 58 [2019-02-25 15:29:53,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-02-25 15:29:53,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-25 15:29:56,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2019-02-25 15:29:56,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-25 15:29:56,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 171 transitions. [2019-02-25 15:29:56,647 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 171 transitions. Word has length 10 [2019-02-25 15:29:56,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:29:56,648 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 171 transitions. [2019-02-25 15:29:56,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-25 15:29:56,648 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 171 transitions. [2019-02-25 15:29:56,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-25 15:29:56,648 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:29:56,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:29:56,648 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:29:56,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:29:56,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1744942188, now seen corresponding path program 1 times [2019-02-25 15:29:56,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:29:56,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:29:56,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:29:56,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:29:56,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:29:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:29:56,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-25 15:29:56,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:29:56,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:29:56,780 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-02-25 15:29:56,780 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [30], [31] [2019-02-25 15:29:56,781 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:29:56,781 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:29:56,782 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:29:56,783 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:29:56,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:29:56,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:29:56,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:29:56,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:29:56,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:29:56,794 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:29:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:29:56,799 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:29:56,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:29:56,816 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:29:56,816 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:56,825 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:56,834 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:56,848 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:56,866 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:29:56,869 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:29:56,873 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:29:56,875 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:29:56,878 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:29:56,878 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:56,897 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:56,909 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:56,918 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:56,927 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:56,953 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:56,953 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-02-25 15:29:56,987 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:56,987 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:29:56,988 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:57,015 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:29:57,015 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-02-25 15:29:57,046 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,047 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,047 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,048 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,051 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,052 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,061 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:29:57,062 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:29:57,137 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-25 15:29:57,137 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:68 [2019-02-25 15:29:57,182 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,183 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,183 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,184 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,186 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,186 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,187 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,188 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:29:57,189 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 15:29:57,189 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:57,230 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,231 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,232 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,233 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,234 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,235 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,236 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,237 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,238 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,239 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:29:57,239 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 68 [2019-02-25 15:29:57,240 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:57,279 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:29:57,279 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:64 [2019-02-25 15:29:57,325 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,326 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,327 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,328 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,329 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,330 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,331 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,332 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,333 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,334 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,335 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:29:57,336 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-25 15:29:57,336 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:57,383 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,384 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,385 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,386 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,387 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,388 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:57,389 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:29:57,390 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 15:29:57,390 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:57,421 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:29:57,421 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:84, output treesize:64 [2019-02-25 15:29:57,776 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:29:57,776 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:29:57,900 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:29:57,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:29:57,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:29:57,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:29:57,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:29:57,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:29:57,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:29:57,920 INFO L87 Difference]: Start difference. First operand 39 states and 171 transitions. Second operand 12 states. [2019-02-25 15:30:03,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:30:03,987 INFO L93 Difference]: Finished difference Result 74 states and 289 transitions. [2019-02-25 15:30:03,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:30:03,987 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-02-25 15:30:03,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:30:03,988 INFO L225 Difference]: With dead ends: 74 [2019-02-25 15:30:03,988 INFO L226 Difference]: Without dead ends: 59 [2019-02-25 15:30:03,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2019-02-25 15:30:03,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-25 15:30:07,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 38. [2019-02-25 15:30:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-25 15:30:07,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-02-25 15:30:07,426 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 10 [2019-02-25 15:30:07,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:30:07,426 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-02-25 15:30:07,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:30:07,426 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-02-25 15:30:07,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-25 15:30:07,427 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:30:07,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:30:07,427 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:30:07,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:30:07,427 INFO L82 PathProgramCache]: Analyzing trace with hash 854957070, now seen corresponding path program 1 times [2019-02-25 15:30:07,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:30:07,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:30:07,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:30:07,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:30:07,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:30:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:30:07,560 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:30:07,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:30:07,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:30:07,561 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-02-25 15:30:07,561 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [30], [31] [2019-02-25 15:30:07,561 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:30:07,561 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:30:07,563 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:30:07,563 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:30:07,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:30:07,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:30:07,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:30:07,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:30:07,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:30:07,572 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:30:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:30:07,577 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:30:07,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:30:07,594 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:30:07,594 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:30:07,602 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:07,611 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:07,625 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:07,645 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:30:07,648 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:30:07,651 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:30:07,655 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:30:07,663 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:30:07,663 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:30:07,683 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:07,695 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:07,704 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:07,713 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:07,739 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:30:07,739 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-25 15:30:07,783 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:07,784 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:30:07,784 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:30:07,800 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:30:07,800 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:30:07,822 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:07,822 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:07,823 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:07,824 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:07,825 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:07,826 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:30:07,826 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:30:07,842 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:30:07,843 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-25 15:30:07,863 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:07,864 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:07,865 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:07,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:07,867 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:07,868 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:30:07,868 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:30:07,869 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:30:07,883 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:30:07,884 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:30:07,903 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:07,904 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:07,905 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:07,906 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:07,907 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:07,909 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:07,910 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:07,911 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:30:07,911 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2019-02-25 15:30:07,912 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:30:07,928 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:30:07,928 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-25 15:30:07,954 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:30:07,954 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:30:07,994 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:30:08,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:30:08,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-25 15:30:08,013 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:30:08,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-25 15:30:08,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-25 15:30:08,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:30:08,013 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-02-25 15:30:15,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:30:15,019 INFO L93 Difference]: Finished difference Result 80 states and 341 transitions. [2019-02-25 15:30:15,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:30:15,019 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-02-25 15:30:15,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:30:15,020 INFO L225 Difference]: With dead ends: 80 [2019-02-25 15:30:15,020 INFO L226 Difference]: Without dead ends: 71 [2019-02-25 15:30:15,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-02-25 15:30:15,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-25 15:30:21,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2019-02-25 15:30:21,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-25 15:30:21,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 296 transitions. [2019-02-25 15:30:21,229 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 296 transitions. Word has length 10 [2019-02-25 15:30:21,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:30:21,229 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 296 transitions. [2019-02-25 15:30:21,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-25 15:30:21,230 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 296 transitions. [2019-02-25 15:30:21,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-25 15:30:21,230 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:30:21,230 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:30:21,230 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:30:21,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:30:21,230 INFO L82 PathProgramCache]: Analyzing trace with hash 997631658, now seen corresponding path program 2 times [2019-02-25 15:30:21,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:30:21,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:30:21,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:30:21,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:30:21,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:30:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:30:21,324 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-02-25 15:30:21,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:30:21,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:30:21,324 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:30:21,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:30:21,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:30:21,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:30:21,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:30:21,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:30:21,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-25 15:30:21,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:30:21,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:30:21,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:30:21,345 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:30:21,350 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:30:21,355 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-25 15:30:21,363 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-25 15:30:21,369 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,372 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,374 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,375 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,376 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-25 15:30:21,376 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:30:21,392 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:21,402 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:21,411 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:21,420 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:21,438 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-25 15:30:21,439 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:30:21,446 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:21,461 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:30:21,461 INFO L208 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:36, output treesize:42 [2019-02-25 15:30:21,489 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,496 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:30:21,496 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:30:21,521 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-25 15:30:21,522 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-02-25 15:30:21,552 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,552 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,553 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,554 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2019-02-25 15:30:21,554 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:30:21,576 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,577 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,578 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,583 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,583 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-02-25 15:30:21,584 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:30:21,601 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-25 15:30:21,602 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:35 [2019-02-25 15:30:21,624 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,624 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,625 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,626 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,627 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,628 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,628 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2019-02-25 15:30:21,628 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:30:21,650 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,651 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,652 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,652 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-02-25 15:30:21,653 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:30:21,666 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-25 15:30:21,666 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:28 [2019-02-25 15:30:21,689 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,689 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,690 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,690 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-02-25 15:30:21,691 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:30:21,710 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,711 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,712 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,713 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,714 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,715 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,715 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 15:30:21,716 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:30:21,732 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-25 15:30:21,732 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2019-02-25 15:30:21,759 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,760 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,760 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,761 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:30:21,761 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2019-02-25 15:30:21,761 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:30:21,782 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,783 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,784 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:21,784 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-02-25 15:30:21,785 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:30:21,800 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-25 15:30:21,800 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:34 [2019-02-25 15:30:21,829 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:30:21,829 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:30:21,912 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:30:21,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:30:21,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-02-25 15:30:21,932 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:30:21,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-25 15:30:21,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-25 15:30:21,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:30:21,933 INFO L87 Difference]: Start difference. First operand 64 states and 296 transitions. Second operand 13 states. [2019-02-25 15:30:28,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:30:28,598 INFO L93 Difference]: Finished difference Result 71 states and 316 transitions. [2019-02-25 15:30:28,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:30:28,598 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2019-02-25 15:30:28,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:30:28,598 INFO L225 Difference]: With dead ends: 71 [2019-02-25 15:30:28,599 INFO L226 Difference]: Without dead ends: 0 [2019-02-25 15:30:28,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2019-02-25 15:30:28,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-25 15:30:28,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-25 15:30:28,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-25 15:30:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-25 15:30:28,600 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-02-25 15:30:28,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:30:28,600 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-25 15:30:28,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-25 15:30:28,600 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-25 15:30:28,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-25 15:30:28,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-25 15:30:28,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:30:28,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:30:29,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:30:29,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:30:29,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:30:29,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:30:29,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:30:29,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:30:29,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:30:30,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:30:30,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:31:08,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:31:23,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:31:37,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:31:38,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:31:43,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:31:45,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent.